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

View Problem - Process Solution

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

% Computer : n020.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:41 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(13,axiom,
    aElementOf0(xi,szNzAzT0),
    file('NUM576+1.p',unknown),
    [] ).

cnf(14,axiom,
    aElementOf0(xj,szNzAzT0),
    file('NUM576+1.p',unknown),
    [] ).

cnf(15,axiom,
    ~ equal(xj,xi),
    file('NUM576+1.p',unknown),
    [] ).

cnf(23,axiom,
    ~ sdtlseqdt0(szszuzczcdt0(xj),xi),
    file('NUM576+1.p',unknown),
    [] ).

cnf(24,axiom,
    ~ sdtlseqdt0(szszuzczcdt0(xi),xj),
    file('NUM576+1.p',unknown),
    [] ).

cnf(82,axiom,
    ( ~ aElementOf0(u,szNzAzT0)
    | ~ aElementOf0(v,szNzAzT0)
    | sdtlseqdt0(v,u)
    | sdtlseqdt0(szszuzczcdt0(u),v) ),
    file('NUM576+1.p',unknown),
    [] ).

cnf(107,axiom,
    ( ~ sdtlseqdt0(u,v)
    | ~ sdtlseqdt0(v,u)
    | ~ aElementOf0(u,szNzAzT0)
    | ~ aElementOf0(v,szNzAzT0)
    | equal(v,u) ),
    file('NUM576+1.p',unknown),
    [] ).

cnf(181,plain,
    ( ~ aElementOf0(xj,szNzAzT0)
    | ~ sdtlseqdt0(xj,xi)
    | ~ sdtlseqdt0(xi,xj)
    | ~ aElementOf0(xi,szNzAzT0) ),
    inference(res,[status(thm),theory(equality)],[107,15]),
    [iquote('0:Res:107.4,15.0')] ).

cnf(192,plain,
    ( ~ aElementOf0(xj,szNzAzT0)
    | ~ aElementOf0(xi,szNzAzT0)
    | sdtlseqdt0(xj,xi) ),
    inference(res,[status(thm),theory(equality)],[82,24]),
    [iquote('0:Res:82.3,24.0')] ).

cnf(200,plain,
    ( ~ aElementOf0(xi,szNzAzT0)
    | ~ aElementOf0(xj,szNzAzT0)
    | sdtlseqdt0(xi,xj) ),
    inference(res,[status(thm),theory(equality)],[82,23]),
    [iquote('0:Res:82.3,23.0')] ).

cnf(207,plain,
    sdtlseqdt0(xj,xi),
    inference(mrr,[status(thm)],[192,14,13]),
    [iquote('0:MRR:192.0,192.1,14.0,13.0')] ).

cnf(208,plain,
    sdtlseqdt0(xi,xj),
    inference(mrr,[status(thm)],[200,13,14]),
    [iquote('0:MRR:200.0,200.1,13.0,14.0')] ).

cnf(214,plain,
    $false,
    inference(mrr,[status(thm)],[181,14,207,208,13]),
    [iquote('0:MRR:181.0,181.1,181.2,181.3,14.0,207.0,208.0,13.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : NUM576+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n020.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 20:19:13 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.49/0.69  
% 0.49/0.69  SPASS V 3.9 
% 0.49/0.69  SPASS beiseite: Proof found.
% 0.49/0.69  % SZS status Theorem
% 0.49/0.69  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.49/0.69  SPASS derived 24 clauses, backtracked 0 clauses, performed 0 splits and kept 181 clauses.
% 0.49/0.69  SPASS allocated 100995 KBytes.
% 0.49/0.69  SPASS spent	0:00:00.34 on the problem.
% 0.49/0.69  		0:00:00.04 for the input.
% 0.49/0.69  		0:00:00.26 for the FLOTTER CNF translation.
% 0.49/0.69  		0:00:00.00 for inferences.
% 0.49/0.69  		0:00:00.00 for the backtracking.
% 0.49/0.69  		0:00:00.01 for the reduction.
% 0.49/0.69  
% 0.49/0.69  
% 0.49/0.69  Here is a proof with depth 1, length 13 :
% 0.49/0.69  % SZS output start Refutation
% See solution above
% 0.49/0.69  Formulae used in the proof : m__3856 m__ mLessTotal mLessASymm
% 0.49/0.69  
%------------------------------------------------------------------------------