%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : GEO024-3 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n014.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 : Thu Sep 24 08:39:17 AM UTC 2026
% Result : Unsatisfiable 121.48s 121.91s
% Output : Proof 121.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 28 ( 22 unt; 0 nHn; 22 RR)
% Number of literals : 44 ( 15 equ; 18 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-4 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-4 aty)
% Number of variables : 33 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(segment_construction2,axiom,
equidistant(Y,extension(X,Y,W,V),W,V),
file('GEO002-0.ax',segment_construction2) ).
cnf(d1,axiom,
equidistant(U,V,U,V),
file('theBenchmark.p',d1) ).
cnf(d4_5,axiom,
( equidistant(X,W,V,U)
| ~ equidistant(U,V,W,X) ),
file('theBenchmark.p',d4_5) ).
cnf(d5,axiom,
( equidistant(U,V,Y,Z)
| ~ equidistant(W,X,Y,Z)
| ~ equidistant(U,V,W,X) ),
file('theBenchmark.p',d5) ).
cnf(e1,axiom,
V = extension(U,V,W,W),
file('theBenchmark.p',e1) ).
cnf(prove_congruence,negated_conjecture,
~ equidistant(u,u,v,v),
file('theBenchmark.p',prove_congruence) ).
cnf(equality_1,axiom,
Eq_x_0 = Eq_x_0,
theory(equality,[reflexivity]) ).
cnf(equality_10,axiom,
( equidistant(Eq_y_0,Eq_y_1,Eq_y_2,Eq_y_3)
| ~ equidistant(Eq_x_0,Eq_x_1,Eq_x_2,Eq_x_3)
| Eq_x_3 != Eq_y_3
| Eq_x_2 != Eq_y_2
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(t1,plain,
~ equidistant(u,u,v,v),
inference(start,[status(thm),parent(0:0)],[prove_congruence]) ).
cnf(t2,plain,
( ~ equidistant(extension(U_2023,v,u,u),v,v,v)
| ~ equidistant(u,u,extension(U_2023,v,u,u),v)
| equidistant(u,u,v,v) ),
inference(extension,[status(thm),parent(t1:1)],[d5]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( ~ equidistant(v,extension(U_2023,v,u,u),u,u)
| equidistant(u,u,extension(U_2023,v,u,u),v) ),
inference(extension,[status(thm),parent(t2:2)],[d4_5]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
equidistant(v,extension(U_2023,v,u,u),u,u),
inference(extension,[status(thm),parent(t4:2)],[segment_construction2]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
( v != v
| v != v
| v != v
| ~ equidistant(v,v,v,v)
| v != extension(U_2023,v,u,u)
| equidistant(extension(U_2023,v,u,u),v,v,v) ),
inference(extension,[status(thm),parent(t2:3)],[equality_10]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t2:3]) ).
cnf(t10,plain,
v = extension(U_2023,v,u,u),
inference(extension,[status(thm),parent(t8:2)],[e1]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t8:2]) ).
cnf(t12,plain,
equidistant(v,v,v,v),
inference(extension,[status(thm),parent(t8:3)],[d1]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t8:3]) ).
cnf(t14,plain,
v = v,
inference(extension,[status(thm),parent(t8:4)],[equality_1]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t8:4]) ).
cnf(t16,plain,
v = v,
inference(extension,[status(thm),parent(t8:5)],[equality_1]) ).
cnf(t17,plain,
$false,
inference(connection,[status(thm),parent(t16:1)],[t16:1,t8:5]) ).
cnf(l8,lemma,
v = v,
inference(lemma,[status(cth),parent(t8:5),below(t2:3)],[t8:5]) ).
cnf(t18,plain,
v = v,
inference(lemma_extension,[status(thm),parent(t8:6)],[l8:1]) ).
cnf(t19,plain,
$false,
inference(connection,[status(thm),parent(t18:1)],[t18:1,t8:6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO024-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 This is a CNF_UNS_RFO_SEQ_NHN problem
% 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.52 % Computer : n014.cluster.edu
% 0.09/0.52 % Model : x86_64 x86_64
% 0.09/0.52 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.52 % Memory : 8046.5625MB
% 0.09/0.52 % OS : Linux 6.8.0-71-generic
% 0.09/0.52 % CPULimit : 300
% 0.09/0.52 % WCLimit : 300
% 0.09/0.52 % DateTime : Sat Sep 19 07:08:36 UTC 2026
% 0.09/0.52 % CPUTime :
% 121.48/121.91 % SZS status Unsatisfiable for theBenchmark
% 121.48/121.91 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------