%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SYN986+1.001 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n012.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:34:28 AM UTC 2026
% Result : Theorem 4.99s 1.51s
% Output : CNFRefutation 4.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 11 ( 5 unt; 0 def)
% Number of atoms : 19 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 15 ( 7 ~; 4 |; 2 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 20 ( 2 sgn 5 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(hyp1,axiom,
! [X0] : r(X0,zero,succ(X0)) ).
fof(hyp2,axiom,
! [X0,X1,X2,X3] :
( r(X0,X1,X2)
=> ( r(X2,X1,X3)
=> r(X0,succ(X1),X3) ) ) ).
fof(ck,conjecture,
? [X0,X1] :
( r(zero,X0,X1)
& r(zero,zero,X0) ) ).
fof(negated_conjecture,negated_conjecture,
~ ? [X0,X1] :
( r(zero,X0,X1)
& r(zero,zero,X0) ),
inference(negate_conjecture,[status(cth)],[ck]) ).
cnf(c0,plain,
r(X0,zero,succ(X0)),
inference(clausification,[status(esa)],[hyp1]) ).
cnf(c1,plain,
( r(X0,succ(X1),X3)
| ~ r(X2,X1,X3)
| ~ r(X0,X1,X2) ),
inference(clausification,[status(esa)],[hyp2]) ).
cnf(c2,plain,
( ~ r(zero,X0,X1)
| ~ r(zero,zero,X0) ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
~ r(zero,succ(zero),X0),
inference(resolution,[status(thm)],[c0,c2]) ).
cnf(d1,plain,
( r(X0,succ(zero),X1)
| ~ r(succ(X0),zero,X1) ),
inference(resolution,[status(thm)],[c1,c0]) ).
cnf(d2,plain,
r(X0,succ(zero),succ(succ(X0))),
inference(resolution,[status(thm)],[d1,c0]) ).
cnf(d3,plain,
$false,
inference(resolution,[status(thm)],[d2,d0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SYN986+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.02 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.02/0.31 % Computer : n012.cluster.edu
% 0.02/0.31 % Model : x86_64 x86_64
% 0.02/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/0.31 % Memory : 8046.5625MB
% 0.02/0.31 % OS : Linux 6.8.0-71-generic
% 0.02/0.31 % CPULimit : 300
% 0.02/0.31 % WCLimit : 300
% 0.02/0.31 % DateTime : Sat Sep 26 18:53:07 UTC 2026
% 0.02/0.31 % CPUTime :
% 0.02/0.31 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.99/1.51 % SZS status Theorem for theBenchmark.p
% 4.99/1.51 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------