%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN062-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 : n007.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:39 PM UTC 2026
% Result : Unsatisfiable 5.23s 1.17s
% Output : Proof 5.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 34 ( 22 unt; 0 def)
% Number of atoms : 54 ( 11 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 46 ( 26 ~; 20 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-4 aty)
% Number of variables : 15 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f3,axiom,
( big_h(X)
| ~ big_k(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).
fof(f3_nnf,plain,
! [X] :
( big_h(X)
| ~ big_k(X) ),
inference(nnf_transformation,[status(thm)],[f3]) ).
fof(f3_sk,plain,
! [X] :
( big_h(X)
| ~ big_k(X) ),
inference(skolemisation,[status(esa)],[f3_nnf]) ).
cnf(c3,plain,
( big_h(X0)
| ~ big_k(X0) ),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(hi3,axiom,
ifeq(big_k(X0),true,big_h(X0),true) = true,
inference(equality_encoding,[status(esa)],[c3]) ).
cnf(f5,negated_conjecture,
big_k(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
fof(f5_nnf,plain,
big_k(a),
inference(nnf_transformation,[status(thm)],[f5]) ).
cnf(c5,plain,
big_k(a),
inference(cnf_transformation,[status(esa)],[f5_nnf]) ).
cnf(hi5,negated_conjecture,
big_k(a) = true,
inference(equality_encoding,[status(esa)],[c5]) ).
cnf(h0,plain,
big_h(a) = true,
inference(hyper_resolution,[status(thm)],[hi3,hi5]) ).
cnf(f1,axiom,
( big_i(X)
| ~ big_h(X)
| ~ big_f(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).
fof(f1_nnf,plain,
! [X] :
( big_i(X)
| ~ big_h(X)
| ~ big_f(X) ),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [X] :
( big_i(X)
| ~ big_h(X)
| ~ big_f(X) ),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c1,plain,
( big_i(X0)
| ~ big_h(X0)
| ~ big_f(X0) ),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(hi1,axiom,
ifeq(big_f(X0),true,ifeq(big_h(X0),true,big_i(X0),true),true) = true,
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(f4,negated_conjecture,
big_f(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).
fof(f4_nnf,plain,
big_f(a),
inference(nnf_transformation,[status(thm)],[f4]) ).
cnf(c4,plain,
big_f(a),
inference(cnf_transformation,[status(esa)],[f4_nnf]) ).
cnf(hi4,negated_conjecture,
big_f(a) = true,
inference(equality_encoding,[status(esa)],[c4]) ).
cnf(h1,plain,
big_i(a) = true,
inference(hyper_resolution,[status(thm)],[hi1,hi4,h0]) ).
cnf(f2,axiom,
( big_j(X)
| ~ big_h(X)
| ~ big_i(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).
fof(f2_nnf,plain,
! [X] :
( big_j(X)
| ~ big_h(X)
| ~ big_i(X) ),
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
! [X] :
( big_j(X)
| ~ big_h(X)
| ~ big_i(X) ),
inference(skolemisation,[status(esa)],[f2_nnf]) ).
cnf(c2,plain,
( big_j(X0)
| ~ big_h(X0)
| ~ big_i(X0) ),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(hi2,axiom,
ifeq(big_i(X0),true,ifeq(big_h(X0),true,big_j(X0),true),true) = true,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(t3,plain,
big_j(a) = true,
inference(hyper_resolution,[status(thm)],[hi2,h1,h0]) ).
cnf(t26,plain,
big_j(a) = true,
inference(orient,[status(thm)],[t3]) ).
cnf(f6,negated_conjecture,
~ big_j(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).
fof(f6_nnf,plain,
~ big_j(a),
inference(nnf_transformation,[status(thm)],[f6]) ).
fof(f6_sk,plain,
~ big_j(a),
inference(skolemisation,[status(esa)],[f6_nnf]) ).
cnf(c6,plain,
~ big_j(a),
inference(cnf_transformation,[status(esa)],[f6_sk]) ).
cnf(goal_0,negated_conjecture,
big_j(a) != true,
inference(equality_encoding,[status(esa)],[c6]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t26]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN062-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.37 % Computer : n007.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Thu Sep 24 23:58:39 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 5.23/1.17 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.23/1.17 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------