%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : LCL457+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:40 AM UTC 2026
% Result : Theorem 59.32s 10.05s
% Output : CNFRefutation 59.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 44 ( 22 unt; 0 def)
% Number of atoms : 74 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 59 ( 29 ~; 22 |; 1 &)
% ( 6 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 8 ( 7 usr; 7 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 63 ( 10 sgn 15 !; 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_3,axiom,
( 'implies$u3'
<=> ! [X0,X1,X2] : 'is$ua$utheorem'(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) ) ).
fof(or_1,axiom,
( 'or$u1'
<=> ! [X0,X1] : 'is$ua$utheorem'(implies(X0,or(X0,X1))) ) ).
fof(or_2,axiom,
( 'or$u2'
<=> ! [X0,X1] : 'is$ua$utheorem'(implies(X1,or(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(r4,axiom,
( r4
<=> ! [X0,X1,X2] : 'is$ua$utheorem'(implies(or(X0,or(X1,X2)),or(X1,or(X0,X2)))) ) ).
fof(hilbert_modus_ponens,axiom,
'modus$uponens' ).
fof(hilbert_implies_3,axiom,
'implies$u3' ).
fof(hilbert_or_1,axiom,
'or$u1' ).
fof(hilbert_or_2,axiom,
'or$u2' ).
fof(hilbert_or_3,axiom,
'or$u3' ).
fof(principia_r4,conjecture,
r4 ).
fof(negated_conjecture,negated_conjecture,
~ r4,
inference(negate_conjecture,[status(cth)],[principia_r4]) ).
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(c16,plain,
( 'is$ua$utheorem'(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))))
| ~ 'implies$u3' ),
inference(clausification,[status(esa)],[implies_3]) ).
cnf(c24,plain,
( 'is$ua$utheorem'(implies(X0,or(X0,X1)))
| ~ 'or$u1' ),
inference(clausification,[status(esa)],[or_1]) ).
cnf(c26,plain,
( 'is$ua$utheorem'(implies(X0,or(X1,X0)))
| ~ 'or$u2' ),
inference(clausification,[status(esa)],[or_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(c55,plain,
( ~ 'is$ua$utheorem'(implies(or(sK101,or(sK102,sK103)),or(sK102,or(sK101,sK103))))
| r4 ),
inference(clausification,[status(esa)],[r4]) ).
cnf(c66,plain,
'modus$uponens',
inference(clausification,[status(esa)],[hilbert_modus_ponens]) ).
cnf(c70,plain,
'implies$u3',
inference(clausification,[status(esa)],[hilbert_implies_3]) ).
cnf(c74,plain,
'or$u1',
inference(clausification,[status(esa)],[hilbert_or_1]) ).
cnf(c75,plain,
'or$u2',
inference(clausification,[status(esa)],[hilbert_or_2]) ).
cnf(c76,plain,
'or$u3',
inference(clausification,[status(esa)],[hilbert_or_3]) ).
cnf(c81,plain,
~ r4,
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
( ~ 'is$ua$utheorem'(implies(X1,X0))
| ~ 'is$ua$utheorem'(X1)
| 'is$ua$utheorem'(X0) ),
inference(resolution,[status(thm)],[c66,c3]) ).
cnf(d1,plain,
'is$ua$utheorem'(implies(implies(X0,X1),implies(implies(X2,X1),implies(or(X0,X2),X1)))),
inference(resolution,[status(thm)],[c76,c28]) ).
cnf(d2,plain,
( 'is$ua$utheorem'(implies(implies(X2,X1),implies(or(X0,X2),X1)))
| ~ 'is$ua$utheorem'(implies(X0,X1)) ),
inference(resolution,[status(thm)],[d0,d1]) ).
cnf(d3,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)],[d2,d0]) ).
cnf(d4,plain,
~ 'is$ua$utheorem'(implies(or(sK101,or(sK102,sK103)),or(sK102,or(sK101,sK103)))),
inference(resolution,[status(thm)],[c81,c55]) ).
cnf(d5,plain,
( ~ 'is$ua$utheorem'(implies(sK101,or(sK102,or(sK101,sK103))))
| ~ 'is$ua$utheorem'(implies(or(sK102,sK103),or(sK102,or(sK101,sK103)))) ),
inference(resolution,[status(thm)],[d3,d4]) ).
cnf(d6,plain,
( ~ 'is$ua$utheorem'(implies(sK102,or(sK102,or(sK101,sK103))))
| ~ 'is$ua$utheorem'(implies(sK103,or(sK102,or(sK101,sK103))))
| ~ 'is$ua$utheorem'(implies(sK101,or(sK102,or(sK101,sK103)))) ),
inference(resolution,[status(thm)],[d5,d3]) ).
cnf(d7,plain,
'is$ua$utheorem'(implies(X0,or(X0,X1))),
inference(resolution,[status(thm)],[c74,c24]) ).
cnf(d8,plain,
( ~ 'is$ua$utheorem'(implies(sK103,or(sK102,or(sK101,sK103))))
| ~ 'is$ua$utheorem'(implies(sK101,or(sK102,or(sK101,sK103)))) ),
inference(resolution,[status(thm)],[d7,d6]) ).
cnf(d9,plain,
'is$ua$utheorem'(implies(X0,or(X1,X0))),
inference(resolution,[status(thm)],[c75,c26]) ).
cnf(d10,plain,
'is$ua$utheorem'(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
inference(resolution,[status(thm)],[c70,c16]) ).
cnf(d11,plain,
( 'is$ua$utheorem'(implies(implies(X1,X2),implies(X0,X2)))
| ~ 'is$ua$utheorem'(implies(X0,X1)) ),
inference(resolution,[status(thm)],[d0,d10]) ).
cnf(d12,plain,
( 'is$ua$utheorem'(implies(X0,X2))
| ~ 'is$ua$utheorem'(implies(X1,X2))
| ~ 'is$ua$utheorem'(implies(X0,X1)) ),
inference(resolution,[status(thm)],[d11,d0]) ).
cnf(d13,plain,
( 'is$ua$utheorem'(implies(X0,X2))
| ~ 'is$ua$utheorem'(implies(or(X0,X1),X2)) ),
inference(resolution,[status(thm)],[d12,d7]) ).
cnf(d14,plain,
'is$ua$utheorem'(implies(X0,or(X1,or(X0,X2)))),
inference(resolution,[status(thm)],[d13,d9]) ).
cnf(d15,plain,
~ 'is$ua$utheorem'(implies(sK103,or(sK102,or(sK101,sK103)))),
inference(resolution,[status(thm)],[d14,d8]) ).
cnf(d16,plain,
( 'is$ua$utheorem'(implies(X1,X2))
| ~ 'is$ua$utheorem'(implies(or(X0,X1),X2)) ),
inference(resolution,[status(thm)],[d12,d9]) ).
cnf(d17,plain,
'is$ua$utheorem'(implies(X0,or(X1,or(X2,X0)))),
inference(resolution,[status(thm)],[d16,d9]) ).
cnf(d18,plain,
$false,
inference(resolution,[status(thm)],[d17,d15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL457+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.38 % Computer : n008.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Fri Sep 25 22:37:25 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 59.32/10.05 % SZS status Theorem for theBenchmark.p
% 59.32/10.05 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------