%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN732+1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n016.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:35:36 PM UTC 2026
% Result : Theorem 6.10s 1.18s
% Output : Proof 6.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 14 ( 10 unt; 0 def)
% Number of atoms : 30 ( 6 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 27 ( 11 ~; 4 |; 6 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-4 aty)
% Number of variables : 30 ( 6 sgn 14 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,conjecture,
( ! [Y] :
( ! [X] : p(X,Y)
=> ! [U] : q(U,Y) )
=> ? [Z] :
( ? [V] : p(V,Z)
=> ? [W] :
( q(W,Z)
| p(Z,W) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x3411) ).
fof(f0_neg,negated_conjecture,
~ ( ! [Y] :
( ! [X] : p(X,Y)
=> ! [U] : q(U,Y) )
=> ? [Z] :
( ? [V] : p(V,Z)
=> ? [W] :
( q(W,Z)
| p(Z,W) ) ) ),
inference(negated_conjecture,[status(cth)],[f0]) ).
fof(f0_nnf,plain,
( ! [Z] :
( ! [W] :
( ~ q(W,Z)
& ~ p(Z,W) )
& ? [V] : p(V,Z) )
& ! [Y] :
( ! [U] : q(U,Y)
| ? [X] : ~ p(X,Y) ) ),
inference(nnf_transformation,[status(thm)],[f0_neg]) ).
fof(f0_sk,plain,
! [Y,U,Z,W] :
( ~ q(W,Z)
& ~ p(Z,W)
& p(sk1(Z),Z)
& ( q(U,Y)
| ~ p(sk0(Y),Y) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1])],[f0_nnf]) ).
cnf(c2,plain,
~ p(X3,X5),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi2,negated_conjecture,
ifeq(p(X0,X1),true,false,true) = true,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(c1,plain,
p(sk1(X3),X3),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi1,negated_conjecture,
p(sk1(X0),X0) = true,
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(t0,plain,
true = false,
inference(hyper_resolution,[status(thm)],[hi2,hi1]) ).
cnf(t10,plain,
false = true,
inference(orient,[status(thm)],[t0]) ).
cnf(c3,plain,
~ q(X5,X3),
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,t10]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN732+1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.08/0.36 % Computer : n016.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Fri Sep 25 02:18:28 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 6.10/1.18 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.10/1.18 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------