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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : NUM304+1 : TPTP v8.1.0. Released v3.1.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 : Mon Jul 18 14:25:16 EDT 2022

% Result   : Theorem 0.37s 0.57s
% Output   : Refutation 0.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   15 (  11 unt;   0 nHn;  15 RR)
%            Number of literals    :   22 (   0 equ;  12 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   8 con; 0-1 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    equal(u,n12),
    file('NUM304+1.p',unknown),
    [] ).

cnf(29,axiom,
    rdn_translate(nn9,rdn_neg(rdnn(n9))),
    file('NUM304+1.p',unknown),
    [] ).

cnf(38,axiom,
    rdn_positive_less(rdnn(n8),rdnn(n9)),
    file('NUM304+1.p',unknown),
    [] ).

cnf(224,axiom,
    ( ~ less(u,v)
    | ~ equal(v,u) ),
    file('NUM304+1.p',unknown),
    [] ).

cnf(395,axiom,
    ( ~ rdn_positive_less(u,v)
    | ~ rdn_translate(w,rdn_pos(v))
    | ~ rdn_translate(x,rdn_pos(u))
    | less(x,w) ),
    file('NUM304+1.p',unknown),
    [] ).

cnf(425,plain,
    rdn_positive_less(n12,n12),
    inference(rew,[status(thm),theory(equality)],[1,38]),
    [iquote('0:Rew:1.0,38.0,1.0,38.0,1.0,38.0,1.0,38.0')] ).

cnf(434,plain,
    rdn_translate(n12,n12),
    inference(rew,[status(thm),theory(equality)],[1,29]),
    [iquote('0:Rew:1.0,29.0,1.0,29.0,1.0,29.0,1.0,29.0')] ).

cnf(790,plain,
    ~ less(n12,u),
    inference(res,[status(thm),theory(equality)],[1,224]),
    [iquote('0:Res:1.0,224.0')] ).

cnf(798,plain,
    ( ~ rdn_translate(u,rdn_pos(n12))
    | ~ rdn_translate(v,rdn_pos(n12))
    | less(v,u) ),
    inference(res,[status(thm),theory(equality)],[425,395]),
    [iquote('0:Res:425.0,395.2')] ).

cnf(806,plain,
    rdn_translate(u,u),
    inference(spr,[status(thm),theory(equality)],[1,434]),
    [iquote('0:SpR:1.0,434.0')] ).

cnf(807,plain,
    equal(u,v),
    inference(spr,[status(thm),theory(equality)],[1]),
    [iquote('0:SpR:1.0,1.0')] ).

cnf(828,plain,
    ~ less(u,v),
    inference(spl,[status(thm),theory(equality)],[807,790]),
    [iquote('0:SpL:807.0,790.0')] ).

cnf(830,plain,
    ( ~ rdn_translate(u,rdn_pos(n12))
    | ~ rdn_translate(v,rdn_pos(n12)) ),
    inference(mrr,[status(thm)],[798,828]),
    [iquote('0:MRR:798.2,828.0')] ).

cnf(835,plain,
    ~ rdn_translate(u,rdn_pos(n12)),
    inference(con,[status(thm)],[830]),
    [iquote('0:Con:830.1')] ).

cnf(836,plain,
    $false,
    inference(unc,[status(thm)],[835,806]),
    [iquote('0:UnC:835.0,806.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : NUM304+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n013.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 : Tue Jul  5 07:03:44 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.37/0.57  
% 0.37/0.57  SPASS V 3.9 
% 0.37/0.57  SPASS beiseite: Proof found.
% 0.37/0.57  % SZS status Theorem
% 0.37/0.57  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.37/0.57  SPASS derived 53 clauses, backtracked 0 clauses, performed 0 splits and kept 74 clauses.
% 0.37/0.57  SPASS allocated 98719 KBytes.
% 0.37/0.57  SPASS spent	0:00:00.21 on the problem.
% 0.37/0.57  		0:00:00.04 for the input.
% 0.37/0.57  		0:00:00.11 for the FLOTTER CNF translation.
% 0.37/0.57  		0:00:00.00 for inferences.
% 0.37/0.57  		0:00:00.00 for the backtracking.
% 0.37/0.57  		0:00:00.04 for the reduction.
% 0.37/0.57  
% 0.37/0.57  
% 0.37/0.57  Here is a proof with depth 2, length 15 :
% 0.37/0.57  % SZS output start Refutation
% See solution above
% 0.37/0.57  Formulae used in the proof : something_not_n12 rdnn9 rdn_positive_less89 less_property less_entry_point_pos_pos
% 0.37/0.57  
%------------------------------------------------------------------------------