%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN968+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 : n019.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 2.43s 0.76s
% Output : Proof 2.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 11 ( 7 unt; 0 def)
% Number of atoms : 15 ( 4 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 6 ~; 0 |; 2 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 12 ( 5 sgn 4 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,conjecture,
? [X] :
! [Y] :
( p(X)
=> p(Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f0_neg,negated_conjecture,
~ ? [X] :
! [Y] :
( p(X)
=> p(Y) ),
inference(negated_conjecture,[status(cth)],[f0]) ).
fof(f0_nnf,plain,
! [X] :
? [Y] :
( ~ p(Y)
& p(X) ),
inference(nnf_transformation,[status(thm)],[f0_neg]) ).
fof(f0_sk,plain,
! [X] :
( ~ p(sk0(X))
& p(X) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f0_nnf]) ).
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(t1,plain,
p(X1) = true,
inference(orient,[status(thm)],[t0]) ).
cnf(c1,plain,
~ p(sk0(X0)),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(goal_0,negated_conjecture,
p(sk0(X1)) != true,
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t1]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN968+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.08/0.36 % Computer : n019.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:40:34 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.43/0.76 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.43/0.76 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------