%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : LCL454+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n018.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:40 AM UTC 2026
% Result : Theorem 15.03s 7.33s
% Output : CNFRefutation 15.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of formulae : 32 ( 17 unt; 0 def)
% Number of atoms : 53 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 39 ( 18 ~; 14 |; 1 &)
% ( 5 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 7 ( 6 usr; 6 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 37 ( 2 sgn 10 !; 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(implies_1,axiom,
( 'implies$u1'
<=> ! [X0,X1] : 'is$ua$utheorem'(implies(X0,implies(X1,X0))) ) ).
fof(implies_2,axiom,
( 'implies$u2'
<=> ! [X0,X1] : 'is$ua$utheorem'(implies(implies(X0,implies(X0,X1)),implies(X0,X1))) ) ).
fof(or_3,axiom,
( 'or$u3'
<=> ! [X0,X1,X2] : 'is$ua$utheorem'(implies(implies(X0,X2),implies(implies(X1,X2),implies(or(X0,X1),X2)))) ) ).
fof(r1,axiom,
( r1
<=> ! [X0] : 'is$ua$utheorem'(implies(or(X0,X0),X0)) ) ).
fof(hilbert_modus_ponens,axiom,
'modus$uponens' ).
fof(hilbert_implies_1,axiom,
'implies$u1' ).
fof(hilbert_implies_2,axiom,
'implies$u2' ).
fof(hilbert_or_3,axiom,
'or$u3' ).
fof(principia_r1,conjecture,
r1 ).
fof(negated_conjecture,negated_conjecture,
~ r1,
inference(negate_conjecture,[status(cth)],[principia_r1]) ).
cnf(c3,plain,
( 'is$ua$utheorem'(X1)
| ~ 'is$ua$utheorem'(implies(X0,X1))
| ~ 'is$ua$utheorem'(X0)
| ~ 'modus$uponens' ),
inference(clausification,[status(esa)],[modus_ponens]) ).
cnf(c12,plain,
( 'is$ua$utheorem'(implies(X0,implies(X1,X0)))
| ~ 'implies$u1' ),
inference(clausification,[status(esa)],[implies_1]) ).
cnf(c14,plain,
( 'is$ua$utheorem'(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))
| ~ 'implies$u2' ),
inference(clausification,[status(esa)],[implies_2]) ).
cnf(c28,plain,
( 'is$ua$utheorem'(implies(implies(X0,X1),implies(implies(X2,X1),implies(or(X0,X2),X1))))
| ~ 'or$u3' ),
inference(clausification,[status(esa)],[or_3]) ).
cnf(c49,plain,
( ~ 'is$ua$utheorem'(implies(or(sK89,sK89),sK89))
| r1 ),
inference(clausification,[status(esa)],[r1]) ).
cnf(c66,plain,
'modus$uponens',
inference(clausification,[status(esa)],[hilbert_modus_ponens]) ).
cnf(c68,plain,
'implies$u1',
inference(clausification,[status(esa)],[hilbert_implies_1]) ).
cnf(c69,plain,
'implies$u2',
inference(clausification,[status(esa)],[hilbert_implies_2]) ).
cnf(c76,plain,
'or$u3',
inference(clausification,[status(esa)],[hilbert_or_3]) ).
cnf(c81,plain,
~ r1,
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
~ 'is$ua$utheorem'(implies(or(sK89,sK89),sK89)),
inference(resolution,[status(thm)],[c81,c49]) ).
cnf(d1,plain,
( ~ 'is$ua$utheorem'(implies(X1,X0))
| ~ 'is$ua$utheorem'(X1)
| 'is$ua$utheorem'(X0) ),
inference(resolution,[status(thm)],[c66,c3]) ).
cnf(d2,plain,
'is$ua$utheorem'(implies(implies(X0,X1),implies(implies(X2,X1),implies(or(X0,X2),X1)))),
inference(resolution,[status(thm)],[c76,c28]) ).
cnf(d3,plain,
( 'is$ua$utheorem'(implies(implies(X2,X1),implies(or(X0,X2),X1)))
| ~ 'is$ua$utheorem'(implies(X0,X1)) ),
inference(resolution,[status(thm)],[d1,d2]) ).
cnf(d4,plain,
( 'is$ua$utheorem'(implies(or(X0,X2),X1))
| ~ 'is$ua$utheorem'(implies(X2,X1))
| ~ 'is$ua$utheorem'(implies(X0,X1)) ),
inference(resolution,[status(thm)],[d3,d1]) ).
cnf(d5,plain,
( ~ 'is$ua$utheorem'(implies(sK89,sK89))
| ~ 'is$ua$utheorem'(implies(sK89,sK89)) ),
inference(resolution,[status(thm)],[d4,d0]) ).
cnf(d6,plain,
'is$ua$utheorem'(implies(X0,implies(X1,X0))),
inference(resolution,[status(thm)],[c68,c12]) ).
cnf(d7,plain,
'is$ua$utheorem'(implies(implies(X0,implies(X0,X1)),implies(X0,X1))),
inference(resolution,[status(thm)],[c69,c14]) ).
cnf(d8,plain,
( 'is$ua$utheorem'(implies(X0,X1))
| ~ 'is$ua$utheorem'(implies(X0,implies(X0,X1))) ),
inference(resolution,[status(thm)],[d1,d7]) ).
cnf(d9,plain,
'is$ua$utheorem'(implies(X0,X0)),
inference(resolution,[status(thm)],[d8,d6]) ).
cnf(d10,plain,
$false,
inference(resolution,[status(thm)],[d9,d5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL454+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.03 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/5.38 % Computer : n018.cluster.edu
% 0.10/5.38 % Model : x86_64 x86_64
% 0.10/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.38 % Memory : 8046.5625MB
% 0.10/5.38 % OS : Linux 6.8.0-71-generic
% 0.10/5.38 % CPULimit : 300
% 0.10/5.38 % WCLimit : 300
% 0.10/5.38 % DateTime : Fri Sep 25 22:37:41 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/5.38 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 15.03/7.33 % SZS status Theorem for theBenchmark.p
% 15.03/7.33 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------