%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN962+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 : n018.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:25 PM UTC 2026
% Result : Theorem 5.27s 6.18s
% Output : Proof 5.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 2
% Syntax : Number of formulae : 19 ( 14 unt; 0 def)
% Number of atoms : 28 ( 12 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 18 ( 9 ~; 3 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-4 aty)
% Number of variables : 19 ( 5 sgn 8 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,conjecture,
( ! [X] : p(X)
=> ( ! [Y] : p(Y)
& ! [X] : p(X) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f0_neg,negated_conjecture,
~ ( ! [X] : p(X)
=> ( ! [Y] : p(Y)
& ! [X] : p(X) ) ),
inference(negated_conjecture,[status(cth)],[f0]) ).
fof(f0_nnf,plain,
( ( ? [Y] : ~ p(Y)
| ? [X] : ~ p(X) )
& ! [X] : p(X) ),
inference(nnf_transformation,[status(thm)],[f0_neg]) ).
fof(f0_sk,plain,
! [X] :
( ( ~ p(sk1)
| ~ p(sk0) )
& p(X) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1])],[f0_nnf]) ).
cnf(c1,plain,
( ~ p(sk1)
| ~ p(sk0) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(t2,plain,
ifeq(p(sk0),true,ifeq(p(sk1),true,false,true),true) = true,
inference(equality_encoding,[status(esa)],[c1]) ).
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(t4,plain,
p(X1) = true,
inference(orient,[status(thm)],[t0]) ).
cnf(t6,plain,
ifeq(true,true,ifeq(p(sk1),true,false,true),true) = true,
inference(step,[status(thm)],[t2,t4]) ).
cnf(t1,plain,
ifeq(X1,X1,X2,X3) = X2,
introduced(definition) ).
cnf(t3,plain,
ifeq(X1,X1,X2,X3) = X2,
inference(orient,[status(thm)],[t1]) ).
cnf(t7,plain,
ifeq(p(sk1),true,false,true) = true,
inference(step,[status(thm)],[t6,t3]) ).
cnf(t8,plain,
ifeq(true,true,false,true) = true,
inference(step,[status(thm)],[t7,t4]) ).
cnf(t9,plain,
false = true,
inference(step,[status(thm)],[t8,t3]) ).
cnf(t5,plain,
false = true,
inference(orient,[status(thm)],[t9]) ).
cnf(goal_0,negated_conjecture,
true != false,
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t5]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN962+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/5.39 % Computer : n018.cluster.edu
% 0.10/5.39 % Model : x86_64 x86_64
% 0.10/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.39 % Memory : 8046.5625MB
% 0.10/5.39 % OS : Linux 6.8.0-71-generic
% 0.10/5.39 % CPULimit : 300
% 0.10/5.39 % WCLimit : 300
% 0.10/5.39 % DateTime : Fri Sep 25 02:42:10 UTC 2026
% 0.10/5.40 % CPUTime :
% 0.10/5.40 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 5.27/6.18 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.27/6.18 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------