TSTP Solution File: NUM622+3 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : NUM622+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n006.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:28:13 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(33,axiom,
    aElementOf0(xn,szNzAzT0),
    file('NUM622+3.p',unknown),
    [] ).

cnf(71,axiom,
    equal(sdtlpdtrp0(xe,xn),xp),
    file('NUM622+3.p',unknown),
    [] ).

cnf(76,axiom,
    ~ aElementOf0(xp,sdtlpdtrp0(xN,xm)),
    file('NUM622+3.p',unknown),
    [] ).

cnf(156,axiom,
    ( ~ aElementOf0(u,szNzAzT0)
    | aElementOf0(sdtlpdtrp0(xe,u),sdtlpdtrp0(xN,u)) ),
    file('NUM622+3.p',unknown),
    [] ).

cnf(159,axiom,
    ( ~ aElementOf0(u,sdtlpdtrp0(xN,xn))
    | aElementOf0(u,sdtlpdtrp0(xN,xm)) ),
    file('NUM622+3.p',unknown),
    [] ).

cnf(519,plain,
    ~ aElementOf0(xp,sdtlpdtrp0(xN,xn)),
    inference(res,[status(thm),theory(equality)],[159,76]),
    [iquote('0:Res:159.1,76.0')] ).

cnf(901,plain,
    ( ~ aElementOf0(xn,szNzAzT0)
    | aElementOf0(xp,sdtlpdtrp0(xN,xn)) ),
    inference(spr,[status(thm),theory(equality)],[71,156]),
    [iquote('0:SpR:71.0,156.1')] ).

cnf(911,plain,
    $false,
    inference(mrr,[status(thm)],[901,33,519]),
    [iquote('0:MRR:901.0,901.1,33.0,519.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : NUM622+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n006.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Tue Jul  5 23:40:22 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 1.10/1.32  
% 1.10/1.32  SPASS V 3.9 
% 1.10/1.32  SPASS beiseite: Proof found.
% 1.10/1.32  % SZS status Theorem
% 1.10/1.32  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 1.10/1.32  SPASS derived 308 clauses, backtracked 0 clauses, performed 0 splits and kept 555 clauses.
% 1.10/1.32  SPASS allocated 105163 KBytes.
% 1.10/1.32  SPASS spent	0:00:00.97 on the problem.
% 1.10/1.32  		0:00:00.04 for the input.
% 1.10/1.32  		0:00:00.82 for the FLOTTER CNF translation.
% 1.10/1.32  		0:00:00.00 for inferences.
% 1.10/1.32  		0:00:00.00 for the backtracking.
% 1.10/1.32  		0:00:00.06 for the reduction.
% 1.10/1.32  
% 1.10/1.32  
% 1.10/1.32  Here is a proof with depth 1, length 8 :
% 1.10/1.32  % SZS output start Refutation
% See solution above
% 1.10/1.32  Formulae used in the proof : m__5309 m__ m__4660 m__5461
% 1.10/1.32  
%------------------------------------------------------------------------------