%------------------------------------------------------------------------------
% File : hopCoP---0.1
% Problem : LCL459+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 : 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:52 PM UTC 2026
% Result : Theorem 0.12s 0.36s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of formulae : 26 ( 14 unt; 0 def)
% Number of atoms : 44 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 33 ( 15 ~; 12 |; 1 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 6 ( 5 usr; 5 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 13 ( 0 sgn 7 !; 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(81,plain,
~ kn1,
inference(cnf,[status(esa)],[rosser_kn1_negated]) ).
cnf(l0,plain,
~ kn1,
inference(instantiation,[status(thm)],[81]) ).
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(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(sK33,implies(sK33,and(sK33,sK33))))
| ~ is_a_theorem(implies(implies(sK33,implies(sK33,and(sK33,sK33))),implies(sK33,and(sK33,sK33))))
| is_a_theorem(implies(sK33,and(sK33,sK33))) ),
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]) ).
fof(implies_2,plain,
( implies_2
<=> ! [X,Y] : is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y))) ),
file('Axioms/LCL006+0.ax',implies_2) ).
cnf(11,plain,
( ~ implies_2
| is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))) ),
inference(cnf,[status(esa)],[implies_2]) ).
cnf(l5,plain,
( ~ implies_2
| is_a_theorem(implies(implies(sK33,implies(sK33,and(sK33,sK33))),implies(sK33,and(sK33,sK33)))) ),
inference(instantiation,[status(thm)],[11]) ).
fof(and_3,plain,
( and_3
<=> ! [X,Y] : is_a_theorem(implies(X,implies(Y,and(X,Y)))) ),
file('Axioms/LCL006+0.ax',and_3) ).
cnf(19,plain,
( ~ and_3
| is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
inference(cnf,[status(esa)],[and_3]) ).
cnf(l4,plain,
( ~ and_3
| is_a_theorem(implies(sK33,implies(sK33,and(sK33,sK33)))) ),
inference(instantiation,[status(thm)],[19]) ).
fof(hilbert_implies_2,plain,
implies_2,
file('Axioms/LCL006+2.ax',hilbert_implies_2) ).
cnf(66,plain,
implies_2,
inference(cnf,[status(esa)],[hilbert_implies_2]) ).
cnf(l7,plain,
implies_2,
inference(instantiation,[status(thm)],[66]) ).
fof(hilbert_and_3,plain,
and_3,
file('Axioms/LCL006+2.ax',hilbert_and_3) ).
cnf(70,plain,
and_3,
inference(cnf,[status(esa)],[hilbert_and_3]) ).
cnf(l6,plain,
and_3,
inference(instantiation,[status(thm)],[70]) ).
cnf(final,plain,
$false,
inference(ground_refutation,[status(thm)],[l0,l1,l2,l3,l5,l4,l7,l6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL459+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.03 % Command : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n027.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Fri Sep 4 14:32:42 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 % launching worker at depth: 1
% 0.09/0.35 % launching worker at depth: 7
% 0.09/0.35 % launching worker at depth: 3
% 0.09/0.35 % launching worker at depth: 4
% 0.09/0.35 % launching worker at depth: 5
% 0.09/0.35 % launching worker at depth: 8
% 0.09/0.35 % launching worker at depth: 6
% 0.09/0.35 % launching worker at depth: 2
% 0.12/0.35 % launching worker at depth: 9
% 0.12/0.36 % launching worker at depth: 10
% 0.12/0.36 % SZS status Theorem for theBenchmark
% 0.12/0.36 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------