%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : GEO045-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 : n020.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:45 EDT 2023

% Result   : Unsatisfiable 0.20s 0.58s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   21
% Syntax   : Number of formulae    :   32 (  12 unt;  15 typ;   0 def)
%            Number of atoms       :   26 (   4 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   20 (  11   ~;   9   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 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   :   15 (   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,
    x: $i ).

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

cnf(v_between_u_and_w,hypothesis,
    between(u,v,w),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',v_between_u_and_w) ).

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

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

cnf(w_between_v_and_x,hypothesis,
    between(v,w,x),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',w_between_v_and_x) ).

cnf(prove_v_between_u_and_x,negated_conjecture,
    ~ between(u,v,x),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_v_between_u_and_x) ).

cnf(c_0_6,axiom,
    ( between(X3,X2,X1)
    | ~ between(X1,X2,X3) ),
    t1 ).

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

cnf(c_0_8,axiom,
    ( between(X1,X3,X4)
    | X2 = X3
    | ~ between(X1,X2,X3)
    | ~ between(X2,X3,X4) ),
    b6 ).

cnf(c_0_9,hypothesis,
    between(w,v,u),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_10,hypothesis,
    v != w,
    v_not_w ).

cnf(c_0_11,hypothesis,
    between(v,w,x),
    w_between_v_and_x ).

cnf(c_0_12,hypothesis,
    ( between(X1,v,u)
    | ~ between(X1,w,v) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).

cnf(c_0_13,hypothesis,
    between(x,w,v),
    inference(spm,[status(thm)],[c_0_6,c_0_11]) ).

cnf(c_0_14,hypothesis,
    between(x,v,u),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_15,negated_conjecture,
    ~ between(u,v,x),
    prove_v_between_u_and_x ).

cnf(c_0_16,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_14]),c_0_15]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : GEO045-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.12/0.34  % Computer : n020.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 23:22:43 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.20/0.55  start to proof: theBenchmark
% 0.20/0.58  % Version  : CSE_E---1.5
% 0.20/0.58  % Problem  : theBenchmark.p
% 0.20/0.58  % Proof found
% 0.20/0.58  % SZS status Theorem for theBenchmark.p
% 0.20/0.58  % SZS output start Proof
% See solution above
% 0.20/0.58  % Total time : 0.012000 s
% 0.20/0.58  % SZS output end Proof
% 0.20/0.58  % Total time : 0.016000 s
%------------------------------------------------------------------------------