%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SYN941+1 : TPTP v9.3.1. Released v3.1.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 09:34:22 AM UTC 2026
% Result : Theorem 8.52s 1.50s
% Output : CNFRefutation 8.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 13 ( 5 unt; 0 def)
% Number of atoms : 35 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 37 ( 15 ~; 10 |; 6 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 20 ( 8 sgn 4 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
! [X0,X1] :
( q(f(X0))
=> ? [X2,X3] :
( q(X2)
& ( p(f(X3))
=> ( ( r(X3)
=> ( r(X1)
& r(X0) ) )
& p(X2) ) ) ) ) ).
fof(negated_conjecture,negated_conjecture,
~ ! [X0,X1] :
( q(f(X0))
=> ? [X2,X3] :
( q(X2)
& ( p(f(X3))
=> ( ( r(X3)
=> ( r(X1)
& r(X0) ) )
& p(X2) ) ) ) ),
inference(negate_conjecture,[status(cth)],[prove_this]) ).
cnf(c0,plain,
q(f(sK0)),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c1,plain,
( ~ q(X1)
| p(f(X0)) ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c2,plain,
( ~ q(X0)
| r(X1)
| ~ p(X0) ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c3,plain,
( ~ q(X0)
| ~ r(sK1)
| ~ r(sK0)
| ~ p(X0) ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
p(f(X0)),
inference(resolution,[status(thm)],[c1,c0]) ).
cnf(d1,plain,
( r(X1)
| ~ q(f(X0)) ),
inference(resolution,[status(thm)],[c2,d0]) ).
cnf(d2,plain,
r(X0),
inference(resolution,[status(thm)],[d1,c0]) ).
cnf(d3,plain,
( ~ r(sK1)
| ~ p(X0)
| ~ q(X0) ),
inference(resolution,[status(thm)],[d2,c3]) ).
cnf(d4,plain,
( ~ p(X0)
| ~ q(X0) ),
inference(resolution,[status(thm)],[d2,d3]) ).
cnf(d5,plain,
~ q(f(X0)),
inference(resolution,[status(thm)],[d4,d0]) ).
cnf(d6,plain,
$false,
inference(resolution,[status(thm)],[d5,c0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN941+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.03 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.34 % Computer : n008.cluster.edu
% 0.09/0.34 % Model : x86_64 x86_64
% 0.09/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34 % Memory : 8046.5625MB
% 0.09/0.34 % OS : Linux 6.8.0-71-generic
% 0.09/0.34 % CPULimit : 300
% 0.09/0.34 % WCLimit : 300
% 0.09/0.34 % DateTime : Sat Sep 26 18:51:42 UTC 2026
% 0.09/0.34 % CPUTime :
% 0.09/0.34 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.52/1.50 % SZS status Theorem for theBenchmark.p
% 8.52/1.50 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------