TSTP Solution File: GEO030-3 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : GEO030-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 : n019.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 17.77s 17.83s
% Output   : CNFRefutation 17.77s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   24
% Syntax   : Number of formulae    :   39 (  15 unt;  15 typ;   0 def)
%            Number of atoms       :   54 (  10 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   60 (  30   ~;  30   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    1 (   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   :   42 (   0 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,
    u: $i ).

tff(decl_34,type,
    v: $i ).

tff(decl_35,type,
    w: $i ).

tff(decl_36,type,
    w1: $i ).

cnf(d2,axiom,
    ( equidistant(X3,X4,X1,X2)
    | ~ equidistant(X1,X2,X3,X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2) ).

cnf(v_to_w_equals_v_to_w1,hypothesis,
    equidistant(v,w,v,w1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',v_to_w_equals_v_to_w1) ).

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(d1,axiom,
    equidistant(X1,X2,X1,X2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1) ).

cnf(u_to_w_equals_u_to_w1,hypothesis,
    equidistant(u,w,u,w1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',u_to_w_equals_u_to_w1) ).

cnf(u_not_v,hypothesis,
    u != v,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',u_not_v) ).

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(v_between_u_and_w,hypothesis,
    between(u,v,w),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',v_between_u_and_w) ).

cnf(prove_w_is_w1,negated_conjecture,
    w != w1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_w_is_w1) ).

cnf(c_0_9,axiom,
    ( equidistant(X3,X4,X1,X2)
    | ~ equidistant(X1,X2,X3,X4) ),
    d2 ).

cnf(c_0_10,hypothesis,
    equidistant(v,w,v,w1),
    v_to_w_equals_v_to_w1 ).

cnf(c_0_11,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_12,hypothesis,
    equidistant(v,w1,v,w),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_13,hypothesis,
    ( X1 = v
    | equidistant(X2,w1,X3,w)
    | ~ between(X4,v,X3)
    | ~ between(X1,v,X2)
    | ~ equidistant(v,X2,v,X3)
    | ~ equidistant(X1,w1,X4,w)
    | ~ equidistant(X1,v,X4,v) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_14,axiom,
    equidistant(X1,X2,X1,X2),
    d1 ).

cnf(c_0_15,hypothesis,
    equidistant(u,w,u,w1),
    u_to_w_equals_u_to_w1 ).

cnf(c_0_16,hypothesis,
    ( X1 = v
    | equidistant(X2,w1,X2,w)
    | ~ between(X3,v,X2)
    | ~ between(X1,v,X2)
    | ~ equidistant(X1,w1,X3,w)
    | ~ equidistant(X1,v,X3,v) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_17,hypothesis,
    equidistant(u,w1,u,w),
    inference(spm,[status(thm)],[c_0_9,c_0_15]) ).

cnf(c_0_18,hypothesis,
    u != v,
    u_not_v ).

cnf(c_0_19,axiom,
    ( X1 = X2
    | ~ equidistant(X1,X2,X3,X3) ),
    identity_for_equidistance ).

cnf(c_0_20,hypothesis,
    ( equidistant(X1,w1,X1,w)
    | ~ between(u,v,X1) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_14])]),c_0_18]) ).

cnf(c_0_21,hypothesis,
    between(u,v,w),
    v_between_u_and_w ).

cnf(c_0_22,negated_conjecture,
    w != w1,
    prove_w_is_w1 ).

cnf(c_0_23,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),c_0_22]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : GEO030-3 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35  % Computer : n019.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Tue Aug 29 22:21:58 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.21/0.57  start to proof: theBenchmark
% 17.77/17.83  % Version  : CSE_E---1.5
% 17.77/17.83  % Problem  : theBenchmark.p
% 17.77/17.83  % Proof found
% 17.77/17.83  % SZS status Theorem for theBenchmark.p
% 17.77/17.83  % SZS output start Proof
% See solution above
% 17.77/17.83  % Total time : 17.249000 s
% 17.77/17.83  % SZS output end Proof
% 17.77/17.83  % Total time : 17.254000 s
%------------------------------------------------------------------------------