%------------------------------------------------------------------------------
% File : hopCoP---0.1
% Problem : LCL499+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 : n005.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 140.36s 18.04s
% Output : CNFRefutation 140.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 14
% Syntax : Number of formulae : 48 ( 25 unt; 0 def)
% Number of atoms : 77 ( 11 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 52 ( 23 ~; 20 |; 1 &)
% ( 4 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 10 ( 8 usr; 8 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(rosser_kn1,plain,
kn1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_kn1) ).
fof(rosser_kn1_negated,plain,
~ kn1,
inference(negate_conjecture,[status(cth)],[rosser_kn1]) ).
cnf(73,plain,
~ kn1,
inference(cnf,[status(esa)],[rosser_kn1_negated]) ).
cnf(l0,plain,
~ kn1,
inference(instantiation,[status(thm)],[73]) ).
fof(kn1,plain,
( kn1
<=> ! [P] : is_a_theorem(implies(P,and(P,P))) ),
file('Axioms/LCL006+0.ax',kn1) ).
cnf(34,plain,
( ~ is_a_theorem(implies(sK33,and(sK33,sK33)))
| kn1 ),
inference(cnf,[status(esa)],[kn1]) ).
cnf(l1,plain,
( ~ is_a_theorem(implies(sK33,and(sK33,sK33)))
| kn1 ),
inference(instantiation,[status(thm)],[34]) ).
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(l100,plain,
( ~ op_implies_or
| implies(sK33,and(sK33,sK33)) = or(not(sK33),and(sK33,sK33)) ),
inference(instantiation,[status(thm)],[58]) ).
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(l101,plain,
op_implies_or,
inference(instantiation,[status(thm)],[60]) ).
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(not(and(not(not(or(not(sK33),not(sK33)))),not(not(sK33)))))
| ~ is_a_theorem(implies(not(and(not(not(or(not(sK33),not(sK33)))),not(not(sK33)))),or(not(sK33),not(or(not(sK33),not(sK33))))))
| is_a_theorem(or(not(sK33),not(or(not(sK33),not(sK33))))) ),
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]) ).
fof(op_and,plain,
( op_and
=> ! [X,Y] : and(X,Y) = not(or(not(X),not(Y))) ),
file('Axioms/LCL006+1.ax',op_and) ).
cnf(56,plain,
( ~ op_and
| and(X0,X1) = not(or(not(X0),not(X1))) ),
inference(cnf,[status(esa)],[op_and]) ).
cnf(l109,plain,
( ~ op_and
| and(sK33,sK33) = not(or(not(sK33),not(sK33))) ),
inference(instantiation,[status(thm)],[56]) ).
fof(principia_op_and,plain,
op_and,
file('Axioms/LCL006+4.ax',principia_op_and) ).
cnf(61,plain,
op_and,
inference(cnf,[status(esa)],[principia_op_and]) ).
cnf(l112,plain,
op_and,
inference(instantiation,[status(thm)],[61]) ).
fof(op_or,plain,
( op_or
=> ! [X,Y] : or(X,Y) = not(and(not(X),not(Y))) ),
file('Axioms/LCL006+1.ax',op_or) ).
cnf(55,plain,
( ~ op_or
| or(X0,X1) = not(and(not(X0),not(X1))) ),
inference(cnf,[status(esa)],[op_or]) ).
cnf(l163,plain,
( ~ op_or
| or(not(or(not(sK33),not(sK33))),not(sK33)) = not(and(not(not(or(not(sK33),not(sK33)))),not(not(sK33)))) ),
inference(instantiation,[status(thm)],[55]) ).
fof(rosser_op_or,plain,
op_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rosser_op_or) ).
cnf(70,plain,
op_or,
inference(cnf,[status(esa)],[rosser_op_or]) ).
cnf(l166,plain,
op_or,
inference(instantiation,[status(thm)],[70]) ).
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(l135,plain,
( ~ r3
| is_a_theorem(implies(or(not(or(not(sK33),not(sK33))),not(sK33)),or(not(sK33),not(or(not(sK33),not(sK33)))))) ),
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(l136,plain,
r3,
inference(instantiation,[status(thm)],[66]) ).
fof(r1,plain,
( r1
<=> ! [P] : is_a_theorem(implies(or(P,P),P)) ),
file('Axioms/LCL006+0.ax',r1) ).
cnf(45,plain,
( ~ r1
| is_a_theorem(implies(or(X0,X0),X0)) ),
inference(cnf,[status(esa)],[r1]) ).
cnf(l111,plain,
( ~ r1
| is_a_theorem(implies(or(not(sK33),not(sK33)),not(sK33))) ),
inference(instantiation,[status(thm)],[45]) ).
fof(principia_r1,plain,
r1,
file('Axioms/LCL006+4.ax',principia_r1) ).
cnf(64,plain,
r1,
inference(cnf,[status(esa)],[principia_r1]) ).
cnf(l114,plain,
r1,
inference(instantiation,[status(thm)],[64]) ).
cnf(l121,plain,
( ~ op_or
| or(not(or(not(sK33),not(sK33))),not(sK33)) = not(and(not(not(or(not(sK33),not(sK33)))),not(not(sK33)))) ),
inference(instantiation,[status(thm)],[55]) ).
cnf(l208,plain,
op_or,
inference(instantiation,[status(thm)],[70]) ).
cnf(l95,plain,
( ~ op_implies_or
| implies(or(not(sK33),not(sK33)),not(sK33)) = or(not(or(not(sK33),not(sK33))),not(sK33)) ),
inference(instantiation,[status(thm)],[58]) ).
cnf(l96,plain,
op_implies_or,
inference(instantiation,[status(thm)],[60]) ).
cnf(final,plain,
$false,
inference(ground_refutation,[status(thm)],[l0,l1,l100,l101,l4,l6,l109,l112,l163,l166,l135,l136,l111,l114,l121,l208,l95,l96]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL499+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.07/0.34 % Computer : n005.cluster.edu
% 0.07/0.34 % Model : x86_64 x86_64
% 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34 % Memory : 8046.5625MB
% 0.07/0.34 % OS : Linux 6.8.0-71-generic
% 0.07/0.34 % CPULimit : 300
% 0.07/0.34 % WCLimit : 300
% 0.07/0.34 % DateTime : Sat Sep 5 02:53:35 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.07/0.35 % launching worker at depth: 1
% 0.07/0.35 % launching worker at depth: 7
% 0.07/0.35 % launching worker at depth: 3
% 0.07/0.35 % launching worker at depth: 4
% 0.07/0.35 % launching worker at depth: 5
% 0.07/0.35 % launching worker at depth: 6
% 0.07/0.35 % launching worker at depth: 2
% 0.07/0.35 % launching worker at depth: 8
% 0.12/0.35 % launching worker at depth: 9
% 0.12/0.35 % launching worker at depth: 10
% 0.12/0.36 % launching worker at depth: 11
% 0.12/0.41 % launching worker at depth: 12
% 2.74/0.72 % launching worker at depth: 13
% 140.36/18.04 % SZS status Theorem for theBenchmark
% 140.36/18.04 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------