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

% Computer : n007.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:29 EDT 2022

% Result   : Theorem 0.49s 0.65s
% Output   : Refutation 0.49s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   10 (   5 unt;   0 nHn;  10 RR)
%            Number of literals    :   16 (   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    :    8 (   8 usr;   7 con; 0-4 aty)
%            Number of variables   :    0 (   0 sgn)

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

cnf(3,axiom,
    ordered_by(skc3,skc5,skc4),
    file('GEO118+1.p',unknown),
    [] ).

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

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

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

cnf(90,plain,
    ( ~ ordered_by(skc3,skc4,u)
    | between_o(skc3,u,skc4,skc5) ),
    inference(res,[status(thm),theory(equality)],[3,61]),
    [iquote('0:Res:3.0,61.0')] ).

cnf(101,plain,
    between_o(skc3,skc5,skc4,skc5),
    inference(res,[status(thm),theory(equality)],[2,90]),
    [iquote('0:Res:2.0,90.0')] ).

cnf(481,plain,
    ( ~ between_o(u,v,w,x)
    | ~ equal(v,x) ),
    inference(res,[status(thm),theory(equality)],[64,35]),
    [iquote('0:Res:64.1,35.1')] ).

cnf(810,plain,
    ~ equal(skc5,skc5),
    inference(res,[status(thm),theory(equality)],[101,481]),
    [iquote('0:Res:101.0,481.0')] ).

cnf(822,plain,
    $false,
    inference(obv,[status(thm),theory(equality)],[810]),
    [iquote('0:Obv:810.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.12  % Problem  : GEO118+1 : TPTP v8.1.0. Released v2.4.0.
% 0.02/0.12  % Command  : run_spass %d %s
% 0.13/0.33  % Computer : n007.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Sat Jun 18 03:01:13 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.49/0.65  
% 0.49/0.65  SPASS V 3.9 
% 0.49/0.65  SPASS beiseite: Proof found.
% 0.49/0.65  % SZS status Theorem
% 0.49/0.65  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.49/0.65  SPASS derived 712 clauses, backtracked 0 clauses, performed 0 splits and kept 674 clauses.
% 0.49/0.65  SPASS allocated 98684 KBytes.
% 0.49/0.65  SPASS spent	0:00:00.29 on the problem.
% 0.49/0.65  		0:00:00.04 for the input.
% 0.49/0.65  		0:00:00.08 for the FLOTTER CNF translation.
% 0.49/0.65  		0:00:00.02 for inferences.
% 0.49/0.65  		0:00:00.00 for the backtracking.
% 0.49/0.65  		0:00:00.13 for the reduction.
% 0.49/0.65  
% 0.49/0.65  
% 0.49/0.65  Here is a proof with depth 3, length 10 :
% 0.49/0.65  % SZS output start Refutation
% See solution above
% 0.49/0.65  Formulae used in the proof : theorem_4_5 between_c_defn part_of_defn between_o_defn o3 o4 start_point_defn
% 0.49/0.65  
%------------------------------------------------------------------------------