%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : GEO117+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n016.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  : 600s
% DateTime : Sat Jul 16 06:22:28 EDT 2022

% Result   : Theorem 0.49s 0.69s
% Output   : Refutation 0.49s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of clauses     :    9 (   4 unt;   0 nHn;   9 RR)
%            Number of literals    :   15 (   0 equ;   9 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-4 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-4 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(2,axiom,
    ordered_by(skc3,skc2,skc2),
    file('GEO117+1.p',unknown),
    [] ).

cnf(34,axiom,
    ( ~ equal(u,v)
    | ~ between_c(w,u,x,v) ),
    file('GEO117+1.p',unknown),
    [] ).

cnf(60,axiom,
    ( ~ ordered_by(u,v,w)
    | ~ ordered_by(u,x,v)
    | between_o(u,w,v,x) ),
    file('GEO117+1.p',unknown),
    [] ).

cnf(63,axiom,
    ( ~ between_o(u,v,w,x)
    | between_c(skf41(u,x,w,v),v,w,x) ),
    file('GEO117+1.p',unknown),
    [] ).

cnf(89,plain,
    ( ~ ordered_by(skc3,skc2,u)
    | between_o(skc3,u,skc2,skc2) ),
    inference(res,[status(thm),theory(equality)],[2,60]),
    [iquote('0:Res:2.0,60.0')] ).

cnf(94,plain,
    between_o(skc3,skc2,skc2,skc2),
    inference(res,[status(thm),theory(equality)],[2,89]),
    [iquote('0:Res:2.0,89.0')] ).

cnf(470,plain,
    ( ~ between_o(u,v,w,x)
    | ~ equal(v,x) ),
    inference(res,[status(thm),theory(equality)],[63,34]),
    [iquote('0:Res:63.1,34.1')] ).

cnf(841,plain,
    ~ equal(skc2,skc2),
    inference(res,[status(thm),theory(equality)],[94,470]),
    [iquote('0:Res:94.0,470.0')] ).

cnf(848,plain,
    $false,
    inference(obv,[status(thm),theory(equality)],[841]),
    [iquote('0:Obv:841.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : GEO117+1 : TPTP v8.1.0. Released v2.4.0.
% 0.13/0.14  % Command  : run_spass %d %s
% 0.14/0.36  % Computer : n016.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 600
% 0.14/0.36  % DateTime : Sat Jun 18 15:15:07 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.49/0.69  
% 0.49/0.69  SPASS V 3.9 
% 0.49/0.69  SPASS beiseite: Proof found.
% 0.49/0.69  % SZS status Theorem
% 0.49/0.69  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.49/0.69  SPASS derived 723 clauses, backtracked 0 clauses, performed 0 splits and kept 691 clauses.
% 0.49/0.69  SPASS allocated 98712 KBytes.
% 0.49/0.69  SPASS spent	0:00:00.32 on the problem.
% 0.49/0.69  		0:00:00.04 for the input.
% 0.49/0.69  		0:00:00.08 for the FLOTTER CNF translation.
% 0.49/0.69  		0:00:00.02 for inferences.
% 0.49/0.69  		0:00:00.00 for the backtracking.
% 0.49/0.69  		0:00:00.15 for the reduction.
% 0.49/0.69  
% 0.49/0.69  
% 0.49/0.69  Here is a proof with depth 3, length 9 :
% 0.49/0.69  % SZS output start Refutation
% See solution above
% 0.49/0.69  Formulae used in the proof : theorem_4_4 between_c_defn part_of_defn between_o_defn o3 o4 start_point_defn o2
% 0.49/0.69  
%------------------------------------------------------------------------------