%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN926+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/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:20 PM UTC 2026
% Result : Theorem 0.16s 5.94s
% Output : Proof 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 15 ( 10 unt; 0 def)
% Number of atoms : 28 ( 7 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 22 ( 9 ~; 3 |; 8 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-4 aty)
% Number of variables : 12 ( 0 sgn 3 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f0,conjecture,
( ? [X] :
( q(X)
& p(X) )
=> ( ? [X] : q(X)
& ? [X] : p(X) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f0_neg,negated_conjecture,
~ ( ? [X] :
( q(X)
& p(X) )
=> ( ? [X] : q(X)
& ? [X] : p(X) ) ),
inference(negated_conjecture,[status(cth)],[f0]) ).
fof(f0_nnf,plain,
( ( ! [X] : ~ q(X)
| ! [X] : ~ p(X) )
& ? [X] :
( q(X)
& p(X) ) ),
inference(nnf_transformation,[status(thm)],[f0_neg]) ).
fof(f0_sk,plain,
! [X] :
( ( ~ q(X)
| ~ p(X) )
& q(sk0)
& p(sk0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f0_nnf]) ).
cnf(c2,plain,
( ~ q(X0)
| ~ p(X0) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi2,negated_conjecture,
ifeq(p(X0),true,ifeq(q(X0),true,false,true),true) = true,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(c0,plain,
p(sk0),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi0,negated_conjecture,
p(sk0) = true,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(c1,plain,
q(sk0),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi1,negated_conjecture,
q(sk0) = true,
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(t0,plain,
true = false,
inference(hyper_resolution,[status(thm)],[hi2,hi0,hi1]) ).
cnf(t7,plain,
false = true,
inference(orient,[status(thm)],[t0]) ).
cnf(goal_0,negated_conjecture,
true != false,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t7]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN926+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.12/5.38 % Computer : n001.cluster.edu
% 0.12/5.38 % Model : x86_64 x86_64
% 0.12/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.38 % Memory : 8046.5625MB
% 0.12/5.38 % OS : Linux 6.8.0-71-generic
% 0.12/5.38 % CPULimit : 300
% 0.12/5.38 % WCLimit : 300
% 0.12/5.38 % DateTime : Fri Sep 25 02:41:00 UTC 2026
% 0.12/5.39 % CPUTime :
% 0.12/5.39 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.16/5.94 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/5.94 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------