%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN262-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 : n012.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:12 PM UTC 2026
% Result : Unsatisfiable 3.46s 0.83s
% Output : Proof 3.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 39 ( 31 unt; 0 def)
% Number of atoms : 59 ( 14 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 46 ( 26 ~; 20 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-4 aty)
% Number of variables : 30 ( 6 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f4,axiom,
s0(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(f4_nnf,plain,
s0(b),
inference(nnf_transformation,[status(thm)],[f4]) ).
cnf(c4,plain,
s0(b),
inference(cnf_transformation,[status(esa)],[f4_nnf]) ).
cnf(hi4,axiom,
s0(b) = true,
inference(equality_encoding,[status(esa)],[c4]) ).
cnf(h0,plain,
s0(b) = true,
inference(hyper_resolution,[status(thm)],[hi4]) ).
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(h2,plain,
k0(b) = true,
inference(hyper_resolution,[status(thm)],[hi31]) ).
cnf(f25,axiom,
n0(d,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_26) ).
fof(f25_nnf,plain,
n0(d,c),
inference(nnf_transformation,[status(thm)],[f25]) ).
cnf(c25,plain,
n0(d,c),
inference(cnf_transformation,[status(esa)],[f25_nnf]) ).
cnf(hi25,axiom,
n0(d,c) = true,
inference(equality_encoding,[status(esa)],[c25]) ).
cnf(h1,plain,
n0(d,c) = true,
inference(hyper_resolution,[status(thm)],[hi25]) ).
cnf(f100,axiom,
( ~ k0(E)
| ~ n0(d,D)
| p1(D,D,E) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_063) ).
fof(f100_nnf,plain,
! [D,E] :
( ~ k0(E)
| ~ n0(d,D)
| p1(D,D,E) ),
inference(nnf_transformation,[status(thm)],[f100]) ).
fof(f100_sk,plain,
! [D,E] :
( ~ k0(E)
| ~ n0(d,D)
| p1(D,D,E) ),
inference(skolemisation,[status(esa)],[f100_nnf]) ).
cnf(c100,plain,
( ~ k0(X1)
| ~ n0(d,X0)
| p1(X0,X0,X1) ),
inference(cnf_transformation,[status(esa)],[f100_sk]) ).
cnf(hi99,axiom,
ifeq(n0(d,X0),true,ifeq(k0(X1),true,p1(X0,X0,X1),true),true) = true,
inference(equality_encoding,[status(esa)],[c100]) ).
cnf(h3,plain,
p1(c,c,b) = true,
inference(hyper_resolution,[status(thm)],[hi99,h1,h2]) ).
cnf(f108,axiom,
( ~ s0(b)
| ~ p1(I,A,H)
| ~ l0(J)
| p1(H,I,H) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_071) ).
fof(f108_nnf,plain,
! [H,I,J,A] :
( ~ s0(b)
| ~ p1(I,A,H)
| ~ l0(J)
| p1(H,I,H) ),
inference(nnf_transformation,[status(thm)],[f108]) ).
fof(f108_sk,plain,
! [H,I,J,A] :
( ~ s0(b)
| ~ p1(I,A,H)
| ~ l0(J)
| p1(H,I,H) ),
inference(skolemisation,[status(esa)],[f108_nnf]) ).
cnf(c108,plain,
( ~ s0(b)
| ~ p1(X1,X3,X0)
| ~ l0(X2)
| p1(X0,X1,X0) ),
inference(cnf_transformation,[status(esa)],[f108_sk]) ).
cnf(hi107,axiom,
ifeq(l0(X0),true,ifeq(p1(X1,X2,X3),true,ifeq(s0(b),true,p1(X3,X1,X3),true),true),true) = true,
inference(equality_encoding,[status(esa)],[c108]) ).
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(t5,plain,
p1(b,c,b) = true,
inference(hyper_resolution,[status(thm)],[hi107,hi19,h3,h0]) ).
cnf(t42,plain,
p1(b,c,b) = true,
inference(orient,[status(thm)],[t5]) ).
cnf(f368,negated_conjecture,
~ p1(b,c,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f368_nnf,plain,
~ p1(b,c,b),
inference(nnf_transformation,[status(thm)],[f368]) ).
fof(f368_sk,plain,
~ p1(b,c,b),
inference(skolemisation,[status(esa)],[f368_nnf]) ).
cnf(c368,plain,
~ p1(b,c,b),
inference(cnf_transformation,[status(esa)],[f368_sk]) ).
cnf(goal_0,negated_conjecture,
p1(b,c,b) != true,
inference(equality_encoding,[status(esa)],[c368]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t42]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SYN262-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.02 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.04/0.30 % Computer : n012.cluster.edu
% 0.04/0.30 % Model : x86_64 x86_64
% 0.04/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30 % Memory : 8046.5625MB
% 0.04/0.30 % OS : Linux 6.8.0-71-generic
% 0.04/0.30 % CPULimit : 300
% 0.04/0.30 % WCLimit : 300
% 0.04/0.30 % DateTime : Fri Sep 25 00:39:21 UTC 2026
% 0.04/0.30 % CPUTime :
% 0.04/0.30 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.46/0.83 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.46/0.83 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------