%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : LCL490+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 : n008.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:44 AM UTC 2026
% Result : Theorem 35.05s 18.28s
% Output : CNFRefutation 35.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of formulae : 38 ( 23 unt; 0 def)
% Number of atoms : 58 ( 3 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 35 ( 15 ~; 12 |; 1 &)
% ( 5 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 9 ( 7 usr; 7 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 52 ( 4 sgn 13 !; 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(or_1,axiom,
( 'or$u1'
<=> ! [X0,X1] : 'is$ua$utheorem'(implies(X0,or(X0,X1))) ) ).
fof(r2,axiom,
( r2
<=> ! [X0,X1] : 'is$ua$utheorem'(implies(X1,or(X0,X1))) ) ).
fof(r3,axiom,
( r3
<=> ! [X0,X1] : 'is$ua$utheorem'(implies(or(X0,X1),or(X1,X0))) ) ).
fof(r5,axiom,
( r5
<=> ! [X0,X1,X2] : 'is$ua$utheorem'(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))) ) ).
fof(op_implies_or,axiom,
( 'op$uimplies$uor'
=> ! [X0,X1] : implies(X0,X1) = or(not(X0),X1) ) ).
fof(principia_op_implies_or,axiom,
'op$uimplies$uor' ).
fof(principia_modus_ponens,axiom,
'modus$uponens' ).
fof(principia_r2,axiom,
r2 ).
fof(principia_r3,axiom,
r3 ).
fof(principia_r5,axiom,
r5 ).
fof(hilbert_or_1,conjecture,
'or$u1' ).
fof(negated_conjecture,negated_conjecture,
~ 'or$u1',
inference(negate_conjecture,[status(cth)],[hilbert_or_1]) ).
cnf(c3,plain,
( 'is$ua$utheorem'(X1)
| ~ 'is$ua$utheorem'(X0)
| ~ 'is$ua$utheorem'(implies(X0,X1))
| ~ 'modus$uponens' ),
inference(clausification,[status(esa)],[modus_ponens]) ).
cnf(c25,plain,
( ~ 'is$ua$utheorem'(implies(sK40,or(sK40,sK41)))
| 'or$u1' ),
inference(clausification,[status(esa)],[or_1]) ).
cnf(c50,plain,
( 'is$ua$utheorem'(implies(X0,or(X1,X0)))
| ~ r2 ),
inference(clausification,[status(esa)],[r2]) ).
cnf(c52,plain,
( 'is$ua$utheorem'(implies(or(X0,X1),or(X1,X0)))
| ~ r3 ),
inference(clausification,[status(esa)],[r3]) ).
cnf(c56,plain,
( 'is$ua$utheorem'(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1))))
| ~ r5 ),
inference(clausification,[status(esa)],[r5]) ).
cnf(c61,plain,
( or(not(X0),X1) = implies(X0,X1)
| ~ 'op$uimplies$uor' ),
inference(clausification,[status(esa)],[op_implies_or]) ).
cnf(c63,plain,
'op$uimplies$uor',
inference(clausification,[status(esa)],[principia_op_implies_or]) ).
cnf(c66,plain,
'modus$uponens',
inference(clausification,[status(esa)],[principia_modus_ponens]) ).
cnf(c68,plain,
r2,
inference(clausification,[status(esa)],[principia_r2]) ).
cnf(c69,plain,
r3,
inference(clausification,[status(esa)],[principia_r3]) ).
cnf(c71,plain,
r5,
inference(clausification,[status(esa)],[principia_r5]) ).
cnf(c73,plain,
~ 'or$u1',
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
~ 'is$ua$utheorem'(implies(sK40,or(sK40,sK41))),
inference(resolution,[status(thm)],[c73,c25]) ).
cnf(d1,plain,
'is$ua$utheorem'(implies(X0,or(X1,X0))),
inference(resolution,[status(thm)],[c68,c50]) ).
cnf(d2,plain,
( ~ 'is$ua$utheorem'(implies(X1,X0))
| ~ 'is$ua$utheorem'(X1)
| 'is$ua$utheorem'(X0) ),
inference(resolution,[status(thm)],[c66,c3]) ).
cnf(d3,plain,
( ~ 'is$ua$utheorem'(implies(implies(X1,or(X2,X1)),X0))
| 'is$ua$utheorem'(X0) ),
inference(resolution,[status(thm)],[d2,d1]) ).
cnf(d4,plain,
'is$ua$utheorem'(implies(or(X0,X1),or(X1,X0))),
inference(resolution,[status(thm)],[c69,c52]) ).
cnf(d5,plain,
( ~ 'is$ua$utheorem'(implies(implies(or(X1,X2),or(X2,X1)),X0))
| 'is$ua$utheorem'(X0) ),
inference(resolution,[status(thm)],[d4,d2]) ).
cnf(d6,plain,
or(not(X0),X1) = implies(X0,X1),
inference(resolution,[status(thm)],[c63,c61]) ).
cnf(d7,plain,
'is$ua$utheorem'(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
inference(resolution,[status(thm)],[c71,c56]) ).
cnf(d8,plain,
'is$ua$utheorem'(implies(implies(X1,X2),implies(implies(X0,X1),or(not(X0),X2)))),
inference(superposition,[status(thm)],[d6,d7]) ).
cnf(d9,plain,
'is$ua$utheorem'(implies(implies(X2,X1),implies(implies(X0,X2),implies(X0,X1)))),
inference(demodulation,[status(thm)],[d8,d6]) ).
cnf(d10,plain,
'is$ua$utheorem'(implies(implies(X0,or(X1,X2)),implies(X0,or(X2,X1)))),
inference(resolution,[status(thm)],[d9,d5]) ).
cnf(d11,plain,
'is$ua$utheorem'(implies(X0,or(X0,X1))),
inference(resolution,[status(thm)],[d10,d3]) ).
cnf(d12,plain,
$false,
inference(resolution,[status(thm)],[d11,d0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL490+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.18/10.45 % Computer : n008.cluster.edu
% 0.18/10.45 % Model : x86_64 x86_64
% 0.18/10.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/10.45 % Memory : 8046.5625MB
% 0.18/10.45 % OS : Linux 6.8.0-71-generic
% 0.18/10.45 % CPULimit : 300
% 0.18/10.45 % WCLimit : 300
% 0.18/10.45 % DateTime : Fri Sep 25 22:40:19 UTC 2026
% 0.18/10.45 % CPUTime :
% 0.18/10.45 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 35.05/18.28 % SZS status Theorem for theBenchmark.p
% 35.05/18.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------