%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN058-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n005.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:33:38 PM UTC 2026
% Result : Unsatisfiable 3.99s 0.94s
% Output : Proof 3.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 35 ( 23 unt; 0 def)
% Number of atoms : 51 ( 12 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 38 ( 22 ~; 16 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-4 aty)
% Number of variables : 20 ( 9 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f7,negated_conjecture,
big_f(d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_8) ).
fof(f7_nnf,plain,
big_f(d),
inference(nnf_transformation,[status(thm)],[f7]) ).
cnf(c7,plain,
big_f(d),
inference(cnf_transformation,[status(esa)],[f7_nnf]) ).
cnf(hi7,negated_conjecture,
big_f(d) = true,
inference(equality_encoding,[status(esa)],[c7]) ).
cnf(h0,plain,
big_f(d) = true,
inference(hyper_resolution,[status(thm)],[hi7]) ).
cnf(f0,axiom,
( big_q(Y)
| ~ big_p(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).
fof(f0_nnf,plain,
! [X,Y] :
( big_q(Y)
| ~ big_p(X) ),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [X,Y] :
( big_q(Y)
| ~ big_p(X) ),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
( big_q(X1)
| ~ big_p(X0) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi0,axiom,
ifeq(big_p(X0),true,big_q(X1),true) = true,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(f6,negated_conjecture,
big_p(d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).
fof(f6_nnf,plain,
big_p(d),
inference(nnf_transformation,[status(thm)],[f6]) ).
cnf(c6,plain,
big_p(d),
inference(cnf_transformation,[status(esa)],[f6_nnf]) ).
cnf(hi6,negated_conjecture,
big_p(d) = true,
inference(equality_encoding,[status(esa)],[c6]) ).
cnf(h1,plain,
big_q(b) = true,
inference(hyper_resolution,[status(thm)],[hi0,hi6]) ).
cnf(f2,axiom,
( big_s(c)
| ~ big_q(b) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).
fof(f2_nnf,plain,
( big_s(c)
| ~ big_q(b) ),
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
( big_s(c)
| ~ big_q(b) ),
inference(skolemisation,[status(esa)],[f2_nnf]) ).
cnf(c2,plain,
( big_s(c)
| ~ big_q(b) ),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(hi2,axiom,
ifeq(big_q(b),true,big_s(c),true) = true,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(h2,plain,
big_s(c) = true,
inference(hyper_resolution,[status(thm)],[hi2,h1]) ).
cnf(f5,axiom,
( big_g(X)
| ~ big_f(X)
| ~ big_s(Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
fof(f5_nnf,plain,
! [Y,X] :
( big_g(X)
| ~ big_f(X)
| ~ big_s(Y) ),
inference(nnf_transformation,[status(thm)],[f5]) ).
fof(f5_sk,plain,
! [Y,X] :
( big_g(X)
| ~ big_f(X)
| ~ big_s(Y) ),
inference(skolemisation,[status(esa)],[f5_nnf]) ).
cnf(c5,plain,
( big_g(X1)
| ~ big_f(X1)
| ~ big_s(X0) ),
inference(cnf_transformation,[status(esa)],[f5_sk]) ).
cnf(hi5,axiom,
ifeq(big_s(X0),true,ifeq(big_f(X1),true,big_g(X1),true),true) = true,
inference(equality_encoding,[status(esa)],[c5]) ).
cnf(t1,plain,
big_g(d) = true,
inference(hyper_resolution,[status(thm)],[hi5,h2,h0]) ).
cnf(t21,plain,
big_g(d) = true,
inference(orient,[status(thm)],[t1]) ).
cnf(f8,negated_conjecture,
~ big_g(d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_9) ).
fof(f8_nnf,plain,
~ big_g(d),
inference(nnf_transformation,[status(thm)],[f8]) ).
fof(f8_sk,plain,
~ big_g(d),
inference(skolemisation,[status(esa)],[f8_nnf]) ).
cnf(c8,plain,
~ big_g(d),
inference(cnf_transformation,[status(esa)],[f8_sk]) ).
cnf(goal_0,negated_conjecture,
big_g(d) != true,
inference(equality_encoding,[status(esa)],[c8]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t21]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN058-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.12/0.38 % Computer : n005.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Fri Sep 25 00:00:17 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.99/0.94 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.99/0.94 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------