%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN236-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 : n014.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:08 PM UTC 2026
% Result : Unsatisfiable 7.64s 11.74s
% Output : Proof 7.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 56 ( 36 unt; 0 def)
% Number of atoms : 88 ( 17 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 70 ( 38 ~; 32 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-4 aty)
% Number of variables : 51 ( 19 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f39,axiom,
( ~ n0(H,G)
| l1(G,G) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_002) ).
fof(f39_nnf,plain,
! [G,H] :
( ~ n0(H,G)
| l1(G,G) ),
inference(nnf_transformation,[status(thm)],[f39]) ).
fof(f39_sk,plain,
! [G,H] :
( ~ n0(H,G)
| l1(G,G) ),
inference(skolemisation,[status(esa)],[f39_nnf]) ).
cnf(c39,plain,
( ~ n0(X1,X0)
| l1(X0,X0) ),
inference(cnf_transformation,[status(esa)],[f39_sk]) ).
cnf(hi39,axiom,
ifeq(n0(X0,X1),true,l1(X1,X1),true) = true,
inference(equality_encoding,[status(esa)],[c39]) ).
cnf(f2,axiom,
n0(d,e),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(f2_nnf,plain,
n0(d,e),
inference(nnf_transformation,[status(thm)],[f2]) ).
cnf(c2,plain,
n0(d,e),
inference(cnf_transformation,[status(esa)],[f2_nnf]) ).
cnf(hi2,axiom,
n0(d,e) = true,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(h25,plain,
l1(e,e) = true,
inference(hyper_resolution,[status(thm)],[hi39,hi2]) ).
cnf(f162,axiom,
( ~ p0(I,I)
| s1(I) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_125) ).
fof(f162_nnf,plain,
! [I] :
( ~ p0(I,I)
| s1(I) ),
inference(nnf_transformation,[status(thm)],[f162]) ).
fof(f162_sk,plain,
! [I] :
( ~ p0(I,I)
| s1(I) ),
inference(skolemisation,[status(esa)],[f162_nnf]) ).
cnf(c162,plain,
( ~ p0(X0,X0)
| s1(X0) ),
inference(cnf_transformation,[status(esa)],[f162_sk]) ).
cnf(hi160,axiom,
ifeq(p0(X0,X0),true,s1(X0),true) = true,
inference(equality_encoding,[status(esa)],[c162]) ).
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(h34,plain,
s1(b) = true,
inference(hyper_resolution,[status(thm)],[hi160,hi13]) ).
cnf(f163,axiom,
( ~ s1(H)
| ~ q0(F,G)
| s1(F) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_126) ).
fof(f163_nnf,plain,
! [F,G,H] :
( ~ s1(H)
| ~ q0(F,G)
| s1(F) ),
inference(nnf_transformation,[status(thm)],[f163]) ).
fof(f163_sk,plain,
! [F,G,H] :
( ~ s1(H)
| ~ q0(F,G)
| s1(F) ),
inference(skolemisation,[status(esa)],[f163_nnf]) ).
cnf(c163,plain,
( ~ s1(X2)
| ~ q0(X0,X1)
| s1(X0) ),
inference(cnf_transformation,[status(esa)],[f163_sk]) ).
cnf(hi161,axiom,
ifeq(q0(X0,X1),true,ifeq(s1(X2),true,s1(X0),true),true) = true,
inference(equality_encoding,[status(esa)],[c163]) ).
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(h51,plain,
s1(V0) = true,
inference(hyper_resolution,[status(thm)],[hi161,hi16,h34]) ).
cnf(f227,axiom,
( ~ s0(d)
| ~ s1(a)
| s2(d) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_190) ).
fof(f227_nnf,plain,
( ~ s0(d)
| ~ s1(a)
| s2(d) ),
inference(nnf_transformation,[status(thm)],[f227]) ).
fof(f227_sk,plain,
( ~ s0(d)
| ~ s1(a)
| s2(d) ),
inference(skolemisation,[status(esa)],[f227_nnf]) ).
cnf(c227,plain,
( ~ s0(d)
| ~ s1(a)
| s2(d) ),
inference(cnf_transformation,[status(esa)],[f227_sk]) ).
cnf(hi224,axiom,
ifeq(s1(a),true,ifeq(s0(d),true,s2(d),true),true) = true,
inference(equality_encoding,[status(esa)],[c227]) ).
cnf(f0,axiom,
s0(d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1) ).
fof(f0_nnf,plain,
s0(d),
inference(nnf_transformation,[status(thm)],[f0]) ).
cnf(c0,plain,
s0(d),
inference(cnf_transformation,[status(esa)],[f0_nnf]) ).
cnf(hi0,axiom,
s0(d) = true,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(h55,plain,
s2(d) = true,
inference(hyper_resolution,[status(thm)],[hi224,h51,hi0]) ).
cnf(f257,axiom,
( ~ l1(G,G)
| ~ s2(H)
| l3(G,G) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_220) ).
fof(f257_nnf,plain,
! [G,H] :
( ~ l1(G,G)
| ~ s2(H)
| l3(G,G) ),
inference(nnf_transformation,[status(thm)],[f257]) ).
fof(f257_sk,plain,
! [G,H] :
( ~ l1(G,G)
| ~ s2(H)
| l3(G,G) ),
inference(skolemisation,[status(esa)],[f257_nnf]) ).
cnf(c257,plain,
( ~ l1(X0,X0)
| ~ s2(X1)
| l3(X0,X0) ),
inference(cnf_transformation,[status(esa)],[f257_sk]) ).
cnf(hi252,axiom,
ifeq(s2(X0),true,ifeq(l1(X1,X1),true,l3(X1,X1),true),true) = true,
inference(equality_encoding,[status(esa)],[c257]) ).
cnf(t13,plain,
l3(e,e) = true,
inference(hyper_resolution,[status(thm)],[hi252,h55,h25]) ).
cnf(t219,plain,
l3(e,e) = true,
inference(orient,[status(thm)],[t13]) ).
cnf(f368,negated_conjecture,
~ l3(e,e),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f368_nnf,plain,
~ l3(e,e),
inference(nnf_transformation,[status(thm)],[f368]) ).
fof(f368_sk,plain,
~ l3(e,e),
inference(skolemisation,[status(esa)],[f368_nnf]) ).
cnf(c368,plain,
~ l3(e,e),
inference(cnf_transformation,[status(esa)],[f368_sk]) ).
cnf(goal_0,negated_conjecture,
l3(e,e) != true,
inference(equality_encoding,[status(esa)],[c368]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t219]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN236-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.03 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/10.59 % Computer : n014.cluster.edu
% 0.10/10.59 % Model : x86_64 x86_64
% 0.10/10.59 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.59 % Memory : 8046.5625MB
% 0.10/10.59 % OS : Linux 6.8.0-71-generic
% 0.10/10.59 % CPULimit : 300
% 0.10/10.59 % WCLimit : 300
% 0.10/10.59 % DateTime : Fri Sep 25 00:34:57 UTC 2026
% 0.13/10.60 % CPUTime :
% 0.13/10.60 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 7.64/11.74 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.64/11.74 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------