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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : GEO059-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:51 EDT 2023

% Result   : Unsatisfiable 0.20s 0.60s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   22
% Syntax   : Number of formulae    :   39 (  16 unt;  13 typ;   0 def)
%            Number of atoms       :   38 (  10 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   25 (  13   ~;  12   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    3 (   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    :   11 (  11 usr;   5 con; 0-6 aty)
%            Number of variables   :   74 (   9 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 ).

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

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(prove_congruence,negated_conjecture,
    ~ equidistant(v,u,v,reflection(reflection(u,v),v)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_congruence) ).

cnf(reflection,axiom,
    reflection(X1,X2) = extension(X1,X2,X1,X2),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-2.ax',reflection) ).

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

cnf(d10_3,axiom,
    ( extension(X1,X2,X1,X2) = extension(X1,X2,X2,X1)
    | X1 = X2 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d10_3) ).

cnf(e1,axiom,
    X1 = extension(X2,X1,X3,X3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e1) ).

cnf(d7,axiom,
    equidistant(X1,X1,X2,X2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d7) ).

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

cnf(c_0_10,axiom,
    equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
    segment_construction2 ).

cnf(c_0_11,negated_conjecture,
    ~ equidistant(v,u,v,reflection(reflection(u,v),v)),
    prove_congruence ).

cnf(c_0_12,axiom,
    reflection(X1,X2) = extension(X1,X2,X1,X2),
    reflection ).

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,plain,
    equidistant(X1,X2,X3,extension(X4,X3,X1,X2)),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_15,axiom,
    ( equidistant(X2,X1,X3,X4)
    | ~ equidistant(X1,X2,X3,X4) ),
    d3 ).

cnf(c_0_16,negated_conjecture,
    ~ equidistant(v,u,v,extension(extension(u,v,u,v),v,extension(u,v,u,v),v)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_12]) ).

cnf(c_0_17,axiom,
    ( extension(X1,X2,X1,X2) = extension(X1,X2,X2,X1)
    | X1 = X2 ),
    d10_3 ).

cnf(c_0_18,plain,
    ( equidistant(X1,X2,X3,extension(X4,X3,X5,X6))
    | ~ equidistant(X5,X6,X1,X2) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_19,plain,
    equidistant(extension(X1,X2,X3,X4),X2,X3,X4),
    inference(spm,[status(thm)],[c_0_15,c_0_10]) ).

cnf(c_0_20,negated_conjecture,
    ( u = v
    | ~ equidistant(v,u,v,extension(extension(u,v,v,u),v,extension(u,v,v,u),v)) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_21,plain,
    equidistant(X1,X2,X3,extension(X4,X3,extension(X5,X6,X1,X2),X6)),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_22,negated_conjecture,
    u = v,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).

cnf(c_0_23,axiom,
    X1 = extension(X2,X1,X3,X3),
    e1 ).

cnf(c_0_24,axiom,
    equidistant(X1,X1,X2,X2),
    d7 ).

cnf(c_0_25,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_22]),c_0_22]),c_0_22]),c_0_23]),c_0_22]),c_0_22]),c_0_23]),c_0_23]),c_0_24])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : GEO059-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.34  % Computer : n024.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Tue Aug 29 23:15:37 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.20/0.57  start to proof: theBenchmark
% 0.20/0.60  % Version  : CSE_E---1.5
% 0.20/0.60  % Problem  : theBenchmark.p
% 0.20/0.60  % Proof found
% 0.20/0.60  % SZS status Theorem for theBenchmark.p
% 0.20/0.60  % SZS output start Proof
% See solution above
% 0.20/0.61  % Total time : 0.023000 s
% 0.20/0.61  % SZS output end Proof
% 0.20/0.61  % Total time : 0.027000 s
%------------------------------------------------------------------------------