TSTP Solution File: GEO263+1 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : GEO263+1 : TPTP v8.1.0. Bugfixed v6.4.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n013.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:24:03 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    convergent_lines(skc11,skc6),
    file('GEO263+1.p',unknown),
    [] ).

cnf(8,axiom,
    ~ left_convergent_lines(u,v),
    file('GEO263+1.p',unknown),
    [] ).

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

cnf(18,axiom,
    ( ~ convergent_lines(u,v)
    | unequally_directed_lines(u,reverse_line(v)) ),
    file('GEO263+1.p',unknown),
    [] ).

cnf(56,axiom,
    ( ~ unequally_directed_lines(u,v)
    | ~ unequally_directed_lines(u,reverse_line(v))
    | left_convergent_lines(u,v)
    | left_convergent_lines(u,reverse_line(v)) ),
    file('GEO263+1.p',unknown),
    [] ).

cnf(64,plain,
    ( ~ unequally_directed_lines(u,v)
    | ~ unequally_directed_lines(u,reverse_line(v)) ),
    inference(mrr,[status(thm)],[56,8]),
    [iquote('0:MRR:56.2,56.3,8.0,8.0')] ).

cnf(102,plain,
    ( ~ convergent_lines(u,v)
    | ~ unequally_directed_lines(u,v) ),
    inference(res,[status(thm),theory(equality)],[18,64]),
    [iquote('0:Res:18.1,64.1')] ).

cnf(107,plain,
    ~ convergent_lines(u,v),
    inference(mrr,[status(thm)],[102,15]),
    [iquote('0:MRR:102.1,15.1')] ).

cnf(108,plain,
    $false,
    inference(unc,[status(thm)],[107,1]),
    [iquote('0:UnC:107.0,1.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : GEO263+1 : TPTP v8.1.0. Bugfixed v6.4.0.
% 0.03/0.13  % Command  : run_spass %d %s
% 0.14/0.35  % Computer : n013.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 : Sat Jun 18 05:59:44 EDT 2022
% 0.14/0.35  % 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 33 clauses, backtracked 0 clauses, performed 2 splits and kept 76 clauses.
% 0.20/0.46  SPASS allocated 97785 KBytes.
% 0.20/0.46  SPASS spent	0:00:00.09 on the problem.
% 0.20/0.46  		0:00:00.03 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 1, length 9 :
% 0.20/0.46  % SZS output start Refutation
% See solution above
% 0.20/0.46  Formulae used in the proof : con oag11 con_def oag9
% 0.20/0.46  
%------------------------------------------------------------------------------