%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN211-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n018.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:05 PM UTC 2026
% Result : Unsatisfiable 6.28s 1.30s
% Output : Proof 6.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 52 ( 28 unt; 0 def)
% Number of atoms : 88 ( 17 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 78 ( 42 ~; 36 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-4 aty)
% Number of variables : 70 ( 21 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f39,axiom,
( ~ n0(H,G)
| l1(G,G) ),
file('/export/starexec/sandbox2/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(f33,axiom,
n0(c,d),
file('/export/starexec/sandbox2/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(h97,plain,
l1(d,d) = true,
inference(hyper_resolution,[status(thm)],[hi39,hi33]) ).
cnf(f109,axiom,
( ~ s0(F)
| ~ s0(G)
| p1(F,F,F) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_072) ).
fof(f109_nnf,plain,
! [F,G] :
( ~ s0(F)
| ~ s0(G)
| p1(F,F,F) ),
inference(nnf_transformation,[status(thm)],[f109]) ).
fof(f109_sk,plain,
! [F,G] :
( ~ s0(F)
| ~ s0(G)
| p1(F,F,F) ),
inference(skolemisation,[status(esa)],[f109_nnf]) ).
cnf(c109,plain,
( ~ s0(X0)
| ~ s0(X1)
| p1(X0,X0,X0) ),
inference(cnf_transformation,[status(esa)],[f109_sk]) ).
cnf(hi108,axiom,
ifeq(s0(X0),true,ifeq(s0(X1),true,p1(X1,X1,X1),true),true) = true,
inference(equality_encoding,[status(esa)],[c109]) ).
cnf(f0,axiom,
s0(d),
file('/export/starexec/sandbox2/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(h1,plain,
p1(d,d,d) = true,
inference(hyper_resolution,[status(thm)],[hi108,hi0,hi0]) ).
cnf(f174,axiom,
( ~ p1(B,C,A)
| n2(A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_137) ).
fof(f174_nnf,plain,
! [A,B,C] :
( ~ p1(B,C,A)
| n2(A) ),
inference(nnf_transformation,[status(thm)],[f174]) ).
fof(f174_sk,plain,
! [A,B,C] :
( ~ p1(B,C,A)
| n2(A) ),
inference(skolemisation,[status(esa)],[f174_nnf]) ).
cnf(c174,plain,
( ~ p1(X1,X2,X0)
| n2(X0) ),
inference(cnf_transformation,[status(esa)],[f174_sk]) ).
cnf(hi171,axiom,
ifeq(p1(X0,X1,X2),true,n2(X2),true) = true,
inference(equality_encoding,[status(esa)],[c174]) ).
cnf(h127,plain,
n2(d) = true,
inference(hyper_resolution,[status(thm)],[hi171,h1]) ).
cnf(f38,axiom,
( ~ n0(J,I)
| k1(I) ),
file('/export/starexec/sandbox2/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(h98,plain,
k1(d) = true,
inference(hyper_resolution,[status(thm)],[hi38,hi33]) ).
cnf(f286,axiom,
( ~ n2(H)
| ~ k1(H)
| p3(H,H,H) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_249) ).
fof(f286_nnf,plain,
! [H] :
( ~ n2(H)
| ~ k1(H)
| p3(H,H,H) ),
inference(nnf_transformation,[status(thm)],[f286]) ).
fof(f286_sk,plain,
! [H] :
( ~ n2(H)
| ~ k1(H)
| p3(H,H,H) ),
inference(skolemisation,[status(esa)],[f286_nnf]) ).
cnf(c286,plain,
( ~ n2(X0)
| ~ k1(X0)
| p3(X0,X0,X0) ),
inference(cnf_transformation,[status(esa)],[f286_sk]) ).
cnf(hi281,axiom,
ifeq(k1(X0),true,ifeq(n2(X0),true,p3(X0,X0,X0),true),true) = true,
inference(equality_encoding,[status(esa)],[c286]) ).
cnf(h190,plain,
p3(d,d,d) = true,
inference(hyper_resolution,[status(thm)],[hi281,h98,h127]) ).
cnf(f336,axiom,
( ~ l1(A,C)
| ~ p3(B,C,D)
| s4(A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_299) ).
fof(f336_nnf,plain,
! [A,B,C,D] :
( ~ l1(A,C)
| ~ p3(B,C,D)
| s4(A) ),
inference(nnf_transformation,[status(thm)],[f336]) ).
fof(f336_sk,plain,
! [A,B,C,D] :
( ~ l1(A,C)
| ~ p3(B,C,D)
| s4(A) ),
inference(skolemisation,[status(esa)],[f336_nnf]) ).
cnf(c336,plain,
( ~ l1(X0,X2)
| ~ p3(X1,X2,X3)
| s4(X0) ),
inference(cnf_transformation,[status(esa)],[f336_sk]) ).
cnf(hi329,axiom,
ifeq(p3(X0,X1,X2),true,ifeq(l1(X3,X1),true,s4(X3),true),true) = true,
inference(equality_encoding,[status(esa)],[c336]) ).
cnf(t23,plain,
s4(d) = true,
inference(hyper_resolution,[status(thm)],[hi329,h190,h97]) ).
cnf(t54,plain,
s4(d) = true,
inference(orient,[status(thm)],[t23]) ).
cnf(f368,negated_conjecture,
~ s4(d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f368_nnf,plain,
~ s4(d),
inference(nnf_transformation,[status(thm)],[f368]) ).
fof(f368_sk,plain,
~ s4(d),
inference(skolemisation,[status(esa)],[f368_nnf]) ).
cnf(c368,plain,
~ s4(d),
inference(cnf_transformation,[status(esa)],[f368_sk]) ).
cnf(goal_0,negated_conjecture,
s4(d) != true,
inference(equality_encoding,[status(esa)],[c368]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t54]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN211-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.11/0.37 % Computer : n018.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Fri Sep 25 00:32:50 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 6.28/1.30 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.28/1.30 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------