TSTP Solution File: GEO028-3 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : GEO028-3 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n024.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Aug 30 22:45:37 EDT 2023
% Result : Unsatisfiable 143.11s 143.10s
% Output : CNFRefutation 143.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 27
% Syntax : Number of formulae : 50 ( 18 unt; 17 typ; 0 def)
% Number of atoms : 59 ( 14 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 51 ( 25 ~; 26 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 34 ( 8 >; 26 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 15 ( 15 usr; 9 con; 0-6 aty)
% Number of variables : 93 ( 13 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
equidistant: ( $i * $i * $i * $i ) > $o ).
tff(decl_23,type,
extension: ( $i * $i * $i * $i ) > $i ).
tff(decl_24,type,
between: ( $i * $i * $i ) > $o ).
tff(decl_25,type,
inner_pasch: ( $i * $i * $i * $i * $i ) > $i ).
tff(decl_26,type,
lower_dimension_point_1: $i ).
tff(decl_27,type,
lower_dimension_point_2: $i ).
tff(decl_28,type,
lower_dimension_point_3: $i ).
tff(decl_29,type,
euclid1: ( $i * $i * $i * $i * $i ) > $i ).
tff(decl_30,type,
euclid2: ( $i * $i * $i * $i * $i ) > $i ).
tff(decl_31,type,
continuous: ( $i * $i * $i * $i * $i * $i ) > $i ).
tff(decl_32,type,
reflection: ( $i * $i ) > $i ).
tff(decl_33,type,
w: $i ).
tff(decl_34,type,
x: $i ).
tff(decl_35,type,
y: $i ).
tff(decl_36,type,
z: $i ).
tff(decl_37,type,
u: $i ).
tff(decl_38,type,
v: $i ).
cnf(d4_4,axiom,
( equidistant(X4,X3,X1,X2)
| ~ equidistant(X1,X2,X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_4) ).
cnf(w_to_x_equals_y_to_z,hypothesis,
equidistant(w,x,y,z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',w_to_x_equals_y_to_z) ).
cnf(transitivity_for_equidistance,axiom,
( equidistant(X3,X4,X5,X6)
| ~ equidistant(X1,X2,X3,X4)
| ~ equidistant(X1,X2,X5,X6) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-0.ax',transitivity_for_equidistance) ).
cnf(d4_5,axiom,
( equidistant(X4,X3,X2,X1)
| ~ equidistant(X1,X2,X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_5) ).
cnf(segment_construction2,axiom,
equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-0.ax',segment_construction2) ).
cnf(d4_3,axiom,
( equidistant(X3,X4,X2,X1)
| ~ equidistant(X1,X2,X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_3) ).
cnf(d9,axiom,
( X1 = X2
| X3 = X4
| ~ between(X1,X2,X3)
| ~ between(X1,X2,X4)
| ~ equidistant(X2,X3,X2,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d9) ).
cnf(segment_construction1,axiom,
between(X1,X2,extension(X1,X2,X3,X4)),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-0.ax',segment_construction1) ).
cnf(prove_equal_extensions,negated_conjecture,
extension(u,v,w,x) != extension(u,v,y,z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_equal_extensions) ).
cnf(u_not_v,hypothesis,
u != v,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',u_not_v) ).
cnf(c_0_10,axiom,
( equidistant(X4,X3,X1,X2)
| ~ equidistant(X1,X2,X3,X4) ),
d4_4 ).
cnf(c_0_11,hypothesis,
equidistant(w,x,y,z),
w_to_x_equals_y_to_z ).
cnf(c_0_12,hypothesis,
equidistant(z,y,w,x),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,axiom,
( equidistant(X3,X4,X5,X6)
| ~ equidistant(X1,X2,X3,X4)
| ~ equidistant(X1,X2,X5,X6) ),
transitivity_for_equidistance ).
cnf(c_0_14,hypothesis,
equidistant(x,w,z,y),
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_15,axiom,
( equidistant(X4,X3,X2,X1)
| ~ equidistant(X1,X2,X3,X4) ),
d4_5 ).
cnf(c_0_16,axiom,
equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
segment_construction2 ).
cnf(c_0_17,hypothesis,
( equidistant(X1,X2,z,y)
| ~ equidistant(x,w,X1,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
equidistant(X1,X2,extension(X3,X4,X2,X1),X4),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
equidistant(X1,X2,X3,extension(X4,X3,X2,X1)),
inference(spm,[status(thm)],[c_0_10,c_0_16]) ).
cnf(c_0_20,axiom,
( equidistant(X3,X4,X2,X1)
| ~ equidistant(X1,X2,X3,X4) ),
d4_3 ).
cnf(c_0_21,hypothesis,
equidistant(extension(X1,X2,w,x),X2,z,y),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
( equidistant(X1,X2,X3,extension(X4,X3,X5,X6))
| ~ equidistant(X6,X5,X1,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_19]) ).
cnf(c_0_23,hypothesis,
equidistant(z,y,X1,extension(X2,X1,w,x)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,axiom,
( X1 = X2
| X3 = X4
| ~ between(X1,X2,X3)
| ~ between(X1,X2,X4)
| ~ equidistant(X2,X3,X2,X4) ),
d9 ).
cnf(c_0_25,hypothesis,
equidistant(X1,extension(X2,X1,w,x),X3,extension(X4,X3,y,z)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,hypothesis,
( extension(X1,X2,w,x) = extension(X3,X2,y,z)
| X4 = X2
| ~ between(X4,X2,extension(X3,X2,y,z))
| ~ between(X4,X2,extension(X1,X2,w,x)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,axiom,
between(X1,X2,extension(X1,X2,X3,X4)),
segment_construction1 ).
cnf(c_0_28,hypothesis,
( extension(X1,X2,w,x) = extension(X3,X2,y,z)
| X3 = X2
| ~ between(X3,X2,extension(X1,X2,w,x)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,negated_conjecture,
extension(u,v,w,x) != extension(u,v,y,z),
prove_equal_extensions ).
cnf(c_0_30,hypothesis,
( extension(X1,X2,y,z) = extension(X1,X2,w,x)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_28,c_0_27]) ).
cnf(c_0_31,hypothesis,
u != v,
u_not_v ).
cnf(c_0_32,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : GEO028-3 : TPTP v8.1.2. Released v1.0.0.
% 0.13/0.14 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.15/0.36 % Computer : n024.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Aug 29 21:54:23 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.58 start to proof: theBenchmark
% 143.11/143.10 % Version : CSE_E---1.5
% 143.11/143.10 % Problem : theBenchmark.p
% 143.11/143.10 % Proof found
% 143.11/143.10 % SZS status Theorem for theBenchmark.p
% 143.11/143.10 % SZS output start Proof
% See solution above
% 143.11/143.10 % Total time : 142.493000 s
% 143.11/143.10 % SZS output end Proof
% 143.11/143.10 % Total time : 142.504000 s
%------------------------------------------------------------------------------