%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN285-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 : n015.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:15 PM UTC 2026
% Result : Unsatisfiable 3.21s 0.89s
% Output : Proof 3.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 36 ( 28 unt; 0 def)
% Number of atoms : 56 ( 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 : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-4 aty)
% Number of variables : 25 ( 0 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f142,axiom,
( ~ p0(D,d)
| ~ s0(C)
| q1(C,C,D) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_105) ).
fof(f142_nnf,plain,
! [C,D] :
( ~ p0(D,d)
| ~ s0(C)
| q1(C,C,D) ),
inference(nnf_transformation,[status(thm)],[f142]) ).
fof(f142_sk,plain,
! [C,D] :
( ~ p0(D,d)
| ~ s0(C)
| q1(C,C,D) ),
inference(skolemisation,[status(esa)],[f142_nnf]) ).
cnf(c142,plain,
( ~ p0(X1,d)
| ~ s0(X0)
| q1(X0,X0,X1) ),
inference(cnf_transformation,[status(esa)],[f142_sk]) ).
cnf(hi140,axiom,
ifeq(s0(X0),true,ifeq(p0(X1,d),true,q1(X0,X0,X1),true),true) = true,
inference(equality_encoding,[status(esa)],[c142]) ).
cnf(f0,axiom,
s0(d),
file('/export/starexec/sandbox/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(f9,axiom,
p0(b,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_10) ).
fof(f9_nnf,plain,
p0(b,d),
inference(nnf_transformation,[status(thm)],[f9]) ).
cnf(c9,plain,
p0(b,d),
inference(cnf_transformation,[status(esa)],[f9_nnf]) ).
cnf(hi9,axiom,
p0(b,d) = true,
inference(equality_encoding,[status(esa)],[c9]) ).
cnf(h17,plain,
q1(d,d,b) = true,
inference(hyper_resolution,[status(thm)],[hi140,hi0,hi9]) ).
cnf(f136,axiom,
( ~ q1(F,F,G)
| ~ l0(E)
| ~ k0(G)
| q1(E,F,F) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_099) ).
fof(f136_nnf,plain,
! [E,F,G] :
( ~ q1(F,F,G)
| ~ l0(E)
| ~ k0(G)
| q1(E,F,F) ),
inference(nnf_transformation,[status(thm)],[f136]) ).
fof(f136_sk,plain,
! [E,F,G] :
( ~ q1(F,F,G)
| ~ l0(E)
| ~ k0(G)
| q1(E,F,F) ),
inference(skolemisation,[status(esa)],[f136_nnf]) ).
cnf(c136,plain,
( ~ q1(X1,X1,X2)
| ~ l0(X0)
| ~ k0(X2)
| q1(X0,X1,X1) ),
inference(cnf_transformation,[status(esa)],[f136_sk]) ).
cnf(hi134,axiom,
ifeq(k0(X0),true,ifeq(l0(X1),true,ifeq(q1(X2,X2,X0),true,q1(X1,X2,X2),true),true),true) = true,
inference(equality_encoding,[status(esa)],[c136]) ).
cnf(f31,axiom,
k0(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_32) ).
fof(f31_nnf,plain,
k0(b),
inference(nnf_transformation,[status(thm)],[f31]) ).
cnf(c31,plain,
k0(b),
inference(cnf_transformation,[status(esa)],[f31_nnf]) ).
cnf(hi31,axiom,
k0(b) = true,
inference(equality_encoding,[status(esa)],[c31]) ).
cnf(f19,axiom,
l0(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_20) ).
fof(f19_nnf,plain,
l0(a),
inference(nnf_transformation,[status(thm)],[f19]) ).
cnf(c19,plain,
l0(a),
inference(cnf_transformation,[status(esa)],[f19_nnf]) ).
cnf(hi19,axiom,
l0(a) = true,
inference(equality_encoding,[status(esa)],[c19]) ).
cnf(t70,plain,
q1(a,d,d) = true,
inference(hyper_resolution,[status(thm)],[hi134,hi31,hi19,h17]) ).
cnf(t122,plain,
q1(a,d,d) = true,
inference(orient,[status(thm)],[t70]) ).
cnf(f368,negated_conjecture,
~ q1(a,d,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f368_nnf,plain,
~ q1(a,d,d),
inference(nnf_transformation,[status(thm)],[f368]) ).
fof(f368_sk,plain,
~ q1(a,d,d),
inference(skolemisation,[status(esa)],[f368_nnf]) ).
cnf(c368,plain,
~ q1(a,d,d),
inference(cnf_transformation,[status(esa)],[f368_sk]) ).
cnf(goal_0,negated_conjecture,
q1(a,d,d) != true,
inference(equality_encoding,[status(esa)],[c368]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t122]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN285-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.37 % Computer : n015.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:46:56 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.21/0.89 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.21/0.89 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------