%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL497+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n020.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:46 PM UTC 2026
% Result : Theorem 106.44s 21.66s
% Output : CNFRefutation 106.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 20
% Syntax : Number of formulae : 113 ( 42 unt; 0 def)
% Number of atoms : 208 ( 25 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 176 ( 81 ~; 76 |; 2 &)
% ( 7 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 9 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 189 ( 0 sgn 187 !; 2 ?; 123 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
( modus_ponens
<=> ! [X0,X1] :
( ( is_a_theorem(implies(X0,X1))
& is_a_theorem(X0) )
=> is_a_theorem(X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',modus_ponens) ).
fof(f20,axiom,
( cn2
<=> ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',cn2) ).
fof(f22,axiom,
( r1
<=> ! [X0] : is_a_theorem(implies(or(X0,X0),X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',r1) ).
fof(f23,axiom,
( r2
<=> ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',r2) ).
fof(f24,axiom,
( r3
<=> ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',r3) ).
fof(f25,axiom,
( r4
<=> ! [X0,X1,X2] : is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',r4) ).
fof(f26,axiom,
( r5
<=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',r5) ).
fof(f30,axiom,
( op_implies_or
=> ! [X0,X1] : implies(X0,X1) = or(not(X0),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax',op_implies_or) ).
fof(f32,axiom,
op_implies_or,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_op_implies_or) ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_modus_ponens) ).
fof(f36,axiom,
r1,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_r1) ).
fof(f37,axiom,
r2,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_r2) ).
fof(f38,axiom,
r3,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_r3) ).
fof(f39,axiom,
r4,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_r4) ).
fof(f40,axiom,
r5,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+4.ax',principia_r5) ).
fof(f45,conjecture,
cn2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',luka_cn2) ).
fof(f46,negated_conjecture,
~ cn2,
inference(negated_conjecture,[status(cth)],[f45]) ).
fof(f47,plain,
~ cn2,
inference(flattening,[],[f46]) ).
fof(f48,plain,
( r5
=> ! [X0,X1,X2] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))) ),
inference(unused_predicate_definition_removal,[],[f26]) ).
fof(f49,plain,
( r4
=> ! [X0,X1,X2] : is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) ),
inference(unused_predicate_definition_removal,[],[f25]) ).
fof(f50,plain,
( r3
=> ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
inference(unused_predicate_definition_removal,[],[f24]) ).
fof(f51,plain,
( r2
=> ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1))) ),
inference(unused_predicate_definition_removal,[],[f23]) ).
fof(f52,plain,
( r1
=> ! [X0] : is_a_theorem(implies(or(X0,X0),X0)) ),
inference(unused_predicate_definition_removal,[],[f22]) ).
fof(f53,plain,
( ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1)))
=> cn2 ),
inference(unused_predicate_definition_removal,[],[f20]) ).
fof(f55,plain,
( modus_ponens
=> ! [X0,X1] :
( ( is_a_theorem(implies(X0,X1))
& is_a_theorem(X0) )
=> is_a_theorem(X1) ) ),
inference(unused_predicate_definition_removal,[],[f1]) ).
fof(f58,plain,
( ~ modus_ponens
| ! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ) ),
inference(ennf_transformation,[],[f55]) ).
fof(f59,plain,
( ~ modus_ponens
| ! [X0,X1] :
( ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ) ),
inference(flattening,[],[f58]) ).
fof(f61,plain,
( ? [X0,X1] : ~ is_a_theorem(implies(X0,implies(not(X0),X1)))
| cn2 ),
inference(ennf_transformation,[],[f53]) ).
fof(f62,plain,
( ~ r1
| ! [X0] : is_a_theorem(implies(or(X0,X0),X0)) ),
inference(ennf_transformation,[],[f52]) ).
fof(f63,plain,
( ~ r2
| ! [X0,X1] : is_a_theorem(implies(X1,or(X0,X1))) ),
inference(ennf_transformation,[],[f51]) ).
fof(f64,plain,
( ~ r3
| ! [X0,X1] : is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
inference(ennf_transformation,[],[f50]) ).
fof(f65,plain,
( ~ r4
| ! [X0,X1,X2] : is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) ),
inference(ennf_transformation,[],[f49]) ).
fof(f66,plain,
( ~ r5
| ! [X0,X1,X2] : is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))) ),
inference(ennf_transformation,[],[f48]) ).
fof(f69,plain,
( ~ op_implies_or
| ! [X0,X1] : implies(X0,X1) = or(not(X0),X1) ),
inference(ennf_transformation,[],[f30]) ).
fof(f71,plain,
( ~ is_a_theorem(implies(sK0,implies(not(sK0),sK1)))
| cn2 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f61]) ).
fof(f72,plain,
! [X0,X1] :
( ~ modus_ponens
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(cnf_transformation,[],[f59]) ).
fof(f74,plain,
( ~ is_a_theorem(implies(sK0,implies(not(sK0),sK1)))
| cn2 ),
inference(cnf_transformation,[],[f71]) ).
fof(f75,plain,
! [X0] :
( ~ r1
| is_a_theorem(implies(or(X0,X0),X0)) ),
inference(cnf_transformation,[],[f62]) ).
fof(f76,plain,
! [X0,X1] :
( ~ r2
| is_a_theorem(implies(X1,or(X0,X1))) ),
inference(cnf_transformation,[],[f63]) ).
fof(f77,plain,
! [X0,X1] :
( ~ r3
| is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
inference(cnf_transformation,[],[f64]) ).
fof(f78,plain,
! [X2,X0,X1] :
( ~ r4
| is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) ),
inference(cnf_transformation,[],[f65]) ).
fof(f79,plain,
! [X2,X0,X1] :
( ~ r5
| is_a_theorem(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))) ),
inference(cnf_transformation,[],[f66]) ).
fof(f82,plain,
! [X0,X1] :
( ~ op_implies_or
| implies(X0,X1) = or(not(X0),X1) ),
inference(cnf_transformation,[],[f69]) ).
fof(f84,plain,
op_implies_or,
inference(cnf_transformation,[],[f32]) ).
fof(f87,plain,
modus_ponens,
inference(cnf_transformation,[],[f35]) ).
fof(f88,plain,
r1,
inference(cnf_transformation,[],[f36]) ).
fof(f89,plain,
r2,
inference(cnf_transformation,[],[f37]) ).
fof(f90,plain,
r3,
inference(cnf_transformation,[],[f38]) ).
fof(f91,plain,
r4,
inference(cnf_transformation,[],[f39]) ).
fof(f92,plain,
r5,
inference(cnf_transformation,[],[f40]) ).
fof(f96,plain,
~ cn2,
inference(cnf_transformation,[],[f47]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(X1)
| ~ modus_ponens
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ),
inference(cnf_transformation,[],[f72]) ).
tcf(c_51,plain,
( cn2
| ~ is_a_theorem(implies(sK0,implies(not(sK0),sK1))) ),
inference(cnf_transformation,[],[f74]) ).
tcf(c_52,plain,
! [X0: $i] :
( is_a_theorem(implies(or(X0,X0),X0))
| ~ r1 ),
inference(cnf_transformation,[],[f75]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(X0,or(X1,X0)))
| ~ r2 ),
inference(cnf_transformation,[],[f76]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(or(X0,X1),or(X1,X0)))
| ~ r3 ),
inference(cnf_transformation,[],[f77]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2))))
| ~ r4 ),
inference(cnf_transformation,[],[f78]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1))))
| ~ r5 ),
inference(cnf_transformation,[],[f79]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] :
( ( or(not(X0),X1) = implies(X0,X1) )
| ~ op_implies_or ),
inference(cnf_transformation,[],[f82]) ).
tcf(c_61,plain,
op_implies_or,
inference(cnf_transformation,[],[f84]) ).
tcf(c_64,plain,
modus_ponens,
inference(cnf_transformation,[],[f87]) ).
tcf(c_65,plain,
r1,
inference(cnf_transformation,[],[f88]) ).
tcf(c_66,plain,
r2,
inference(cnf_transformation,[],[f89]) ).
tcf(c_67,plain,
r3,
inference(cnf_transformation,[],[f90]) ).
tcf(c_68,plain,
r4,
inference(cnf_transformation,[],[f91]) ).
tcf(c_69,plain,
r5,
inference(cnf_transformation,[],[f92]) ).
tcf(c_73,negated_conjecture,
~ cn2,
inference(cnf_transformation,[],[f96]) ).
tcf(c_84,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(X0,or(X1,X0))),
inference(global_subsumption_just,[status(thm)],[c_53,c_66,c_53]) ).
tcf(c_87,plain,
! [X0: $i] : is_a_theorem(implies(or(X0,X0),X0)),
inference(global_subsumption_just,[status(thm)],[c_52,c_65,c_52]) ).
tcf(c_90,plain,
~ is_a_theorem(implies(sK0,implies(not(sK0),sK1))),
inference(global_subsumption_just,[status(thm)],[c_51,c_73,c_51]) ).
tcf(c_92,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(or(X0,X1),or(X1,X0))),
inference(global_subsumption_just,[status(thm)],[c_54,c_67,c_54]) ).
tcf(c_95,plain,
! [X0: $i,X1: $i] : or(not(X0),X1) = implies(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_59,c_61,c_59]) ).
tcf(c_101,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0) ),
inference(global_subsumption_just,[status(thm)],[c_49,c_64,c_49]) ).
tcf(c_102,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(X1)
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ),
inference(renaming,[status(thm)],[c_101]) ).
tcf(c_112,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
inference(global_subsumption_just,[status(thm)],[c_56,c_69,c_56]) ).
tcf(c_115,plain,
! [X0: $i,X1: $i,X2: $i] : is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(global_subsumption_just,[status(thm)],[c_55,c_68,c_55]) ).
tcf(c_134,plain,
! [X0: $i] : X0 = X0,
theory(equality) ).
tcf(c_136,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X2 = X0 )
| ( X2 != X1 )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_137,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(X0)
| ~ is_a_theorem(X1)
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_138,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( implies(X0,X2) = implies(X1,X3) )
| ( X2 != X3 )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_190,plain,
! [X0: $i] :
( is_a_theorem(X0)
| ~ is_a_theorem(or(X0,X0)) ),
inference(resolution,[status(thm)],[c_102,c_87]) ).
tcf(c_194,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(or(X1,X0))
| ~ is_a_theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[c_102,c_92]) ).
tcf(c_274,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(or(not(X0),X1))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[status(thm)],[c_137,c_95]) ).
tcf(c_380,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(or(X2,X0),or(X2,X1)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[status(thm)],[c_112,c_102]) ).
tcf(c_393,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(or(X1,or(X0,X2)))
| ~ is_a_theorem(or(X0,or(X1,X2))) ),
inference(resolution,[status(thm)],[c_115,c_102]) ).
tcf(c_460,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(or(X2,X1))
| ~ is_a_theorem(or(X2,X0))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[status(thm)],[c_380,c_102]) ).
tcf(c_480,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(or(X1,or(not(X0),X2)))
| ~ is_a_theorem(implies(X0,or(X1,X2))) ),
inference(resolution,[status(thm)],[c_393,c_274]) ).
tcf(c_675,plain,
! [X0: $i,X1: $i] :
( ( X1 = X0 )
| ( X0 != X1 ) ),
inference(resolution,[status(thm)],[c_136,c_134]) ).
tcf(c_703,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(implies(X0,X2))
| ~ is_a_theorem(implies(X1,X3))
| ( X2 != X3 )
| ( X0 != X1 ) ),
inference(resolution,[status(thm)],[c_138,c_137]) ).
tcf(c_765,plain,
! [X0: $i,X1: $i] : implies(X0,X1) = or(not(X0),X1),
inference(resolution,[status(thm)],[c_675,c_95]) ).
tcf(c_808,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(or(not(X0),X1)) ),
inference(resolution,[status(thm)],[c_765,c_137]) ).
tcf(c_1770,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(implies(X0,X2))
| ( X2 != or(X3,X1) )
| ( X0 != X1 ) ),
inference(resolution,[status(thm)],[c_703,c_84]) ).
tcf(c_1771,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( is_a_theorem(implies(X0,X3))
| ( X3 != or(X2,X1) )
| ( X0 != or(X1,X2) ) ),
inference(resolution,[status(thm)],[c_703,c_92]) ).
tcf(c_5271,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(X0,or(X2,X1)))
| ( X0 != X1 ) ),
inference(resolution,[status(thm)],[c_1770,c_134]) ).
tcf(c_5664,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(or(X2,X1))
| ~ is_a_theorem(X0)
| ( X0 != X1 ) ),
inference(resolution,[status(thm)],[c_5271,c_102]) ).
tcf(c_6033,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(or(X2,or(not(X0),X1)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[status(thm)],[c_5664,c_765]) ).
tcf(c_7092,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(or(not(X0),or(X2,X1)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[status(thm)],[c_6033,c_393]) ).
tcf(c_7378,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(X0,or(X2,X1)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[status(thm)],[c_7092,c_808]) ).
tcf(c_7390,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(or(X2,X1))
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[status(thm)],[c_7378,c_102]) ).
tcf(c_7506,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(implies(X0,implies(X2,X1)))
| ( X0 != or(X1,not(X2)) ) ),
inference(resolution,[status(thm)],[c_1771,c_765]) ).
tcf(c_8026,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(or(X2,or(X1,X0)))
| ~ is_a_theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[c_7390,c_92]) ).
tcf(c_8146,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(or(X1,or(X2,X0)))
| ~ is_a_theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[c_8026,c_393]) ).
tcf(c_8481,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(or(X1,X0))
| ~ is_a_theorem(or(X0,or(X1,X0))) ),
inference(resolution,[status(thm)],[c_8146,c_190]) ).
tcf(c_18136,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(or(not(X0),X1))
| ~ is_a_theorem(implies(X0,or(X1,X1))) ),
inference(resolution,[status(thm)],[c_480,c_8481]) ).
tcf(c_18223,plain,
! [X0: $i] : is_a_theorem(or(not(X0),X0)),
inference(resolution,[status(thm)],[c_18136,c_84]) ).
tcf(c_18481,plain,
! [X0: $i] : is_a_theorem(or(X0,not(X0))),
inference(resolution,[status(thm)],[c_18223,c_194]) ).
tcf(c_19089,plain,
! [X0: $i,X1: $i] :
( is_a_theorem(or(X0,X1))
| ~ is_a_theorem(implies(not(X0),X1)) ),
inference(resolution,[status(thm)],[c_18481,c_460]) ).
tcf(c_21974,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(or(X0,not(X1)),implies(X1,X0))),
inference(resolution,[status(thm)],[c_7506,c_134]) ).
tcf(c_23029,plain,
! [X0: $i,X1: $i] : is_a_theorem(or(X0,or(X1,not(X0)))),
inference(resolution,[status(thm)],[c_19089,c_84]) ).
tcf(c_23237,plain,
! [X0: $i,X1: $i,X2: $i] :
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(implies(or(X0,not(X1)),X2)) ),
inference(resolution,[status(thm)],[c_23029,c_460]) ).
tcf(c_173393,plain,
! [X0: $i,X1: $i] : is_a_theorem(or(X0,implies(X0,X1))),
inference(resolution,[status(thm)],[c_23237,c_21974]) ).
tcf(c_173862,plain,
! [X0: $i,X1: $i] : is_a_theorem(implies(X0,implies(not(X0),X1))),
inference(resolution,[status(thm)],[c_173393,c_808]) ).
tcf(c_176561,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_90,c_173862]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL497+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.16/5.44 % Computer : n020.cluster.edu
% 0.16/5.44 % Model : x86_64 x86_64
% 0.16/5.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/5.44 % Memory : 8046.5625MB
% 0.16/5.44 % OS : Linux 6.8.0-71-generic
% 0.16/5.45 % CPULimit : 300
% 0.16/5.45 % WCLimit : 300
% 0.16/5.45 % DateTime : Wed Sep 23 23:35:09 UTC 2026
% 0.16/5.45 % CPUTime :
% 0.16/5.45 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.21/5.50 Running first-order theorem proving
% 0.21/5.50 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.21/5.52
% 0.21/5.52 % ======== iProver multi-core TPTP/SMT =========
% 0.21/5.52
% 0.21/5.52 % Detected problem language: tptp
% 0.21/5.53 % Proving...
% 106.44/21.66 % SZS status Started for theBenchmark.p
% 106.44/21.66 % SZS status Theorem for theBenchmark.p
% 106.44/21.66
% 106.44/21.66 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 106.44/21.66
% 106.44/21.66 % ------ iProver source info
% 106.44/21.66
% 106.44/21.66 % git: date: 2026-07-19 20:42:38 +0200
% 106.44/21.66 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 106.44/21.66 % git: non_committed_changes: false
% 106.44/21.66
% 106.44/21.66 % ------ Parsing...
% 106.44/21.66 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 106.44/21.66
% 106.44/21.66 % ------ Preprocessing... sf_s rm: 13 0s sf_e sf_s rm: 1 0s sf_e %
% 106.44/21.66
% 106.44/21.66 % ------ Preprocessing...%
% 106.44/21.66
% 106.44/21.66 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 106.44/21.66 % ------ Proving...
% 106.44/21.66 % ------ Problem Properties
% 106.44/21.66
% 106.44/21.66 %
% 106.44/21.66 % clauses 12
% 106.44/21.66 % conjectures 0
% 106.44/21.66 % EPR 0
% 106.44/21.66 % Horn 12
% 106.44/21.66 % unary 10
% 106.44/21.66 % binary 1
% 106.44/21.66 % lits 15
% 106.44/21.66 % lits eq 5
% 106.44/21.66 % fd_pure 0
% 106.44/21.66 % fd_pseudo 0
% 106.44/21.66 % fd_cond 0
% 106.44/21.66 % fd_pseudo_cond 1
% 106.44/21.66 % AC symbols 0
% 106.44/21.66
% 106.44/21.66 % ------ Input Options Time Limit: Unbounded
% 106.44/21.66
% 106.44/21.66
% 106.44/21.66 % ------
% 106.44/21.66 % Current options:
% 106.44/21.66 % ------
% 106.44/21.66
% 106.44/21.66
% 106.44/21.66 %
% 106.44/21.66
% 106.44/21.66 % ------ Proving...
% 106.44/21.66 %
% 106.44/21.66
% 106.44/21.66 % SZS status Theorem for theBenchmark.p
% 106.44/21.66
% 106.44/21.66 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 106.44/21.67
% 106.44/21.67
%------------------------------------------------------------------------------