TSTP Solution File: GEO037-3 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : GEO037-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 : n005.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:41 EDT 2023
% Result : Unsatisfiable 0.18s 0.67s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 23
% Syntax : Number of formulae : 39 ( 12 unt; 15 typ; 0 def)
% Number of atoms : 40 ( 8 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 34 ( 18 ~; 16 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 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 : 13 ( 13 usr; 7 con; 0-6 aty)
% Number of variables : 70 ( 11 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,
v: $i ).
tff(decl_34,type,
u: $i ).
tff(decl_35,type,
x: $i ).
tff(decl_36,type,
w: $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(segment_construction2,axiom,
equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-0.ax',segment_construction2) ).
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(prove_lengthen,negated_conjecture,
( v = extension(u,v,lower_dimension_point_1,lower_dimension_point_2)
| ~ equidistant(v,extension(u,v,lower_dimension_point_1,lower_dimension_point_2),x,extension(w,x,lower_dimension_point_1,lower_dimension_point_2))
| ~ between(u,v,extension(u,v,lower_dimension_point_1,lower_dimension_point_2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_lengthen) ).
cnf(segment_construction1,axiom,
between(X1,X2,extension(X1,X2,X3,X4)),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-0.ax',segment_construction1) ).
cnf(d4_5,axiom,
( equidistant(X4,X3,X2,X1)
| ~ equidistant(X1,X2,X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_5) ).
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(e2_1,axiom,
lower_dimension_point_1 != lower_dimension_point_2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e2_1) ).
cnf(c_0_8,axiom,
( equidistant(X4,X3,X1,X2)
| ~ equidistant(X1,X2,X3,X4) ),
d4_4 ).
cnf(c_0_9,axiom,
equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
segment_construction2 ).
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,plain,
equidistant(X1,X2,X3,extension(X4,X3,X2,X1)),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
( v = extension(u,v,lower_dimension_point_1,lower_dimension_point_2)
| ~ equidistant(v,extension(u,v,lower_dimension_point_1,lower_dimension_point_2),x,extension(w,x,lower_dimension_point_1,lower_dimension_point_2))
| ~ between(u,v,extension(u,v,lower_dimension_point_1,lower_dimension_point_2)) ),
prove_lengthen ).
cnf(c_0_13,axiom,
between(X1,X2,extension(X1,X2,X3,X4)),
segment_construction1 ).
cnf(c_0_14,plain,
( equidistant(X1,X2,X3,extension(X4,X3,X5,X6))
| ~ equidistant(X6,X5,X1,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,axiom,
( equidistant(X4,X3,X2,X1)
| ~ equidistant(X1,X2,X3,X4) ),
d4_5 ).
cnf(c_0_16,negated_conjecture,
( extension(u,v,lower_dimension_point_1,lower_dimension_point_2) = v
| ~ equidistant(v,extension(u,v,lower_dimension_point_1,lower_dimension_point_2),x,extension(w,x,lower_dimension_point_1,lower_dimension_point_2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
cnf(c_0_17,plain,
equidistant(X1,extension(X2,X1,X3,X4),X5,extension(X6,X5,X3,X4)),
inference(spm,[status(thm)],[c_0_14,c_0_11]) ).
cnf(c_0_18,plain,
equidistant(X1,X2,extension(X3,X4,X2,X1),X4),
inference(spm,[status(thm)],[c_0_15,c_0_9]) ).
cnf(c_0_19,negated_conjecture,
extension(u,v,lower_dimension_point_1,lower_dimension_point_2) = v,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).
cnf(c_0_20,axiom,
( X1 = X2
| ~ equidistant(X1,X2,X3,X3) ),
identity_for_equidistance ).
cnf(c_0_21,negated_conjecture,
equidistant(lower_dimension_point_2,lower_dimension_point_1,v,v),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,axiom,
lower_dimension_point_1 != lower_dimension_point_2,
e2_1 ).
cnf(c_0_23,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : GEO037-3 : TPTP v8.1.2. Released v1.0.0.
% 0.10/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.32 % Computer : n005.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Tue Aug 29 21:27:07 EDT 2023
% 0.12/0.32 % CPUTime :
% 0.18/0.56 start to proof: theBenchmark
% 0.18/0.67 % Version : CSE_E---1.5
% 0.18/0.67 % Problem : theBenchmark.p
% 0.18/0.67 % Proof found
% 0.18/0.67 % SZS status Theorem for theBenchmark.p
% 0.18/0.67 % SZS output start Proof
% See solution above
% 0.18/0.68 % Total time : 0.101000 s
% 0.18/0.68 % SZS output end Proof
% 0.18/0.68 % Total time : 0.105000 s
%------------------------------------------------------------------------------