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

View Problem - Process Solution

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

% Computer : n005.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:27:51 EDT 2022

% Result   : Theorem 0.80s 1.03s
% Output   : Refutation 0.80s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    5
% Syntax   : Number of clauses     :    9 (   6 unt;   0 nHn;   9 RR)
%            Number of literals    :   13 (   0 equ;   7 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 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(12,axiom,
    aElementOf0(skc1,xY),
    file('NUM590+3.p',unknown),
    [] ).

cnf(18,axiom,
    aElementOf0(xi,szNzAzT0),
    file('NUM590+3.p',unknown),
    [] ).

cnf(19,axiom,
    ~ aElementOf0(skc1,szNzAzT0),
    file('NUM590+3.p',unknown),
    [] ).

cnf(75,axiom,
    ( ~ aElementOf0(u,xY)
    | aElementOf0(u,sdtlpdtrp0(xN,xi)) ),
    file('NUM590+3.p',unknown),
    [] ).

cnf(109,axiom,
    ( ~ aElementOf0(u,szNzAzT0)
    | ~ aElementOf0(v,sdtlpdtrp0(xN,u))
    | aElementOf0(v,szNzAzT0) ),
    file('NUM590+3.p',unknown),
    [] ).

cnf(334,plain,
    aElementOf0(skc1,sdtlpdtrp0(xN,xi)),
    inference(res,[status(thm),theory(equality)],[12,75]),
    [iquote('0:Res:12.0,75.0')] ).

cnf(373,plain,
    ( ~ aElementOf0(u,szNzAzT0)
    | ~ aElementOf0(skc1,sdtlpdtrp0(xN,u)) ),
    inference(res,[status(thm),theory(equality)],[109,19]),
    [iquote('0:Res:109.2,19.0')] ).

cnf(546,plain,
    ~ aElementOf0(xi,szNzAzT0),
    inference(res,[status(thm),theory(equality)],[334,373]),
    [iquote('0:Res:334.0,373.1')] ).

cnf(548,plain,
    $false,
    inference(mrr,[status(thm)],[546,18]),
    [iquote('0:MRR:546.0,18.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : NUM590+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n005.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 14:21:07 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.80/1.03  
% 0.80/1.03  SPASS V 3.9 
% 0.80/1.03  SPASS beiseite: Proof found.
% 0.80/1.03  % SZS status Theorem
% 0.80/1.03  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.80/1.03  SPASS derived 177 clauses, backtracked 0 clauses, performed 0 splits and kept 406 clauses.
% 0.80/1.03  SPASS allocated 103778 KBytes.
% 0.80/1.03  SPASS spent	0:00:00.68 on the problem.
% 0.80/1.03  		0:00:00.04 for the input.
% 0.80/1.03  		0:00:00.57 for the FLOTTER CNF translation.
% 0.80/1.03  		0:00:00.00 for inferences.
% 0.80/1.03  		0:00:00.00 for the backtracking.
% 0.80/1.03  		0:00:00.03 for the reduction.
% 0.80/1.03  
% 0.80/1.03  
% 0.80/1.03  Here is a proof with depth 2, length 9 :
% 0.80/1.03  % SZS output start Refutation
% See solution above
% 0.80/1.03  Formulae used in the proof : m__ m__4448 m__4448_02 m__3671
% 0.80/1.03  
%------------------------------------------------------------------------------