%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN217-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 : n009.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 5.09s 1.28s
% Output : Proof 5.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 40 ( 28 unt; 0 def)
% Number of atoms : 64 ( 12 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 54 ( 30 ~; 24 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-4 aty)
% Number of variables : 57 ( 18 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f162,axiom,
( ~ p0(I,I)
| s1(I) ),
file('/export/starexec/sandbox2/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/sandbox2/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(h26,plain,
s1(b) = true,
inference(hyper_resolution,[status(thm)],[hi160,hi13]) ).
cnf(f163,axiom,
( ~ s1(H)
| ~ q0(F,G)
| s1(F) ),
file('/export/starexec/sandbox2/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(f32,axiom,
q0(d,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_33) ).
fof(f32_nnf,plain,
q0(d,c),
inference(nnf_transformation,[status(thm)],[f32]) ).
cnf(c32,plain,
q0(d,c),
inference(cnf_transformation,[status(esa)],[f32_nnf]) ).
cnf(hi32,axiom,
q0(d,c) = true,
inference(equality_encoding,[status(esa)],[c32]) ).
cnf(h116,plain,
s1(d) = true,
inference(hyper_resolution,[status(thm)],[hi161,hi32,h26]) ).
cnf(f170,axiom,
( ~ m0(C,B,J)
| ~ s1(B)
| ~ p0(A,A)
| l2(J,J) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_133) ).
fof(f170_nnf,plain,
! [J,A,B,C] :
( ~ m0(C,B,J)
| ~ s1(B)
| ~ p0(A,A)
| l2(J,J) ),
inference(nnf_transformation,[status(thm)],[f170]) ).
fof(f170_sk,plain,
! [J,A,B,C] :
( ~ m0(C,B,J)
| ~ s1(B)
| ~ p0(A,A)
| l2(J,J) ),
inference(skolemisation,[status(esa)],[f170_nnf]) ).
cnf(c170,plain,
( ~ m0(X3,X2,X0)
| ~ s1(X2)
| ~ p0(X1,X1)
| l2(X0,X0) ),
inference(cnf_transformation,[status(esa)],[f170_sk]) ).
cnf(hi167,axiom,
ifeq(p0(X0,X0),true,ifeq(s1(X1),true,ifeq(m0(X2,X1,X3),true,l2(X3,X3),true),true),true) = true,
inference(equality_encoding,[status(esa)],[c170]) ).
cnf(f18,axiom,
m0(X,d,Y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_19) ).
fof(f18_nnf,plain,
! [X,Y] : m0(X,d,Y),
inference(nnf_transformation,[status(thm)],[f18]) ).
fof(f18_sk,plain,
! [X,Y] : m0(X,d,Y),
inference(skolemisation,[status(esa)],[f18_nnf]) ).
cnf(c18,plain,
m0(X0,d,X1),
inference(cnf_transformation,[status(esa)],[f18_sk]) ).
cnf(hi18,axiom,
m0(X0,d,X1) = true,
inference(equality_encoding,[status(esa)],[c18]) ).
cnf(t12,plain,
l2(X1,X1) = true,
inference(hyper_resolution,[status(thm)],[hi167,hi13,h116,hi18]) ).
cnf(t218,plain,
l2(X1,X1) = true,
inference(orient,[status(thm)],[t12]) ).
cnf(f368,negated_conjecture,
~ l2(b,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f368_nnf,plain,
~ l2(b,b),
inference(nnf_transformation,[status(thm)],[f368]) ).
fof(f368_sk,plain,
~ l2(b,b),
inference(skolemisation,[status(esa)],[f368_nnf]) ).
cnf(c368,plain,
~ l2(b,b),
inference(cnf_transformation,[status(esa)],[f368_sk]) ).
cnf(goal_0,negated_conjecture,
l2(b,b) != true,
inference(equality_encoding,[status(esa)],[c368]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t218]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN217-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.37 % Computer : n009.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Fri Sep 25 00:31:58 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 5.09/1.28 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.09/1.28 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------