%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN949+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n001.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 : Fri Sep 25 03:36:23 PM UTC 2026
% Result : Theorem 5.33s 1.19s
% Output : Proof 5.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 21 ( 14 unt; 0 def)
% Number of atoms : 56 ( 11 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 50 ( 15 ~; 9 |; 20 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-4 aty)
% Number of variables : 36 ( 2 sgn 19 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,conjecture,
! [A,B,C] :
( ( ! [X,Y] :
( r(X,Y)
=> q(X,Y) )
& ! [X] :
( s(X)
=> p(X) )
& r(B,C)
& s(B)
& s(A) )
=> ? [X,Y] :
( q(X,Y)
& p(X) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f0_neg,negated_conjecture,
~ ! [A,B,C] :
( ( ! [X,Y] :
( r(X,Y)
=> q(X,Y) )
& ! [X] :
( s(X)
=> p(X) )
& r(B,C)
& s(B)
& s(A) )
=> ? [X,Y] :
( q(X,Y)
& p(X) ) ),
inference(negated_conjecture,[status(cth)],[f0]) ).
fof(f0_nnf,plain,
? [A,B,C] :
( ! [X,Y] :
( ~ q(X,Y)
| ~ p(X) )
& ! [X,Y] :
( q(X,Y)
| ~ r(X,Y) )
& ! [X] :
( p(X)
| ~ s(X) )
& r(B,C)
& s(B)
& s(A) ),
inference(nnf_transformation,[status(thm)],[f0_neg]) ).
fof(f0_sk,plain,
! [X,Y] :
( ( ~ q(X,Y)
| ~ p(X) )
& ( q(X,Y)
| ~ r(X,Y) )
& ( p(X)
| ~ s(X) )
& r(sk1,sk2)
& s(sk1)
& s(sk0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1,sk2])],[f0_nnf]) ).
cnf(c4,plain,
( q(X3,X4)
| ~ r(X3,X4) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi4,negated_conjecture,
ifeq(r(X0,X1),true,q(X0,X1),true) = true,
inference(equality_encoding,[status(esa)],[c4]) ).
cnf(c2,plain,
r(sk1,sk2),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi2,negated_conjecture,
r(sk1,sk2) = true,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(h2,plain,
q(sk1,sk2) = true,
inference(hyper_resolution,[status(thm)],[hi4,hi2]) ).
cnf(c3,plain,
( p(X3)
| ~ s(X3) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi3,negated_conjecture,
ifeq(s(X0),true,p(X0),true) = true,
inference(equality_encoding,[status(esa)],[c3]) ).
cnf(c1,plain,
s(sk1),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi1,negated_conjecture,
s(sk1) = true,
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(h1,plain,
p(sk1) = true,
inference(hyper_resolution,[status(thm)],[hi3,hi1]) ).
cnf(c5,plain,
( ~ q(X3,X4)
| ~ p(X3) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi5,negated_conjecture,
ifeq(p(X0),true,ifeq(q(X0,X1),true,false,true),true) = true,
inference(equality_encoding,[status(esa)],[c5]) ).
cnf(t0,plain,
true = false,
inference(hyper_resolution,[status(thm)],[hi5,h1,h2]) ).
cnf(t26,plain,
false = true,
inference(orient,[status(thm)],[t0]) ).
cnf(goal_0,negated_conjecture,
true != false,
inference(equality_encoding,[status(esa)],[c5]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t26]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN949+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.03 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.38 % Computer : n001.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Fri Sep 25 02:43:26 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 5.33/1.19 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.33/1.19 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------