↑ Up

SPASS---3.9.THM-Ref.s

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

% Computer : n029.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.17s 0.38s
% Output   : Refutation 0.17s
% 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+1.p',unknown),
    [] ).

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

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

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

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

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

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

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

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

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

cnf(29,plain,
    ~ skP0(skc2,skc3),
    inference(res,[status(thm),theory(equality)],[12,2]),
    [iquote('0:Res:12.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(41,plain,
    ( ~ convergent_lines(skc2,skc3)
    | skP0(u,skc3)
    | skP0(u,skc2) ),
    inference(res,[status(thm),theory(equality)],[28,23]),
    [iquote('0:Res:28.1,23.0')] ).

cnf(43,plain,
    ( ~ convergent_lines(skc2,skc3)
    | skP0(u,skc3)
    | convergent_lines(skc2,u) ),
    inference(res,[status(thm),theory(equality)],[41,11]),
    [iquote('0:Res:41.2,11.0')] ).

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

cnf(49,plain,
    ~ convergent_lines(skc2,skc3),
    inference(mrr,[status(thm)],[45,5]),
    [iquote('0:MRR:45.1,5.0')] ).

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

cnf(62,plain,
    convergent_lines(skc3,skc3),
    inference(res,[status(thm),theory(equality)],[53,49]),
    [iquote('0:Res:53.0,49.0')] ).

cnf(63,plain,
    $false,
    inference(mrr,[status(thm)],[62,5]),
    [iquote('0:MRR:62.0,5.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10  % Problem  : GEO214+1 : TPTP v8.1.0. Released v3.3.0.
% 0.02/0.11  % Command  : run_spass %d %s
% 0.11/0.31  % Computer : n029.cluster.edu
% 0.11/0.31  % Model    : x86_64 x86_64
% 0.11/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31  % Memory   : 8042.1875MB
% 0.11/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31  % CPULimit : 300
% 0.11/0.31  % WCLimit  : 600
% 0.11/0.31  % DateTime : Fri Jun 17 22:01:13 EDT 2022
% 0.11/0.31  % CPUTime  : 
% 0.17/0.38  
% 0.17/0.38  SPASS V 3.9 
% 0.17/0.38  SPASS beiseite: Proof found.
% 0.17/0.38  % SZS status Theorem
% 0.17/0.38  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.17/0.38  SPASS derived 32 clauses, backtracked 0 clauses, performed 0 splits and kept 50 clauses.
% 0.17/0.38  SPASS allocated 85188 KBytes.
% 0.17/0.38  SPASS spent	0:00:00.06 on the problem.
% 0.17/0.38  		0:00:00.02 for the input.
% 0.17/0.38  		0:00:00.02 for the FLOTTER CNF translation.
% 0.17/0.38  		0:00:00.00 for inferences.
% 0.17/0.38  		0:00:00.00 for the backtracking.
% 0.17/0.38  		0:00:00.00 for the reduction.
% 0.17/0.38  
% 0.17/0.38  
% 0.17/0.38  Here is a proof with depth 5, length 19 :
% 0.17/0.38  % SZS output start Refutation
% See solution above
% 0.17/0.38  Formulae used in the proof : con apart3 occu1 oac1 ax6
% 0.17/0.38  
%------------------------------------------------------------------------------