%------------------------------------------------------------------------------
% File : hopCoP---0.1
% Problem : LCL490+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n003.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 0.94s 0.58s
% Output : CNFRefutation 0.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 13
% Syntax : Number of formulae : 47 ( 22 unt; 0 def)
% Number of atoms : 80 ( 4 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 60 ( 27 ~; 24 |; 1 &)
% ( 6 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 10 ( 8 usr; 8 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 28 ( 2 sgn 15 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(hilbert_or_1,plain,
or_1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hilbert_or_1) ).
fof(hilbert_or_1_negated,plain,
~ or_1,
inference(negate_conjecture,[status(cth)],[hilbert_or_1]) ).
cnf(73,plain,
~ or_1,
inference(cnf,[status(esa)],[hilbert_or_1_negated]) ).
cnf(l0,plain,
~ or_1,
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(22,plain,
( ~ is_a_theorem(implies(sK20,or(sK20,sK21)))
| or_1 ),
inference(cnf,[status(esa)],[or_1]) ).
cnf(l1,plain,
( ~ is_a_theorem(implies(sK20,or(sK20,sK21)))
| or_1 ),
inference(instantiation,[status(thm)],[22]) ).
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(l77,plain,
( ~ op_implies_or
| implies(sK20,or(sK20,sK21)) = or(not(sK20),or(sK20,sK21)) ),
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(l7,plain,
( ~ modus_ponens
| ~ is_a_theorem(or(not(sK20),or(sK21,sK20)))
| ~ is_a_theorem(implies(or(not(sK20),or(sK21,sK20)),or(not(sK20),or(sK20,sK21))))
| is_a_theorem(or(not(sK20),or(sK20,sK21))) ),
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(l78,plain,
op_implies_or,
inference(instantiation,[status(thm)],[60]) ).
cnf(l13,plain,
( ~ modus_ponens
| ~ is_a_theorem(implies(or(sK21,sK20),or(sK20,sK21)))
| ~ is_a_theorem(implies(implies(or(sK21,sK20),or(sK20,sK21)),implies(or(not(sK20),or(sK21,sK20)),or(not(sK20),or(sK20,sK21)))))
| is_a_theorem(implies(or(not(sK20),or(sK21,sK20)),or(not(sK20),or(sK20,sK21)))) ),
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(l11,plain,
modus_ponens,
inference(instantiation,[status(thm)],[63]) ).
cnf(l21,plain,
modus_ponens,
inference(instantiation,[status(thm)],[63]) ).
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(l87,plain,
( ~ r5
| is_a_theorem(implies(implies(or(sK21,sK20),or(sK20,sK21)),implies(or(not(sK20),or(sK21,sK20)),or(not(sK20),or(sK20,sK21))))) ),
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(l88,plain,
r5,
inference(instantiation,[status(thm)],[68]) ).
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(l72,plain,
( ~ r3
| is_a_theorem(implies(or(sK21,sK20),or(sK20,sK21))) ),
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(l82,plain,
r3,
inference(instantiation,[status(thm)],[66]) ).
cnf(l15,plain,
( ~ op_implies_or
| implies(sK20,or(sK21,sK20)) = or(not(sK20),or(sK21,sK20)) ),
inference(instantiation,[status(thm)],[58]) ).
cnf(l20,plain,
op_implies_or,
inference(instantiation,[status(thm)],[60]) ).
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(l24,plain,
( ~ or_2
| is_a_theorem(implies(sK20,or(sK21,sK20))) ),
inference(instantiation,[status(thm)],[23]) ).
cnf(24,plain,
( ~ is_a_theorem(implies(sK23,or(sK22,sK23)))
| or_2 ),
inference(cnf,[status(esa)],[or_2]) ).
cnf(l27,plain,
( ~ is_a_theorem(implies(sK23,or(sK22,sK23)))
| or_2 ),
inference(instantiation,[status(thm)],[24]) ).
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(l28,plain,
( ~ r2
| is_a_theorem(implies(sK23,or(sK22,sK23))) ),
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(l33,plain,
r2,
inference(instantiation,[status(thm)],[65]) ).
cnf(final,plain,
$false,
inference(ground_refutation,[status(thm)],[l0,l1,l77,l7,l78,l13,l11,l21,l87,l88,l72,l82,l15,l20,l24,l27,l28,l33]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL490+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n003.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.12/0.35 % CPULimit : 300
% 0.12/0.36 % WCLimit : 300
% 0.12/0.36 % DateTime : Sat Sep 5 13:38:50 UTC 2026
% 0.12/0.36 % CPUTime :
% 0.12/0.36 % launching worker at depth: 1
% 0.12/0.36 % launching worker at depth: 4
% 0.12/0.36 % launching worker at depth: 7
% 0.12/0.36 % launching worker at depth: 8
% 0.12/0.36 % launching worker at depth: 5
% 0.12/0.36 % launching worker at depth: 2
% 0.12/0.36 % launching worker at depth: 6
% 0.12/0.36 % launching worker at depth: 3
% 0.12/0.36 % launching worker at depth: 9
% 0.12/0.36 % launching worker at depth: 10
% 0.12/0.37 % launching worker at depth: 11
% 0.12/0.41 % launching worker at depth: 12
% 0.94/0.58 % SZS status Theorem for theBenchmark
% 0.94/0.58 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------