TSTP Solution File: GEO029-2 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : GEO029-2 : 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 : n015.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 2.03s 2.18s
% Output : CNFRefutation 2.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 23
% Syntax : Number of formulae : 56 ( 21 unt; 12 typ; 0 def)
% Number of atoms : 100 ( 23 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 108 ( 52 ~; 56 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 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 : 10 ( 10 usr; 5 con; 0-6 aty)
% Number of variables : 160 ( 16 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 ).
cnf(identity_for_equidistance,axiom,
( X1 = X2
| ~ equidistant(X1,X2,X3,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-0.ax',identity_for_equidistance) ).
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(identity_for_betweeness,axiom,
( X1 = X2
| ~ between(X1,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-0.ax',identity_for_betweeness) ).
cnf(inner_pasch1,axiom,
( between(X2,inner_pasch(X1,X2,X3,X5,X4),X4)
| ~ between(X1,X2,X3)
| ~ between(X4,X5,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-0.ax',inner_pasch1) ).
cnf(segment_construction1,axiom,
between(X1,X2,extension(X1,X2,X3,X4)),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-0.ax',segment_construction1) ).
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(reflexivity_for_equidistance,axiom,
equidistant(X1,X2,X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-0.ax',reflexivity_for_equidistance) ).
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/sandbox2/benchmark/Axioms/GEO002-0.ax',outer_five_segment) ).
cnf(inner_pasch2,axiom,
( between(X5,inner_pasch(X1,X2,X3,X5,X4),X1)
| ~ between(X1,X2,X3)
| ~ between(X4,X5,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-0.ax',inner_pasch2) ).
cnf(prove_equal_extensions,negated_conjecture,
extension(u,v,u,v) != extension(u,v,v,u),
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_11,axiom,
( X1 = X2
| ~ equidistant(X1,X2,X3,X3) ),
identity_for_equidistance ).
cnf(c_0_12,axiom,
equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
segment_construction2 ).
cnf(c_0_13,axiom,
( X1 = X2
| ~ between(X1,X2,X1) ),
identity_for_betweeness ).
cnf(c_0_14,axiom,
( between(X2,inner_pasch(X1,X2,X3,X5,X4),X4)
| ~ between(X1,X2,X3)
| ~ between(X4,X5,X3) ),
inner_pasch1 ).
cnf(c_0_15,axiom,
between(X1,X2,extension(X1,X2,X3,X4)),
segment_construction1 ).
cnf(c_0_16,plain,
extension(X1,X2,X3,X3) = X2,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,axiom,
( equidistant(X3,X4,X5,X6)
| ~ equidistant(X1,X2,X3,X4)
| ~ equidistant(X1,X2,X5,X6) ),
transitivity_for_equidistance ).
cnf(c_0_18,axiom,
equidistant(X1,X2,X2,X1),
reflexivity_for_equidistance ).
cnf(c_0_19,plain,
( inner_pasch(X1,X2,X3,X4,X2) = X2
| ~ between(X2,X4,X3)
| ~ between(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
between(X1,X2,X2),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( equidistant(X1,X2,X3,X4)
| ~ equidistant(X5,extension(X6,X5,X3,X4),X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_12]) ).
cnf(c_0_22,plain,
( equidistant(X1,X2,X3,X4)
| ~ equidistant(X4,X3,X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,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_24,plain,
( inner_pasch(X1,X2,X3,X3,X2) = X2
| ~ between(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
equidistant(X1,X2,X1,X2),
inference(spm,[status(thm)],[c_0_21,c_0_12]) ).
cnf(c_0_26,plain,
equidistant(X1,X2,extension(X3,X4,X1,X2),X4),
inference(spm,[status(thm)],[c_0_22,c_0_12]) ).
cnf(c_0_27,plain,
( X1 = X2
| equidistant(X3,extension(X4,X2,X5,X6),X7,X6)
| ~ between(X8,X5,X7)
| ~ between(X1,X2,X3)
| ~ equidistant(X1,extension(X4,X2,X5,X6),X8,X6)
| ~ equidistant(X2,X3,X5,X7)
| ~ equidistant(X1,X2,X8,X5) ),
inference(spm,[status(thm)],[c_0_23,c_0_12]) ).
cnf(c_0_28,axiom,
( between(X5,inner_pasch(X1,X2,X3,X5,X4),X1)
| ~ between(X1,X2,X3)
| ~ between(X4,X5,X3) ),
inner_pasch2 ).
cnf(c_0_29,plain,
inner_pasch(X1,X2,extension(X1,X2,X3,X4),extension(X1,X2,X3,X4),X2) = X2,
inference(spm,[status(thm)],[c_0_24,c_0_15]) ).
cnf(c_0_30,plain,
( equidistant(X1,X2,X3,X4)
| ~ equidistant(X3,X4,X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_25]) ).
cnf(c_0_31,plain,
equidistant(extension(X1,X2,X3,X4),X2,X4,X3),
inference(spm,[status(thm)],[c_0_22,c_0_26]) ).
cnf(c_0_32,plain,
( X1 = X2
| equidistant(X3,extension(X4,X2,X5,X1),X6,X1)
| ~ between(extension(X4,X2,X5,X1),X5,X6)
| ~ between(X1,X2,X3)
| ~ equidistant(X1,X2,extension(X4,X2,X5,X1),X5)
| ~ equidistant(X2,X3,X5,X6) ),
inference(spm,[status(thm)],[c_0_27,c_0_18]) ).
cnf(c_0_33,plain,
between(extension(X1,X2,X3,X4),X2,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_20]),c_0_15])]) ).
cnf(c_0_34,plain,
equidistant(X1,X2,extension(X3,X4,X2,X1),X4),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
( X1 = X2
| equidistant(X3,extension(X4,X2,X2,X1),X4,X1)
| ~ between(X1,X2,X3)
| ~ equidistant(X2,X3,X2,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
cnf(c_0_36,plain,
equidistant(X1,X2,X3,extension(X4,X3,X1,X2)),
inference(spm,[status(thm)],[c_0_30,c_0_12]) ).
cnf(c_0_37,plain,
( X1 = extension(X2,X3,X3,X2)
| X2 = X3
| ~ between(X2,X3,X1)
| ~ equidistant(X3,X1,X3,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_35]) ).
cnf(c_0_38,plain,
equidistant(X1,extension(X2,X1,X3,X4),X4,X3),
inference(spm,[status(thm)],[c_0_22,c_0_36]) ).
cnf(c_0_39,plain,
( extension(X1,X2,X3,X2) = extension(X3,X2,X2,X3)
| X3 = X2
| ~ between(X3,X2,extension(X1,X2,X3,X2)) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_40,negated_conjecture,
extension(u,v,u,v) != extension(u,v,v,u),
prove_equal_extensions ).
cnf(c_0_41,plain,
( extension(X1,X2,X1,X2) = extension(X1,X2,X2,X1)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_39,c_0_15]) ).
cnf(c_0_42,hypothesis,
u != v,
u_not_v ).
cnf(c_0_43,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO029-2 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34 % Computer : n015.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 29 20:45:41 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.56 start to proof: theBenchmark
% 2.03/2.18 % Version : CSE_E---1.5
% 2.03/2.18 % Problem : theBenchmark.p
% 2.03/2.18 % Proof found
% 2.03/2.18 % SZS status Theorem for theBenchmark.p
% 2.03/2.18 % SZS output start Proof
% See solution above
% 2.03/2.19 % Total time : 1.608000 s
% 2.03/2.19 % SZS output end Proof
% 2.03/2.19 % Total time : 1.610000 s
%------------------------------------------------------------------------------