%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN220-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 : n026.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:06 PM UTC 2026
% Result : Unsatisfiable 7.54s 1.49s
% Output : Proof 7.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 53 ( 33 unt; 0 def)
% Number of atoms : 81 ( 22 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 62 ( 34 ~; 28 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-4 aty)
% Number of variables : 48 ( 16 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f368,negated_conjecture,
~ l3(X,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f368_nnf,plain,
! [X] : ~ l3(X,b),
inference(nnf_transformation,[status(thm)],[f368]) ).
fof(f368_sk,plain,
! [X] : ~ l3(X,b),
inference(skolemisation,[status(esa)],[f368_nnf]) ).
cnf(c368,plain,
~ l3(X0,b),
inference(cnf_transformation,[status(esa)],[f368_sk]) ).
cnf(t152,plain,
eq(l3(X1,b),true) = efalse,
inference(equality_encoding,[status(esa)],[c368]) ).
cnf(t354,plain,
eq(l3(X1,b),true) = efalse,
inference(orient,[status(thm)],[t152]) ).
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(f6,axiom,
n0(d,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
fof(f6_nnf,plain,
n0(d,b),
inference(nnf_transformation,[status(thm)],[f6]) ).
cnf(c6,plain,
n0(d,b),
inference(cnf_transformation,[status(esa)],[f6_nnf]) ).
cnf(hi6,axiom,
n0(d,b) = true,
inference(equality_encoding,[status(esa)],[c6]) ).
cnf(h30,plain,
k1(b) = true,
inference(hyper_resolution,[status(thm)],[hi38,hi6]) ).
cnf(f173,axiom,
( ~ k1(b)
| m2(b) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_136) ).
fof(f173_nnf,plain,
( ~ k1(b)
| m2(b) ),
inference(nnf_transformation,[status(thm)],[f173]) ).
fof(f173_sk,plain,
( ~ k1(b)
| m2(b) ),
inference(skolemisation,[status(esa)],[f173_nnf]) ).
cnf(c173,plain,
( ~ k1(b)
| m2(b) ),
inference(cnf_transformation,[status(esa)],[f173_sk]) ).
cnf(hi170,axiom,
ifeq(k1(b),true,m2(b),true) = true,
inference(equality_encoding,[status(esa)],[c173]) ).
cnf(h32,plain,
m2(b) = true,
inference(hyper_resolution,[status(thm)],[hi170,h30]) ).
cnf(f109,axiom,
( ~ s0(F)
| ~ s0(G)
| p1(F,F,F) ),
file('/export/starexec/sandbox/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(f4,axiom,
s0(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(f4_nnf,plain,
s0(b),
inference(nnf_transformation,[status(thm)],[f4]) ).
cnf(c4,plain,
s0(b),
inference(cnf_transformation,[status(esa)],[f4_nnf]) ).
cnf(hi4,axiom,
s0(b) = true,
inference(equality_encoding,[status(esa)],[c4]) ).
cnf(h5,plain,
p1(b,b,b) = true,
inference(hyper_resolution,[status(thm)],[hi108,hi4,hi4]) ).
cnf(f174,axiom,
( ~ p1(B,C,A)
| n2(A) ),
file('/export/starexec/sandbox/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(h202,plain,
n2(b) = true,
inference(hyper_resolution,[status(thm)],[hi171,h5]) ).
cnf(f254,axiom,
( ~ m2(b)
| ~ n2(C)
| l3(C,C) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_217) ).
fof(f254_nnf,plain,
! [C] :
( ~ m2(b)
| ~ n2(C)
| l3(C,C) ),
inference(nnf_transformation,[status(thm)],[f254]) ).
fof(f254_sk,plain,
! [C] :
( ~ m2(b)
| ~ n2(C)
| l3(C,C) ),
inference(skolemisation,[status(esa)],[f254_nnf]) ).
cnf(c254,plain,
( ~ m2(b)
| ~ n2(X0)
| l3(X0,X0) ),
inference(cnf_transformation,[status(esa)],[f254_sk]) ).
cnf(hi249,axiom,
ifeq(n2(X0),true,ifeq(m2(b),true,l3(X0,X0),true),true) = true,
inference(equality_encoding,[status(esa)],[c254]) ).
cnf(t37,plain,
l3(b,b) = true,
inference(hyper_resolution,[status(thm)],[hi249,h202,h32]) ).
cnf(t302,plain,
l3(b,b) = true,
inference(orient,[status(thm)],[t37]) ).
cnf(t355,plain,
efalse = eq(true,true),
inference(cp,[status(thm)],[t354,t302]) ).
cnf(t13,plain,
eq(X1,X1) = etrue,
introduced(definition) ).
cnf(t353,plain,
eq(X1,X1) = etrue,
inference(orient,[status(thm)],[t13]) ).
cnf(t370,plain,
efalse = etrue,
inference(step,[status(thm)],[t355,t353]) ).
cnf(t356,plain,
efalse = etrue,
inference(orient,[status(thm)],[t370]) ).
cnf(goal_0,negated_conjecture,
etrue != efalse,
introduced(definition) ).
cnf(g0_0,plain,
etrue != etrue,
inference(rw,[status(thm)],[goal_0,t356]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN220-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.11/0.37 % Computer : n026.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:34:54 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 7.54/1.49 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.54/1.49 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------