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

View Problem - Process Solution

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

% Computer : n028.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:31 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    unorthogonal_lines(skc2,skc3),
    file('GEO214+2.p',unknown),
    [] ).

cnf(2,axiom,
    ~ unorthogonal_lines(skc3,skc2),
    file('GEO214+2.p',unknown),
    [] ).

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

cnf(8,axiom,
    ( unorthogonal_lines(u,v)
    | convergent_lines(u,v) ),
    file('GEO214+2.p',unknown),
    [] ).

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

cnf(13,axiom,
    ( ~ skP0(u,v)
    | unorthogonal_lines(v,u) ),
    file('GEO214+2.p',unknown),
    [] ).

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

cnf(19,axiom,
    ( ~ skP0(u,v)
    | skP0(w,u)
    | skP0(w,v) ),
    file('GEO214+2.p',unknown),
    [] ).

cnf(20,axiom,
    ( ~ unorthogonal_lines(u,v)
    | ~ convergent_lines(u,v)
    | skP0(v,u) ),
    file('GEO214+2.p',unknown),
    [] ).

cnf(28,plain,
    ( ~ convergent_lines(skc2,skc3)
    | skP0(skc3,skc2) ),
    inference(res,[status(thm),theory(equality)],[1,20]),
    [iquote('0:Res:1.0,20.1')] ).

cnf(29,plain,
    ~ skP0(skc2,skc3),
    inference(res,[status(thm),theory(equality)],[13,2]),
    [iquote('0:Res:13.1,2.0')] ).

cnf(30,plain,
    convergent_lines(skc3,skc2),
    inference(res,[status(thm),theory(equality)],[8,2]),
    [iquote('0:Res:8.1,2.0')] ).

cnf(44,plain,
    ( ~ convergent_lines(skc2,skc3)
    | skP0(u,skc3)
    | skP0(u,skc2) ),
    inference(res,[status(thm),theory(equality)],[28,19]),
    [iquote('0:Res:28.1,19.0')] ).

cnf(46,plain,
    ( ~ convergent_lines(skc2,skc3)
    | skP0(u,skc3)
    | convergent_lines(skc2,u) ),
    inference(res,[status(thm),theory(equality)],[44,12]),
    [iquote('0:Res:44.2,12.0')] ).

cnf(48,plain,
    ( ~ convergent_lines(skc2,skc3)
    | convergent_lines(skc2,skc2) ),
    inference(res,[status(thm),theory(equality)],[46,29]),
    [iquote('0:Res:46.1,29.0')] ).

cnf(52,plain,
    ~ convergent_lines(skc2,skc3),
    inference(mrr,[status(thm)],[48,5]),
    [iquote('0:MRR:48.1,5.0')] ).

cnf(113,plain,
    ( convergent_lines(skc2,u)
    | convergent_lines(skc3,u) ),
    inference(res,[status(thm),theory(equality)],[30,16]),
    [iquote('0:Res:30.0,16.0')] ).

cnf(119,plain,
    convergent_lines(skc3,skc3),
    inference(res,[status(thm),theory(equality)],[113,52]),
    [iquote('0:Res:113.0,52.0')] ).

cnf(120,plain,
    $false,
    inference(mrr,[status(thm)],[119,5]),
    [iquote('0:MRR:119.0,5.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : GEO214+2 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.14  % Command  : run_spass %d %s
% 0.14/0.35  % Computer : n028.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Fri Jun 17 18:25:28 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.20/0.46  
% 0.20/0.46  SPASS V 3.9 
% 0.20/0.46  SPASS beiseite: Proof found.
% 0.20/0.46  % SZS status Theorem
% 0.20/0.46  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.20/0.46  SPASS derived 83 clauses, backtracked 0 clauses, performed 0 splits and kept 70 clauses.
% 0.20/0.46  SPASS allocated 85192 KBytes.
% 0.20/0.46  SPASS spent	0:00:00.09 on the problem.
% 0.20/0.46  		0:00:00.04 for the input.
% 0.20/0.46  		0:00:00.03 for the FLOTTER CNF translation.
% 0.20/0.46  		0:00:00.00 for inferences.
% 0.20/0.46  		0:00:00.00 for the backtracking.
% 0.20/0.46  		0:00:00.00 for the reduction.
% 0.20/0.46  
% 0.20/0.46  
% 0.20/0.46  Here is a proof with depth 5, length 19 :
% 0.20/0.46  % SZS output start Refutation
% See solution above
% 0.20/0.46  Formulae used in the proof : con apart3 occu1 oac1 apart6
% 0.20/0.46  
%------------------------------------------------------------------------------