TSTP Solution File: SWV055+1 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SWV055+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n017.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 : Wed Jul 20 17:45:40 EDT 2022

% Result   : Theorem 10.00s 2.82s
% Output   : CNFRefutation 10.00s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   26
% Syntax   : Number of clauses     :   81 (  50 unt;  12 nHn;  59 RR)
%            Number of literals    :  141 (  49 equ;  53 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    6 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   16 (  16 usr;  12 con; 0-3 aty)
%            Number of variables   :   44 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_165,plain,
    plus(plus(X1,n1),n1) = plus(X1,n2),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k9pvjrst/lgb.p',i_0_165) ).

cnf(i_0_162,plain,
    plus(n1,X1) = plus(X1,n1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k9pvjrst/lgb.p',i_0_162) ).

cnf(i_0_157,plain,
    plus(n0,n1) = n1,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k9pvjrst/lgb.p',i_0_157) ).

cnf(i_0_158,plain,
    plus(plus(n0,n1),n1) = n2,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k9pvjrst/lgb.p',i_0_158) ).

cnf(i_0_167,plain,
    plus(plus(plus(X1,n1),n1),n1) = plus(X1,n3),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k9pvjrst/lgb.p',i_0_167) ).

cnf(i_0_159,plain,
    plus(plus(plus(n0,n1),n1),n1) = n3,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k9pvjrst/lgb.p',i_0_159) ).

cnf(i_0_169,plain,
    plus(plus(plus(plus(X1,n1),n1),n1),n1) = plus(X1,n4),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k9pvjrst/lgb.p',i_0_169) ).

cnf(i_0_160,plain,
    plus(plus(plus(plus(n0,n1),n1),n1),n1) = n4,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k9pvjrst/lgb.p',i_0_160) ).

cnf(i_0_168,plain,
    plus(plus(plus(plus(X1,n1),n1),n1),n1) = plus(n4,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k9pvjrst/lgb.p',i_0_168) ).

cnf(i_0_161,plain,
    plus(plus(plus(plus(plus(n0,n1),n1),n1),n1),n1) = n5,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k9pvjrst/lgb.p',i_0_161) ).

cnf(i_0_4,negated_conjecture,
    ( leq(esk1_0,minus(n0,n1))
    | sum(n0,minus(n5,n1),a_select3(q,esk3_0,esk4_0)) != n1
    | ~ leq(n0,pv10)
    | ~ leq(pv10,minus(n135300,n1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k9pvjrst/lgb.p',i_0_4) ).

cnf(i_0_12,negated_conjecture,
    leq(n0,pv10),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k9pvjrst/lgb.p',i_0_12) ).

cnf(i_0_11,negated_conjecture,
    leq(pv10,minus(n135300,n1)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k9pvjrst/lgb.p',i_0_11) ).

cnf(i_0_143,plain,
    minus(plus(X1,n1),n1) = X1,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k9pvjrst/lgb.p',i_0_143) ).

cnf(i_0_10,negated_conjecture,
    ( sum(n0,minus(n5,n1),a_select3(q,X1,X2)) = n1
    | ~ leq(n0,X1)
    | ~ leq(X1,minus(pv10,n1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k9pvjrst/lgb.p',i_0_10) ).

cnf(i_0_6,negated_conjecture,
    ( leq(n0,esk3_0)
    | leq(esk1_0,minus(n0,n1))
    | ~ leq(n0,pv10)
    | ~ leq(pv10,minus(n135300,n1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k9pvjrst/lgb.p',i_0_6) ).

cnf(i_0_5,negated_conjecture,
    ( leq(esk1_0,minus(n0,n1))
    | leq(esk3_0,minus(pv10,n1))
    | ~ leq(n0,pv10)
    | ~ leq(pv10,minus(n135300,n1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k9pvjrst/lgb.p',i_0_5) ).

cnf(i_0_7,negated_conjecture,
    ( leq(n0,esk1_0)
    | sum(n0,minus(n5,n1),a_select3(q,esk3_0,esk4_0)) != n1
    | ~ leq(n0,pv10)
    | ~ leq(pv10,minus(n135300,n1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k9pvjrst/lgb.p',i_0_7) ).

cnf(i_0_54,plain,
    ( gt(X1,X2)
    | ~ leq(X2,minus(X1,n1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k9pvjrst/lgb.p',i_0_54) ).

cnf(i_0_9,negated_conjecture,
    ( leq(n0,esk1_0)
    | leq(n0,esk3_0)
    | ~ leq(n0,pv10)
    | ~ leq(pv10,minus(n135300,n1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k9pvjrst/lgb.p',i_0_9) ).

cnf(i_0_8,negated_conjecture,
    ( leq(n0,esk1_0)
    | leq(esk3_0,minus(pv10,n1))
    | ~ leq(n0,pv10)
    | ~ leq(pv10,minus(n135300,n1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k9pvjrst/lgb.p',i_0_8) ).

cnf(i_0_50,plain,
    ~ gt(X1,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k9pvjrst/lgb.p',i_0_50) ).

cnf(i_0_59,plain,
    ( gt(plus(X1,n1),X2)
    | ~ leq(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k9pvjrst/lgb.p',i_0_59) ).

cnf(i_0_51,plain,
    ( leq(X1,X2)
    | ~ gt(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k9pvjrst/lgb.p',i_0_51) ).

cnf(i_0_172,plain,
    plus(minus(X1,n1),n1) = X1,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k9pvjrst/lgb.p',i_0_172) ).

cnf(i_0_15,plain,
    ( X1 = n0
    | ~ leq(X1,n0)
    | ~ leq(n0,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k9pvjrst/lgb.p',i_0_15) ).

cnf(c_0_199,plain,
    plus(plus(X1,n1),n1) = plus(X1,n2),
    i_0_165 ).

cnf(c_0_200,plain,
    plus(n1,X1) = plus(X1,n1),
    i_0_162 ).

cnf(c_0_201,plain,
    plus(n0,n1) = n1,
    i_0_157 ).

cnf(c_0_202,plain,
    plus(plus(n0,n1),n1) = n2,
    i_0_158 ).

cnf(c_0_203,plain,
    plus(plus(plus(X1,n1),n1),n1) = plus(X1,n3),
    i_0_167 ).

cnf(c_0_204,plain,
    plus(n1,plus(X1,n1)) = plus(X1,n2),
    inference(rw,[status(thm)],[c_0_199,c_0_200]) ).

cnf(c_0_205,plain,
    plus(plus(plus(n0,n1),n1),n1) = n3,
    i_0_159 ).

cnf(c_0_206,plain,
    plus(n1,n0) = n1,
    inference(rw,[status(thm)],[c_0_201,c_0_200]) ).

cnf(c_0_207,plain,
    plus(n1,n1) = n2,
    inference(rw,[status(thm)],[c_0_202,c_0_201]) ).

cnf(c_0_208,plain,
    plus(plus(plus(plus(X1,n1),n1),n1),n1) = plus(X1,n4),
    i_0_169 ).

cnf(c_0_209,plain,
    plus(n1,plus(X1,n2)) = plus(X1,n3),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_203,c_0_200]),c_0_204]),c_0_200]) ).

cnf(c_0_210,plain,
    plus(plus(plus(plus(n0,n1),n1),n1),n1) = n4,
    i_0_160 ).

cnf(c_0_211,plain,
    plus(n1,n2) = n3,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_205,c_0_200]),c_0_206]),c_0_207]),c_0_200]) ).

cnf(c_0_212,plain,
    plus(plus(plus(plus(X1,n1),n1),n1),n1) = plus(n4,X1),
    i_0_168 ).

cnf(c_0_213,plain,
    plus(n1,plus(X1,n3)) = plus(X1,n4),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_208,c_0_200]),c_0_204]),c_0_200]),c_0_209]),c_0_200]) ).

cnf(c_0_214,plain,
    plus(plus(plus(plus(plus(n0,n1),n1),n1),n1),n1) = n5,
    i_0_161 ).

cnf(c_0_215,plain,
    plus(n1,n3) = n4,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_210,c_0_200]),c_0_206]),c_0_207]),c_0_200]),c_0_211]),c_0_200]) ).

cnf(c_0_216,plain,
    plus(X1,n4) = plus(n4,X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_212,c_0_200]),c_0_204]),c_0_200]),c_0_209]),c_0_200]),c_0_213]) ).

cnf(c_0_217,negated_conjecture,
    ( leq(esk1_0,minus(n0,n1))
    | sum(n0,minus(n5,n1),a_select3(q,esk3_0,esk4_0)) != n1
    | ~ leq(n0,pv10)
    | ~ leq(pv10,minus(n135300,n1)) ),
    i_0_4 ).

cnf(c_0_218,negated_conjecture,
    leq(n0,pv10),
    i_0_12 ).

cnf(c_0_219,negated_conjecture,
    leq(pv10,minus(n135300,n1)),
    i_0_11 ).

cnf(c_0_220,plain,
    minus(plus(X1,n1),n1) = X1,
    i_0_143 ).

cnf(c_0_221,plain,
    plus(n1,n4) = n5,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_214,c_0_200]),c_0_206]),c_0_207]),c_0_200]),c_0_211]),c_0_200]),c_0_215]),c_0_216]) ).

