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

View Problem - Process Solution

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

% Computer : n008.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:22 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(10,axiom,
    ~ sum__dfg(u,nn5,n0),
    file('NUM326+1.p',unknown),
    [] ).

cnf(16,axiom,
    rdn_translate(n5,rdn_pos(rdnn(n5))),
    file('NUM326+1.p',unknown),
    [] ).

cnf(25,axiom,
    rdn_translate(nn5,rdn_neg(rdnn(n5))),
    file('NUM326+1.p',unknown),
    [] ).

cnf(393,axiom,
    ( ~ rdn_translate(u,rdn_neg(v))
    | ~ rdn_translate(w,rdn_pos(v))
    | sum__dfg(w,u,n0) ),
    file('NUM326+1.p',unknown),
    [] ).

cnf(408,plain,
    ( ~ rdn_translate(u,rdn_pos(v))
    | ~ rdn_translate(nn5,rdn_neg(v)) ),
    inference(res,[status(thm),theory(equality)],[393,10]),
    [iquote('0:Res:393.2,10.0')] ).

cnf(428,plain,
    ~ rdn_translate(nn5,rdn_neg(rdnn(n5))),
    inference(res,[status(thm),theory(equality)],[16,408]),
    [iquote('0:Res:16.0,408.0')] ).

cnf(524,plain,
    $false,
    inference(mrr,[status(thm)],[428,25]),
    [iquote('0:MRR:428.0,25.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : NUM326+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.13  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n008.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 : Wed Jul  6 09:39:08 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.47/0.64  
% 0.47/0.64  SPASS V 3.9 
% 0.47/0.64  SPASS beiseite: Proof found.
% 0.47/0.64  % SZS status Theorem
% 0.47/0.64  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.47/0.64  SPASS derived 115 clauses, backtracked 0 clauses, performed 0 splits and kept 515 clauses.
% 0.47/0.64  SPASS allocated 98718 KBytes.
% 0.47/0.64  SPASS spent	0:00:00.29 on the problem.
% 0.47/0.64  		0:00:00.04 for the input.
% 0.47/0.64  		0:00:00.09 for the FLOTTER CNF translation.
% 0.47/0.64  		0:00:00.02 for inferences.
% 0.47/0.64  		0:00:00.00 for the backtracking.
% 0.47/0.64  		0:00:00.06 for the reduction.
% 0.47/0.64  
% 0.47/0.64  
% 0.47/0.64  Here is a proof with depth 2, length 7 :
% 0.47/0.64  % SZS output start Refutation
% See solution above
% 0.47/0.64  Formulae used in the proof : sum_what_nn5_n0 rdn5 rdnn5 sum_entry_point_posx_negx
% 0.47/0.64  
%------------------------------------------------------------------------------