%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : GEO086-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n006.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 01:17:00 PM UTC 2026
% Result : Unsatisfiable 7.56s 1.44s
% Output : Proof 7.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 10
% Syntax : Number of formulae : 55 ( 39 unt; 0 def)
% Number of atoms : 75 ( 36 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 54 ( 34 ~; 20 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-4 aty)
% Number of variables : 48 ( 4 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f48,negated_conjecture,
open(sk14),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',theorem_2_7_2_67) ).
fof(f48_nnf,plain,
open(sk14),
inference(nnf_transformation,[status(thm)],[f48]) ).
cnf(c48,plain,
open(sk14),
inference(cnf_transformation,[status(esa)],[f48_nnf]) ).
cnf(t2,plain,
open(sk14) = true,
inference(equality_encoding,[status(esa)],[c48]) ).
cnf(t141,plain,
open(sk14) = true,
inference(orient,[status(thm)],[t2]) ).
cnf(t14,plain,
ifeq(eq(X1,X2),true,X1,X2) = X2,
introduced(definition) ).
cnf(t62,plain,
ifeq(eq(X1,X2),true,X1,X2) = X2,
inference(orient,[status(thm)],[t14]) ).
cnf(f34,axiom,
( open(A)
| A = B
| ~ part_of(A,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c1_35) ).
fof(f34_nnf,plain,
! [A,B] :
( open(A)
| A = B
| ~ part_of(A,B) ),
inference(nnf_transformation,[status(thm)],[f34]) ).
fof(f34_sk,plain,
! [A,B] :
( open(A)
| A = B
| ~ part_of(A,B) ),
inference(skolemisation,[status(esa)],[f34_nnf]) ).
cnf(c34,plain,
( open(X0)
| X0 = X1
| ~ part_of(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f34_sk]) ).
cnf(t29,plain,
ifeq(part_of(X1,X2),true,or(eq(X1,X2),open(X1)),true) = true,
inference(equality_encoding,[status(esa)],[c34]) ).
cnf(t90,plain,
ifeq(part_of(X1,X2),true,or(eq(X1,X2),open(X1)),true) = true,
inference(orient,[status(thm)],[t29]) ).
cnf(f49,negated_conjecture,
part_of(sk15,sk14),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',theorem_2_7_2_68) ).
fof(f49_nnf,plain,
part_of(sk15,sk14),
inference(nnf_transformation,[status(thm)],[f49]) ).
cnf(c49,plain,
part_of(sk15,sk14),
inference(cnf_transformation,[status(esa)],[f49_nnf]) ).
cnf(t9,plain,
part_of(sk15,sk14) = true,
inference(equality_encoding,[status(esa)],[c49]) ).
cnf(t112,plain,
part_of(sk15,sk14) = true,
inference(orient,[status(thm)],[t9]) ).
cnf(t113,plain,
true = ifeq(true,true,or(eq(sk15,sk14),open(sk15)),true),
inference(cp,[status(thm)],[t90,t112]) ).
cnf(t11,plain,
ifeq(X1,X1,X2,X3) = X2,
introduced(definition) ).
cnf(t60,plain,
ifeq(X1,X1,X2,X3) = X2,
inference(orient,[status(thm)],[t11]) ).
cnf(t357,plain,
true = or(eq(sk15,sk14),open(sk15)),
inference(step,[status(thm)],[t113,t60]) ).
cnf(f50,negated_conjecture,
~ open(sk15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',theorem_2_7_2_69) ).
fof(f50_nnf,plain,
~ open(sk15),
inference(nnf_transformation,[status(thm)],[f50]) ).
fof(f50_sk,plain,
~ open(sk15),
inference(skolemisation,[status(esa)],[f50_nnf]) ).
cnf(c50,plain,
~ open(sk15),
inference(cnf_transformation,[status(esa)],[f50_sk]) ).
cnf(t3,plain,
open(sk15) = false,
inference(equality_encoding,[status(esa)],[c50]) ).
cnf(t153,plain,
open(sk15) = false,
inference(orient,[status(thm)],[t3]) ).
cnf(t358,plain,
true = or(eq(sk15,sk14),false),
inference(step,[status(thm)],[t357,t153]) ).
cnf(t5,plain,
or(X1,false) = X1,
introduced(definition) ).
cnf(t63,plain,
or(X1,false) = X1,
inference(orient,[status(thm)],[t5]) ).
cnf(t359,plain,
true = eq(sk15,sk14),
inference(step,[status(thm)],[t358,t63]) ).
cnf(t315,plain,
eq(sk15,sk14) = true,
inference(orient,[status(thm)],[t359]) ).
cnf(t316,plain,
sk14 = ifeq(true,true,sk15,sk14),
inference(cp,[status(thm)],[t62,t315]) ).
cnf(t360,plain,
sk14 = sk15,
inference(step,[status(thm)],[t316,t60]) ).
cnf(t320,plain,
sk14 = sk15,
inference(orient,[status(thm)],[t360]) ).
cnf(t362,plain,
open(sk15) = true,
inference(step,[status(thm)],[t141,t320]) ).
cnf(t363,plain,
false = true,
inference(step,[status(thm)],[t362,t153]) ).
cnf(t322,plain,
false = true,
inference(rw,[status(thm)],[t363]) ).
cnf(t330,plain,
false = true,
inference(orient,[status(thm)],[t322]) ).
cnf(f21,axiom,
( ~ end_point(A,B)
| ~ inner_point(A,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inner_point_defn_22) ).
fof(f21_nnf,plain,
! [A,B] :
( ~ end_point(A,B)
| ~ inner_point(A,B) ),
inference(nnf_transformation,[status(thm)],[f21]) ).
fof(f21_sk,plain,
! [A,B] :
( ~ end_point(A,B)
| ~ inner_point(A,B) ),
inference(skolemisation,[status(esa)],[f21_nnf]) ).
cnf(c21,plain,
( ~ end_point(X0,X1)
| ~ inner_point(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f21_sk]) ).
cnf(f30,axiom,
( ~ end_point(B,A)
| ~ closed(A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',closed_defn_31) ).
fof(f30_nnf,plain,
! [A,B] :
( ~ end_point(B,A)
| ~ closed(A) ),
inference(nnf_transformation,[status(thm)],[f30]) ).
fof(f30_sk,plain,
! [A,B] :
( ~ end_point(B,A)
| ~ closed(A) ),
inference(skolemisation,[status(esa)],[f30_nnf]) ).
cnf(c30,plain,
( ~ end_point(X1,X0)
| ~ closed(X0) ),
inference(cnf_transformation,[status(esa)],[f30_sk]) ).
cnf(f41,axiom,
( A != ax0_sk11(A,B)
| ~ end_point(A,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c6_42) ).
fof(f41_nnf,plain,
! [A,B] :
( A != ax0_sk11(A,B)
| ~ end_point(A,B) ),
inference(nnf_transformation,[status(thm)],[f41]) ).
fof(f41_sk,plain,
! [A,B] :
( A != ax0_sk11(A,B)
| ~ end_point(A,B) ),
inference(skolemisation,[status(esa)],[f41_nnf]) ).
cnf(c41,plain,
( X0 != ax0_sk11(X0,X1)
| ~ end_point(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f41_sk]) ).
cnf(goal_0,negated_conjecture,
true != false,
inference(equality_encoding,[status(esa)],[c21,c30,c41,c50]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t330]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GEO086-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.35 % Computer : n006.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Wed Sep 23 10:46:41 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 7.56/1.44 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.56/1.44 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------