%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : LCL512+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 : n006.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:46 AM UTC 2026
% Result : Theorem 10.82s 2.22s
% Output : CNFRefutation 10.82s
% 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 ( 2 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(hilbert_op_equiv,axiom,
'op$uequiv' ).
fof(equivalence_1,axiom,
( 'equivalence$u1'
<=> ! [X0,X1] : 'is$ua$utheorem'(implies(equiv(X0,X1),implies(X0,X1))) ) ).
fof(kn2,axiom,
( kn2
<=> ! [X0,X1] : 'is$ua$utheorem'(implies(and(X0,X1),X0)) ) ).
fof(op_equiv,axiom,
( 'op$uequiv'
=> ! [X0,X1] : equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)) ) ).
fof(rosser_kn2,axiom,
kn2 ).
fof(hilbert_equivalence_1,conjecture,
'equivalence$u1' ).
fof(negated_conjecture,negated_conjecture,
~ 'equivalence$u1',
inference(negate_conjecture,[status(cth)],[hilbert_equivalence_1]) ).
cnf(c2,plain,
'op$uequiv',
inference(clausification,[status(esa)],[hilbert_op_equiv]) ).
cnf(c31,plain,
( ~ 'is$ua$utheorem'(implies(equiv(sK54,sK55),implies(sK54,sK55)))
| 'equivalence$u1' ),
inference(clausification,[status(esa)],[equivalence_1]) ).
cnf(c38,plain,
( 'is$ua$utheorem'(implies(and(X0,X1),X0))
| ~ kn2 ),
inference(clausification,[status(esa)],[kn2]) ).
cnf(c62,plain,
( equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0))
| ~ 'op$uequiv' ),
inference(clausification,[status(esa)],[op_equiv]) ).
cnf(c68,plain,
kn2,
inference(clausification,[status(esa)],[rosser_kn2]) ).
cnf(c71,plain,
~ 'equivalence$u1',
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
~ 'is$ua$utheorem'(implies(equiv(sK54,sK55),implies(sK54,sK55))),
inference(resolution,[status(thm)],[c71,c31]) ).
cnf(d1,plain,
'is$ua$utheorem'(implies(and(X0,X1),X0)),
inference(resolution,[status(thm)],[c68,c38]) ).
cnf(d2,plain,
equiv(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
inference(resolution,[status(thm)],[c2,c62]) ).
cnf(d3,plain,
'is$ua$utheorem'(implies(equiv(X0,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.02 % Problem : LCL512+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.03 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.34 % Computer : n006.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.34 % DateTime : Fri Sep 25 22:40:25 UTC 2026
% 0.08/0.34 % CPUTime :
% 0.08/0.34 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.82/2.22 % SZS status Theorem for theBenchmark.p
% 10.82/2.22 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------