%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL191-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 02:05:54 PM UTC 2026
% Result : Unsatisfiable 178.90s 43.95s
% Output : CNFRefutation 178.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 15
% Syntax : Number of formulae : 70 ( 30 unt; 6 def)
% Number of atoms : 198 ( 6 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 97 ( 50 ~; 47 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 7 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 93 ( 0 sgn 93 !; 0 ?; 76 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : axiom(or(not(or(X0,X0)),X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_2) ).
fof(f2,axiom,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_3) ).
fof(f3,axiom,
! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_4) ).
fof(f4,axiom,
! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_5) ).
fof(f5,axiom,
! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_6) ).
fof(f6,axiom,
! [X0] :
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_1) ).
fof(f7,axiom,
! [X0,X1] :
( ~ theorem(X1)
| ~ axiom(or(not(X1),X0))
| theorem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_2) ).
fof(f8,axiom,
! [X2,X0,X1] :
( ~ theorem(or(not(X2),X1))
| ~ axiom(or(not(X0),X2))
| theorem(or(not(X0),X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_3) ).
fof(f9,negated_conjecture,
~ theorem(or(not(or(p,or(q,r))),or(or(p,q),r))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
tcf(c_58,plain,
! [X0: $i] : axiom(or(not(or(X0,X0)),X0)),
inference(cnf_transformation,[],[f1]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] : axiom(or(not(X0),or(X1,X0))),
inference(cnf_transformation,[],[f2]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(cnf_transformation,[],[f3]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i,X2: $i] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
inference(cnf_transformation,[],[f4]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i,X2: $i] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
inference(cnf_transformation,[],[f5]) ).
tcf(c_63,plain,
! [X0: $i] :
( theorem(X0)
| ~ axiom(X0) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i] :
( theorem(X1)
| ~ theorem(X0)
| ~ axiom(or(not(X0),X1)) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(not(X2),X1))
| ~ axiom(or(not(X2),X0))
| ~ theorem(or(not(X0),X1)) ),
inference(cnf_transformation,[],[f8]) ).
tcf(c_66,negated_conjecture,
~ theorem(or(not(or(p,or(q,r))),or(or(p,q),r))),
inference(cnf_transformation,[],[f9]) ).
tcf(c_225,definition,
iPr_def_10 = or(q,r),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_226,definition,
iPr_def_11 = or(p,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_227,definition,
iPr_def_12 = not(iPr_def_11),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_228,definition,
iPr_def_13 = or(p,q),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_229,definition,
iPr_def_14 = or(iPr_def_13,r),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_230,definition,
iPr_def_15 = or(iPr_def_12,iPr_def_14),
introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).
tcf(c_231,negated_conjecture,
~ theorem(iPr_def_15),
inference(demodulation,[status(thm)],[c_66,c_228,c_229,c_225,c_226,c_227,c_230]) ).
tcf(c_402,plain,
axiom(or(not(or(q,p)),iPr_def_13)),
inference(superposition,[status(thm)],[c_228,c_60]) ).
tcf(c_406,plain,
! [X0: $i,X1: $i] : theorem(or(not(or(X0,X1)),or(X1,X0))),
inference(superposition,[status(thm)],[c_60,c_63]) ).
tcf(c_414,plain,
! [X0: $i] :
( theorem(X0)
| ~ theorem(or(X0,X0)) ),
inference(superposition,[status(thm)],[c_58,c_64]) ).
tcf(c_415,plain,
! [X0: $i,X1: $i] :
( theorem(or(X1,X0))
| ~ theorem(X0) ),
inference(superposition,[status(thm)],[c_59,c_64]) ).
tcf(c_416,plain,
! [X0: $i,X1: $i] :
( theorem(or(X1,X0))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_60,c_64]) ).
tcf(c_430,plain,
! [X0: $i] : axiom(or(not(or(X0,iPr_def_10)),or(q,or(X0,r)))),
inference(superposition,[status(thm)],[c_225,c_61]) ).
tcf(c_438,plain,
! [X0: $i] : axiom(or(not(or(iPr_def_13,or(X0,r))),or(X0,iPr_def_14))),
inference(superposition,[status(thm)],[c_229,c_61]) ).
tcf(c_441,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X1,or(X0,X2)))
| ~ theorem(or(X0,or(X1,X2))) ),
inference(superposition,[status(thm)],[c_61,c_64]) ).
tcf(c_718,plain,
theorem(or(not(or(r,iPr_def_13)),iPr_def_14)),
inference(superposition,[status(thm)],[c_229,c_406]) ).
tcf(c_912,plain,
! [X0: $i] :
( theorem(or(not(X0),iPr_def_14))
| ~ axiom(or(not(X0),or(r,iPr_def_13))) ),
inference(superposition,[status(thm)],[c_718,c_65]) ).
tcf(c_1028,plain,
! [X0: $i] :
( theorem(or(q,or(X0,r)))
| ~ theorem(or(X0,iPr_def_10)) ),
inference(superposition,[status(thm)],[c_430,c_64]) ).
tcf(c_1107,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X0,or(X2,X1)))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_415,c_441]) ).
tcf(c_1874,plain,
! [X0: $i] :
( theorem(or(X0,iPr_def_14))
| ~ theorem(or(iPr_def_13,or(X0,r))) ),
inference(superposition,[status(thm)],[c_438,c_64]) ).
tcf(c_2285,plain,
! [X0: $i] :
( theorem(or(or(X0,r),q))
| ~ theorem(or(X0,iPr_def_10)) ),
inference(superposition,[status(thm)],[c_1028,c_416]) ).
tcf(c_2350,plain,
! [X0: $i,X1: $i] :
( theorem(or(X0,X1))
| ~ theorem(or(or(X0,X1),X1)) ),
inference(superposition,[status(thm)],[c_1107,c_414]) ).
tcf(c_2351,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(or(X2,X1),X0))
| ~ theorem(or(X0,X1)) ),
inference(superposition,[status(thm)],[c_1107,c_416]) ).
tcf(c_5938,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X0,or(X1,X2)))
| ~ theorem(or(or(X0,or(X1,X2)),X2)) ),
inference(superposition,[status(thm)],[c_1107,c_2350]) ).
tcf(c_6965,plain,
! [X0: $i] :
( theorem(or(iPr_def_13,X0))
| ~ theorem(or(X0,q)) ),
inference(superposition,[status(thm)],[c_228,c_2351]) ).
tcf(c_6968,plain,
! [X0: $i] :
( theorem(or(iPr_def_15,X0))
| ~ theorem(or(X0,iPr_def_14)) ),
inference(superposition,[status(thm)],[c_230,c_2351]) ).
tcf(c_7171,plain,
! [X0: $i] :
( theorem(or(iPr_def_13,or(X0,r)))
| ~ theorem(or(X0,iPr_def_10)) ),
inference(superposition,[status(thm)],[c_2285,c_6965]) ).
tcf(c_7621,plain,
theorem(or(not(iPr_def_13),iPr_def_14)),
inference(superposition,[status(thm)],[c_59,c_912]) ).
tcf(c_7628,plain,
! [X0: $i] :
( theorem(or(not(X0),iPr_def_14))
| ~ axiom(or(not(X0),iPr_def_13)) ),
inference(superposition,[status(thm)],[c_7621,c_65]) ).
tcf(c_7795,plain,
theorem(or(not(or(q,p)),iPr_def_14)),
inference(superposition,[status(thm)],[c_402,c_7628]) ).
tcf(c_7917,plain,
! [X0: $i] :
( theorem(or(not(X0),iPr_def_14))
| ~ axiom(or(not(X0),or(q,p))) ),
inference(superposition,[status(thm)],[c_7795,c_65]) ).
tcf(c_9401,plain,
! [X0: $i] :
( theorem(or(X0,iPr_def_14))
| ~ theorem(or(X0,iPr_def_10)) ),
inference(superposition,[status(thm)],[c_7171,c_1874]) ).
tcf(c_9532,plain,
! [X0: $i,X1: $i] :
( theorem(or(or(X1,X0),iPr_def_14))
| ~ theorem(or(iPr_def_10,X0)) ),
inference(superposition,[status(thm)],[c_2351,c_9401]) ).
tcf(c_12770,plain,
! [X0: $i,X1: $i] :
( theorem(or(iPr_def_15,or(X1,X0)))
| ~ theorem(or(iPr_def_10,X0)) ),
inference(superposition,[status(thm)],[c_9532,c_6968]) ).
tcf(c_14547,plain,
theorem(or(not(p),iPr_def_14)),
inference(superposition,[status(thm)],[c_59,c_7917]) ).
tcf(c_15949,plain,
! [X0: $i,X1: $i] :
( theorem(or(X1,or(iPr_def_15,X0)))
| ~ theorem(or(iPr_def_10,X0)) ),
inference(superposition,[status(thm)],[c_12770,c_441]) ).
tcf(c_20180,plain,
! [X0: $i] :
( theorem(or(X0,or(iPr_def_12,iPr_def_14)))
| ~ theorem(or(or(X0,iPr_def_15),iPr_def_14)) ),
inference(superposition,[status(thm)],[c_230,c_5938]) ).
tcf(c_20185,plain,
! [X0: $i] :
( theorem(or(X0,iPr_def_15))
| ~ theorem(or(or(X0,iPr_def_15),iPr_def_14)) ),
inference(light_normalisation,[status(thm)],[c_20180,c_230]) ).
tcf(c_38469,plain,
! [X0: $i,X1: $i] :
( theorem(or(or(iPr_def_15,X0),X1))
| ~ theorem(or(iPr_def_10,X0)) ),
inference(superposition,[status(thm)],[c_15949,c_416]) ).
tcf(c_57631,plain,
( theorem(or(iPr_def_15,iPr_def_15))
| ~ theorem(or(iPr_def_10,iPr_def_15)) ),
inference(superposition,[status(thm)],[c_38469,c_20185]) ).
tcf(c_192685,plain,
! [X0: $i,X1: $i] :
( theorem(X1)
| ~ theorem(or(X0,iPr_def_15))
| ~ axiom(or(not(or(X0,iPr_def_15)),X1)) ),
inference(instantiation,[status(thm)],[c_64]) ).
tcf(c_222836,plain,
( theorem(iPr_def_15)
| ~ theorem(or(iPr_def_15,iPr_def_15))
| ~ axiom(or(not(or(iPr_def_15,iPr_def_15)),iPr_def_15)) ),
inference(instantiation,[status(thm)],[c_192685]) ).
tcf(c_222837,plain,
axiom(or(not(or(iPr_def_15,iPr_def_15)),iPr_def_15)),
inference(instantiation,[status(thm)],[c_58]) ).
tcf(c_399694,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(not(or(X2,X0)),or(X2,X1)))
| ~ theorem(or(not(X0),X1)) ),
inference(superposition,[status(thm)],[c_62,c_64]) ).
tcf(c_399773,plain,
! [X0: $i] : axiom(or(not(or(iPr_def_12,or(X0,iPr_def_14))),or(X0,iPr_def_15))),
inference(superposition,[status(thm)],[c_230,c_61]) ).
tcf(c_400052,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( theorem(or(not(X0),or(X1,X3)))
| ~ theorem(or(not(X2),X3))
| ~ axiom(or(not(X0),or(X1,X2))) ),
inference(superposition,[status(thm)],[c_399694,c_65]) ).
tcf(c_400425,plain,
! [X0: $i] :
( theorem(or(X0,iPr_def_15))
| ~ theorem(or(iPr_def_12,or(X0,iPr_def_14))) ),
inference(superposition,[status(thm)],[c_399773,c_64]) ).
tcf(c_401595,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(not(or(X0,X2)),or(X2,X1)))
| ~ theorem(or(not(X0),X1)) ),
inference(superposition,[status(thm)],[c_60,c_400052]) ).
tcf(c_406622,plain,
! [X0: $i] :
( theorem(or(not(iPr_def_11),or(iPr_def_10,X0)))
| ~ theorem(or(not(p),X0)) ),
inference(superposition,[status(thm)],[c_226,c_401595]) ).
tcf(c_406633,plain,
! [X0: $i] :
( theorem(or(iPr_def_12,or(iPr_def_10,X0)))
| ~ theorem(or(not(p),X0)) ),
inference(light_normalisation,[status(thm)],[c_406622,c_227]) ).
tcf(c_421049,plain,
( theorem(or(iPr_def_10,iPr_def_15))
| ~ theorem(or(not(p),iPr_def_14)) ),
inference(superposition,[status(thm)],[c_406633,c_400425]) ).
tcf(c_421056,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_421049,c_222837,c_222836,c_57631,c_14547,c_231]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL191-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.34 % Computer : n011.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.10/15.44 % CPULimit : 300
% 0.10/15.44 % WCLimit : 300
% 0.10/15.44 % DateTime : Wed Sep 23 22:15:38 UTC 2026
% 0.10/15.45 % CPUTime :
% 0.10/15.45 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/15.48 Running first-order theorem proving
% 0.10/15.48 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/15.50
% 0.10/15.50 % ======== iProver multi-core TPTP/SMT =========
% 0.10/15.50
% 0.10/15.50 % Detected problem language: tptp
% 0.36/15.51 % Proving...
% 178.90/43.95 % SZS status Started for theBenchmark.p
% 178.90/43.95 % SZS status Unsatisfiable for theBenchmark.p
% 178.90/43.95
% 178.90/43.95 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 178.90/43.95
% 178.90/43.95 % ------ iProver source info
% 178.90/43.95
% 178.90/43.95 % git: date: 2026-07-19 20:42:38 +0200
% 178.90/43.95 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 178.90/43.95 % git: non_committed_changes: false
% 178.90/43.95
% 178.90/43.95 % ------ Parsing...% successful
% 178.90/43.95
% 178.90/43.95
% 178.90/43.95 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 178.90/43.95
% 178.90/43.95 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 178.90/43.95
% 178.90/43.95 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 178.90/43.95
% 178.90/43.95 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 178.90/43.95 % ------ Proving...
% 178.90/43.95 % ------ Problem Properties
% 178.90/43.95
% 178.90/43.95 %
% 178.90/43.95 % clauses 15
% 178.90/43.95 % conjectures 1
% 178.90/43.95 % EPR 2
% 178.90/43.95 % Horn 15
% 178.90/43.95 % unary 12
% 178.90/43.95 % binary 1
% 178.90/43.95 % lits 20
% 178.90/43.95 % lits eq 6
% 178.90/43.95 % fd_pure 0
% 178.90/43.95 % fd_pseudo 0
% 178.90/43.95 % fd_cond 0
% 178.90/43.95 % fd_pseudo_cond 0
% 178.90/43.95 % AC symbols 0
% 178.90/43.95
% 178.90/43.95 % ------ Schedule dynamic 5 is on
% 178.90/43.95
% 178.90/43.95 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 178.90/43.95
% 178.90/43.95
% 178.90/43.95 % ------
% 178.90/43.95 % Current options:
% 178.90/43.95 % ------
% 178.90/43.95
% 178.90/43.95
% 178.90/43.95 %
% 178.90/43.95
% 178.90/43.95 % ------ Proving...
% 178.90/43.95 % Proof_search_loop: time out after: 9463 full_loop iterations
% 178.90/43.95
% 178.90/43.95 % ------ Input Options"1. --res_lit_sel adaptive --res_lit_sel_side num_symb" Time Limit: 15.
% 178.90/43.95
% 178.90/43.95
% 178.90/43.95 % ------
% 178.90/43.95 % Current options:
% 178.90/43.95 % ------
% 178.90/43.95
% 178.90/43.95
% 178.90/43.95 %
% 178.90/43.95
% 178.90/43.95 % ------ Proving...
% 178.90/43.95 % Proof_search_loop: time out after: 12306 full_loop iterations
% 178.90/43.95
% 178.90/43.95 % ------ Option_1: Negative Selections Time Limit: 35.
% 178.90/43.95
% 178.90/43.95
% 178.90/43.95 % ------
% 178.90/43.95 % Current options:
% 178.90/43.95 % ------
% 178.90/43.95
% 178.90/43.95
% 178.90/43.95 %
% 178.90/43.95
% 178.90/43.95 % ------ Proving...
% 178.90/43.95 %
% 178.90/43.95
% 178.90/43.95 % SZS status Unsatisfiable for theBenchmark.p
% 178.90/43.95
% 178.90/43.95 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 178.90/43.95
% 178.90/43.95
%------------------------------------------------------------------------------