%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN154-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 : n008.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:33:56 PM UTC 2026
% Result : Unsatisfiable 7.45s 1.72s
% Output : Proof 7.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 35 ( 23 unt; 0 def)
% Number of atoms : 51 ( 11 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 38 ( 22 ~; 16 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 3 ( 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 : 45 ( 15 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f129,axiom,
( ~ p0(C,J)
| ~ n0(B,A)
| q1(J,A,J) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_092) ).
fof(f129_nnf,plain,
! [J,A,B,C] :
( ~ p0(C,J)
| ~ n0(B,A)
| q1(J,A,J) ),
inference(nnf_transformation,[status(thm)],[f129]) ).
fof(f129_sk,plain,
! [J,A,B,C] :
( ~ p0(C,J)
| ~ n0(B,A)
| q1(J,A,J) ),
inference(skolemisation,[status(esa)],[f129_nnf]) ).
cnf(c129,plain,
( ~ p0(X3,X0)
| ~ n0(X2,X1)
| q1(X0,X1,X0) ),
inference(cnf_transformation,[status(esa)],[f129_sk]) ).
cnf(hi127,axiom,
ifeq(n0(X0,X1),true,ifeq(p0(X2,X3),true,q1(X3,X1,X3),true),true) = true,
inference(equality_encoding,[status(esa)],[c129]) ).
cnf(f36,axiom,
n0(b,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_37) ).
fof(f36_nnf,plain,
n0(b,a),
inference(nnf_transformation,[status(thm)],[f36]) ).
cnf(c36,plain,
n0(b,a),
inference(cnf_transformation,[status(esa)],[f36_nnf]) ).
cnf(hi36,axiom,
n0(b,a) = true,
inference(equality_encoding,[status(esa)],[c36]) ).
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(h1,plain,
q1(e,a,e) = true,
inference(hyper_resolution,[status(thm)],[hi127,hi36,hi13]) ).
cnf(f178,axiom,
( ~ q1(B,a,B)
| p2(B,a,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_141) ).
fof(f178_nnf,plain,
! [B] :
( ~ q1(B,a,B)
| p2(B,a,B) ),
inference(nnf_transformation,[status(thm)],[f178]) ).
fof(f178_sk,plain,
! [B] :
( ~ q1(B,a,B)
| p2(B,a,B) ),
inference(skolemisation,[status(esa)],[f178_nnf]) ).
cnf(c178,plain,
( ~ q1(X0,a,X0)
| p2(X0,a,X0) ),
inference(cnf_transformation,[status(esa)],[f178_sk]) ).
cnf(hi175,axiom,
ifeq(q1(X0,a,X0),true,p2(X0,a,X0),true) = true,
inference(equality_encoding,[status(esa)],[c178]) ).
cnf(h2,plain,
p2(e,a,e) = true,
inference(hyper_resolution,[status(thm)],[hi175,h1]) ).
cnf(f277,axiom,
( ~ p2(E,F,D)
| n3(D) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_240) ).
fof(f277_nnf,plain,
! [D,E,F] :
( ~ p2(E,F,D)
| n3(D) ),
inference(nnf_transformation,[status(thm)],[f277]) ).
fof(f277_sk,plain,
! [D,E,F] :
( ~ p2(E,F,D)
| n3(D) ),
inference(skolemisation,[status(esa)],[f277_nnf]) ).
cnf(c277,plain,
( ~ p2(X1,X2,X0)
| n3(X0) ),
inference(cnf_transformation,[status(esa)],[f277_sk]) ).
cnf(hi272,axiom,
ifeq(p2(X0,X1,X2),true,n3(X2),true) = true,
inference(equality_encoding,[status(esa)],[c277]) ).
cnf(t0,plain,
n3(e) = true,
inference(hyper_resolution,[status(thm)],[hi272,h2]) ).
cnf(t626,plain,
n3(e) = true,
inference(orient,[status(thm)],[t0]) ).
cnf(f368,negated_conjecture,
~ n3(e),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f368_nnf,plain,
~ n3(e),
inference(nnf_transformation,[status(thm)],[f368]) ).
fof(f368_sk,plain,
~ n3(e),
inference(skolemisation,[status(esa)],[f368_nnf]) ).
cnf(c368,plain,
~ n3(e),
inference(cnf_transformation,[status(esa)],[f368_sk]) ).
cnf(goal_0,negated_conjecture,
n3(e) != true,
inference(equality_encoding,[status(esa)],[c368]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t626]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN154-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.58 % Computer : n008.cluster.edu
% 0.09/0.58 % Model : x86_64 x86_64
% 0.09/0.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.58 % Memory : 8046.5625MB
% 0.09/0.58 % OS : Linux 6.8.0-71-generic
% 0.09/0.58 % CPULimit : 300
% 0.09/0.58 % WCLimit : 300
% 0.09/0.58 % DateTime : Fri Sep 25 00:21:13 UTC 2026
% 0.09/0.58 % CPUTime :
% 0.09/0.58 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 7.45/1.72 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.45/1.72 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------