%------------------------------------------------------------------------------
% File : hopCoP---0.1
% Problem : LCL497+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n027.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 : Mon Sep 7 12:13:55 PM UTC 2026
% Result : Theorem 144.81s 18.65s
% Output : CNFRefutation 144.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 14
% Syntax : Number of formulae : 52 ( 27 unt; 0 def)
% Number of atoms : 87 ( 5 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 64 ( 29 ~; 26 |; 1 &)
% ( 6 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 10 ( 8 usr; 8 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 30 ( 1 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(luka_cn2,plain,
cn2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',luka_cn2) ).
fof(luka_cn2_negated,plain,
~ cn2,
inference(negate_conjecture,[status(cth)],[luka_cn2]) ).
cnf(73,plain,
~ cn2,
inference(cnf,[status(esa)],[luka_cn2_negated]) ).
cnf(l0,plain,
~ cn2,
inference(instantiation,[status(thm)],[73]) ).
fof(cn2,plain,
( cn2
<=> ! [P,Q] : is_a_theorem(implies(P,implies(not(P),Q))) ),
file('Axioms/LCL006+0.ax',cn2) ).
cnf(42,plain,
( ~ is_a_theorem(implies(sK42,implies(not(sK42),sK43)))
| cn2 ),
inference(cnf,[status(esa)],[cn2]) ).
cnf(l1,plain,
( ~ is_a_theorem(implies(sK42,implies(not(sK42),sK43)))
| cn2 ),
inference(instantiation,[status(thm)],[42]) ).
fof(op_implies_or,plain,
( op_implies_or
=> ! [X,Y] : implies(X,Y) = or(not(X),Y) ),
file('Axioms/LCL006+1.ax',op_implies_or) ).
cnf(58,plain,
( ~ op_implies_or
| implies(X0,X1) = or(not(X0),X1) ),
inference(cnf,[status(esa)],[op_implies_or]) ).
cnf(l17,plain,
( ~ op_implies_or
| implies(sK42,implies(not(sK42),sK43)) = or(not(sK42),implies(not(sK42),sK43)) ),
inference(instantiation,[status(thm)],[58]) ).
fof(modus_ponens,plain,
( modus_ponens
<=> ! [X,Y] :
( ( is_a_theorem(X)
& is_a_theorem(implies(X,Y)) )
=> is_a_theorem(Y) ) ),
file('Axioms/LCL006+0.ax',modus_ponens) ).
cnf(0,plain,
( ~ modus_ponens
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,X1))
| is_a_theorem(X1) ),
inference(cnf,[status(esa)],[modus_ponens]) ).
cnf(l4,plain,
( ~ modus_ponens
| ~ is_a_theorem(or(not(not(sK42)),or(not(sK42),sK43)))
| ~ is_a_theorem(implies(or(not(not(sK42)),or(not(sK42),sK43)),or(not(sK42),or(not(not(sK42)),sK43))))
| is_a_theorem(or(not(sK42),or(not(not(sK42)),sK43))) ),
inference(instantiation,[status(thm)],[0]) ).
fof(principia_modus_ponens,plain,
modus_ponens,
file('Axioms/LCL006+4.ax',principia_modus_ponens) ).
cnf(63,plain,
modus_ponens,
inference(cnf,[status(esa)],[principia_modus_ponens]) ).
cnf(l6,plain,
modus_ponens,
inference(instantiation,[status(thm)],[63]) ).
cnf(l144,plain,
( ~ op_implies_or
| implies(not(sK42),sK43) = or(not(not(sK42)),sK43) ),
inference(instantiation,[status(thm)],[58]) ).
cnf(l54,plain,
( ~ modus_ponens
| ~ is_a_theorem(or(not(not(sK42)),or(sK43,not(sK42))))
| ~ is_a_theorem(implies(or(not(not(sK42)),or(sK43,not(sK42))),or(not(not(sK42)),or(not(sK42),sK43))))
| is_a_theorem(or(not(not(sK42)),or(not(sK42),sK43))) ),
inference(instantiation,[status(thm)],[0]) ).
fof(principia_op_implies_or,plain,
op_implies_or,
file('Axioms/LCL006+4.ax',principia_op_implies_or) ).
cnf(60,plain,
op_implies_or,
inference(cnf,[status(esa)],[principia_op_implies_or]) ).
cnf(l146,plain,
op_implies_or,
inference(instantiation,[status(thm)],[60]) ).
cnf(l80,plain,
( ~ modus_ponens
| ~ is_a_theorem(implies(or(sK43,not(sK42)),or(not(sK42),sK43)))
| ~ is_a_theorem(implies(implies(or(sK43,not(sK42)),or(not(sK42),sK43)),implies(or(not(not(sK42)),or(sK43,not(sK42))),or(not(not(sK42)),or(not(sK42),sK43)))))
| is_a_theorem(implies(or(not(not(sK42)),or(sK43,not(sK42))),or(not(not(sK42)),or(not(sK42),sK43)))) ),
inference(instantiation,[status(thm)],[0]) ).
fof(r5,plain,
( r5
<=> ! [P,Q,R] : is_a_theorem(implies(implies(Q,R),implies(or(P,Q),or(P,R)))) ),
file('Axioms/LCL006+0.ax',r5) ).
cnf(53,plain,
( ~ r5
| is_a_theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))) ),
inference(cnf,[status(esa)],[r5]) ).
cnf(l126,plain,
( ~ r5
| is_a_theorem(implies(implies(or(sK43,not(sK42)),or(not(sK42),sK43)),implies(or(not(not(sK42)),or(sK43,not(sK42))),or(not(not(sK42)),or(not(sK42),sK43))))) ),
inference(instantiation,[status(thm)],[53]) ).
fof(principia_r5,plain,
r5,
file('Axioms/LCL006+4.ax',principia_r5) ).
cnf(68,plain,
r5,
inference(cnf,[status(esa)],[principia_r5]) ).
cnf(l129,plain,
r5,
inference(instantiation,[status(thm)],[68]) ).
cnf(l81,plain,
modus_ponens,
inference(instantiation,[status(thm)],[63]) ).
cnf(l18,plain,
op_implies_or,
inference(instantiation,[status(thm)],[60]) ).
cnf(l55,plain,
modus_ponens,
inference(instantiation,[status(thm)],[63]) ).
fof(r3,plain,
( r3
<=> ! [P,Q] : is_a_theorem(implies(or(P,Q),or(Q,P))) ),
file('Axioms/LCL006+0.ax',r3) ).
cnf(49,plain,
( ~ r3
| is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
inference(cnf,[status(esa)],[r3]) ).
cnf(l115,plain,
( ~ r3
| is_a_theorem(implies(or(sK43,not(sK42)),or(not(sK42),sK43))) ),
inference(instantiation,[status(thm)],[49]) ).
fof(principia_r3,plain,
r3,
file('Axioms/LCL006+4.ax',principia_r3) ).
cnf(66,plain,
r3,
inference(cnf,[status(esa)],[principia_r3]) ).
cnf(l127,plain,
r3,
inference(instantiation,[status(thm)],[66]) ).
fof(r4,plain,
( r4
<=> ! [P,Q,R] : is_a_theorem(implies(or(P,or(Q,R)),or(Q,or(P,R)))) ),
file('Axioms/LCL006+0.ax',r4) ).
cnf(51,plain,
( ~ r4
| is_a_theorem(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) ),
inference(cnf,[status(esa)],[r4]) ).
cnf(l86,plain,
( ~ r4
| is_a_theorem(implies(or(not(not(sK42)),or(not(sK42),sK43)),or(not(sK42),or(not(not(sK42)),sK43)))) ),
inference(instantiation,[status(thm)],[51]) ).
fof(principia_r4,plain,
r4,
file('Axioms/LCL006+4.ax',principia_r4) ).
cnf(67,plain,
r4,
inference(cnf,[status(esa)],[principia_r4]) ).
cnf(l141,plain,
r4,
inference(instantiation,[status(thm)],[67]) ).
cnf(l65,plain,
( ~ op_implies_or
| implies(not(sK42),or(sK43,not(sK42))) = or(not(not(sK42)),or(sK43,not(sK42))) ),
inference(instantiation,[status(thm)],[58]) ).
cnf(l79,plain,
op_implies_or,
inference(instantiation,[status(thm)],[60]) ).
fof(r2,plain,
( r2
<=> ! [P,Q] : is_a_theorem(implies(Q,or(P,Q))) ),
file('Axioms/LCL006+0.ax',r2) ).
cnf(47,plain,
( ~ r2
| is_a_theorem(implies(X0,or(X1,X0))) ),
inference(cnf,[status(esa)],[r2]) ).
cnf(l111,plain,
( ~ r2
| is_a_theorem(implies(not(sK42),or(sK43,not(sK42)))) ),
inference(instantiation,[status(thm)],[47]) ).
fof(principia_r2,plain,
r2,
file('Axioms/LCL006+4.ax',principia_r2) ).
cnf(65,plain,
r2,
inference(cnf,[status(esa)],[principia_r2]) ).
cnf(l120,plain,
r2,
inference(instantiation,[status(thm)],[65]) ).
cnf(final,plain,
$false,
inference(ground_refutation,[status(thm)],[l0,l1,l17,l4,l6,l144,l54,l146,l80,l126,l129,l81,l18,l55,l115,l127,l86,l141,l65,l79,l111,l120]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL497+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.03 % Command : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n027.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sat Sep 5 12:12:28 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 % launching worker at depth: 1
% 0.09/0.36 % launching worker at depth: 3
% 0.09/0.36 % launching worker at depth: 4
% 0.09/0.36 % launching worker at depth: 5
% 0.09/0.36 % launching worker at depth: 6
% 0.09/0.36 % launching worker at depth: 2
% 0.09/0.36 % launching worker at depth: 7
% 0.09/0.36 % launching worker at depth: 8
% 0.09/0.36 % launching worker at depth: 9
% 0.09/0.36 % launching worker at depth: 10
% 0.09/0.37 % launching worker at depth: 11
% 0.13/0.42 % launching worker at depth: 12
% 5.71/1.11 % launching worker at depth: 13
% 144.81/18.65 % SZS status Theorem for theBenchmark
% 144.81/18.65 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------