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

View Problem - Process Solution

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

% Computer : n025.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:11 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(4,axiom,
    ~ distinct_lines(u,u),
    file('GEO191+3.p',unknown),
    [] ).

cnf(8,axiom,
    ~ convergent_lines(parallel_through_point(u,v),u),
    file('GEO191+3.p',unknown),
    [] ).

cnf(9,axiom,
    ~ apart_point_and_line(u,parallel_through_point(v,u)),
    file('GEO191+3.p',unknown),
    [] ).

cnf(17,axiom,
    ( equal_lines(u,v)
    | distinct_lines(u,v) ),
    file('GEO191+3.p',unknown),
    [] ).

cnf(21,axiom,
    ( ~ distinct_lines(u,v)
    | convergent_lines(u,v) ),
    file('GEO191+3.p',unknown),
    [] ).

cnf(25,axiom,
    ( ~ distinct_lines(u,v)
    | ~ equal_lines(u,v) ),
    file('GEO191+3.p',unknown),
    [] ).

cnf(29,axiom,
    ( apart_point_and_line(intersection_point(skc7,skc6),skc5)
    | apart_point_and_line(intersection_point(skc7,skc6),skc4) ),
    file('GEO191+3.p',unknown),
    [] ).

cnf(31,axiom,
    ( ~ distinct_lines(u,v)
    | distinct_lines(v,w)
    | distinct_lines(u,w) ),
    file('GEO191+3.p',unknown),
    [] ).

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

cnf(38,axiom,
    ( ~ apart_point_and_line(u,v)
    | distinct_lines(v,w)
    | apart_point_and_line(u,w) ),
    file('GEO191+3.p',unknown),
    [] ).

cnf(274,plain,
    ( apart_point_and_line(intersection_point(skc7,skc6),skc5)
    | apart_point_and_line(u,skc4)
    | distinct_points(intersection_point(skc7,skc6),u) ),
    inference(res,[status(thm),theory(equality)],[29,37]),
    [iquote('0:Res:29.1,37.0')] ).

cnf(396,plain,
    ( equal_lines(u,v)
    | distinct_lines(v,w)
    | distinct_lines(u,w) ),
    inference(res,[status(thm),theory(equality)],[17,31]),
    [iquote('0:Res:17.1,31.0')] ).

cnf(408,plain,
    ( apart_point_and_line(intersection_point(skc7,skc6),skc5)
    | distinct_lines(skc4,u)
    | apart_point_and_line(intersection_point(skc7,skc6),u) ),
    inference(res,[status(thm),theory(equality)],[29,38]),
    [iquote('0:Res:29.1,38.0')] ).

cnf(756,plain,
    ( equal_lines(u,v)
    | distinct_lines(v,u) ),
    inference(res,[status(thm),theory(equality)],[396,4]),
    [iquote('0:Res:396.2,4.0')] ).

cnf(767,plain,
    ( equal_lines(u,v)
    | convergent_lines(v,u) ),
    inference(res,[status(thm),theory(equality)],[756,21]),
    [iquote('0:Res:756.1,21.0')] ).

cnf(769,plain,
    equal_lines(u,parallel_through_point(u,v)),
    inference(res,[status(thm),theory(equality)],[767,8]),
    [iquote('0:Res:767.1,8.0')] ).

cnf(887,plain,
    apart_point_and_line(intersection_point(skc7,skc6),skc5),
    inference(spt,[spt(split,[position(s1)])],[274]),
    [iquote('1:Spt:274.0')] ).

cnf(888,plain,
    ( distinct_lines(skc5,u)
    | apart_point_and_line(intersection_point(skc7,skc6),u) ),
    inference(res,[status(thm),theory(equality)],[887,38]),
    [iquote('1:Res:887.0,38.0')] ).

cnf(1337,plain,
    distinct_lines(skc5,parallel_through_point(u,intersection_point(skc7,skc6))),
    inference(res,[status(thm),theory(equality)],[888,9]),
    [iquote('1:Res:888.1,9.0')] ).

cnf(1361,plain,
    ~ equal_lines(skc5,parallel_through_point(u,intersection_point(skc7,skc6))),
    inference(res,[status(thm),theory(equality)],[1337,25]),
    [iquote('1:Res:1337.0,25.0')] ).

cnf(1363,plain,
    $false,
    inference(unc,[status(thm)],[1361,769]),
    [iquote('1:UnC:1361.0,769.0')] ).

cnf(1364,plain,
    ~ apart_point_and_line(intersection_point(skc7,skc6),skc5),
    inference(spt,[spt(split,[position(sa)])],[1363,887]),
    [iquote('1:Spt:1363.0,274.0,887.0')] ).

cnf(1365,plain,
    ( apart_point_and_line(u,skc4)
    | distinct_points(intersection_point(skc7,skc6),u) ),
    inference(spt,[spt(split,[position(s2)])],[274]),
    [iquote('1:Spt:1363.0,274.1,274.2')] ).

cnf(1368,plain,
    ( distinct_lines(skc4,u)
    | apart_point_and_line(intersection_point(skc7,skc6),u) ),
    inference(mrr,[status(thm)],[408,1364]),
    [iquote('1:MRR:408.0,1364.0')] ).

cnf(1419,plain,
    distinct_lines(skc4,parallel_through_point(u,intersection_point(skc7,skc6))),
    inference(res,[status(thm),theory(equality)],[1368,9]),
    [iquote('1:Res:1368.1,9.0')] ).

cnf(1447,plain,
    ~ equal_lines(skc4,parallel_through_point(u,intersection_point(skc7,skc6))),
    inference(res,[status(thm),theory(equality)],[1419,25]),
    [iquote('1:Res:1419.0,25.0')] ).

cnf(1449,plain,
    $false,
    inference(unc,[status(thm)],[1447,769]),
    [iquote('1:UnC:1447.0,769.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : GEO191+3 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n025.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 : Sat Jun 18 06:12:28 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.58  
% 0.18/0.58  SPASS V 3.9 
% 0.18/0.58  SPASS beiseite: Proof found.
% 0.18/0.58  % SZS status Theorem
% 0.18/0.58  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.18/0.58  SPASS derived 1344 clauses, backtracked 14 clauses, performed 1 splits and kept 991 clauses.
% 0.18/0.58  SPASS allocated 98487 KBytes.
% 0.18/0.58  SPASS spent	0:00:00.23 on the problem.
% 0.18/0.58  		0:00:00.03 for the input.
% 0.18/0.58  		0:00:00.03 for the FLOTTER CNF translation.
% 0.18/0.58  		0:00:00.01 for inferences.
% 0.18/0.58  		0:00:00.00 for the backtracking.
% 0.18/0.58  		0:00:00.12 for the reduction.
% 0.18/0.58  
% 0.18/0.58  
% 0.18/0.58  Here is a proof with depth 5, length 27 :
% 0.18/0.58  % SZS output start Refutation
% See solution above
% 0.18/0.58  Formulae used in the proof : apart2 cp1 cp2 ax2 p1 con apart5 ceq1 ceq2
% 0.18/0.58  
%------------------------------------------------------------------------------