TSTP Solution File: GEO176+3 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : GEO176+3 : TPTP v8.1.0. Released v4.0.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:58 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(2,axiom,
    convergent_lines(skc4,skc5),
    file('GEO176+3.p',unknown),
    [] ).

cnf(6,axiom,
    ~ distinct_points(skc6,intersection_point(skc4,skc5)),
    file('GEO176+3.p',unknown),
    [] ).

cnf(7,axiom,
    ( apart_point_and_line(skc6,skc5)
    | apart_point_and_line(skc6,skc4) ),
    file('GEO176+3.p',unknown),
    [] ).

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

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

cnf(36,axiom,
    ( ~ apart_point_and_line(u,v)
    | apart_point_and_line(w,v)
    | distinct_points(u,w) ),
    file('GEO176+3.p',unknown),
    [] ).

cnf(54,plain,
    ~ apart_point_and_line(intersection_point(skc4,skc5),skc4),
    inference(res,[status(thm),theory(equality)],[2,34]),
    [iquote('0:Res:2.0,34.0')] ).

cnf(55,plain,
    ~ apart_point_and_line(intersection_point(skc4,skc5),skc5),
    inference(res,[status(thm),theory(equality)],[2,35]),
    [iquote('0:Res:2.0,35.0')] ).

cnf(68,plain,
    ( ~ apart_point_and_line(skc6,u)
    | apart_point_and_line(intersection_point(skc4,skc5),u) ),
    inference(res,[status(thm),theory(equality)],[36,6]),
    [iquote('0:Res:36.1,6.0')] ).

cnf(155,plain,
    ~ apart_point_and_line(skc6,skc5),
    inference(res,[status(thm),theory(equality)],[68,55]),
    [iquote('0:Res:68.1,55.0')] ).

cnf(156,plain,
    ~ apart_point_and_line(skc6,skc4),
    inference(res,[status(thm),theory(equality)],[68,54]),
    [iquote('0:Res:68.1,54.0')] ).

cnf(160,plain,
    apart_point_and_line(skc6,skc4),
    inference(mrr,[status(thm)],[7,155]),
    [iquote('0:MRR:7.0,155.0')] ).

cnf(162,plain,
    $false,
    inference(mrr,[status(thm)],[156,160]),
    [iquote('0:MRR:156.0,160.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GEO176+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n016.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Fri Jun 17 22:58:21 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.20/0.44  
% 0.20/0.44  SPASS V 3.9 
% 0.20/0.44  SPASS beiseite: Proof found.
% 0.20/0.44  % SZS status Theorem
% 0.20/0.44  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.20/0.44  SPASS derived 107 clauses, backtracked 0 clauses, performed 0 splits and kept 121 clauses.
% 0.20/0.44  SPASS allocated 97747 KBytes.
% 0.20/0.44  SPASS spent	0:00:00.09 on the problem.
% 0.20/0.44  		0:00:00.04 for the input.
% 0.20/0.44  		0:00:00.03 for the FLOTTER CNF translation.
% 0.20/0.44  		0:00:00.00 for inferences.
% 0.20/0.44  		0:00:00.00 for the backtracking.
% 0.20/0.44  		0:00:00.00 for the reduction.
% 0.20/0.44  
% 0.20/0.44  
% 0.20/0.44  Here is a proof with depth 2, length 13 :
% 0.20/0.44  % SZS output start Refutation
% See solution above
% 0.20/0.44  Formulae used in the proof : con ci3 ci4 ceq1
% 0.20/0.44  
%------------------------------------------------------------------------------