%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN112-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 : n026.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 7.12s 1.43s
% Output : Proof 7.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 23 unt; 0 def)
% Number of atoms : 39 ( 15 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 22 ( 14 ~; 8 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-4 aty)
% Number of variables : 18 ( 7 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f368,negated_conjecture,
~ k2(e,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f368_nnf,plain,
! [X] : ~ k2(e,X),
inference(nnf_transformation,[status(thm)],[f368]) ).
fof(f368_sk,plain,
! [X] : ~ k2(e,X),
inference(skolemisation,[status(esa)],[f368_nnf]) ).
cnf(c368,plain,
~ k2(e,X0),
inference(cnf_transformation,[status(esa)],[f368_sk]) ).
cnf(t129,plain,
eq(k2(e,X1),true) = efalse,
inference(equality_encoding,[status(esa)],[c368]) ).
cnf(t1134,plain,
eq(k2(e,X1),true) = efalse,
inference(orient,[status(thm)],[t129]) ).
cnf(f39,axiom,
( ~ n0(H,G)
| l1(G,G) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_002) ).
fof(f39_nnf,plain,
! [G,H] :
( ~ n0(H,G)
| l1(G,G) ),
inference(nnf_transformation,[status(thm)],[f39]) ).
fof(f39_sk,plain,
! [G,H] :
( ~ n0(H,G)
| l1(G,G) ),
inference(skolemisation,[status(esa)],[f39_nnf]) ).
cnf(c39,plain,
( ~ n0(X1,X0)
| l1(X0,X0) ),
inference(cnf_transformation,[status(esa)],[f39_sk]) ).
cnf(hi39,axiom,
ifeq(n0(X0,X1),true,l1(X1,X1),true) = true,
inference(equality_encoding,[status(esa)],[c39]) ).
cnf(f2,axiom,
n0(d,e),
file('/export/starexec/sandbox2/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(h25,plain,
l1(e,e) = true,
inference(hyper_resolution,[status(thm)],[hi39,hi2]) ).
cnf(f167,axiom,
( ~ l1(e,e)
| k2(e,e) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_130) ).
fof(f167_nnf,plain,
( ~ l1(e,e)
| k2(e,e) ),
inference(nnf_transformation,[status(thm)],[f167]) ).
fof(f167_sk,plain,
( ~ l1(e,e)
| k2(e,e) ),
inference(skolemisation,[status(esa)],[f167_nnf]) ).
cnf(c167,plain,
( ~ l1(e,e)
| k2(e,e) ),
inference(cnf_transformation,[status(esa)],[f167_sk]) ).
cnf(hi165,axiom,
ifeq(l1(e,e),true,k2(e,e),true) = true,
inference(equality_encoding,[status(esa)],[c167]) ).
cnf(t8,plain,
k2(e,e) = true,
inference(hyper_resolution,[status(thm)],[hi165,h25]) ).
cnf(t1126,plain,
k2(e,e) = true,
inference(orient,[status(thm)],[t8]) ).
cnf(t1135,plain,
efalse = eq(true,true),
inference(cp,[status(thm)],[t1134,t1126]) ).
cnf(t7,plain,
eq(X1,X1) = etrue,
introduced(definition) ).
cnf(t1133,plain,
eq(X1,X1) = etrue,
inference(orient,[status(thm)],[t7]) ).
cnf(t1177,plain,
efalse = etrue,
inference(step,[status(thm)],[t1135,t1133]) ).
cnf(t1136,plain,
efalse = etrue,
inference(orient,[status(thm)],[t1177]) ).
cnf(goal_0,negated_conjecture,
etrue != efalse,
introduced(definition) ).
cnf(g0_0,plain,
etrue != etrue,
inference(rw,[status(thm)],[goal_0,t1136]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN112-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/0.38 % Computer : n026.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Fri Sep 25 00:15:09 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 7.12/1.43 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.12/1.43 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------