%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL211-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 : n009.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:00 PM UTC 2026
% Result : Unsatisfiable 4.91s 2.26s
% Output : CNFRefutation 4.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 44 ( 23 unt; 0 def)
% Number of atoms : 84 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 82 ( 42 ~; 40 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 7 ( 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 : 56 ( 0 sgn 56 !; 0 ?; 42 :)
% 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(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(not(q)),or(not(or(p,q)),p))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
tcf(c_58,negated_conjecture,
~ theorem(or(not(not(q)),or(not(or(p,q)),p))),
inference(cnf_transformation,[],[f9]) ).
tcf(c_59,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_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_63,plain,
! [X0: $i] : axiom(or(not(or(X0,X0)),X0)),
inference(cnf_transformation,[],[f1]) ).
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_101,plain,
! [X0: $i] : theorem(or(not(or(X0,X0)),X0)),
inference(resolution,[status(thm)],[c_63,c_66]) ).
tcf(c_102,plain,
theorem(or(not(or(p,p)),p)),
inference(instantiation,[status(thm)],[c_101]) ).
tcf(c_230,plain,
! [X0: $i] :
( theorem(or(not(not(q)),or(not(or(p,q)),p)))
| ~ axiom(or(not(not(q)),X0))
| ~ theorem(or(not(X0),or(not(or(p,q)),p))) ),
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_234,plain,
! [X0: $i] :
( theorem(or(not(not(q)),or(not(or(p,q)),p)))
| ~ axiom(or(not(not(q)),or(X0,not(q))))
| ~ theorem(or(not(or(X0,not(q))),or(not(or(p,q)),p))) ),
inference(instantiation,[status(thm)],[c_230]) ).
tcf(c_235,plain,
! [X0: $i] : axiom(or(not(not(q)),or(X0,not(q)))),
inference(instantiation,[status(thm)],[c_62]) ).
tcf(c_236,plain,
( theorem(or(not(not(q)),or(not(or(p,q)),p)))
| ~ axiom(or(not(not(q)),or(p,not(q))))
| ~ theorem(or(not(or(p,not(q))),or(not(or(p,q)),p))) ),
inference(instantiation,[status(thm)],[c_234]) ).
tcf(c_237,plain,
axiom(or(not(not(q)),or(p,not(q)))),
inference(instantiation,[status(thm)],[c_235]) ).
tcf(c_256,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_232]) ).
tcf(c_262,plain,
! [X0: $i,X1: $i] :
( theorem(or(not(or(X1,not(q))),or(not(or(p,q)),p)))
| ~ axiom(or(not(or(X1,not(q))),X0))
| ~ theorem(or(not(X0),or(not(or(p,q)),p))) ),
inference(instantiation,[status(thm)],[c_64]) ).
tcf(c_299,plain,
! [X0: $i,X1: $i] :
( theorem(or(not(X1),or(not(or(p,q)),p)))
| ~ axiom(or(not(X1),X0))
| ~ theorem(or(not(X0),or(not(or(p,q)),p))) ),
inference(instantiation,[status(thm)],[c_64]) ).
tcf(c_309,plain,
! [X0: $i] :
( theorem(or(not(or(not(or(p,q)),X0)),or(not(or(p,q)),p)))
| ~ theorem(or(not(X0),p))
| ~ axiom(or(not(or(not(X0),p)),or(not(or(not(or(p,q)),X0)),or(not(or(p,q)),p)))) ),
inference(instantiation,[status(thm)],[c_256]) ).
tcf(c_353,plain,
! [X0: $i,X1: $i] : axiom(or(not(or(X0,not(X1))),or(not(X1),X0))),
inference(instantiation,[status(thm)],[c_61]) ).
tcf(c_488,plain,
! [X0: $i] : axiom(or(not(or(not(X0),p)),or(not(or(not(or(p,q)),X0)),or(not(or(p,q)),p)))),
inference(instantiation,[status(thm)],[c_59]) ).
tcf(c_611,plain,
! [X0: $i] :
( theorem(or(not(or(X0,not(q))),or(not(or(p,q)),p)))
| ~ axiom(or(not(or(X0,not(q))),or(not(q),X0)))
| ~ theorem(or(not(or(not(q),X0)),or(not(or(p,q)),p))) ),
inference(instantiation,[status(thm)],[c_262]) ).
tcf(c_612,plain,
! [X0: $i] : axiom(or(not(or(X0,not(q))),or(not(q),X0))),
inference(instantiation,[status(thm)],[c_353]) ).
tcf(c_613,plain,
( theorem(or(not(or(p,not(q))),or(not(or(p,q)),p)))
| ~ axiom(or(not(or(p,not(q))),or(not(q),p)))
| ~ theorem(or(not(or(not(q),p)),or(not(or(p,q)),p))) ),
inference(instantiation,[status(thm)],[c_611]) ).
tcf(c_614,plain,
axiom(or(not(or(p,not(q))),or(not(q),p))),
inference(instantiation,[status(thm)],[c_612]) ).
tcf(c_966,plain,
! [X0: $i,X1: $i] :
( theorem(or(not(or(not(q),X1)),or(not(or(p,q)),p)))
| ~ axiom(or(not(or(not(q),X1)),X0))
| ~ theorem(or(not(X0),or(not(or(p,q)),p))) ),
inference(instantiation,[status(thm)],[c_299]) ).
tcf(c_2233,plain,
! [X0: $i,X1: $i] :
( theorem(or(not(or(not(q),X1)),or(not(or(p,q)),p)))
| ~ axiom(or(not(or(not(q),X1)),or(not(or(X0,q)),or(X0,X1))))
| ~ theorem(or(not(or(not(or(X0,q)),or(X0,X1))),or(not(or(p,q)),p))) ),
inference(instantiation,[status(thm)],[c_966]) ).
tcf(c_2234,plain,
! [X0: $i,X1: $i] : axiom(or(not(or(not(q),X0)),or(not(or(X1,q)),or(X1,X0)))),
inference(instantiation,[status(thm)],[c_59]) ).
tcf(c_2235,plain,
( theorem(or(not(or(not(q),p)),or(not(or(p,q)),p)))
| ~ axiom(or(not(or(not(q),p)),or(not(or(p,q)),or(p,p))))
| ~ theorem(or(not(or(not(or(p,q)),or(p,p))),or(not(or(p,q)),p))) ),
inference(instantiation,[status(thm)],[c_2233]) ).
tcf(c_2236,plain,
axiom(or(not(or(not(q),p)),or(not(or(p,q)),or(p,p)))),
inference(instantiation,[status(thm)],[c_2234]) ).
tcf(c_6922,plain,
! [X0: $i] :
( theorem(or(not(or(not(or(p,q)),or(p,X0))),or(not(or(p,q)),p)))
| ~ theorem(or(not(or(p,X0)),p))
| ~ axiom(or(not(or(not(or(p,X0)),p)),or(not(or(not(or(p,q)),or(p,X0))),or(not(or(p,q)),p)))) ),
inference(instantiation,[status(thm)],[c_309]) ).
tcf(c_6923,plain,
( theorem(or(not(or(not(or(p,q)),or(p,p))),or(not(or(p,q)),p)))
| ~ theorem(or(not(or(p,p)),p))
| ~ axiom(or(not(or(not(or(p,p)),p)),or(not(or(not(or(p,q)),or(p,p))),or(not(or(p,q)),p)))) ),
inference(instantiation,[status(thm)],[c_6922]) ).
tcf(c_12348,plain,
! [X0: $i] : axiom(or(not(or(not(or(p,X0)),p)),or(not(or(not(or(p,q)),or(p,X0))),or(not(or(p,q)),p)))),
inference(instantiation,[status(thm)],[c_488]) ).
tcf(c_12349,plain,
axiom(or(not(or(not(or(p,p)),p)),or(not(or(not(or(p,q)),or(p,p))),or(not(or(p,q)),p)))),
inference(instantiation,[status(thm)],[c_12348]) ).
tcf(c_12350,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_12349,c_6923,c_2236,c_2235,c_614,c_613,c_237,c_236,c_102,c_58]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL211-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.36 % Computer : n009.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Wed Sep 23 22:21:58 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.44
% 0.11/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.44
% 0.11/0.44 % Detected problem language: tptp
% 0.11/0.46 % Proving...
% 4.91/2.26 % SZS status Started for theBenchmark.p
% 4.91/2.26 % SZS status Unsatisfiable for theBenchmark.p
% 4.91/2.26
% 4.91/2.26 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.91/2.26
% 4.91/2.26 % ------ iProver source info
% 4.91/2.26
% 4.91/2.26 % git: date: 2026-07-19 20:42:38 +0200
% 4.91/2.26 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.91/2.26 % git: non_committed_changes: false
% 4.91/2.26
% 4.91/2.26 % ------ Parsing...% successful
% 4.91/2.26
% 4.91/2.26
% 4.91/2.26 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.91/2.26
% 4.91/2.26 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 4.91/2.26
% 4.91/2.26 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.91/2.26 % ------ Proving...
% 4.91/2.26 % ------ Problem Properties
% 4.91/2.26
% 4.91/2.26 %
% 4.91/2.26 % clauses 9
% 4.91/2.26 % conjectures 1
% 4.91/2.26 % EPR 1
% 4.91/2.26 % Horn 9
% 4.91/2.26 % unary 6
% 4.91/2.26 % binary 1
% 4.91/2.26 % lits 14
% 4.91/2.26 % lits eq 0
% 4.91/2.26 % fd_pure 0
% 4.91/2.26 % fd_pseudo 0
% 4.91/2.26 % fd_cond 0
% 4.91/2.26 % fd_pseudo_cond 0
% 4.91/2.26 % AC symbols 0
% 4.91/2.26
% 4.91/2.26 % ------ Schedule dynamic 5 is on
% 4.91/2.26
% 4.91/2.26 % ------ no equalities: superposition off
% 4.91/2.26
% 4.91/2.26 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.91/2.26
% 4.91/2.26
% 4.91/2.26 % ------
% 4.91/2.26 % Current options:
% 4.91/2.26 % ------
% 4.91/2.26
% 4.91/2.26
% 4.91/2.26 %
% 4.91/2.26
% 4.91/2.26 % ------ Proving...
% 4.91/2.26 %
% 4.91/2.26
% 4.91/2.26 % SZS status Unsatisfiable for theBenchmark.p
% 4.91/2.26
% 4.91/2.26 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.91/2.26
% 4.91/2.26
%------------------------------------------------------------------------------