%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : LCL483+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 : n018.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 11.73s 2.22s
% Output : CNFRefutation 11.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of formulae : 30 ( 20 unt; 0 def)
% Number of atoms : 40 ( 10 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 19 ( 9 ~; 5 |; 0 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 8 ( 6 usr; 6 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(hilbert_op_or,axiom,
'op$uor' ).
fof(hilbert_op_implies_and,axiom,
'op$uimplies$uand' ).
fof(modus_tollens,axiom,
( 'modus$utollens'
<=> ! [X0,X1] : 'is$ua$utheorem'(implies(implies(not(X1),not(X0)),implies(X0,X1))) ) ).
fof(r3,axiom,
( r3
<=> ! [X0,X1] : 'is$ua$utheorem'(implies(or(X0,X1),or(X1,X0))) ) ).
fof(op_or,axiom,
( 'op$uor'
=> ! [X0,X1] : or(X0,X1) = not(and(not(X0),not(X1))) ) ).
fof(op_implies_and,axiom,
( 'op$uimplies$uand'
=> ! [X0,X1] : implies(X0,X1) = not(and(X0,not(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_r3,axiom,
r3 ).
fof(hilbert_modus_tollens,conjecture,
'modus$utollens' ).
fof(negated_conjecture,negated_conjecture,
~ 'modus$utollens',
inference(negate_conjecture,[status(cth)],[hilbert_modus_tollens]) ).
cnf(c0,plain,
'op$uor',
inference(clausification,[status(esa)],[hilbert_op_or]) ).
cnf(c1,plain,
'op$uimplies$uand',
inference(clausification,[status(esa)],[hilbert_op_implies_and]) ).
cnf(c11,plain,
( ~ 'is$ua$utheorem'(implies(implies(not(sK11),not(sK10)),implies(sK10,sK11)))
| 'modus$utollens' ),
inference(clausification,[status(esa)],[modus_tollens]) ).
cnf(c52,plain,
( 'is$ua$utheorem'(implies(or(X0,X1),or(X1,X0)))
| ~ r3 ),
inference(clausification,[status(esa)],[r3]) ).
cnf(c58,plain,
( or(X0,X1) = not(and(not(X0),not(X1)))
| ~ 'op$uor' ),
inference(clausification,[status(esa)],[op_or]) ).
cnf(c60,plain,
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ 'op$uimplies$uand' ),
inference(clausification,[status(esa)],[op_implies_and]) ).
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(c69,plain,
r3,
inference(clausification,[status(esa)],[principia_r3]) ).
cnf(c73,plain,
~ 'modus$utollens',
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
implies(X0,X1) = not(and(X0,not(X1))),
inference(resolution,[status(thm)],[c1,c60]) ).
cnf(d1,plain,
or(X0,X1) = not(and(not(X0),not(X1))),
inference(resolution,[status(thm)],[c0,c58]) ).
cnf(d2,plain,
or(X0,X1) = implies(not(X0),X1),
inference(demodulation,[status(thm)],[d1,d0]) ).
cnf(d3,plain,
~ 'is$ua$utheorem'(implies(implies(not(sK11),not(sK10)),implies(sK10,sK11))),
inference(resolution,[status(thm)],[c73,c11]) ).
cnf(d4,plain,
~ 'is$ua$utheorem'(implies(or(sK11,not(sK10)),implies(sK10,sK11))),
inference(demodulation,[status(thm)],[d3,d2]) ).
cnf(d5,plain,
'is$ua$utheorem'(implies(or(X0,X1),or(X1,X0))),
inference(resolution,[status(thm)],[c69,c52]) ).
cnf(d6,plain,
implies(X0,X1) = or(not(X0),X1),
inference(resolution,[status(thm)],[c63,c61]) ).
cnf(d7,plain,
'is$ua$utheorem'(implies(or(X1,not(X0)),implies(X0,X1))),
inference(superposition,[status(thm)],[d6,d5]) ).
cnf(d8,plain,
$false,
inference(resolution,[status(thm)],[d7,d4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL483+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.09/0.36 % Computer : n018.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Fri Sep 25 22:40:50 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.73/2.22 % SZS status Theorem for theBenchmark.p
% 11.73/2.22 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------