%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL215-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 : n004.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:01 PM UTC 2026
% Result : Unsatisfiable 5.39s 2.28s
% Output : CNFRefutation 5.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 39 ( 20 unt; 0 def)
% Number of atoms : 75 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 74 ( 38 ~; 36 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 8 ( 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 : 50 ( 0 sgn 50 !; 0 ?; 35 :)
% 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(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(not(p),q)),or(not(or(p,q)),q))),
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_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(not(p),q)),or(not(or(p,q)),q))),
inference(cnf_transformation,[],[f9]) ).
tcf(c_101,plain,
! [X0: $i] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[status(thm)],[c_58,c_63]) ).
tcf(c_102,plain,
theorem(or(not(or(q,q)),q)),
inference(instantiation,[status(thm)],[c_101]) ).
tcf(c_226,plain,
! [X0: $i] :
( theorem(or(not(or(not(p),q)),or(not(or(p,q)),q)))
| ~ theorem(X0)
| ~ axiom(or(not(X0),or(not(or(not(p),q)),or(not(or(p,q)),q)))) ),
inference(instantiation,[status(thm)],[c_64]) ).
tcf(c_230,plain,
! [X0: $i,X1: $i] :
( theorem(or(not(or(not(p),q)),or(not(or(p,q)),q)))
| ~ theorem(or(not(X0),X1))
| ~ axiom(or(not(or(not(X0),X1)),or(not(or(not(p),q)),or(not(or(p,q)),q)))) ),
inference(instantiation,[status(thm)],[c_226]) ).
tcf(c_241,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_64]) ).
tcf(c_244,plain,
( theorem(or(not(or(not(p),q)),or(not(or(p,q)),q)))
| ~ theorem(or(not(or(p,q)),or(not(or(not(p),q)),q)))
| ~ axiom(or(not(or(not(or(p,q)),or(not(or(not(p),q)),q))),or(not(or(not(p),q)),or(not(or(p,q)),q)))) ),
inference(instantiation,[status(thm)],[c_230]) ).
tcf(c_246,plain,
! [X0: $i] : axiom(or(not(or(not(p),q)),or(not(or(X0,p)),or(X0,q)))),
inference(instantiation,[status(thm)],[c_62]) ).
tcf(c_247,plain,
axiom(or(not(or(not(p),q)),or(not(or(q,p)),or(q,q)))),
inference(instantiation,[status(thm)],[c_246]) ).
tcf(c_268,plain,
! [X0: $i] :
( theorem(or(not(or(p,q)),or(not(or(not(p),q)),q)))
| ~ axiom(or(not(or(p,q)),X0))
| ~ theorem(or(not(X0),or(not(or(not(p),q)),q))) ),
inference(instantiation,[status(thm)],[c_65]) ).
tcf(c_281,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_241]) ).
tcf(c_283,plain,
! [X0: $i,X1: $i,X2: $i] :
( theorem(or(not(or(X2,X0)),or(X2,X1)))
| ~ theorem(or(not(X0),X1))
| ~ axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))) ),
inference(instantiation,[status(thm)],[c_241]) ).
tcf(c_325,plain,
( theorem(or(not(or(p,q)),or(not(or(not(p),q)),q)))
| ~ axiom(or(not(or(p,q)),or(q,p)))
| ~ theorem(or(not(or(q,p)),or(not(or(not(p),q)),q))) ),
inference(instantiation,[status(thm)],[c_268]) ).
tcf(c_342,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_61]) ).
tcf(c_364,plain,
axiom(or(not(or(p,q)),or(q,p))),
inference(instantiation,[status(thm)],[c_60]) ).
tcf(c_396,plain,
axiom(or(not(or(not(or(p,q)),or(not(or(not(p),q)),q))),or(not(or(not(p),q)),or(not(or(p,q)),q)))),
inference(instantiation,[status(thm)],[c_342]) ).
tcf(c_499,plain,
( theorem(or(not(or(q,p)),or(not(or(not(p),q)),q)))
| ~ theorem(or(not(or(not(p),q)),or(not(or(q,p)),q)))
| ~ axiom(or(not(or(not(or(not(p),q)),or(not(or(q,p)),q))),or(not(or(q,p)),or(not(or(not(p),q)),q)))) ),
inference(instantiation,[status(thm)],[c_281]) ).
tcf(c_578,plain,
axiom(or(not(or(not(or(not(p),q)),or(not(or(q,p)),q))),or(not(or(q,p)),or(not(or(not(p),q)),q)))),
inference(instantiation,[status(thm)],[c_342]) ).
tcf(c_899,plain,
! [X0: $i] :
( theorem(or(not(or(not(p),q)),or(not(or(q,p)),q)))
| ~ axiom(or(not(or(not(p),q)),X0))
| ~ theorem(or(not(X0),or(not(or(q,p)),q))) ),
inference(instantiation,[status(thm)],[c_65]) ).
tcf(c_1872,plain,
! [X0: $i] :
( theorem(or(not(or(not(p),q)),or(not(or(q,p)),q)))
| ~ axiom(or(not(or(not(p),q)),or(not(or(X0,p)),or(X0,q))))
| ~ theorem(or(not(or(not(or(X0,p)),or(X0,q))),or(not(or(q,p)),q))) ),
inference(instantiation,[status(thm)],[c_899]) ).
tcf(c_1873,plain,
( theorem(or(not(or(not(p),q)),or(not(or(q,p)),q)))
| ~ axiom(or(not(or(not(p),q)),or(not(or(q,p)),or(q,q))))
| ~ theorem(or(not(or(not(or(q,p)),or(q,q))),or(not(or(q,p)),q))) ),
inference(instantiation,[status(thm)],[c_1872]) ).
tcf(c_8063,plain,
( theorem(or(not(or(not(or(q,p)),or(q,q))),or(not(or(q,p)),q)))
| ~ theorem(or(not(or(q,q)),q))
| ~ axiom(or(not(or(not(or(q,q)),q)),or(not(or(not(or(q,p)),or(q,q))),or(not(or(q,p)),q)))) ),
inference(instantiation,[status(thm)],[c_283]) ).
tcf(c_14613,plain,
axiom(or(not(or(not(or(q,q)),q)),or(not(or(not(or(q,p)),or(q,q))),or(not(or(q,p)),q)))),
inference(instantiation,[status(thm)],[c_62]) ).
tcf(c_14614,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_14613,c_8063,c_1873,c_578,c_499,c_396,c_364,c_325,c_247,c_244,c_102,c_66]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL215-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.11/0.37 % Computer : n004.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Wed Sep 23 22:22:50 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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.11/0.43
% 0.11/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.43
% 0.11/0.43 % Detected problem language: tptp
% 0.11/0.44 % Proving...
% 5.39/2.28 % SZS status Started for theBenchmark.p
% 5.39/2.28 % SZS status Unsatisfiable for theBenchmark.p
% 5.39/2.28
% 5.39/2.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 5.39/2.28
% 5.39/2.28 % ------ iProver source info
% 5.39/2.28
% 5.39/2.28 % git: date: 2026-07-19 20:42:38 +0200
% 5.39/2.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 5.39/2.28 % git: non_committed_changes: false
% 5.39/2.28
% 5.39/2.28 % ------ Parsing...% successful
% 5.39/2.28
% 5.39/2.28
% 5.39/2.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 5.39/2.28
% 5.39/2.28 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 5.39/2.28
% 5.39/2.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 5.39/2.28 % ------ Proving...
% 5.39/2.28 % ------ Problem Properties
% 5.39/2.28
% 5.39/2.28 %
% 5.39/2.28 % clauses 9
% 5.39/2.28 % conjectures 1
% 5.39/2.28 % EPR 1
% 5.39/2.28 % Horn 9
% 5.39/2.28 % unary 6
% 5.39/2.28 % binary 1
% 5.39/2.28 % lits 14
% 5.39/2.28 % lits eq 0
% 5.39/2.28 % fd_pure 0
% 5.39/2.28 % fd_pseudo 0
% 5.39/2.28 % fd_cond 0
% 5.39/2.28 % fd_pseudo_cond 0
% 5.39/2.28 % AC symbols 0
% 5.39/2.28
% 5.39/2.28 % ------ Input Options Time Limit: Unbounded
% 5.39/2.28
% 5.39/2.28
% 5.39/2.28 % ------
% 5.39/2.28 % Current options:
% 5.39/2.28 % ------
% 5.39/2.28
% 5.39/2.28
% 5.39/2.28 %
% 5.39/2.28
% 5.39/2.28 % ------ Proving...
% 5.39/2.28 %
% 5.39/2.28
% 5.39/2.28 % SZS status Unsatisfiable for theBenchmark.p
% 5.39/2.28
% 5.39/2.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 5.39/2.28
% 5.39/2.28
%------------------------------------------------------------------------------