↑ Up

SPASS---3.9.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : GEO213+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n007.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:30 EDT 2022

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

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

cnf(2,axiom,
    ~ distinct_lines(skc5,skc4),
    file('GEO213+1.p',unknown),
    [] ).

cnf(3,axiom,
    ~ unorthogonal_lines(skc3,skc4),
    file('GEO213+1.p',unknown),
    [] ).

cnf(5,axiom,
    ~ distinct_lines(u,u),
    file('GEO213+1.p',unknown),
    [] ).

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

cnf(9,axiom,
    ( unorthogonal_lines(u,v)
    | convergent_lines(u,v) ),
    file('GEO213+1.p',unknown),
    [] ).

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

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

cnf(15,axiom,
    ( ~ distinct_lines(u,v)
    | distinct_lines(v,w)
    | distinct_lines(u,w) ),
    file('GEO213+1.p',unknown),
    [] ).

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

cnf(23,axiom,
    ( ~ convergent_lines(u,v)
    | distinct_lines(v,w)
    | convergent_lines(u,w) ),
    file('GEO213+1.p',unknown),
    [] ).

cnf(24,axiom,
    ( ~ skP0(u,v)
    | skP0(w,u)
    | skP0(w,v) ),
    file('GEO213+1.p',unknown),
    [] ).

cnf(25,axiom,
    ( ~ unorthogonal_lines(u,v)
    | ~ convergent_lines(u,v)
    | skP0(v,u) ),
    file('GEO213+1.p',unknown),
    [] ).

cnf(29,plain,
    ( ~ convergent_lines(skc5,skc3)
    | skP0(skc3,skc5) ),
    inference(res,[status(thm),theory(equality)],[1,25]),
    [iquote('0:Res:1.0,25.1')] ).

cnf(30,plain,
    ~ skP0(skc4,skc3),
    inference(res,[status(thm),theory(equality)],[13,3]),
    [iquote('0:Res:13.1,3.0')] ).

cnf(31,plain,
    convergent_lines(skc3,skc4),
    inference(res,[status(thm),theory(equality)],[9,3]),
    [iquote('0:Res:9.1,3.0')] ).

cnf(35,plain,
    ( ~ distinct_lines(u,skc5)
    | distinct_lines(u,skc4) ),
    inference(res,[status(thm),theory(equality)],[15,2]),
    [iquote('0:Res:15.2,2.0')] ).

cnf(37,plain,
    ( ~ convergent_lines(u,skc5)
    | convergent_lines(u,skc4) ),
    inference(res,[status(thm),theory(equality)],[23,2]),
    [iquote('0:Res:23.2,2.0')] ).

cnf(48,plain,
    ~ distinct_lines(skc4,skc5),
    inference(res,[status(thm),theory(equality)],[35,5]),
    [iquote('0:Res:35.1,5.0')] ).

cnf(51,plain,
    ~ convergent_lines(skc4,skc5),
    inference(res,[status(thm),theory(equality)],[37,6]),
    [iquote('0:Res:37.1,6.0')] ).

cnf(57,plain,
    ( ~ convergent_lines(skc5,skc3)
    | skP0(u,skc3)
    | skP0(u,skc5) ),
    inference(res,[status(thm),theory(equality)],[29,24]),
    [iquote('0:Res:29.1,24.0')] ).

cnf(58,plain,
    ( ~ convergent_lines(skc5,skc3)
    | skP0(skc4,skc5) ),
    inference(res,[status(thm),theory(equality)],[57,30]),
    [iquote('0:Res:57.1,30.0')] ).

cnf(63,plain,
    ( ~ convergent_lines(skc5,skc3)
    | convergent_lines(skc5,skc4) ),
    inference(res,[status(thm),theory(equality)],[58,12]),
    [iquote('0:Res:58.1,12.0')] ).

cnf(87,plain,
    ( distinct_lines(skc4,u)
    | convergent_lines(skc3,u) ),
    inference(res,[status(thm),theory(equality)],[31,23]),
    [iquote('0:Res:31.0,23.0')] ).

cnf(103,plain,
    ( distinct_lines(skc4,u)
    | convergent_lines(u,v)
    | convergent_lines(skc3,v) ),
    inference(res,[status(thm),theory(equality)],[87,16]),
    [iquote('0:Res:87.1,16.0')] ).

cnf(143,plain,
    ( distinct_lines(skc4,u)
    | convergent_lines(u,skc3) ),
    inference(res,[status(thm),theory(equality)],[103,6]),
    [iquote('0:Res:103.2,6.0')] ).

cnf(153,plain,
    ( distinct_lines(skc4,skc5)
    | convergent_lines(skc5,skc4) ),
    inference(res,[status(thm),theory(equality)],[143,63]),
    [iquote('0:Res:143.1,63.0')] ).

cnf(155,plain,
    convergent_lines(skc5,skc4),
    inference(mrr,[status(thm)],[153,48]),
    [iquote('0:MRR:153.0,48.0')] ).

cnf(172,plain,
    ( convergent_lines(skc4,u)
    | convergent_lines(skc5,u) ),
    inference(res,[status(thm),theory(equality)],[155,16]),
    [iquote('0:Res:155.0,16.0')] ).

cnf(198,plain,
    convergent_lines(skc5,skc5),
    inference(res,[status(thm),theory(equality)],[172,51]),
    [iquote('0:Res:172.0,51.0')] ).

cnf(199,plain,
    $false,
    inference(mrr,[status(thm)],[198,6]),
    [iquote('0:MRR:198.0,6.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : GEO213+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.14  % Command  : run_spass %d %s
% 0.13/0.35  % Computer : n007.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Sat Jun 18 00:02:42 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.21/0.47  
% 0.21/0.47  SPASS V 3.9 
% 0.21/0.47  SPASS beiseite: Proof found.
% 0.21/0.47  % SZS status Theorem
% 0.21/0.47  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.21/0.47  SPASS derived 164 clauses, backtracked 0 clauses, performed 0 splits and kept 145 clauses.
% 0.21/0.47  SPASS allocated 85205 KBytes.
% 0.21/0.47  SPASS spent	0:00:00.10 on the problem.
% 0.21/0.47  		0:00:00.04 for the input.
% 0.21/0.47  		0:00:00.03 for the FLOTTER CNF translation.
% 0.21/0.47  		0:00:00.00 for inferences.
% 0.21/0.47  		0:00:00.00 for the backtracking.
% 0.21/0.47  		0:00:00.01 for the reduction.
% 0.21/0.47  
% 0.21/0.47  
% 0.21/0.47  Here is a proof with depth 7, length 31 :
% 0.21/0.47  % SZS output start Refutation
% See solution above
% 0.21/0.47  Formulae used in the proof : con apart2 apart3 occu1 oac1 apart5 ax6 ceq3
% 0.21/0.47  
%------------------------------------------------------------------------------