TSTP Solution File: GEO199+2 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : GEO199+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n003.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:18 EDT 2022

% Result   : Theorem 0.66s 0.84s
% Output   : Refutation 0.66s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   36 (  13 unt;  14 nHn;  36 RR)
%            Number of literals    :   76 (   0 equ;  26 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   7 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

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

cnf(4,axiom,
    ~ distinct_points(u,u),
    file('GEO199+2.p',unknown),
    [] ).

cnf(6,axiom,
    ~ convergent_lines(u,u),
    file('GEO199+2.p',unknown),
    [] ).

cnf(7,axiom,
    apart_point_and_line(intersection_point(skc3,skc5),skc4),
    file('GEO199+2.p',unknown),
    [] ).

cnf(8,axiom,
    ~ apart_point_and_line(intersection_point(skc5,skc3),skc4),
    file('GEO199+2.p',unknown),
    [] ).

cnf(9,axiom,
    ( ~ convergent_lines(u,v)
    | distinct_lines(u,v) ),
    file('GEO199+2.p',unknown),
    [] ).

cnf(10,axiom,
    ( ~ distinct_points(u,v)
    | distinct_points(v,w)
    | distinct_points(u,w) ),
    file('GEO199+2.p',unknown),
    [] ).

cnf(12,axiom,
    ( ~ convergent_lines(u,v)
    | convergent_lines(v,w)
    | convergent_lines(u,w) ),
    file('GEO199+2.p',unknown),
    [] ).

cnf(13,axiom,
    ( ~ apart_point_and_line(u,v)
    | apart_point_and_line(w,v)
    | distinct_points(u,w) ),
    file('GEO199+2.p',unknown),
    [] ).

cnf(17,axiom,
    ( ~ convergent_lines(u,v)
    | ~ apart_point_and_line(w,u)
    | distinct_points(w,intersection_point(u,v)) ),
    file('GEO199+2.p',unknown),
    [] ).

cnf(18,axiom,
    ( ~ convergent_lines(u,v)
    | ~ apart_point_and_line(w,v)
    | distinct_points(w,intersection_point(u,v)) ),
    file('GEO199+2.p',unknown),
    [] ).

cnf(19,axiom,
    ( ~ distinct_lines(u,v)
    | ~ distinct_points(w,x)
    | apart_point_and_line(x,u)
    | apart_point_and_line(x,v)
    | apart_point_and_line(w,v)
    | apart_point_and_line(w,u) ),
    file('GEO199+2.p',unknown),
    [] ).

cnf(28,plain,
    ( convergent_lines(skc3,u)
    | convergent_lines(skc5,u) ),
    inference(res,[status(thm),theory(equality)],[1,12]),
    [iquote('0:Res:1.0,12.0')] ).

cnf(29,plain,
    distinct_lines(skc5,skc3),
    inference(res,[status(thm),theory(equality)],[1,9]),
    [iquote('0:Res:1.0,9.0')] ).

cnf(30,plain,
    ( ~ apart_point_and_line(u,skc5)
    | distinct_points(u,intersection_point(skc5,skc3)) ),
    inference(res,[status(thm),theory(equality)],[1,17]),
    [iquote('0:Res:1.0,17.1')] ).

cnf(31,plain,
    ( ~ apart_point_and_line(u,skc3)
    | distinct_points(u,intersection_point(skc5,skc3)) ),
    inference(res,[status(thm),theory(equality)],[1,18]),
    [iquote('0:Res:1.0,18.1')] ).

cnf(39,plain,
    ( ~ apart_point_and_line(u,skc4)
    | distinct_points(u,intersection_point(skc5,skc3)) ),
    inference(res,[status(thm),theory(equality)],[13,8]),
    [iquote('0:Res:13.2,8.0')] ).

cnf(48,plain,
    ~ apart_point_and_line(intersection_point(skc5,skc3),skc3),
    inference(res,[status(thm),theory(equality)],[31,4]),
    [iquote('0:Res:31.1,4.0')] ).

cnf(63,plain,
    ( convergent_lines(skc5,u)
    | convergent_lines(u,v)
    | convergent_lines(skc3,v) ),
    inference(res,[status(thm),theory(equality)],[28,12]),
    [iquote('0:Res:28.0,12.0')] ).

cnf(65,plain,
    ~ apart_point_and_line(intersection_point(skc5,skc3),skc5),
    inference(res,[status(thm),theory(equality)],[30,4]),
    [iquote('0:Res:30.1,4.0')] ).

cnf(70,plain,
    ( ~ apart_point_and_line(u,skc4)
    | distinct_points(intersection_point(skc5,skc3),v)
    | distinct_points(u,v) ),
    inference(res,[status(thm),theory(equality)],[39,10]),
    [iquote('0:Res:39.1,10.0')] ).

cnf(106,plain,
    ( ~ convergent_lines(u,v)
    | ~ apart_point_and_line(intersection_point(u,v),v) ),
    inference(res,[status(thm),theory(equality)],[18,4]),
    [iquote('0:Res:18.2,4.0')] ).

cnf(124,plain,
    ( convergent_lines(skc5,u)
    | convergent_lines(u,skc3) ),
    inference(res,[status(thm),theory(equality)],[63,6]),
    [iquote('0:Res:63.2,6.0')] ).

cnf(126,plain,
    ( ~ convergent_lines(u,v)
    | ~ apart_point_and_line(intersection_point(u,v),u) ),
    inference(res,[status(thm),theory(equality)],[17,4]),
    [iquote('0:Res:17.2,4.0')] ).

cnf(128,plain,
    ( convergent_lines(u,skc3)
    | convergent_lines(u,v)
    | convergent_lines(skc5,v) ),
    inference(res,[status(thm),theory(equality)],[124,12]),
    [iquote('0:Res:124.0,12.0')] ).

cnf(187,plain,
    ( ~ distinct_points(u,v)
    | apart_point_and_line(v,skc5)
    | apart_point_and_line(v,skc3)
    | apart_point_and_line(u,skc3)
    | apart_point_and_line(u,skc5) ),
    inference(res,[status(thm),theory(equality)],[29,19]),
    [iquote('0:Res:29.0,19.0')] ).

cnf(246,plain,
    ( convergent_lines(u,skc3)
    | convergent_lines(u,skc5) ),
    inference(res,[status(thm),theory(equality)],[128,6]),
    [iquote('0:Res:128.2,6.0')] ).

cnf(252,plain,
    convergent_lines(skc3,skc5),
    inference(res,[status(thm),theory(equality)],[246,6]),
    [iquote('0:Res:246.0,6.0')] ).

cnf(897,plain,
    ( distinct_points(intersection_point(skc5,skc3),u)
    | distinct_points(intersection_point(skc3,skc5),u) ),
    inference(res,[status(thm),theory(equality)],[7,70]),
    [iquote('0:Res:7.0,70.0')] ).

cnf(900,plain,
    distinct_points(intersection_point(skc5,skc3),intersection_point(skc3,skc5)),
    inference(res,[status(thm),theory(equality)],[897,4]),
    [iquote('0:Res:897.1,4.0')] ).

cnf(1741,plain,
    ( apart_point_and_line(intersection_point(skc3,skc5),skc5)
    | apart_point_and_line(intersection_point(skc3,skc5),skc3)
    | apart_point_and_line(intersection_point(skc5,skc3),skc3)
    | apart_point_and_line(intersection_point(skc5,skc3),skc5) ),
    inference(res,[status(thm),theory(equality)],[900,187]),
    [iquote('0:Res:900.0,187.0')] ).

cnf(1747,plain,
    ( apart_point_and_line(intersection_point(skc3,skc5),skc5)
    | apart_point_and_line(intersection_point(skc3,skc5),skc3) ),
    inference(mrr,[status(thm)],[1741,48,65]),
    [iquote('0:MRR:1741.2,1741.3,48.0,65.0')] ).

cnf(1763,plain,
    ( ~ convergent_lines(skc3,skc5)
    | apart_point_and_line(intersection_point(skc3,skc5),skc5) ),
    inference(res,[status(thm),theory(equality)],[1747,126]),
    [iquote('0:Res:1747.1,126.1')] ).

cnf(1775,plain,
    apart_point_and_line(intersection_point(skc3,skc5),skc5),
    inference(mrr,[status(thm)],[1763,252]),
    [iquote('0:MRR:1763.0,252.0')] ).

cnf(1777,plain,
    ~ convergent_lines(skc3,skc5),
    inference(res,[status(thm),theory(equality)],[1775,106]),
    [iquote('0:Res:1775.0,106.1')] ).

cnf(1787,plain,
    $false,
    inference(mrr,[status(thm)],[1777,252]),
    [iquote('0:MRR:1777.0,252.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : GEO199+2 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n003.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 : Sat Jun 18 01:39:42 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.66/0.84  
% 0.66/0.84  SPASS V 3.9 
% 0.66/0.84  SPASS beiseite: Proof found.
% 0.66/0.84  % SZS status Theorem
% 0.66/0.84  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.66/0.84  SPASS derived 1668 clauses, backtracked 0 clauses, performed 0 splits and kept 853 clauses.
% 0.66/0.84  SPASS allocated 86034 KBytes.
% 0.66/0.84  SPASS spent	0:00:00.49 on the problem.
% 0.66/0.84  		0:00:00.03 for the input.
% 0.66/0.84  		0:00:00.03 for the FLOTTER CNF translation.
% 0.66/0.84  		0:00:00.03 for inferences.
% 0.66/0.84  		0:00:00.00 for the backtracking.
% 0.66/0.84  		0:00:00.37 for the reduction.
% 0.66/0.84  
% 0.66/0.84  
% 0.66/0.84  Here is a proof with depth 7, length 36 :
% 0.66/0.84  % SZS output start Refutation
% See solution above
% 0.66/0.84  Formulae used in the proof : con apart1 apart3 ceq3 apart4 apart6 ceq1 con2 cu1
% 0.66/0.84  
%------------------------------------------------------------------------------