%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SWV069+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/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 09:01:21 AM UTC 2026
% Result : Theorem 8.69s 2.74s
% Output : CNFRefutation 8.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 19 ( 12 unt; 0 def)
% Number of atoms : 37 ( 2 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 32 ( 14 ~; 7 |; 8 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 8 ( 0 sgn 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(gt_5_0,axiom,
gt(n5,n0) ).
fof(reflexivity_leq,axiom,
! [X0] : leq(X0,X0) ).
fof(leq_gt_pred,axiom,
! [X0,X1] :
( leq(X0,pred(X1))
<=> gt(X1,X0) ) ).
fof(pred_minus_1,axiom,
! [X0] : minus(X0,n1) = pred(X0) ).
fof(cl5_nebula_array_0010,conjecture,
( ( leq(pv10,minus(n135300,n1))
& leq(n0,pv10) )
=> ( leq(pv10,minus(n135300,n1))
& leq(n0,minus(n5,n1))
& leq(n0,pv10)
& leq(n0,n0) ) ) ).
fof(negated_conjecture,negated_conjecture,
~ ( ( leq(pv10,minus(n135300,n1))
& leq(n0,pv10) )
=> ( leq(pv10,minus(n135300,n1))
& leq(n0,minus(n5,n1))
& leq(n0,pv10)
& leq(n0,n0) ) ),
inference(negate_conjecture,[status(cth)],[cl5_nebula_array_0010]) ).
cnf(c11,plain,
gt(n5,n0),
inference(clausification,[status(esa)],[gt_5_0]) ).
cnf(c42,plain,
leq(X0,X0),
inference(clausification,[status(esa)],[reflexivity_leq]) ).
cnf(c51,plain,
( ~ gt(X1,X0)
| leq(X0,pred(X1)) ),
inference(clausification,[status(esa)],[leq_gt_pred]) ).
cnf(c141,plain,
minus(X0,n1) = pred(X0),
inference(clausification,[status(esa)],[pred_minus_1]) ).
cnf(c163,plain,
leq(n0,pv10),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c164,plain,
leq(pv10,minus(n135300,n1)),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c165,plain,
( ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,minus(n5,n1))
| ~ leq(n0,pv10)
| ~ leq(n0,n0) ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
( ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,minus(n5,n1))
| ~ leq(n0,n0) ),
inference(resolution,[status(thm)],[c163,c165]) ).
cnf(d1,plain,
( ~ leq(n0,minus(n5,n1))
| ~ leq(n0,n0) ),
inference(resolution,[status(thm)],[c164,d0]) ).
cnf(d2,plain,
~ leq(n0,minus(n5,n1)),
inference(resolution,[status(thm)],[c42,d1]) ).
cnf(d3,plain,
~ leq(n0,pred(n5)),
inference(demodulation,[status(thm)],[d2,c141]) ).
cnf(d4,plain,
~ gt(n5,n0),
inference(resolution,[status(thm)],[d3,c51]) ).
cnf(d5,plain,
$false,
inference(resolution,[status(thm)],[c11,d4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV069+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.03 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.57 % Computer : n006.cluster.edu
% 0.09/0.57 % Model : x86_64 x86_64
% 0.09/0.57 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.57 % Memory : 8046.5625MB
% 0.09/0.57 % OS : Linux 6.8.0-71-generic
% 0.09/0.57 % CPULimit : 300
% 0.09/0.57 % WCLimit : 300
% 0.09/0.57 % DateTime : Sat Sep 26 13:10:25 UTC 2026
% 0.09/0.57 % CPUTime :
% 0.09/0.57 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.69/2.74 % SZS status Theorem for theBenchmark.p
% 8.69/2.74 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------