TSTP Solution File: GEO030-2 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : GEO030-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n013.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 0.85s 0.97s
% Output : CNFRefutation 0.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 24
% Syntax : Number of formulae : 44 ( 19 unt; 14 typ; 0 def)
% Number of atoms : 64 ( 11 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 68 ( 34 ~; 34 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 32 ( 7 >; 25 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-6 aty)
% Number of variables : 70 ( 3 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,
u: $i ).
tff(decl_33,type,
v: $i ).
tff(decl_34,type,
w: $i ).
tff(decl_35,type,
w1: $i ).
cnf(transitivity_for_equidistance,axiom,
( equidistant(X3,X4,X5,X6)
| ~ equidistant(X1,X2,X3,X4)
| ~ equidistant(X1,X2,X5,X6) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO002-0.ax',transitivity_for_equidistance) ).
cnf(reflexivity_for_equidistance,axiom,
equidistant(X1,X2,X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GEO002-0.ax',reflexivity_for_equidistance) ).
cnf(identity_for_equidistance,axiom,
( X1 = X2
| ~ equidistant(X1,X2,X3,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO002-0.ax',identity_for_equidistance) ).
cnf(segment_construction2,axiom,
equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
file('/export/starexec/sandbox/benchmark/Axioms/GEO002-0.ax',segment_construction2) ).
cnf(outer_five_segment,axiom,
( X1 = X2
| equidistant(X5,X7,X6,X8)
| ~ equidistant(X1,X2,X3,X4)
| ~ equidistant(X2,X5,X4,X6)
| ~ equidistant(X1,X7,X3,X8)
| ~ equidistant(X2,X7,X4,X8)
| ~ between(X1,X2,X5)
| ~ between(X3,X4,X6) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO002-0.ax',outer_five_segment) ).
cnf(v_to_w_equals_v_to_w1,hypothesis,
equidistant(v,w,v,w1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',v_to_w_equals_v_to_w1) ).
cnf(u_to_w_equals_u_to_w1,hypothesis,
equidistant(u,w,u,w1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',u_to_w_equals_u_to_w1) ).
cnf(u_not_v,hypothesis,
u != v,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',u_not_v) ).
cnf(v_between_u_and_w,hypothesis,
between(u,v,w),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',v_between_u_and_w) ).
cnf(prove_w_is_w1,negated_conjecture,
w != w1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_w_is_w1) ).
cnf(c_0_10,axiom,
( equidistant(X3,X4,X5,X6)
| ~ equidistant(X1,X2,X3,X4)
| ~ equidistant(X1,X2,X5,X6) ),
transitivity_for_equidistance ).
cnf(c_0_11,axiom,
equidistant(X1,X2,X2,X1),
reflexivity_for_equidistance ).
cnf(c_0_12,axiom,
( X1 = X2
| ~ equidistant(X1,X2,X3,X3) ),
identity_for_equidistance ).
cnf(c_0_13,axiom,
equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
segment_construction2 ).
cnf(c_0_14,axiom,
( X1 = X2
| equidistant(X5,X7,X6,X8)
| ~ equidistant(X1,X2,X3,X4)
| ~ equidistant(X2,X5,X4,X6)
| ~ equidistant(X1,X7,X3,X8)
| ~ equidistant(X2,X7,X4,X8)
| ~ between(X1,X2,X5)
| ~ between(X3,X4,X6) ),
outer_five_segment ).
cnf(c_0_15,hypothesis,
equidistant(v,w,v,w1),
v_to_w_equals_v_to_w1 ).
cnf(c_0_16,plain,
( equidistant(X1,X2,X3,X4)
| ~ equidistant(X4,X3,X1,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,plain,
extension(X1,X2,X3,X3) = X2,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,hypothesis,
( X1 = v
| equidistant(X2,w,X3,w1)
| ~ between(X4,v,X3)
| ~ between(X1,v,X2)
| ~ equidistant(v,X2,v,X3)
| ~ equidistant(X1,w,X4,w1)
| ~ equidistant(X1,v,X4,v) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
equidistant(X1,X2,X1,X2),
inference(spm,[status(thm)],[c_0_16,c_0_11]) ).
cnf(c_0_20,plain,
equidistant(X1,X1,X2,X2),
inference(spm,[status(thm)],[c_0_13,c_0_17]) ).
cnf(c_0_21,hypothesis,
( X1 = v
| equidistant(X2,w,X2,w1)
| ~ between(X3,v,X2)
| ~ between(X1,v,X2)
| ~ equidistant(X1,w,X3,w1)
| ~ equidistant(X1,v,X3,v) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,hypothesis,
equidistant(u,w,u,w1),
u_to_w_equals_u_to_w1 ).
cnf(c_0_23,hypothesis,
u != v,
u_not_v ).
cnf(c_0_24,plain,
( equidistant(X1,X2,X3,X3)
| ~ equidistant(X4,X4,X1,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_20]) ).
cnf(c_0_25,hypothesis,
( equidistant(X1,w,X1,w1)
| ~ between(u,v,X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_19])]),c_0_23]) ).
cnf(c_0_26,hypothesis,
between(u,v,w),
v_between_u_and_w ).
cnf(c_0_27,hypothesis,
equidistant(w,w1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_28,negated_conjecture,
w != w1,
prove_w_is_w1 ).
cnf(c_0_29,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_27]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO030-2 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.34 % Computer : n013.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 29 19:03:46 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.56 start to proof: theBenchmark
% 0.85/0.97 % Version : CSE_E---1.5
% 0.85/0.97 % Problem : theBenchmark.p
% 0.85/0.97 % Proof found
% 0.85/0.97 % SZS status Theorem for theBenchmark.p
% 0.85/0.97 % SZS output start Proof
% See solution above
% 0.85/0.97 % Total time : 0.402000 s
% 0.85/0.97 % SZS output end Proof
% 0.85/0.97 % Total time : 0.405000 s
%------------------------------------------------------------------------------