cnf(c_0_222,negated_conjecture,
    ( leq(esk1_0,minus(n0,n1))
    | sum(n0,minus(n5,n1),a_select3(q,esk3_0,esk4_0)) != n1 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_217,c_0_218]),c_0_219])]) ).

cnf(c_0_223,plain,
    minus(n5,n1) = n4,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_220,c_0_216]),c_0_221]) ).

cnf(c_0_224,negated_conjecture,
    ( sum(n0,minus(n5,n1),a_select3(q,X1,X2)) = n1
    | ~ leq(n0,X1)
    | ~ leq(X1,minus(pv10,n1)) ),
    i_0_10 ).

cnf(c_0_225,negated_conjecture,
    ( leq(n0,esk3_0)
    | leq(esk1_0,minus(n0,n1))
    | ~ leq(n0,pv10)
    | ~ leq(pv10,minus(n135300,n1)) ),
    i_0_6 ).

cnf(c_0_226,negated_conjecture,
    ( leq(esk1_0,minus(n0,n1))
    | leq(esk3_0,minus(pv10,n1))
    | ~ leq(n0,pv10)
    | ~ leq(pv10,minus(n135300,n1)) ),
    i_0_5 ).

cnf(c_0_227,negated_conjecture,
    ( leq(esk1_0,minus(n0,n1))
    | sum(n0,n4,a_select3(q,esk3_0,esk4_0)) != n1 ),
    inference(rw,[status(thm)],[c_0_222,c_0_223]) ).

