%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : LCL484+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 : n007.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:43 AM UTC 2026
% Result : Theorem 10.44s 2.42s
% Output : CNFRefutation 10.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of formulae : 18 ( 12 unt; 0 def)
% Number of atoms : 24 ( 3 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 12 ( 6 ~; 3 |; 0 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 4 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 16 ( 3 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(implies_1,axiom,
( 'implies$u1'
<=> ! [X0,X1] : 'is$ua$utheorem'(implies(X0,implies(X1,X0))) ) ).
fof(r2,axiom,
( r2
<=> ! [X0,X1] : 'is$ua$utheorem'(implies(X1,or(X0,X1))) ) ).
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_r2,axiom,
r2 ).
fof(hilbert_implies_1,conjecture,
'implies$u1' ).
fof(negated_conjecture,negated_conjecture,
~ 'implies$u1',
inference(negate_conjecture,[status(cth)],[hilbert_implies_1]) ).
cnf(c13,plain,
( ~ 'is$ua$utheorem'(implies(sK14,implies(sK15,sK14)))
| 'implies$u1' ),
inference(clausification,[status(esa)],[implies_1]) ).
cnf(c50,plain,
( 'is$ua$utheorem'(implies(X0,or(X1,X0)))
| ~ r2 ),
inference(clausification,[status(esa)],[r2]) ).
cnf(c61,plain,
( implies(X0,X1) = or(not(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(c68,plain,
r2,
inference(clausification,[status(esa)],[principia_r2]) ).
cnf(c73,plain,
~ 'implies$u1',
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
~ 'is$ua$utheorem'(implies(sK14,implies(sK15,sK14))),
inference(resolution,[status(thm)],[c73,c13]) ).
cnf(d1,plain,
'is$ua$utheorem'(implies(X0,or(X1,X0))),
inference(resolution,[status(thm)],[c68,c50]) ).
cnf(d2,plain,
implies(X0,X1) = or(not(X0),X1),
inference(resolution,[status(thm)],[c63,c61]) ).
cnf(d3,plain,
'is$ua$utheorem'(implies(X1,implies(X0,X1))),
inference(superposition,[status(thm)],[d2,d1]) ).
cnf(d4,plain,
$false,
inference(resolution,[status(thm)],[d3,d0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL484+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.36 % Computer : n007.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Fri Sep 25 22:37:08 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.44/2.42 % SZS status Theorem for theBenchmark.p
% 10.44/2.42 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------