%------------------------------------------------------------------------------
% File : hopCoP---0.1
% Problem : LCL540+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 : n001.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:59 PM UTC 2026
% Result : Theorem 0.95s 0.56s
% Output : CNFRefutation 0.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of formulae : 26 ( 12 unt; 0 def)
% Number of atoms : 50 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 40 ( 16 ~; 17 |; 2 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 5 ( 4 usr; 4 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(s1_0_adjunction,plain,
adjunction,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s1_0_adjunction) ).
fof(s1_0_adjunction_negated,plain,
~ adjunction,
inference(negate_conjecture,[status(cth)],[s1_0_adjunction]) ).
cnf(146,plain,
~ adjunction,
inference(cnf,[status(esa)],[s1_0_adjunction_negated]) ).
cnf(l0,plain,
~ adjunction,
inference(instantiation,[status(thm)],[146]) ).
fof(adjunction,plain,
( adjunction
<=> ! [X,Y] :
( ( is_a_theorem(X)
& is_a_theorem(Y) )
=> is_a_theorem(and(X,Y)) ) ),
file('Axioms/LCL007+0.ax',adjunction) ).
cnf(86,plain,
( adjunction
| is_a_theorem(sK59) ),
inference(cnf,[status(esa)],[adjunction]) ).
cnf(l1,plain,
( adjunction
| is_a_theorem(sK59) ),
inference(instantiation,[status(thm)],[86]) ).
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(sK59)
| ~ is_a_theorem(implies(sK59,implies(sK60,and(sK59,sK60))))
| is_a_theorem(implies(sK60,and(sK59,sK60))) ),
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(l4,plain,
modus_ponens,
inference(instantiation,[status(thm)],[63]) ).
cnf(l5,plain,
( ~ modus_ponens
| ~ is_a_theorem(sK60)
| ~ is_a_theorem(implies(sK60,and(sK59,sK60)))
| is_a_theorem(and(sK59,sK60)) ),
inference(instantiation,[status(thm)],[0]) ).
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(l3,plain,
( ~ and_3
| is_a_theorem(implies(sK59,implies(sK60,and(sK59,sK60)))) ),
inference(instantiation,[status(thm)],[19]) ).
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(l8,plain,
and_3,
inference(instantiation,[status(thm)],[70]) ).
cnf(l14,plain,
modus_ponens,
inference(instantiation,[status(thm)],[63]) ).
cnf(88,plain,
( ~ is_a_theorem(and(sK59,sK60))
| adjunction ),
inference(cnf,[status(esa)],[adjunction]) ).
cnf(l7,plain,
( ~ is_a_theorem(and(sK59,sK60))
| adjunction ),
inference(instantiation,[status(thm)],[88]) ).
cnf(87,plain,
( adjunction
| is_a_theorem(sK60) ),
inference(cnf,[status(esa)],[adjunction]) ).
cnf(l32,plain,
( adjunction
| is_a_theorem(sK60) ),
inference(instantiation,[status(thm)],[87]) ).
cnf(final,plain,
$false,
inference(ground_refutation,[status(thm)],[l0,l1,l2,l4,l5,l3,l8,l14,l7,l32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL540+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.11/0.36 % Computer : n001.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Fri Sep 4 16:08:30 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 % launching worker at depth: 1
% 0.11/0.37 % launching worker at depth: 5
% 0.11/0.37 % launching worker at depth: 3
% 0.11/0.37 % launching worker at depth: 4
% 0.11/0.37 % launching worker at depth: 8
% 0.11/0.37 % launching worker at depth: 6
% 0.11/0.37 % launching worker at depth: 7
% 0.11/0.37 % launching worker at depth: 2
% 0.11/0.37 % launching worker at depth: 9
% 0.11/0.37 % launching worker at depth: 10
% 0.15/0.39 % launching worker at depth: 11
% 0.95/0.56 % SZS status Theorem for theBenchmark
% 0.95/0.56 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------