%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SYN106-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 : n013.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:49 PM UTC 2026
% Result : Unsatisfiable 9.13s 3.20s
% Output : Proof 9.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 14 unt; 0 def)
% Number of atoms : 22 ( 6 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 14 ( 10 ~; 4 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-4 aty)
% Number of variables : 10 ( 3 sgn 4 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f38,axiom,
( ~ n0(J,I)
| k1(I) ),
file('/export/starexec/sandbox2/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/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(t0,plain,
k1(e) = true,
inference(hyper_resolution,[status(thm)],[hi38,hi2]) ).
cnf(t587,plain,
k1(e) = true,
inference(orient,[status(thm)],[t0]) ).
cnf(f368,negated_conjecture,
~ k1(e),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f368_nnf,plain,
~ k1(e),
inference(nnf_transformation,[status(thm)],[f368]) ).
fof(f368_sk,plain,
~ k1(e),
inference(skolemisation,[status(esa)],[f368_nnf]) ).
cnf(c368,plain,
~ k1(e),
inference(cnf_transformation,[status(esa)],[f368_sk]) ).
cnf(goal_0,negated_conjecture,
k1(e) != true,
inference(equality_encoding,[status(esa)],[c368]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t587]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN106-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.08/0.35 % Computer : n013.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Fri Sep 25 00:10:36 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 9.13/3.20 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.13/3.20 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------