%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : LCL540+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/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 : Sun Sep 27 07:54:49 AM UTC 2026
% Result : Theorem 15.43s 4.81s
% Output : CNFRefutation 15.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 25 ( 13 unt; 0 def)
% Number of atoms : 45 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 36 ( 16 ~; 13 |; 2 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 4 ( 1 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 : 18 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(modus_ponens,axiom,
( 'modus$uponens'
<=> ! [X0,X1] :
( ( 'is$ua$utheorem'(implies(X0,X1))
& 'is$ua$utheorem'(X0) )
=> 'is$ua$utheorem'(X1) ) ) ).
fof(and_3,axiom,
( 'and$u3'
<=> ! [X0,X1] : 'is$ua$utheorem'(implies(X0,implies(X1,and(X0,X1)))) ) ).
fof(hilbert_modus_ponens,axiom,
'modus$uponens' ).
fof(hilbert_and_3,axiom,
'and$u3' ).
fof(adjunction,axiom,
( adjunction
<=> ! [X0,X1] :
( ( 'is$ua$utheorem'(X1)
& 'is$ua$utheorem'(X0) )
=> 'is$ua$utheorem'(and(X0,X1)) ) ) ).
fof(s1_0_adjunction,conjecture,
adjunction ).
fof(negated_conjecture,negated_conjecture,
~ adjunction,
inference(negate_conjecture,[status(cth)],[s1_0_adjunction]) ).
cnf(c6,plain,
( 'is$ua$utheorem'(X1)
| ~ 'is$ua$utheorem'(implies(X0,X1))
| ~ 'is$ua$utheorem'(X0)
| ~ 'modus$uponens' ),
inference(clausification,[status(esa)],[modus_ponens]) ).
cnf(c25,plain,
( 'is$ua$utheorem'(implies(X0,implies(X1,and(X0,X1))))
| ~ 'and$u3' ),
inference(clausification,[status(esa)],[and_3]) ).
cnf(c69,plain,
'modus$uponens',
inference(clausification,[status(esa)],[hilbert_modus_ponens]) ).
cnf(c76,plain,
'and$u3',
inference(clausification,[status(esa)],[hilbert_and_3]) ).
cnf(c92,plain,
( 'is$ua$utheorem'(sK128)
| adjunction ),
inference(clausification,[status(esa)],[adjunction]) ).
cnf(c93,plain,
( 'is$ua$utheorem'(sK129)
| adjunction ),
inference(clausification,[status(esa)],[adjunction]) ).
cnf(c94,plain,
( ~ 'is$ua$utheorem'(and(sK128,sK129))
| adjunction ),
inference(clausification,[status(esa)],[adjunction]) ).
cnf(c146,plain,
~ adjunction,
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
~ 'is$ua$utheorem'(and(sK128,sK129)),
inference(resolution,[status(thm)],[c146,c94]) ).
cnf(d1,plain,
( ~ 'is$ua$utheorem'(implies(X1,X0))
| ~ 'is$ua$utheorem'(X1)
| 'is$ua$utheorem'(X0) ),
inference(resolution,[status(thm)],[c69,c6]) ).
cnf(d2,plain,
'is$ua$utheorem'(implies(X0,implies(X1,and(X0,X1)))),
inference(resolution,[status(thm)],[c76,c25]) ).
cnf(d3,plain,
( 'is$ua$utheorem'(implies(X1,and(X0,X1)))
| ~ 'is$ua$utheorem'(X0) ),
inference(resolution,[status(thm)],[d1,d2]) ).
cnf(d4,plain,
( 'is$ua$utheorem'(and(X0,X1))
| ~ 'is$ua$utheorem'(X1)
| ~ 'is$ua$utheorem'(X0) ),
inference(resolution,[status(thm)],[d3,d1]) ).
cnf(d5,plain,
( ~ 'is$ua$utheorem'(sK128)
| ~ 'is$ua$utheorem'(sK129) ),
inference(resolution,[status(thm)],[d4,d0]) ).
cnf(d6,plain,
'is$ua$utheorem'(sK128),
inference(resolution,[status(thm)],[c146,c92]) ).
cnf(d7,plain,
~ 'is$ua$utheorem'(sK129),
inference(resolution,[status(thm)],[d6,d5]) ).
cnf(d8,plain,
'is$ua$utheorem'(sK129),
inference(resolution,[status(thm)],[c146,c93]) ).
cnf(d9,plain,
$false,
inference(resolution,[status(thm)],[d8,d7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL540+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.06 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.42 % Computer : n004.cluster.edu
% 0.16/0.42 % Model : x86_64 x86_64
% 0.16/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.42 % Memory : 8046.5625MB
% 0.16/0.42 % OS : Linux 6.8.0-71-generic
% 0.16/0.42 % CPULimit : 300
% 0.16/0.42 % WCLimit : 300
% 0.16/0.42 % DateTime : Fri Sep 25 22:43:07 UTC 2026
% 0.16/0.43 % CPUTime :
% 0.16/0.43 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 15.43/4.81 % SZS status Theorem for theBenchmark.p
% 15.43/4.81 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------