%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN293-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n003.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:34:16 PM UTC 2026
% Result : Unsatisfiable 6.45s 1.26s
% Output : Proof 6.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 34 ( 26 unt; 0 def)
% Number of atoms : 50 ( 10 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 38 ( 22 ~; 16 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-4 aty)
% Number of variables : 37 ( 11 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f38,axiom,
( ~ n0(J,I)
| k1(I) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_001) ).
fof(f38_nnf,plain,
! [I,J] :
( ~ n0(J,I)
| k1(I) ),
inference(nnf_transformation,[status(thm)],[f38]) ).
fof(f38_sk,plain,
! [I,J] :
( ~ n0(J,I)
| k1(I) ),
inference(skolemisation,[status(esa)],[f38_nnf]) ).
cnf(c38,plain,
( ~ n0(X1,X0)
| k1(X0) ),
inference(cnf_transformation,[status(esa)],[f38_sk]) ).
cnf(hi38,axiom,
ifeq(n0(X0,X1),true,k1(X1),true) = true,
inference(equality_encoding,[status(esa)],[c38]) ).
cnf(f33,axiom,
n0(c,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_34) ).
fof(f33_nnf,plain,
n0(c,d),
inference(nnf_transformation,[status(thm)],[f33]) ).
cnf(c33,plain,
n0(c,d),
inference(cnf_transformation,[status(esa)],[f33_nnf]) ).
cnf(hi33,axiom,
n0(c,d) = true,
inference(equality_encoding,[status(esa)],[c33]) ).
cnf(h98,plain,
k1(d) = true,
inference(hyper_resolution,[status(thm)],[hi38,hi33]) ).
cnf(f146,axiom,
( ~ k1(E)
| ~ q0(F,E)
| ~ p0(G,G)
| q1(E,E,F) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_109) ).
fof(f146_nnf,plain,
! [E,F,G] :
( ~ k1(E)
| ~ q0(F,E)
| ~ p0(G,G)
| q1(E,E,F) ),
inference(nnf_transformation,[status(thm)],[f146]) ).
fof(f146_sk,plain,
! [E,F,G] :
( ~ k1(E)
| ~ q0(F,E)
| ~ p0(G,G)
| q1(E,E,F) ),
inference(skolemisation,[status(esa)],[f146_nnf]) ).
cnf(c146,plain,
( ~ k1(X0)
| ~ q0(X1,X0)
| ~ p0(X2,X2)
| q1(X0,X0,X1) ),
inference(cnf_transformation,[status(esa)],[f146_sk]) ).
cnf(hi144,axiom,
ifeq(p0(X0,X0),true,ifeq(q0(X1,X2),true,ifeq(k1(X2),true,q1(X2,X2,X1),true),true),true) = true,
inference(equality_encoding,[status(esa)],[c146]) ).
cnf(f13,axiom,
p0(b,X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_14) ).
fof(f13_nnf,plain,
! [X] : p0(b,X),
inference(nnf_transformation,[status(thm)],[f13]) ).
fof(f13_sk,plain,
! [X] : p0(b,X),
inference(skolemisation,[status(esa)],[f13_nnf]) ).
cnf(c13,plain,
p0(b,X0),
inference(cnf_transformation,[status(esa)],[f13_sk]) ).
cnf(hi13,axiom,
p0(b,X0) = true,
inference(equality_encoding,[status(esa)],[c13]) ).
cnf(f16,axiom,
q0(X,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_17) ).
fof(f16_nnf,plain,
! [X] : q0(X,d),
inference(nnf_transformation,[status(thm)],[f16]) ).
fof(f16_sk,plain,
! [X] : q0(X,d),
inference(skolemisation,[status(esa)],[f16_nnf]) ).
cnf(c16,plain,
q0(X0,d),
inference(cnf_transformation,[status(esa)],[f16_sk]) ).
cnf(hi16,axiom,
q0(X0,d) = true,
inference(equality_encoding,[status(esa)],[c16]) ).
cnf(t80,plain,
q1(d,d,X1) = true,
inference(hyper_resolution,[status(thm)],[hi144,hi13,hi16,h98]) ).
cnf(t106,plain,
q1(d,d,X1) = true,
inference(orient,[status(thm)],[t80]) ).
cnf(f368,negated_conjecture,
~ q1(d,d,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f368_nnf,plain,
~ q1(d,d,a),
inference(nnf_transformation,[status(thm)],[f368]) ).
fof(f368_sk,plain,
~ q1(d,d,a),
inference(skolemisation,[status(esa)],[f368_nnf]) ).
cnf(c368,plain,
~ q1(d,d,a),
inference(cnf_transformation,[status(esa)],[f368_sk]) ).
cnf(goal_0,negated_conjecture,
q1(d,d,a) != true,
inference(equality_encoding,[status(esa)],[c368]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t106]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN293-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.36 % Computer : n003.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Fri Sep 25 00:46:53 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 6.45/1.26 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.45/1.26 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------