%------------------------------------------------------------------------------
% File : hopCoP---0.1
% Problem : LCL456+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 : 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 : Mon Sep 7 12:13:52 PM UTC 2026
% Result : Theorem 0.13s 0.40s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 11
% Syntax : Number of formulae : 39 ( 18 unt; 0 def)
% Number of atoms : 68 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 53 ( 24 ~; 21 |; 1 &)
% ( 6 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 8 ( 7 usr; 7 prp; 0-1 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 24 ( 3 sgn 13 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(principia_r3,plain,
r3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',principia_r3) ).
fof(principia_r3_negated,plain,
~ r3,
inference(negate_conjecture,[status(cth)],[principia_r3]) ).
cnf(81,plain,
~ r3,
inference(cnf,[status(esa)],[principia_r3_negated]) ).
cnf(l0,plain,
~ r3,
inference(instantiation,[status(thm)],[81]) ).
fof(r3,plain,
( r3
<=> ! [P,Q] : is_a_theorem(implies(or(P,Q),or(Q,P))) ),
file('Axioms/LCL006+0.ax',r3) ).
cnf(50,plain,
( ~ is_a_theorem(implies(or(sK48,sK49),or(sK49,sK48)))
| r3 ),
inference(cnf,[status(esa)],[r3]) ).
cnf(l1,plain,
( ~ is_a_theorem(implies(or(sK48,sK49),or(sK49,sK48)))
| r3 ),
inference(instantiation,[status(thm)],[50]) ).
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(l2,plain,
( ~ modus_ponens
| ~ is_a_theorem(implies(sK49,or(sK49,sK48)))
| ~ is_a_theorem(implies(implies(sK49,or(sK49,sK48)),implies(or(sK48,sK49),or(sK49,sK48))))
| is_a_theorem(implies(or(sK48,sK49),or(sK49,sK48))) ),
inference(instantiation,[status(thm)],[0]) ).
fof(hilbert_modus_ponens,plain,
modus_ponens,
file('Axioms/LCL006+2.ax',hilbert_modus_ponens) ).
cnf(63,plain,
modus_ponens,
inference(cnf,[status(esa)],[hilbert_modus_ponens]) ).
cnf(l3,plain,
modus_ponens,
inference(instantiation,[status(thm)],[63]) ).
cnf(l4,plain,
( ~ modus_ponens
| ~ is_a_theorem(implies(sK48,or(sK49,sK48)))
| ~ is_a_theorem(implies(implies(sK48,or(sK49,sK48)),implies(implies(sK49,or(sK49,sK48)),implies(or(sK48,sK49),or(sK49,sK48)))))
| is_a_theorem(implies(implies(sK49,or(sK49,sK48)),implies(or(sK48,sK49),or(sK49,sK48)))) ),
inference(instantiation,[status(thm)],[0]) ).
cnf(l6,plain,
modus_ponens,
inference(instantiation,[status(thm)],[63]) ).
fof(or_3,plain,
( or_3
<=> ! [X,Y,Z] : is_a_theorem(implies(implies(X,Z),implies(implies(Y,Z),implies(or(X,Y),Z)))) ),
file('Axioms/LCL006+0.ax',or_3) ).
cnf(25,plain,
( ~ or_3
| is_a_theorem(implies(implies(X0,X1),implies(implies(X2,X1),implies(or(X0,X2),X1)))) ),
inference(cnf,[status(esa)],[or_3]) ).
cnf(l20,plain,
( ~ or_3
| is_a_theorem(implies(implies(sK48,or(sK49,sK48)),implies(implies(sK49,or(sK49,sK48)),implies(or(sK48,sK49),or(sK49,sK48))))) ),
inference(instantiation,[status(thm)],[25]) ).
fof(hilbert_or_3,plain,
or_3,
file('Axioms/LCL006+2.ax',hilbert_or_3) ).
cnf(73,plain,
or_3,
inference(cnf,[status(esa)],[hilbert_or_3]) ).
cnf(l22,plain,
or_3,
inference(instantiation,[status(thm)],[73]) ).
fof(or_1,plain,
( or_1
<=> ! [X,Y] : is_a_theorem(implies(X,or(X,Y))) ),
file('Axioms/LCL006+0.ax',or_1) ).
cnf(21,plain,
( ~ or_1
| is_a_theorem(implies(X0,or(X0,X1))) ),
inference(cnf,[status(esa)],[or_1]) ).
cnf(l7,plain,
( ~ or_1
| is_a_theorem(implies(sK49,or(sK49,sK48))) ),
inference(instantiation,[status(thm)],[21]) ).
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(l21,plain,
( ~ r2
| is_a_theorem(implies(sK48,or(sK49,sK48))) ),
inference(instantiation,[status(thm)],[47]) ).
cnf(48,plain,
( ~ is_a_theorem(implies(sK47,or(sK46,sK47)))
| r2 ),
inference(cnf,[status(esa)],[r2]) ).
cnf(l24,plain,
( ~ is_a_theorem(implies(sK47,or(sK46,sK47)))
| r2 ),
inference(instantiation,[status(thm)],[48]) ).
fof(or_2,plain,
( or_2
<=> ! [X,Y] : is_a_theorem(implies(Y,or(X,Y))) ),
file('Axioms/LCL006+0.ax',or_2) ).
cnf(23,plain,
( ~ or_2
| is_a_theorem(implies(X0,or(X1,X0))) ),
inference(cnf,[status(esa)],[or_2]) ).
cnf(l26,plain,
( ~ or_2
| is_a_theorem(implies(sK47,or(sK46,sK47))) ),
inference(instantiation,[status(thm)],[23]) ).
fof(hilbert_or_1,plain,
or_1,
file('Axioms/LCL006+2.ax',hilbert_or_1) ).
cnf(71,plain,
or_1,
inference(cnf,[status(esa)],[hilbert_or_1]) ).
cnf(l8,plain,
or_1,
inference(instantiation,[status(thm)],[71]) ).
fof(hilbert_or_2,plain,
or_2,
file('Axioms/LCL006+2.ax',hilbert_or_2) ).
cnf(72,plain,
or_2,
inference(cnf,[status(esa)],[hilbert_or_2]) ).
cnf(l31,plain,
or_2,
inference(instantiation,[status(thm)],[72]) ).
cnf(final,plain,
$false,
inference(ground_refutation,[status(thm)],[l0,l1,l2,l3,l4,l6,l20,l22,l7,l21,l24,l26,l8,l31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL456+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.10/0.35 % Computer : n004.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Fri Sep 4 18:42:44 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.13/0.36 % launching worker at depth: 1
% 0.13/0.36 % launching worker at depth: 2
% 0.13/0.36 % launching worker at depth: 7
% 0.13/0.36 % launching worker at depth: 3
% 0.13/0.36 % launching worker at depth: 5
% 0.13/0.36 % launching worker at depth: 6
% 0.13/0.36 % launching worker at depth: 8
% 0.13/0.36 % launching worker at depth: 4
% 0.13/0.36 % launching worker at depth: 9
% 0.13/0.36 % launching worker at depth: 10
% 0.13/0.37 % launching worker at depth: 11
% 0.13/0.40 % SZS status Theorem for theBenchmark
% 0.13/0.40 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------