%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SYN939+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n007.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.48s 1.62s
% Output : CNFRefutation 8.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 1
% Syntax : Number of formulae : 18 ( 5 unt; 0 def)
% Number of atoms : 50 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 53 ( 21 ~; 20 |; 6 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 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 : 32 ( 15 sgn 6 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
! [X0,X1] :
( ! [X2] : q(f(X2))
=> ? [X3,X4] :
( q(X3)
& ( r(X4)
=> ( r(X0)
& r(X1) ) )
& ( p(f(X4))
=> p(X3) ) ) ) ).
fof(negated_conjecture,negated_conjecture,
~ ! [X0,X1] :
( ! [X2] : q(f(X2))
=> ? [X3,X4] :
( q(X3)
& ( r(X4)
=> ( r(X0)
& r(X1) ) )
& ( p(f(X4))
=> p(X3) ) ) ),
inference(negate_conjecture,[status(cth)],[prove_this]) ).
cnf(c0,plain,
q(f(X0)),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c1,plain,
( ~ q(X1)
| r(X0)
| p(f(X0)) ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c2,plain,
( ~ q(X1)
| ~ r(sK0)
| ~ r(sK1)
| p(f(X0)) ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c3,plain,
( ~ q(X0)
| r(X1)
| ~ p(X0) ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c4,plain,
( ~ q(X0)
| ~ r(sK0)
| ~ r(sK1)
| ~ p(X0) ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
( p(f(X0))
| r(X0) ),
inference(resolution,[status(thm)],[c1,c0]) ).
cnf(d1,plain,
( r(X0)
| r(X1)
| ~ q(f(X0)) ),
inference(resolution,[status(thm)],[c3,d0]) ).
cnf(d2,plain,
( r(X1)
| r(X0) ),
inference(resolution,[status(thm)],[c0,d1]) ).
cnf(d3,plain,
r(X0),
inference(factoring,[status(thm)],[d2]) ).
cnf(d4,plain,
( ~ p(X0)
| ~ r(sK0)
| ~ q(X0) ),
inference(resolution,[status(thm)],[d3,c4]) ).
cnf(d5,plain,
( ~ p(X0)
| ~ q(X0) ),
inference(resolution,[status(thm)],[d3,d4]) ).
cnf(d6,plain,
( p(f(X1))
| ~ r(sK0)
| ~ q(X0) ),
inference(resolution,[status(thm)],[d3,c2]) ).
cnf(d7,plain,
( p(f(X1))
| ~ q(X0) ),
inference(resolution,[status(thm)],[d3,d6]) ).
cnf(d8,plain,
p(f(X0)),
inference(resolution,[status(thm)],[d7,c0]) ).
cnf(d9,plain,
~ q(f(X0)),
inference(resolution,[status(thm)],[d8,d5]) ).
cnf(d10,plain,
$false,
inference(resolution,[status(thm)],[c0,d9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN939+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.36 % Computer : n007.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Sat Sep 26 18:49:09 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.48/1.62 % SZS status Theorem for theBenchmark.p
% 8.48/1.62 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------