%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : LCL491+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 11.49s 2.07s
% Output : CNFRefutation 11.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 12 ( 8 unt; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 9 ( 5 ~; 2 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 3 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 8 ( 2 sgn 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(or_2,axiom,
( 'or$u2'
<=> ! [X0,X1] : 'is$ua$utheorem'(implies(X1,or(X0,X1))) ) ).
fof(r2,axiom,
( r2
<=> ! [X0,X1] : 'is$ua$utheorem'(implies(X1,or(X0,X1))) ) ).
fof(principia_r2,axiom,
r2 ).
fof(hilbert_or_2,conjecture,
'or$u2' ).
fof(negated_conjecture,negated_conjecture,
~ 'or$u2',
inference(negate_conjecture,[status(cth)],[hilbert_or_2]) ).
cnf(c27,plain,
( ~ 'is$ua$utheorem'(implies(sK45,or(sK44,sK45)))
| 'or$u2' ),
inference(clausification,[status(esa)],[or_2]) ).
cnf(c50,plain,
( 'is$ua$utheorem'(implies(X0,or(X1,X0)))
| ~ r2 ),
inference(clausification,[status(esa)],[r2]) ).
cnf(c68,plain,
r2,
inference(clausification,[status(esa)],[principia_r2]) ).
cnf(c73,plain,
~ 'or$u2',
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
~ 'is$ua$utheorem'(implies(sK45,or(sK44,sK45))),
inference(resolution,[status(thm)],[c73,c27]) ).
cnf(d1,plain,
'is$ua$utheorem'(implies(X0,or(X1,X0))),
inference(resolution,[status(thm)],[c68,c50]) ).
cnf(d2,plain,
$false,
inference(resolution,[status(thm)],[d1,d0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL491+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 : n008.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:40:39 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.49/2.07 % SZS status Theorem for theBenchmark.p
% 11.49/2.07 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------