%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : LCL495+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 : n026.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 87.53s 26.74s
% Output : CNFRefutation 87.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 17
% Syntax : Number of formulae : 68 ( 37 unt; 0 def)
% Number of atoms : 105 ( 11 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 68 ( 31 ~; 26 |; 1 &)
% ( 6 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 12 ( 10 usr; 10 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 106 ( 0 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(hilbert_op_equiv,axiom,
'op$uequiv' ).
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(equivalence_3,axiom,
( 'equivalence$u3'
<=> ! [X0,X1] : 'is$ua$utheorem'(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1)))) ) ).
fof(r3,axiom,
( r3
<=> ! [X0,X1] : 'is$ua$utheorem'(implies(or(X0,X1),or(X1,X0))) ) ).
fof(r4,axiom,
( r4
<=> ! [X0,X1,X2] : 'is$ua$utheorem'(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) ) ).
fof(r5,axiom,
( r5
<=> ! [X0,X1,X2] : 'is$ua$utheorem'(implies(implies(X1,X2),implies(or(X0,X1),or(X0,X2)))) ) ).
fof(op_and,axiom,
( 'op$uand'
=> ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))) ) ).
fof(op_implies_or,axiom,
( 'op$uimplies$uor'
=> ! [X0,X1] : implies(X0,X1) = or(not(X0),X1) ) ).
fof(op_equiv,axiom,
( 'op$uequiv'
=> ! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)) ) ).
fof(principia_op_implies_or,axiom,
'op$uimplies$uor' ).
fof(principia_op_and,axiom,
'op$uand' ).
fof(principia_modus_ponens,axiom,
'modus$uponens' ).
fof(principia_r3,axiom,
r3 ).
fof(principia_r4,axiom,
r4 ).
fof(principia_r5,axiom,
r5 ).
fof(hilbert_equivalence_3,conjecture,
'equivalence$u3' ).
fof(negated_conjecture,negated_conjecture,
~ 'equivalence$u3',
inference(negate_conjecture,[status(cth)],[hilbert_equivalence_3]) ).
cnf(c2,plain,
'op$uequiv',
inference(clausification,[status(esa)],[hilbert_op_equiv]) ).
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(c22,plain,
( 'is$ua$utheorem'(implies(X0,implies(X1,and(X0,X1))))
| ~ 'and$u3' ),
inference(clausification,[status(esa)],[and_3]) ).
cnf(c23,plain,
( ~ 'is$ua$utheorem'(implies(sK36,implies(sK37,and(sK36,sK37))))
| 'and$u3' ),
inference(clausification,[status(esa)],[and_3]) ).
cnf(c35,plain,
( ~ 'is$ua$utheorem'(implies(implies(sK62,sK63),implies(implies(sK63,sK62),equiv(sK62,sK63))))
| 'equivalence$u3' ),
inference(clausification,[status(esa)],[equivalence_3]) ).
cnf(c52,plain,
( 'is$ua$utheorem'(implies(or(X0,X1),or(X1,X0)))
| ~ r3 ),
inference(clausification,[status(esa)],[r3]) ).
cnf(c54,plain,
( 'is$ua$utheorem'(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2))))
| ~ r4 ),
inference(clausification,[status(esa)],[r4]) ).
cnf(c56,plain,
( 'is$ua$utheorem'(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1))))
| ~ r5 ),
inference(clausification,[status(esa)],[r5]) ).
cnf(c59,plain,
( not(or(not(X0),not(X1))) = and(X0,X1)
| ~ 'op$uand' ),
inference(clausification,[status(esa)],[op_and]) ).
cnf(c61,plain,
( or(not(X0),X1) = implies(X0,X1)
| ~ 'op$uimplies$uor' ),
inference(clausification,[status(esa)],[op_implies_or]) ).
cnf(c62,plain,
( and(implies(X0,X1),implies(X1,X0)) = equiv(X0,X1)
| ~ 'op$uequiv' ),
inference(clausification,[status(esa)],[op_equiv]) ).
cnf(c63,plain,
'op$uimplies$uor',
inference(clausification,[status(esa)],[principia_op_implies_or]) ).
cnf(c64,plain,
'op$uand',
inference(clausification,[status(esa)],[principia_op_and]) ).
cnf(c66,plain,
'modus$uponens',
inference(clausification,[status(esa)],[principia_modus_ponens]) ).
cnf(c69,plain,
r3,
inference(clausification,[status(esa)],[principia_r3]) ).
cnf(c70,plain,
r4,
inference(clausification,[status(esa)],[principia_r4]) ).
cnf(c71,plain,
r5,
inference(clausification,[status(esa)],[principia_r5]) ).
cnf(c73,plain,
~ 'equivalence$u3',
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
~ 'is$ua$utheorem'(implies(implies(sK62,sK63),implies(implies(sK63,sK62),equiv(sK62,sK63)))),
inference(resolution,[status(thm)],[c73,c35]) ).
cnf(d1,plain,
and(implies(X0,X1),implies(X1,X0)) = equiv(X0,X1),
inference(resolution,[status(thm)],[c2,c62]) ).
cnf(d2,plain,
( ~ 'and$u3'
| 'is$ua$utheorem'(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1)))) ),
inference(superposition,[status(thm)],[d1,c22]) ).
cnf(d3,plain,
~ 'and$u3',
inference(resolution,[status(thm)],[d2,d0]) ).
cnf(d4,plain,
~ 'is$ua$utheorem'(implies(sK36,implies(sK37,and(sK36,sK37)))),
inference(resolution,[status(thm)],[d3,c23]) ).
cnf(d5,plain,
or(not(X0),X1) = implies(X0,X1),
inference(resolution,[status(thm)],[c63,c61]) ).
cnf(d6,plain,
( ~ 'is$ua$utheorem'(implies(X1,X0))
| ~ 'is$ua$utheorem'(X1)
| 'is$ua$utheorem'(X0) ),
inference(resolution,[status(thm)],[c66,c3]) ).
cnf(d7,plain,
'is$ua$utheorem'(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))),
inference(resolution,[status(thm)],[c70,c54]) ).
cnf(d8,plain,
( 'is$ua$utheorem'(or(X1,or(X0,X2)))
| ~ 'is$ua$utheorem'(or(X0,or(X1,X2))) ),
inference(resolution,[status(thm)],[d7,d6]) ).
cnf(d9,plain,
( 'is$ua$utheorem'(or(X1,or(not(X0),X2)))
| ~ 'is$ua$utheorem'(implies(X0,or(X1,X2))) ),
inference(superposition,[status(thm)],[d5,d8]) ).
cnf(d10,plain,
( 'is$ua$utheorem'(or(X2,implies(X0,X1)))
| ~ 'is$ua$utheorem'(implies(X0,or(X2,X1))) ),
inference(demodulation,[status(thm)],[d9,d5]) ).
cnf(d11,plain,
( 'is$ua$utheorem'(or(not(X0),implies(X2,X1)))
| ~ 'is$ua$utheorem'(implies(X2,implies(X0,X1))) ),
inference(superposition,[status(thm)],[d5,d10]) ).
cnf(d12,plain,
( 'is$ua$utheorem'(implies(X0,implies(X1,X2)))
| ~ 'is$ua$utheorem'(implies(X1,implies(X0,X2))) ),
inference(demodulation,[status(thm)],[d11,d5]) ).
cnf(d13,plain,
( ~ 'op$uand'
| not(implies(X0,not(X1))) = and(X0,X1) ),
inference(demodulation,[status(thm)],[c59,d5]) ).
cnf(d14,plain,
not(implies(X0,not(X1))) = and(X0,X1),
inference(resolution,[status(thm)],[c64,d13]) ).
cnf(d15,plain,
or(and(X0,X1),X2) = implies(implies(X0,not(X1)),X2),
inference(superposition,[status(thm)],[d14,d5]) ).
cnf(d16,plain,
'is$ua$utheorem'(implies(or(X0,X1),or(X1,X0))),
inference(resolution,[status(thm)],[c69,c52]) ).
cnf(d17,plain,
'is$ua$utheorem'(implies(or(X1,not(X0)),implies(X0,X1))),
inference(superposition,[status(thm)],[d5,d16]) ).
cnf(d18,plain,
'is$ua$utheorem'(implies(implies(X0,not(X1)),implies(X1,not(X0)))),
inference(superposition,[status(thm)],[d5,d17]) ).
cnf(d19,plain,
'is$ua$utheorem'(or(and(X0,X1),implies(X1,not(X0)))),
inference(demodulation,[status(thm)],[d18,d15]) ).
cnf(d20,plain,
'is$ua$utheorem'(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
inference(resolution,[status(thm)],[c71,c56]) ).
cnf(d21,plain,
( 'is$ua$utheorem'(implies(or(X2,X0),or(X2,X1)))
| ~ 'is$ua$utheorem'(implies(X0,X1)) ),
inference(resolution,[status(thm)],[d20,d6]) ).
cnf(d22,plain,
( 'is$ua$utheorem'(or(X2,X1))
| ~ 'is$ua$utheorem'(or(X2,X0))
| ~ 'is$ua$utheorem'(implies(X0,X1)) ),
inference(resolution,[status(thm)],[d21,d6]) ).
cnf(d23,plain,
'is$ua$utheorem'(implies(implies(X0,X1),or(X1,not(X0)))),
inference(superposition,[status(thm)],[d5,d16]) ).
cnf(d24,plain,
'is$ua$utheorem'(or(X0,implies(implies(X1,X0),not(X1)))),
inference(resolution,[status(thm)],[d10,d23]) ).
cnf(d25,plain,
( 'is$ua$utheorem'(or(X1,X2))
| ~ 'is$ua$utheorem'(implies(implies(implies(X0,X1),not(X0)),X2)) ),
inference(resolution,[status(thm)],[d24,d22]) ).
cnf(d26,plain,
( 'is$ua$utheorem'(or(X1,X2))
| ~ 'is$ua$utheorem'(or(and(implies(X0,X1),X0),X2)) ),
inference(demodulation,[status(thm)],[d25,d15]) ).
cnf(d27,plain,
'is$ua$utheorem'(or(X0,implies(X1,not(implies(X1,X0))))),
inference(resolution,[status(thm)],[d26,d19]) ).
cnf(d28,plain,
'is$ua$utheorem'(or(not(X1),implies(X0,and(X0,X1)))),
inference(superposition,[status(thm)],[d14,d27]) ).
cnf(d29,plain,
'is$ua$utheorem'(implies(X0,implies(X1,and(X1,X0)))),
inference(demodulation,[status(thm)],[d28,d5]) ).
cnf(d30,plain,
'is$ua$utheorem'(implies(X0,implies(X1,and(X0,X1)))),
inference(resolution,[status(thm)],[d29,d12]) ).
cnf(d31,plain,
$false,
inference(resolution,[status(thm)],[d30,d4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL495+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.07 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.67 % Computer : n026.cluster.edu
% 0.18/0.67 % Model : x86_64 x86_64
% 0.18/0.67 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.67 % Memory : 8046.5625MB
% 0.18/0.67 % OS : Linux 6.8.0-71-generic
% 0.18/0.67 % CPULimit : 300
% 0.18/0.67 % WCLimit : 300
% 0.18/0.67 % DateTime : Fri Sep 25 22:42:26 UTC 2026
% 0.18/0.68 % CPUTime :
% 0.18/0.68 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 87.53/26.74 % SZS status Theorem for theBenchmark.p
% 87.53/26.74 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------