%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN111-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:33:50 PM UTC 2026
% Result : Unsatisfiable 3.72s 0.88s
% Output : Proof 3.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 54 ( 34 unt; 0 def)
% Number of atoms : 90 ( 17 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 78 ( 42 ~; 36 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-4 aty)
% Number of variables : 55 ( 9 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f156,axiom,
( ~ s0(b)
| ~ s0(B)
| q1(B,b,b) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_119) ).
fof(f156_nnf,plain,
! [B] :
( ~ s0(b)
| ~ s0(B)
| q1(B,b,b) ),
inference(nnf_transformation,[status(thm)],[f156]) ).
fof(f156_sk,plain,
! [B] :
( ~ s0(b)
| ~ s0(B)
| q1(B,b,b) ),
inference(skolemisation,[status(esa)],[f156_nnf]) ).
cnf(c156,plain,
( ~ s0(b)
| ~ s0(X0)
| q1(X0,b,b) ),
inference(cnf_transformation,[status(esa)],[f156_sk]) ).
cnf(hi154,axiom,
ifeq(s0(X0),true,ifeq(s0(b),true,q1(X0,b,b),true),true) = true,
inference(equality_encoding,[status(esa)],[c156]) ).
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(h9,plain,
q1(b,b,b) = true,
inference(hyper_resolution,[status(thm)],[hi154,hi4,hi4]) ).
cnf(f166,axiom,
( ~ q1(A,J,J)
| k2(J,J) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_129) ).
fof(f166_nnf,plain,
! [J,A] :
( ~ q1(A,J,J)
| k2(J,J) ),
inference(nnf_transformation,[status(thm)],[f166]) ).
fof(f166_sk,plain,
! [J,A] :
( ~ q1(A,J,J)
| k2(J,J) ),
inference(skolemisation,[status(esa)],[f166_nnf]) ).
cnf(c166,plain,
( ~ q1(X1,X0,X0)
| k2(X0,X0) ),
inference(cnf_transformation,[status(esa)],[f166_sk]) ).
cnf(hi164,axiom,
ifeq(q1(X0,X1,X1),true,k2(X1,X1),true) = true,
inference(equality_encoding,[status(esa)],[c166]) ).
cnf(h144,plain,
k2(b,b) = true,
inference(hyper_resolution,[status(thm)],[hi164,h9]) ).
cnf(f38,axiom,
( ~ n0(J,I)
| k1(I) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_001) ).
fof(f38_nnf,plain,
! [I,J] :
( ~ n0(J,I)
| k1(I) ),
inference(nnf_transformation,[status(thm)],[f38]) ).
fof(f38_sk,plain,
! [I,J] :
( ~ n0(J,I)
| k1(I) ),
inference(skolemisation,[status(esa)],[f38_nnf]) ).
cnf(c38,plain,
( ~ n0(X1,X0)
| k1(X0) ),
inference(cnf_transformation,[status(esa)],[f38_sk]) ).
cnf(hi38,axiom,
ifeq(n0(X0,X1),true,k1(X1),true) = true,
inference(equality_encoding,[status(esa)],[c38]) ).
cnf(f6,axiom,
n0(d,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
fof(f6_nnf,plain,
n0(d,b),
inference(nnf_transformation,[status(thm)],[f6]) ).
cnf(c6,plain,
n0(d,b),
inference(cnf_transformation,[status(esa)],[f6_nnf]) ).
cnf(hi6,axiom,
n0(d,b) = true,
inference(equality_encoding,[status(esa)],[c6]) ).
cnf(h14,plain,
k1(b) = true,
inference(hyper_resolution,[status(thm)],[hi38,hi6]) ).
cnf(f58,axiom,
( ~ k0(J)
| ~ l0(I)
| m1(I,J,I) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_021) ).
fof(f58_nnf,plain,
! [I,J] :
( ~ k0(J)
| ~ l0(I)
| m1(I,J,I) ),
inference(nnf_transformation,[status(thm)],[f58]) ).
fof(f58_sk,plain,
! [I,J] :
( ~ k0(J)
| ~ l0(I)
| m1(I,J,I) ),
inference(skolemisation,[status(esa)],[f58_nnf]) ).
cnf(c58,plain,
( ~ k0(X1)
| ~ l0(X0)
| m1(X0,X1,X0) ),
inference(cnf_transformation,[status(esa)],[f58_sk]) ).
cnf(hi58,axiom,
ifeq(l0(X0),true,ifeq(k0(X1),true,m1(X0,X1,X0),true),true) = true,
inference(equality_encoding,[status(esa)],[c58]) ).
cnf(f23,axiom,
l0(c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_24) ).
fof(f23_nnf,plain,
l0(c),
inference(nnf_transformation,[status(thm)],[f23]) ).
cnf(c23,plain,
l0(c),
inference(cnf_transformation,[status(esa)],[f23_nnf]) ).
cnf(hi23,axiom,
l0(c) = true,
inference(equality_encoding,[status(esa)],[c23]) ).
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(h88,plain,
m1(c,b,c) = true,
inference(hyper_resolution,[status(thm)],[hi58,hi23,hi31]) ).
cnf(f164,axiom,
( ~ k2(F,D)
| ~ k1(F)
| ~ m1(E,D,C)
| k2(C,D) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_127) ).
fof(f164_nnf,plain,
! [C,D,E,F] :
( ~ k2(F,D)
| ~ k1(F)
| ~ m1(E,D,C)
| k2(C,D) ),
inference(nnf_transformation,[status(thm)],[f164]) ).
fof(f164_sk,plain,
! [C,D,E,F] :
( ~ k2(F,D)
| ~ k1(F)
| ~ m1(E,D,C)
| k2(C,D) ),
inference(skolemisation,[status(esa)],[f164_nnf]) ).
cnf(c164,plain,
( ~ k2(X3,X1)
| ~ k1(X3)
| ~ m1(X2,X1,X0)
| k2(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f164_sk]) ).
cnf(hi162,axiom,
ifeq(m1(X0,X1,X2),true,ifeq(k1(X3),true,ifeq(k2(X3,X1),true,k2(X2,X1),true),true),true) = true,
inference(equality_encoding,[status(esa)],[c164]) ).
cnf(t22,plain,
k2(c,b) = true,
inference(hyper_resolution,[status(thm)],[hi162,h88,h14,h144]) ).
cnf(t332,plain,
k2(c,b) = true,
inference(orient,[status(thm)],[t22]) ).
cnf(f368,negated_conjecture,
~ k2(c,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f368_nnf,plain,
~ k2(c,b),
inference(nnf_transformation,[status(thm)],[f368]) ).
fof(f368_sk,plain,
~ k2(c,b),
inference(skolemisation,[status(esa)],[f368_nnf]) ).
cnf(c368,plain,
~ k2(c,b),
inference(cnf_transformation,[status(esa)],[f368_sk]) ).
cnf(goal_0,negated_conjecture,
k2(c,b) != true,
inference(equality_encoding,[status(esa)],[c368]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t332]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SYN111-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.02 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Fri Sep 25 00:11:50 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.31 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.72/0.88 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.72/0.88 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------