TSTP Solution File: NUM574+3 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : NUM574+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n016.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 08:37:31 EDT 2022

% Result   : Theorem 9.30s 3.27s
% Output   : CNFRefutation 9.30s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   32 (  18 unt;   4 nHn;  32 RR)
%            Number of literals    :   61 (  19 equ;  30 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   7 con; 0-2 aty)
%            Number of variables   :   14 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_4184,hypothesis,
    ( aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj))
    | szszuzczcdt0(X1) != xi
    | ~ aElementOf0(X1,szNzAzT0)
    | ~ sdtlseqdt0(xj,xi) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pt1s31w2/lgb.p',i_0_4184) ).

cnf(i_0_4189,negated_conjecture,
    sdtlseqdt0(xj,xi),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pt1s31w2/lgb.p',i_0_4189) ).

cnf(i_0_4186,negated_conjecture,
    ~ aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pt1s31w2/lgb.p',i_0_4186) ).

cnf(i_0_51,plain,
    ( X1 = sz00
    | aElementOf0(esk5_1(X1),szNzAzT0)
    | ~ aElementOf0(X1,szNzAzT0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pt1s31w2/lgb.p',i_0_51) ).

cnf(i_0_60,plain,
    ( X1 = X2
    | ~ sdtlseqdt0(X2,X1)
    | ~ sdtlseqdt0(X1,X2)
    | ~ aElementOf0(X2,szNzAzT0)
    | ~ aElementOf0(X1,szNzAzT0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pt1s31w2/lgb.p',i_0_60) ).

cnf(i_0_4181,hypothesis,
    aElementOf0(xj,szNzAzT0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pt1s31w2/lgb.p',i_0_4181) ).

cnf(i_0_4180,hypothesis,
    aElementOf0(xi,szNzAzT0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pt1s31w2/lgb.p',i_0_4180) ).

cnf(i_0_50,plain,
    ( X1 = sz00
    | szszuzczcdt0(esk5_1(X1)) = X1
    | ~ aElementOf0(X1,szNzAzT0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pt1s31w2/lgb.p',i_0_50) ).

cnf(i_0_54,plain,
    ( sdtlseqdt0(sz00,X1)
    | ~ aElementOf0(X1,szNzAzT0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pt1s31w2/lgb.p',i_0_54) ).

cnf(i_0_4188,negated_conjecture,
    aElementOf0(esk32_0,sdtlpdtrp0(xN,xi)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pt1s31w2/lgb.p',i_0_4188) ).

cnf(i_0_4173,hypothesis,
    sdtlpdtrp0(xN,sz00) = xS,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pt1s31w2/lgb.p',i_0_4173) ).

cnf(i_0_4187,negated_conjecture,
    ~ aElementOf0(esk32_0,sdtlpdtrp0(xN,xj)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pt1s31w2/lgb.p',i_0_4187) ).

cnf(c_0_4202,hypothesis,
    ( aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj))
    | szszuzczcdt0(X1) != xi
    | ~ aElementOf0(X1,szNzAzT0)
    | ~ sdtlseqdt0(xj,xi) ),
    i_0_4184 ).

cnf(c_0_4203,negated_conjecture,
    sdtlseqdt0(xj,xi),
    i_0_4189 ).

cnf(c_0_4204,negated_conjecture,
    ~ aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj)),
    i_0_4186 ).

cnf(c_0_4205,hypothesis,
    ( szszuzczcdt0(X1) != xi
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_4202,c_0_4203])]),c_0_4204]) ).

cnf(c_0_4206,plain,
    ( X1 = sz00
    | aElementOf0(esk5_1(X1),szNzAzT0)
    | ~ aElementOf0(X1,szNzAzT0) ),
    i_0_51 ).

cnf(c_0_4207,plain,
    ( X1 = X2
    | ~ sdtlseqdt0(X2,X1)
    | ~ sdtlseqdt0(X1,X2)
    | ~ aElementOf0(X2,szNzAzT0)
    | ~ aElementOf0(X1,szNzAzT0) ),
    i_0_60 ).

cnf(c_0_4208,hypothesis,
    aElementOf0(xj,szNzAzT0),
    i_0_4181 ).

cnf(c_0_4209,hypothesis,
    aElementOf0(xi,szNzAzT0),
    i_0_4180 ).

cnf(c_0_4210,hypothesis,
    ( X1 = sz00
    | szszuzczcdt0(esk5_1(X1)) != xi
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(spm,[status(thm)],[c_0_4205,c_0_4206]) ).

cnf(c_0_4211,plain,
    ( X1 = sz00
    | szszuzczcdt0(esk5_1(X1)) = X1
    | ~ aElementOf0(X1,szNzAzT0) ),
    i_0_50 ).

cnf(c_0_4212,negated_conjecture,
    ( xi = xj
    | ~ sdtlseqdt0(xi,xj) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4207,c_0_4203]),c_0_4208]),c_0_4209])]) ).

cnf(c_0_4213,plain,
    xi = sz00,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_4210,c_0_4211])]),c_0_4209])]) ).

cnf(c_0_4214,negated_conjecture,
    ( xj = sz00
    | ~ sdtlseqdt0(sz00,xj) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_4212,c_0_4213]),c_0_4213]) ).

cnf(c_0_4215,plain,
    ( sdtlseqdt0(sz00,X1)
    | ~ aElementOf0(X1,szNzAzT0) ),
    i_0_54 ).

cnf(c_0_4216,negated_conjecture,
    aElementOf0(esk32_0,sdtlpdtrp0(xN,xi)),
    i_0_4188 ).

cnf(c_0_4217,hypothesis,
    sdtlpdtrp0(xN,sz00) = xS,
    i_0_4173 ).

cnf(c_0_4218,negated_conjecture,
    ~ aElementOf0(esk32_0,sdtlpdtrp0(xN,xj)),
    i_0_4187 ).

cnf(c_0_4219,plain,
    xj = sz00,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4214,c_0_4215]),c_0_4208])]) ).

cnf(c_0_4220,negated_conjecture,
    aElementOf0(esk32_0,xS),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_4216,c_0_4213]),c_0_4217]) ).

cnf(c_0_4221,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_4218,c_0_4219]),c_0_4217]),c_0_4220])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : NUM574+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n016.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 06:46:21 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 9.30/3.27  # ENIGMATIC: Solved by autoschedule-lgb:
% 9.30/3.27  # No SInE strategy applied
% 9.30/3.27  # Trying AutoSched0 for 150 seconds
% 9.30/3.27  # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 9.30/3.27  # and selection function SelectMaxLComplexAvoidPosPred.
% 9.30/3.27  #
% 9.30/3.27  # Preprocessing time       : 0.025 s
% 9.30/3.27  
% 9.30/3.27  # Proof found!
% 9.30/3.27  # SZS status Theorem
% 9.30/3.27  # SZS output start CNFRefutation
% See solution above
% 9.30/3.27  # Training examples: 0 positive, 0 negative
% 9.30/3.27  
% 9.30/3.27  # -------------------------------------------------
% 9.30/3.27  # User time                : 0.036 s
% 9.30/3.27  # System time              : 0.008 s
% 9.30/3.27  # Total time               : 0.044 s
% 9.30/3.27  # Maximum resident set size: 7128 pages
% 9.30/3.27  
%------------------------------------------------------------------------------