%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : GEO019-3 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n001.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:16:35 PM UTC 2026
% Result : Unsatisfiable 4.62s 1.08s
% Output : Proof 4.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 41 ( 37 unt; 0 def)
% Number of atoms : 49 ( 13 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 34 ( 26 ~; 8 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-4 aty)
% Number of variables : 46 ( 2 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f22,negated_conjecture,
~ equidistant(w,x,v,u),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_symmetry) ).
fof(f22_nnf,plain,
~ equidistant(w,x,v,u),
inference(nnf_transformation,[status(thm)],[f22]) ).
fof(f22_sk,plain,
~ equidistant(w,x,v,u),
inference(skolemisation,[status(esa)],[f22_nnf]) ).
cnf(c22,plain,
~ equidistant(w,x,v,u),
inference(cnf_transformation,[status(esa)],[f22_sk]) ).
cnf(t52,plain,
ifeq(equidistant(w,x,v,u),true,false,true) = true,
inference(equality_encoding,[status(esa)],[c22]) ).
cnf(f1,axiom,
( equidistant(Z,V,V2,W)
| ~ equidistant(X,Y,V2,W)
| ~ equidistant(X,Y,Z,V) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_for_equidistance) ).
fof(f1_nnf,plain,
! [X,Y,Z,V,V2,W] :
( equidistant(Z,V,V2,W)
| ~ equidistant(X,Y,V2,W)
| ~ equidistant(X,Y,Z,V) ),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [X,Y,Z,V,V2,W] :
( equidistant(Z,V,V2,W)
| ~ equidistant(X,Y,V2,W)
| ~ equidistant(X,Y,Z,V) ),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c1,plain,
( equidistant(X2,X3,X4,X5)
| ~ equidistant(X0,X1,X4,X5)
| ~ equidistant(X0,X1,X2,X3) ),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(hi1,axiom,
ifeq(equidistant(X0,X1,X2,X3),true,ifeq(equidistant(X0,X1,X4,X5),true,equidistant(X2,X3,X4,X5),true),true) = true,
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(f21,hypothesis,
equidistant(u,v,w,x),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',u_to_v_equals_w_to_x) ).
fof(f21_nnf,plain,
equidistant(u,v,w,x),
inference(nnf_transformation,[status(thm)],[f21]) ).
cnf(c21,plain,
equidistant(u,v,w,x),
inference(cnf_transformation,[status(esa)],[f21_nnf]) ).
cnf(hi18,axiom,
equidistant(u,v,w,x) = true,
inference(equality_encoding,[status(esa)],[c21]) ).
cnf(f0,axiom,
equidistant(X,Y,Y,X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_for_equidistance) ).
fof(f0_nnf,plain,
! [X,Y] : equidistant(X,Y,Y,X),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [X,Y] : equidistant(X,Y,Y,X),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
equidistant(X0,X1,X1,X0),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi0,axiom,
equidistant(X0,X1,X1,X0) = true,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(t17,plain,
equidistant(w,x,v,u) = true,
inference(hyper_resolution,[status(thm)],[hi1,hi18,hi0]) ).
cnf(t959,plain,
equidistant(w,x,v,u) = true,
inference(orient,[status(thm)],[t17]) ).
cnf(t3133,plain,
ifeq(true,true,false,true) = true,
inference(step,[status(thm)],[t52,t959]) ).
cnf(t23,plain,
ifeq(X1,X1,X2,X3) = X2,
introduced(definition) ).
cnf(t262,plain,
ifeq(X1,X1,X2,X3) = X2,
inference(orient,[status(thm)],[t23]) ).
cnf(t3134,plain,
false = true,
inference(step,[status(thm)],[t3133,t262]) ).
cnf(t3042,plain,
false = true,
inference(orient,[status(thm)],[t3134]) ).
cnf(f9,axiom,
~ between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lower_dimension1) ).
fof(f9_nnf,plain,
~ between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3),
inference(nnf_transformation,[status(thm)],[f9]) ).
fof(f9_sk,plain,
~ between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3),
inference(skolemisation,[status(esa)],[f9_nnf]) ).
cnf(c9,plain,
~ between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3),
inference(cnf_transformation,[status(esa)],[f9_sk]) ).
cnf(f10,axiom,
~ between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lower_dimension2) ).
fof(f10_nnf,plain,
~ between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1),
inference(nnf_transformation,[status(thm)],[f10]) ).
fof(f10_sk,plain,
~ between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1),
inference(skolemisation,[status(esa)],[f10_nnf]) ).
cnf(c10,plain,
~ between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1),
inference(cnf_transformation,[status(esa)],[f10_sk]) ).
cnf(f11,axiom,
~ between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lower_dimension3) ).
fof(f11_nnf,plain,
~ between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2),
inference(nnf_transformation,[status(thm)],[f11]) ).
fof(f11_sk,plain,
~ between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2),
inference(skolemisation,[status(esa)],[f11_nnf]) ).
cnf(c11,plain,
~ between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2),
inference(cnf_transformation,[status(esa)],[f11_sk]) ).
cnf(goal_0,negated_conjecture,
true != false,
inference(equality_encoding,[status(esa)],[c9,c10,c11,c22]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t3042]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO019-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.37 % Computer : n001.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Wed Sep 23 10:30:35 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.62/1.08 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.62/1.08 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------