cnf(c_0_228,negated_conjecture,
    ( sum(n0,n4,a_select3(q,X1,X2)) = n1
    | ~ leq(X1,minus(pv10,n1))
    | ~ leq(n0,X1) ),
    inference(rw,[status(thm)],[c_0_224,c_0_223]) ).

cnf(c_0_229,negated_conjecture,
    ( leq(esk1_0,minus(n0,n1))
    | leq(n0,esk3_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_225,c_0_218]),c_0_219])]) ).

cnf(c_0_230,negated_conjecture,
    ( leq(esk3_0,minus(pv10,n1))
    | leq(esk1_0,minus(n0,n1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_226,c_0_218]),c_0_219])]) ).

cnf(c_0_231,negated_conjecture,
    ( leq(n0,esk1_0)
    | sum(n0,minus(n5,n1),a_select3(q,esk3_0,esk4_0)) != n1
    | ~ leq(n0,pv10)
    | ~ leq(pv10,minus(n135300,n1)) ),
    i_0_7 ).

cnf(c_0_232,plain,
    ( gt(X1,X2)
    | ~ leq(X2,minus(X1,n1)) ),
    i_0_54 ).

cnf(c_0_233,negated_conjecture,
    leq(esk1_0,minus(n0,n1)),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_227,c_0_228]),c_0_229]),c_0_230]) ).

cnf(c_0_234,negated_conjecture,
    ( leq(n0,esk1_0)
    | sum(n0,minus(n5,n1),a_select3(q,esk3_0,esk4_0)) != n1 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_231,c_0_218]),c_0_219])]) ).

cnf(c_0_235,negated_conjecture,
    ( leq(n0,esk1_0)
    | leq(n0,esk3_0)
    | ~ leq(n0,pv10)
    | ~ leq(pv10,minus(n135300,n1)) ),
    i_0_9 ).

