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

View Problem - Process Solution

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

% Computer : n015.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:54 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(19,axiom,
    aElementOf0(xi,szNzAzT0),
    file('NUM595+3.p',unknown),
    [] ).

cnf(20,axiom,
    aElementOf0(skc97,xX),
    file('NUM595+3.p',unknown),
    [] ).

cnf(21,axiom,
    ~ aElementOf0(xx,xT),
    file('NUM595+3.p',unknown),
    [] ).

cnf(31,axiom,
    aElementOf0(skf88(u),xT),
    file('NUM595+3.p',unknown),
    [] ).

cnf(44,axiom,
    equal(sdtlpdtrp0(xd,xi),xx),
    file('NUM595+3.p',unknown),
    [] ).

cnf(54,axiom,
    ( ~ aElementOf0(u,xX)
    | aSet0(u) ),
    file('NUM595+3.p',unknown),
    [] ).

cnf(73,axiom,
    equal(slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(xi)),xk),xX),
    file('NUM595+3.p',unknown),
    [] ).

cnf(282,axiom,
    ( ~ aSet0(u)
    | ~ aElementOf0(v,szNzAzT0)
    | ~ aElementOf0(u,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(v)),xk))
    | equal(sdtlpdtrp0(sdtlpdtrp0(xC,v),u),skf88(v)) ),
    file('NUM595+3.p',unknown),
    [] ).

cnf(296,axiom,
    ( ~ aSet0(u)
    | ~ aElementOf0(v,szNzAzT0)
    | ~ aElementOf0(u,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(v)),xk))
    | equal(sdtlpdtrp0(sdtlpdtrp0(xC,v),u),sdtlpdtrp0(xd,v)) ),
    file('NUM595+3.p',unknown),
    [] ).

cnf(417,plain,
    ( ~ aSet0(u)
    | ~ aElementOf0(v,szNzAzT0)
    | ~ aElementOf0(u,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(v)),xk))
    | equal(sdtlpdtrp0(xd,v),skf88(v)) ),
    inference(rew,[status(thm),theory(equality)],[282,296]),
    [iquote('0:Rew:282.3,296.3')] ).

cnf(11096,plain,
    ( ~ aSet0(u)
    | ~ aElementOf0(xi,szNzAzT0)
    | ~ aElementOf0(u,xX)
    | equal(sdtlpdtrp0(xd,xi),skf88(xi)) ),
    inference(spl,[status(thm),theory(equality)],[73,417]),
    [iquote('0:SpL:73.0,417.2')] ).

cnf(11108,plain,
    ( ~ aSet0(u)
    | ~ aElementOf0(xi,szNzAzT0)
    | ~ aElementOf0(u,xX)
    | equal(skf88(xi),xx) ),
    inference(rew,[status(thm),theory(equality)],[44,11096]),
    [iquote('0:Rew:44.0,11096.3')] ).

cnf(11109,plain,
    ( ~ aElementOf0(u,xX)
    | equal(skf88(xi),xx) ),
    inference(mrr,[status(thm)],[11108,54,19]),
    [iquote('0:MRR:11108.0,11108.1,54.1,19.0')] ).

cnf(11112,plain,
    equal(skf88(xi),xx),
    inference(res,[status(thm),theory(equality)],[20,11109]),
    [iquote('0:Res:20.0,11109.0')] ).

cnf(11124,plain,
    aElementOf0(xx,xT),
    inference(spr,[status(thm),theory(equality)],[11112,31]),
    [iquote('0:SpR:11112.0,31.0')] ).

cnf(11127,plain,
    $false,
    inference(mrr,[status(thm)],[11124,21]),
    [iquote('0:MRR:11124.0,21.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : NUM595+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n015.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 : Thu Jul  7 08:47:49 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 3.81/4.01  
% 3.81/4.01  SPASS V 3.9 
% 3.81/4.01  SPASS beiseite: Proof found.
% 3.81/4.01  % SZS status Theorem
% 3.81/4.01  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 3.81/4.01  SPASS derived 8129 clauses, backtracked 1749 clauses, performed 23 splits and kept 5315 clauses.
% 3.81/4.01  SPASS allocated 106153 KBytes.
% 3.81/4.01  SPASS spent	0:00:03.57 on the problem.
% 3.81/4.01  		0:00:00.04 for the input.
% 3.81/4.01  		0:00:00.74 for the FLOTTER CNF translation.
% 3.81/4.01  		0:00:00.12 for inferences.
% 3.81/4.01  		0:00:00.08 for the backtracking.
% 3.81/4.01  		0:00:02.49 for the reduction.
% 3.81/4.01  
% 3.81/4.01  
% 3.81/4.01  Here is a proof with depth 3, length 16 :
% 3.81/4.01  % SZS output start Refutation
% See solution above
% 3.81/4.01  Formulae used in the proof : m__4806 m__4826 m__ m__4618 mZeroNum m__4730
% 3.81/4.01  
%------------------------------------------------------------------------------