%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN249-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 : n016.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:10 PM UTC 2026
% Result : Unsatisfiable 6.61s 16.32s
% Output : Proof 6.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 33 ( 25 unt; 0 def)
% Number of atoms : 49 ( 11 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 38 ( 22 ~; 16 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-4 aty)
% Number of variables : 20 ( 3 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(f2,axiom,
n0(d,e),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(f2_nnf,plain,
n0(d,e),
inference(nnf_transformation,[status(thm)],[f2]) ).
cnf(c2,plain,
n0(d,e),
inference(cnf_transformation,[status(esa)],[f2_nnf]) ).
cnf(hi2,axiom,
n0(d,e) = true,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(h6,plain,
k1(e) = true,
inference(hyper_resolution,[status(thm)],[hi38,hi2]) ).
cnf(f36,axiom,
n0(b,a),
file('/export/starexec/sandbox/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(h110,plain,
k1(a) = true,
inference(hyper_resolution,[status(thm)],[hi38,hi36]) ).
cnf(f71,axiom,
( ~ q0(A,A)
| ~ k1(B)
| ~ k1(a)
| m1(A,B,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_034) ).
fof(f71_nnf,plain,
! [A,B] :
( ~ q0(A,A)
| ~ k1(B)
| ~ k1(a)
| m1(A,B,B) ),
inference(nnf_transformation,[status(thm)],[f71]) ).
fof(f71_sk,plain,
! [A,B] :
( ~ q0(A,A)
| ~ k1(B)
| ~ k1(a)
| m1(A,B,B) ),
inference(skolemisation,[status(esa)],[f71_nnf]) ).
cnf(c71,plain,
( ~ q0(X0,X0)
| ~ k1(X1)
| ~ k1(a)
| m1(X0,X1,X1) ),
inference(cnf_transformation,[status(esa)],[f71_sk]) ).
cnf(hi71,axiom,
ifeq(k1(a),true,ifeq(k1(X0),true,ifeq(q0(X1,X1),true,m1(X1,X0,X0),true),true),true) = true,
inference(equality_encoding,[status(esa)],[c71]) ).
cnf(f24,axiom,
q0(d,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_25) ).
fof(f24_nnf,plain,
q0(d,d),
inference(nnf_transformation,[status(thm)],[f24]) ).
cnf(c24,plain,
q0(d,d),
inference(cnf_transformation,[status(esa)],[f24_nnf]) ).
cnf(hi24,axiom,
q0(d,d) = true,
inference(equality_encoding,[status(esa)],[c24]) ).
cnf(t22,plain,
m1(d,e,e) = true,
inference(hyper_resolution,[status(thm)],[hi71,h110,h6,hi24]) ).
cnf(t130,plain,
m1(d,e,e) = true,
inference(orient,[status(thm)],[t22]) ).
cnf(f368,negated_conjecture,
~ m1(d,e,e),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f368_nnf,plain,
~ m1(d,e,e),
inference(nnf_transformation,[status(thm)],[f368]) ).
fof(f368_sk,plain,
~ m1(d,e,e),
inference(skolemisation,[status(esa)],[f368_nnf]) ).
cnf(c368,plain,
~ m1(d,e,e),
inference(cnf_transformation,[status(esa)],[f368_sk]) ).
cnf(goal_0,negated_conjecture,
m1(d,e,e) != true,
inference(equality_encoding,[status(esa)],[c368]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t130]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN249-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.14/15.43 % Computer : n016.cluster.edu
% 0.14/15.43 % Model : x86_64 x86_64
% 0.14/15.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/15.43 % Memory : 8046.5625MB
% 0.14/15.43 % OS : Linux 6.8.0-71-generic
% 0.14/15.43 % CPULimit : 300
% 0.14/15.43 % WCLimit : 300
% 0.14/15.43 % DateTime : Fri Sep 25 00:42:44 UTC 2026
% 0.14/15.43 % CPUTime :
% 0.14/15.43 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 6.61/16.32 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.61/16.32 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------