%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : GEO224+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n021.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:23:40 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    line(skc2),
    file('GEO224+3.p',unknown),
    [] ).

cnf(2,axiom,
    point(skc3),
    file('GEO224+3.p',unknown),
    [] ).

cnf(9,axiom,
    ~ unorthogonal_lines(orthogonal_through_point(u,v),u),
    file('GEO224+3.p',unknown),
    [] ).

cnf(11,axiom,
    ( unorthogonal_lines(u,v)
    | convergent_lines(u,v) ),
    file('GEO224+3.p',unknown),
    [] ).

cnf(17,axiom,
    ( incident_point_and_line(u,v)
    | apart_point_and_line(u,v) ),
    file('GEO224+3.p',unknown),
    [] ).

cnf(19,axiom,
    ( ~ point(u)
    | ~ incident_point_and_line(u,skc2) ),
    file('GEO224+3.p',unknown),
    [] ).

cnf(34,axiom,
    ( ~ convergent_lines(u,v)
    | ~ apart_point_and_line(intersection_point(u,v),v) ),
    file('GEO224+3.p',unknown),
    [] ).

cnf(41,axiom,
    ( ~ point(u)
    | ~ line(v)
    | line(orthogonal_through_point(v,u)) ),
    file('GEO224+3.p',unknown),
    [] ).

cnf(47,axiom,
    ( ~ line(u)
    | ~ line(v)
    | ~ convergent_lines(v,u)
    | point(intersection_point(v,u)) ),
    file('GEO224+3.p',unknown),
    [] ).

cnf(54,plain,
    ( ~ line(u)
    | line(orthogonal_through_point(u,skc3)) ),
    inference(res,[status(thm),theory(equality)],[2,41]),
    [iquote('0:Res:2.0,41.1')] ).

cnf(58,plain,
    ( ~ line(u)
    | ~ convergent_lines(u,skc2)
    | point(intersection_point(u,skc2)) ),
    inference(res,[status(thm),theory(equality)],[1,47]),
    [iquote('0:Res:1.0,47.1')] ).

cnf(62,plain,
    line(orthogonal_through_point(skc2,skc3)),
    inference(res,[status(thm),theory(equality)],[1,54]),
    [iquote('0:Res:1.0,54.0')] ).

cnf(95,plain,
    convergent_lines(orthogonal_through_point(u,v),u),
    inference(res,[status(thm),theory(equality)],[11,9]),
    [iquote('0:Res:11.0,9.0')] ).

cnf(96,plain,
    ( ~ point(u)
    | apart_point_and_line(u,skc2) ),
    inference(res,[status(thm),theory(equality)],[17,19]),
    [iquote('0:Res:17.0,19.1')] ).

cnf(119,plain,
    ( ~ point(intersection_point(u,skc2))
    | ~ convergent_lines(u,skc2) ),
    inference(res,[status(thm),theory(equality)],[96,34]),
    [iquote('0:Res:96.1,34.1')] ).

cnf(120,plain,
    ( ~ line(u)
    | ~ convergent_lines(u,skc2) ),
    inference(mrr,[status(thm)],[58,119]),
    [iquote('0:MRR:58.2,119.0')] ).

cnf(122,plain,
    ~ line(orthogonal_through_point(skc2,u)),
    inference(res,[status(thm),theory(equality)],[95,120]),
    [iquote('0:Res:95.0,120.1')] ).

cnf(126,plain,
    $false,
    inference(unc,[status(thm)],[122,62]),
    [iquote('0:UnC:122.0,62.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : GEO224+3 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n021.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  : 600
% 0.13/0.34  % DateTime : Fri Jun 17 15:21:01 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.21/0.45  
% 0.21/0.45  SPASS V 3.9 
% 0.21/0.45  SPASS beiseite: Proof found.
% 0.21/0.45  % SZS status Theorem
% 0.21/0.45  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.21/0.45  SPASS derived 60 clauses, backtracked 0 clauses, performed 0 splits and kept 87 clauses.
% 0.21/0.45  SPASS allocated 97740 KBytes.
% 0.21/0.45  SPASS spent	0:00:00.09 on the problem.
% 0.21/0.45  		0:00:00.04 for the input.
% 0.21/0.45  		0:00:00.03 for the FLOTTER CNF translation.
% 0.21/0.45  		0:00:00.00 for inferences.
% 0.21/0.45  		0:00:00.00 for the backtracking.
% 0.21/0.45  		0:00:00.00 for the reduction.
% 0.21/0.45  
% 0.21/0.45  
% 0.21/0.45  Here is a proof with depth 2, length 18 :
% 0.21/0.45  % SZS output start Refutation
% See solution above
% 0.21/0.45  Formulae used in the proof : con ooc1 coipo1 a4 ci4 orth1 int1
% 0.21/0.45  
%------------------------------------------------------------------------------