%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN188-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 : n004.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:01 PM UTC 2026
% Result : Unsatisfiable 4.45s 6.37s
% Output : Proof 4.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 38 ( 30 unt; 0 def)
% Number of atoms : 58 ( 11 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 46 ( 26 ~; 20 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-4 aty)
% Number of variables : 43 ( 14 sgn 16 !; 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(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(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(h71,plain,
q1(V0,d,V0) = true,
inference(hyper_resolution,[status(thm)],[hi127,hi33,hi13]) ).
cnf(f161,axiom,
( ~ q1(d,E,d)
| ~ s0(d)
| ~ q0(D,E)
| r1(D) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_124) ).
fof(f161_nnf,plain,
! [D,E] :
( ~ q1(d,E,d)
| ~ s0(d)
| ~ q0(D,E)
| r1(D) ),
inference(nnf_transformation,[status(thm)],[f161]) ).
fof(f161_sk,plain,
! [D,E] :
( ~ q1(d,E,d)
| ~ s0(d)
| ~ q0(D,E)
| r1(D) ),
inference(skolemisation,[status(esa)],[f161_nnf]) ).
cnf(c161,plain,
( ~ q1(d,X1,d)
| ~ s0(d)
| ~ q0(X0,X1)
| r1(X0) ),
inference(cnf_transformation,[status(esa)],[f161_sk]) ).
cnf(hi159,axiom,
ifeq(q0(X0,X1),true,ifeq(s0(d),true,ifeq(q1(d,X1,d),true,r1(X0),true),true),true) = true,
inference(equality_encoding,[status(esa)],[c161]) ).
cnf(f16,axiom,
q0(X,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_17) ).
fof(f16_nnf,plain,
! [X] : q0(X,d),
inference(nnf_transformation,[status(thm)],[f16]) ).
fof(f16_sk,plain,
! [X] : q0(X,d),
inference(skolemisation,[status(esa)],[f16_nnf]) ).
cnf(c16,plain,
q0(X0,d),
inference(cnf_transformation,[status(esa)],[f16_sk]) ).
cnf(hi16,axiom,
q0(X0,d) = true,
inference(equality_encoding,[status(esa)],[c16]) ).
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(t0,plain,
r1(X1) = true,
inference(hyper_resolution,[status(thm)],[hi159,hi16,hi0,h71]) ).
cnf(t388,plain,
r1(X1) = true,
inference(orient,[status(thm)],[t0]) ).
cnf(f368,negated_conjecture,
~ r1(e),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f368_nnf,plain,
~ r1(e),
inference(nnf_transformation,[status(thm)],[f368]) ).
fof(f368_sk,plain,
~ r1(e),
inference(skolemisation,[status(esa)],[f368_nnf]) ).
cnf(c368,plain,
~ r1(e),
inference(cnf_transformation,[status(esa)],[f368_sk]) ).
cnf(goal_0,negated_conjecture,
r1(e) != true,
inference(equality_encoding,[status(esa)],[c368]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t388]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN188-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/5.59 % Computer : n004.cluster.edu
% 0.10/5.59 % Model : x86_64 x86_64
% 0.10/5.59 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.59 % Memory : 8046.5625MB
% 0.10/5.59 % OS : Linux 6.8.0-71-generic
% 0.10/5.59 % CPULimit : 300
% 0.10/5.59 % WCLimit : 300
% 0.10/5.59 % DateTime : Fri Sep 25 00:26:27 UTC 2026
% 0.10/5.59 % CPUTime :
% 0.10/5.59 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.45/6.37 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.45/6.37 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------