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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : NUM604+3 : TPTP v8.1.0. Released v4.0.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:28:00 EDT 2022

% Result   : Theorem 0.96s 1.15s
% Output   : Refutation 0.96s
% 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(22,axiom,
    aElementOf0(xi,szNzAzT0),
    file('NUM604+3.p',unknown),
    [] ).

cnf(23,axiom,
    ~ aElementOf0(xx,xS),
    file('NUM604+3.p',unknown),
    [] ).

cnf(49,axiom,
    equal(sdtlpdtrp0(xe,xi),xx),
    file('NUM604+3.p',unknown),
    [] ).

cnf(94,axiom,
    ( ~ aElementOf0(u,sdtlpdtrp0(xN,xi))
    | aElementOf0(u,xS) ),
    file('NUM604+3.p',unknown),
    [] ).

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

cnf(460,plain,
    ~ aElementOf0(xx,sdtlpdtrp0(xN,xi)),
    inference(res,[status(thm),theory(equality)],[94,23]),
    [iquote('0:Res:94.1,23.0')] ).

cnf(716,plain,
    ( ~ aElementOf0(xi,szNzAzT0)
    | aElementOf0(xx,sdtlpdtrp0(xN,xi)) ),
    inference(spr,[status(thm),theory(equality)],[49,110]),
    [iquote('0:SpR:49.0,110.1')] ).

cnf(724,plain,
    $false,
    inference(mrr,[status(thm)],[716,22,460]),
    [iquote('0:MRR:716.0,716.1,22.0,460.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : NUM604+3 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12  % 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 19:36:38 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.96/1.15  
% 0.96/1.15  SPASS V 3.9 
% 0.96/1.15  SPASS beiseite: Proof found.
% 0.96/1.15  % SZS status Theorem
% 0.96/1.15  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.96/1.15  SPASS derived 202 clauses, backtracked 0 clauses, performed 0 splits and kept 462 clauses.
% 0.96/1.15  SPASS allocated 104633 KBytes.
% 0.96/1.15  SPASS spent	0:00:00.80 on the problem.
% 0.96/1.15  		0:00:00.04 for the input.
% 0.96/1.15  		0:00:00.67 for the FLOTTER CNF translation.
% 0.96/1.15  		0:00:00.00 for inferences.
% 0.96/1.15  		0:00:00.00 for the backtracking.
% 0.96/1.15  		0:00:00.05 for the reduction.
% 0.96/1.15  
% 0.96/1.15  
% 0.96/1.15  Here is a proof with depth 1, length 8 :
% 0.96/1.15  % SZS output start Refutation
% See solution above
% 0.96/1.15  Formulae used in the proof : m__5034 m__ m__5045 m__4660
% 0.96/1.15  
%------------------------------------------------------------------------------