%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL218-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n012.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:06:02 PM UTC 2026
% Result : Unsatisfiable 5.97s 12.36s
% Output : CNFRefutation 5.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 46 ( 22 unt; 0 def)
% Number of atoms : 89 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 88 ( 45 ~; 43 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 65 ( 0 sgn 65 !; 0 ?; 52 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
file('/export/starexec/sandbox/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/sandbox/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/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_5) ).
fof(f6,axiom,
! [X0] :
( ~ axiom(X0)
| theorem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_1) ).
fof(f7,axiom,
! [X0,X1] :
( ~ theorem(X1)
| ~ axiom(or(not(X1),X0))
| theorem(X0) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/LCL003-0.ax',rule_3) ).
fof(f9,negated_conjecture,
~ theorem(or(not(or(not(or(p,q)),q)),or(not(p),q))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
tcf(c_58,negated_conjecture,
~ theorem(or(not(or(not(or(p,q)),q)),or(not(p),q))),
inference(cnf_transformation,[],[f9]) ).
tcf(c_60,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_61,plain,
! [X0: $i,X1: $i] : axiom(or(not(or(X0,X1)),or(X1,X0))),
inference(cnf_transformation,[],[f3]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i] : axiom(or(not(X0),or(X1,X0))),
inference(cnf_transformation,[],[f2]) ).
tcf(c_64,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_65,plain,
! [X0: $i,X1: $i] :
( theorem(X1)
| ~ theorem(X0)
| ~ axiom(or(not(X0),X1)) ),
inference(cnf_transformation,[],[f7]) ).
tcf(c_66,plain,
! [X0: $i] :
( theorem(X0)
| ~ axiom(X0) ),
inference(cnf_transformation,[],[f6]) ).
tcf(c_227,plain,
! [X0: $i,X1: $i] :
( theorem(or(not(or(X0,X1)),or(X1,X0)))
| ~ axiom(or(not(or(X0,X1)),or(X1,X0))) ),
inference(instantiation,[status(thm)],[c_66]) ).
tcf(c_230,plain,
! [X0: $i] :
( theorem(or(not(or(not(or(p,q)),q)),or(not(p),q)))
| ~ theorem(or(not(X0),or(not(p),q)))
| ~ axiom(or(not(or(not(or(p,q)),q)),X0)) ),
inference(instantiation,[status(thm)],[c_64]) ).
tcf(c_232,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(X2)
| ~ theorem(or(not(X0),X1))
| ~ axiom(or(not(or(not(X0),X1)),X2)) ),
inference(instantiation,[status(thm)],[c_65]) ).
tcf(c_250,plain,
! [X0: $i,X1: $i] : axiom(or(not(or(not(X0),X1)),or(X1,not(X0)))),
inference(instantiation,[status(thm)],[c_61]) ).
tcf(c_253,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(X1,or(not(X0),X2)))
| ~ theorem(or(not(X0),or(X1,X2)))
| ~ axiom(or(not(or(not(X0),or(X1,X2))),or(X1,or(not(X0),X2)))) ),
inference(instantiation,[status(thm)],[c_232]) ).
tcf(c_254,plain,
! [X0: $i,X1: $i,X2: $i] : axiom(or(not(or(not(X0),or(X1,X2))),or(X1,or(not(X0),X2)))),
inference(instantiation,[status(thm)],[c_60]) ).
tcf(c_289,plain,
axiom(or(not(or(not(or(p,q)),q)),or(q,not(or(p,q))))),
inference(instantiation,[status(thm)],[c_250]) ).
tcf(c_290,plain,
( theorem(or(not(or(not(or(p,q)),q)),or(not(p),q)))
| ~ theorem(or(not(or(q,not(or(p,q)))),or(not(p),q)))
| ~ axiom(or(not(or(not(or(p,q)),q)),or(q,not(or(p,q))))) ),
inference(instantiation,[status(thm)],[c_230]) ).
tcf(c_331,plain,
( theorem(or(not(or(q,not(or(p,q)))),or(not(p),q)))
| ~ theorem(or(not(p),or(not(or(q,not(or(p,q)))),q)))
| ~ axiom(or(not(or(not(p),or(not(or(q,not(or(p,q)))),q))),or(not(or(q,not(or(p,q)))),or(not(p),q)))) ),
inference(instantiation,[status(thm)],[c_253]) ).
tcf(c_371,plain,
! [X0: $i,X1: $i] : axiom(or(not(or(X0,not(X1))),or(not(X1),X0))),
inference(instantiation,[status(thm)],[c_61]) ).
tcf(c_462,plain,
! [X0: $i] : axiom(or(not(p),or(X0,p))),
inference(instantiation,[status(thm)],[c_62]) ).
tcf(c_464,plain,
axiom(or(not(p),or(q,p))),
inference(instantiation,[status(thm)],[c_462]) ).
tcf(c_476,plain,
! [X0: $i] :
( theorem(or(not(p),or(not(or(q,not(or(p,q)))),q)))
| ~ axiom(or(not(p),X0))
| ~ theorem(or(not(X0),or(not(or(q,not(or(p,q)))),q))) ),
inference(instantiation,[status(thm)],[c_64]) ).
tcf(c_508,plain,
! [X0: $i] : axiom(or(not(or(not(X0),or(not(or(p,q)),q))),or(not(or(p,q)),or(not(X0),q)))),
inference(instantiation,[status(thm)],[c_254]) ).
tcf(c_815,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( theorem(or(not(X3),or(not(X1),X2)))
| ~ axiom(or(not(X3),X0))
| ~ theorem(or(not(X0),or(not(X1),X2))) ),
inference(instantiation,[status(thm)],[c_64]) ).
tcf(c_823,plain,
! [X0: $i,X1: $i] :
( theorem(or(not(or(X0,not(X1))),or(not(X1),X0)))
| ~ axiom(or(not(or(X0,not(X1))),or(not(X1),X0))) ),
inference(instantiation,[status(thm)],[c_227]) ).
tcf(c_842,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(not(X1),or(not(X0),X2)))
| ~ theorem(or(not(X0),or(not(X1),X2)))
| ~ axiom(or(not(or(not(X0),or(not(X1),X2))),or(not(X1),or(not(X0),X2)))) ),
inference(instantiation,[status(thm)],[c_253]) ).
tcf(c_1041,plain,
! [X0: $i] :
( theorem(or(not(p),or(not(or(q,not(or(p,q)))),q)))
| ~ axiom(or(not(p),or(X0,p)))
| ~ theorem(or(not(or(X0,p)),or(not(or(q,not(or(p,q)))),q))) ),
inference(instantiation,[status(thm)],[c_476]) ).
tcf(c_1042,plain,
( theorem(or(not(p),or(not(or(q,not(or(p,q)))),q)))
| ~ axiom(or(not(p),or(q,p)))
| ~ theorem(or(not(or(q,p)),or(not(or(q,not(or(p,q)))),q))) ),
inference(instantiation,[status(thm)],[c_1041]) ).
tcf(c_1526,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( theorem(or(not(or(X1,X0)),or(not(X2),X3)))
| ~ axiom(or(not(or(X1,X0)),or(X0,X1)))
| ~ theorem(or(not(or(X0,X1)),or(not(X2),X3))) ),
inference(instantiation,[status(thm)],[c_815]) ).
tcf(c_1746,plain,
! [X0: $i,X1: $i] :
( theorem(or(not(X1),or(not(or(X0,not(X1))),X0)))
| ~ theorem(or(not(or(X0,not(X1))),or(not(X1),X0)))
| ~ axiom(or(not(or(not(or(X0,not(X1))),or(not(X1),X0))),or(not(X1),or(not(or(X0,not(X1))),X0)))) ),
inference(instantiation,[status(thm)],[c_842]) ).
tcf(c_2398,plain,
! [X0: $i,X1: $i] : axiom(or(not(or(not(p),or(X0,X1))),or(X0,or(not(p),X1)))),
inference(instantiation,[status(thm)],[c_254]) ).
tcf(c_2939,plain,
! [X0: $i] : axiom(or(not(or(X0,p)),or(p,X0))),
inference(instantiation,[status(thm)],[c_61]) ).
tcf(c_2941,plain,
axiom(or(not(or(q,p)),or(p,q))),
inference(instantiation,[status(thm)],[c_2939]) ).
tcf(c_3447,plain,
axiom(or(not(or(q,not(or(p,q)))),or(not(or(p,q)),q))),
inference(instantiation,[status(thm)],[c_371]) ).
tcf(c_3531,plain,
( theorem(or(not(or(q,not(or(p,q)))),or(not(or(p,q)),q)))
| ~ axiom(or(not(or(q,not(or(p,q)))),or(not(or(p,q)),q))) ),
inference(instantiation,[status(thm)],[c_823]) ).
tcf(c_4956,plain,
! [X0: $i] :
( theorem(or(not(or(X0,p)),or(not(or(q,not(or(p,q)))),q)))
| ~ axiom(or(not(or(X0,p)),or(p,X0)))
| ~ theorem(or(not(or(p,X0)),or(not(or(q,not(or(p,q)))),q))) ),
inference(instantiation,[status(thm)],[c_1526]) ).
tcf(c_4957,plain,
( theorem(or(not(or(q,p)),or(not(or(q,not(or(p,q)))),q)))
| ~ axiom(or(not(or(q,p)),or(p,q)))
| ~ theorem(or(not(or(p,q)),or(not(or(q,not(or(p,q)))),q))) ),
inference(instantiation,[status(thm)],[c_4956]) ).
tcf(c_5736,plain,
( theorem(or(not(or(p,q)),or(not(or(q,not(or(p,q)))),q)))
| ~ theorem(or(not(or(q,not(or(p,q)))),or(not(or(p,q)),q)))
| ~ axiom(or(not(or(not(or(q,not(or(p,q)))),or(not(or(p,q)),q))),or(not(or(p,q)),or(not(or(q,not(or(p,q)))),q)))) ),
inference(instantiation,[status(thm)],[c_1746]) ).
tcf(c_5737,plain,
axiom(or(not(or(not(or(q,not(or(p,q)))),or(not(or(p,q)),q))),or(not(or(p,q)),or(not(or(q,not(or(p,q)))),q)))),
inference(instantiation,[status(thm)],[c_508]) ).
tcf(c_11275,plain,
axiom(or(not(or(not(p),or(not(or(q,not(or(p,q)))),q))),or(not(or(q,not(or(p,q)))),or(not(p),q)))),
inference(instantiation,[status(thm)],[c_2398]) ).
tcf(c_11276,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_11275,c_5737,c_5736,c_4957,c_3531,c_3447,c_2941,c_1042,c_464,c_331,c_290,c_289,c_58]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : LCL218-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.04/11.15 % Computer : n012.cluster.edu
% 0.04/11.15 % Model : x86_64 x86_64
% 0.04/11.15 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/11.15 % Memory : 8046.5625MB
% 0.04/11.15 % OS : Linux 6.8.0-71-generic
% 0.04/11.15 % CPULimit : 300
% 0.04/11.15 % WCLimit : 300
% 0.04/11.15 % DateTime : Wed Sep 23 22:24:18 UTC 2026
% 0.04/11.16 % CPUTime :
% 0.04/11.16 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.04/11.17 Running first-order theorem proving
% 0.04/11.17 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.04/11.18
% 0.04/11.18 % ======== iProver multi-core TPTP/SMT =========
% 0.04/11.18
% 0.04/11.18 % Detected problem language: tptp
% 0.04/11.19 % Proving...
% 5.97/12.36 % SZS status Started for theBenchmark.p
% 5.97/12.36 % SZS status Unsatisfiable for theBenchmark.p
% 5.97/12.36
% 5.97/12.36 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 5.97/12.36
% 5.97/12.36 % ------ iProver source info
% 5.97/12.36
% 5.97/12.36 % git: date: 2026-07-19 20:42:38 +0200
% 5.97/12.36 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 5.97/12.36 % git: non_committed_changes: false
% 5.97/12.36
% 5.97/12.36 % ------ Parsing...% successful
% 5.97/12.36
% 5.97/12.36
% 5.97/12.36 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 5.97/12.36
% 5.97/12.36 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 5.97/12.36
% 5.97/12.36 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 5.97/12.36 % ------ Proving...
% 5.97/12.36 % ------ Problem Properties
% 5.97/12.36
% 5.97/12.36 %
% 5.97/12.36 % clauses 9
% 5.97/12.36 % conjectures 1
% 5.97/12.36 % EPR 1
% 5.97/12.36 % Horn 9
% 5.97/12.36 % unary 6
% 5.97/12.36 % binary 1
% 5.97/12.36 % lits 14
% 5.97/12.36 % lits eq 0
% 5.97/12.36 % fd_pure 0
% 5.97/12.36 % fd_pseudo 0
% 5.97/12.36 % fd_cond 0
% 5.97/12.36 % fd_pseudo_cond 0
% 5.97/12.36 % AC symbols 0
% 5.97/12.36
% 5.97/12.36 % ------ Schedule dynamic 5 is on
% 5.97/12.36
% 5.97/12.36 % ------ no equalities: superposition off
% 5.97/12.36
% 5.97/12.36 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 5.97/12.36
% 5.97/12.36
% 5.97/12.36 % ------
% 5.97/12.36 % Current options:
% 5.97/12.36 % ------
% 5.97/12.36
% 5.97/12.36
% 5.97/12.36 %
% 5.97/12.36
% 5.97/12.36 % ------ Proving...
% 5.97/12.36 %
% 5.97/12.36
% 5.97/12.36 % SZS status Unsatisfiable for theBenchmark.p
% 5.97/12.36
% 5.97/12.36 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 5.97/12.36
% 5.97/12.36
%------------------------------------------------------------------------------