cnf(c_0_236,negated_conjecture,
    ( leq(n0,esk1_0)
    | leq(esk3_0,minus(pv10,n1))
    | ~ leq(n0,pv10)
    | ~ leq(pv10,minus(n135300,n1)) ),
    i_0_8 ).

cnf(c_0_237,plain,
    ~ gt(X1,X1),
    i_0_50 ).

cnf(c_0_238,plain,
    ( gt(plus(X1,n1),X2)
    | ~ leq(X2,X1) ),
    i_0_59 ).

cnf(c_0_239,plain,
    ( leq(X1,X2)
    | ~ gt(X2,X1) ),
    i_0_51 ).

cnf(c_0_240,plain,
    gt(n0,esk1_0),
    inference(spm,[status(thm)],[c_0_232,c_0_233]) ).

cnf(c_0_241,negated_conjecture,
    ( leq(n0,esk1_0)
    | sum(n0,n4,a_select3(q,esk3_0,esk4_0)) != n1 ),
    inference(rw,[status(thm)],[c_0_234,c_0_223]) ).

cnf(c_0_242,negated_conjecture,
    ( leq(n0,esk3_0)
    | leq(n0,esk1_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_235,c_0_218]),c_0_219])]) ).

cnf(c_0_243,negated_conjecture,
    ( leq(esk3_0,minus(pv10,n1))
    | leq(n0,esk1_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_236,c_0_218]),c_0_219])]) ).

cnf(c_0_244,plain,
    ~ leq(plus(X1,n1),X1),
    inference(spm,[status(thm)],[c_0_237,c_0_238]) ).

cnf(c_0_245,plain,
    plus(minus(X1,n1),n1) = X1,
    i_0_172 ).

cnf(c_0_246,plain,
    ( X1 = n0
    | ~ leq(X1,n0)
    | ~ leq(n0,X1) ),
    i_0_15 ).

cnf(c_0_247,plain,
    leq(esk1_0,n0),
    inference(spm,[status(thm)],[c_0_239,c_0_240]) ).

cnf(c_0_248,negated_conjecture,
    leq(n0,esk1_0),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_241,c_0_228]),c_0_242]),c_0_243]) ).

cnf(c_0_249,plain,
    ~ leq(plus(n1,X1),X1),
    inference(spm,[status(thm)],[c_0_244,c_0_200]) ).

cnf(c_0_250,plain,
    plus(n1,minus(X1,n1)) = X1,
    inference(rw,[status(thm)],[c_0_245,c_0_200]) ).

cnf(c_0_251,plain,
    esk1_0 = n0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_246,c_0_247]),c_0_248])]) ).

cnf(c_0_252,plain,
    ~ leq(X1,minus(X1,n1)),
    inference(spm,[status(thm)],[c_0_249,c_0_250]) ).

cnf(c_0_253,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_233,c_0_251]),c_0_252]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : SWV055+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.03/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.35  % Computer : n017.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Wed Jun 15 09:35:41 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.21/0.46  # ENIGMATIC: Selected SinE mode:
% 0.21/0.47  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.47  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.21/0.47  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.21/0.47  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 10.00/2.82  # ENIGMATIC: Solved by autoschedule-lgb:
% 10.00/2.82  # No SInE strategy applied
% 10.00/2.82  # Trying AutoSched0 for 150 seconds
% 10.00/2.82  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 10.00/2.82  # and selection function SelectComplexExceptUniqMaxHorn.
% 10.00/2.82  #
% 10.00/2.82  # Preprocessing time       : 0.024 s
% 10.00/2.82  # Presaturation interreduction done
% 10.00/2.82  
% 10.00/2.82  # Proof found!
% 10.00/2.82  # SZS status Theorem
% 10.00/2.82  # SZS output start CNFRefutation
% See solution above
% 10.00/2.83  # Training examples: 0 positive, 0 negative
% 10.00/2.83  
% 10.00/2.83  # -------------------------------------------------
% 10.00/2.83  # User time                : 0.035 s
% 10.00/2.83  # System time              : 0.007 s
% 10.00/2.83  # Total time               : 0.041 s
% 10.00/2.83  # Maximum resident set size: 7128 pages
% 10.00/2.83  
%------------------------------------------------------------------------------