%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN947+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 3.47s 0.98s
% Output : Proof 3.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of formulae : 20 ( 16 unt; 0 def)
% Number of atoms : 32 ( 12 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 21 ( 9 ~; 2 |; 8 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-4 aty)
% Number of variables : 27 ( 9 sgn 8 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,conjecture,
( ! [X] :
? [Y] :
( q(Y)
& p(X) )
=> ? [Z] :
! [Y] :
( r(Z)
| p(Y) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f0_neg,negated_conjecture,
~ ( ! [X] :
? [Y] :
( q(Y)
& p(X) )
=> ? [Z] :
! [Y] :
( r(Z)
| p(Y) ) ),
inference(negated_conjecture,[status(cth)],[f0]) ).
fof(f0_nnf,plain,
( ! [Z] :
? [Y] :
( ~ r(Z)
& ~ p(Y) )
& ! [X] :
? [Y] :
( q(Y)
& p(X) ) ),
inference(nnf_transformation,[status(thm)],[f0_neg]) ).
fof(f0_sk,plain,
! [X,Z] :
( ~ r(Z)
& ~ p(sk1(Z))
& q(sk0(X))
& p(X) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1])],[f0_nnf]) ).
cnf(c2,plain,
~ p(sk1(X2)),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(t4,plain,
ifeq(p(sk1(X1)),true,false,true) = true,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(t6,plain,
ifeq(p(sk1(X1)),true,false,true) = true,
inference(orient,[status(thm)],[t4]) ).
cnf(c0,plain,
p(X0),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(t0,plain,
p(X1) = true,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(t8,plain,
p(X1) = true,
inference(orient,[status(thm)],[t0]) ).
cnf(t13,plain,
ifeq(true,true,false,true) = true,
inference(step,[status(thm)],[t6,t8]) ).
cnf(t2,plain,
ifeq(X1,X1,X2,X3) = X2,
introduced(definition) ).
cnf(t5,plain,
ifeq(X1,X1,X2,X3) = X2,
inference(orient,[status(thm)],[t2]) ).
cnf(t14,plain,
false = true,
inference(step,[status(thm)],[t13,t5]) ).
cnf(t9,plain,
false = true,
inference(rw,[status(thm)],[t14]) ).
cnf(t11,plain,
false = true,
inference(orient,[status(thm)],[t9]) ).
cnf(c3,plain,
~ r(X2),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(goal_0,negated_conjecture,
true != false,
inference(equality_encoding,[status(esa)],[c2,c3]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t11]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SYN947+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.06 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.20/0.44 % Computer : n001.cluster.edu
% 0.20/0.44 % Model : x86_64 x86_64
% 0.20/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.44 % Memory : 8046.5625MB
% 0.20/0.44 % OS : Linux 6.8.0-71-generic
% 0.20/0.44 % CPULimit : 300
% 0.20/0.44 % WCLimit : 300
% 0.20/0.45 % DateTime : Fri Sep 25 02:43:54 UTC 2026
% 0.20/0.45 % CPUTime :
% 0.20/0.45 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.47/0.98 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.47/0.98 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------