%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN216-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 : n020.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 8.35s 1.72s
% Output : Proof 8.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 22 unt; 0 def)
% Number of atoms : 46 ( 9 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 38 ( 22 ~; 16 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-4 aty)
% Number of variables : 35 ( 9 sgn 14 !; 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(h0,plain,
s1(b) = true,
inference(hyper_resolution,[status(thm)],[hi160,hi13]) ).
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(f11,axiom,
m0(a,X,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_12) ).
fof(f11_nnf,plain,
! [X] : m0(a,X,a),
inference(nnf_transformation,[status(thm)],[f11]) ).
fof(f11_sk,plain,
! [X] : m0(a,X,a),
inference(skolemisation,[status(esa)],[f11_nnf]) ).
cnf(c11,plain,
m0(a,X0,a),
inference(cnf_transformation,[status(esa)],[f11_sk]) ).
cnf(hi11,axiom,
m0(a,X0,a) = true,
inference(equality_encoding,[status(esa)],[c11]) ).
cnf(t8,plain,
l2(a,a) = true,
inference(hyper_resolution,[status(thm)],[hi167,hi13,h0,hi11]) ).
cnf(t913,plain,
l2(a,a) = true,
inference(orient,[status(thm)],[t8]) ).
cnf(f368,negated_conjecture,
~ l2(a,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f368_nnf,plain,
~ l2(a,a),
inference(nnf_transformation,[status(thm)],[f368]) ).
fof(f368_sk,plain,
~ l2(a,a),
inference(skolemisation,[status(esa)],[f368_nnf]) ).
cnf(c368,plain,
~ l2(a,a),
inference(cnf_transformation,[status(esa)],[f368_sk]) ).
cnf(goal_0,negated_conjecture,
l2(a,a) != true,
inference(equality_encoding,[status(esa)],[c368]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t913]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN216-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.03 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.08/0.34 % Computer : n020.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.34 % DateTime : Fri Sep 25 00:32:48 UTC 2026
% 0.08/0.34 % CPUTime :
% 0.08/0.34 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 8.35/1.72 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.35/1.72 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------