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

View Problem - Process Solution

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

% Computer : n008.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:38 EDT 2022

% Result   : Theorem 6.99s 2.37s
% Output   : CNFRefutation 6.99s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   26 (  24 unt;   0 nHn;  17 RR)
%            Number of literals    :   34 (  21 equ;  12 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   2 prp; 0-2 aty)
%            Number of functors    :   22 (  22 usr;  14 con; 0-3 aty)
%            Number of variables   :   13 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_1,negated_conjecture,
    ( sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) != pv78
    | sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35)))) != n0
    | ~ true
    | ~ leq(n0,pv35)
    | ~ leq(pv35,minus(n5,n1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ajloedwi/lgb.p',i_0_1) ).

cnf(i_0_8,negated_conjecture,
    sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) = pv78,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ajloedwi/lgb.p',i_0_8) ).

cnf(i_0_175,plain,
    true,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ajloedwi/lgb.p',i_0_175) ).

cnf(i_0_6,negated_conjecture,
    leq(n0,pv35),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ajloedwi/lgb.p',i_0_6) ).

cnf(i_0_5,negated_conjecture,
    leq(pv35,minus(n5,n1)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ajloedwi/lgb.p',i_0_5) ).

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

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

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

cnf(i_0_141,plain,
    a_select2(tptp_update2(X1,X2,X3),X2) = X3,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ajloedwi/lgb.p',i_0_141) ).

cnf(i_0_170,plain,
    sum(n0,tptp_minus_1,X1) = n0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ajloedwi/lgb.p',i_0_170) ).

cnf(c_0_186,negated_conjecture,
    ( sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) != pv78
    | sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35)))) != n0
    | ~ true
    | ~ leq(n0,pv35)
    | ~ leq(pv35,minus(n5,n1)) ),
    i_0_1 ).

cnf(c_0_187,negated_conjecture,
    sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) = pv78,
    i_0_8 ).

cnf(c_0_188,plain,
    true,
    i_0_175 ).

cnf(c_0_189,negated_conjecture,
    leq(n0,pv35),
    i_0_6 ).

cnf(c_0_190,negated_conjecture,
    leq(pv35,minus(n5,n1)),
    i_0_5 ).

cnf(c_0_191,plain,
    minus(plus(X1,n1),n1) = X1,
    i_0_139 ).

cnf(c_0_192,plain,
    plus(n1,X1) = plus(X1,n1),
    i_0_158 ).

cnf(c_0_193,plain,
    plus(tptp_minus_1,n1) = n0,
    i_0_169 ).

cnf(c_0_194,negated_conjecture,
    sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35)))) != n0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_186,c_0_187]),c_0_188]),c_0_189]),c_0_190])]) ).

cnf(c_0_195,plain,
    a_select2(tptp_update2(X1,X2,X3),X2) = X3,
    i_0_141 ).

cnf(c_0_196,plain,
    minus(plus(n1,X1),n1) = X1,
    inference(spm,[status(thm)],[c_0_191,c_0_192]) ).

cnf(c_0_197,plain,
    plus(n1,tptp_minus_1) = n0,
    inference(rw,[status(thm)],[c_0_193,c_0_192]) ).

cnf(c_0_198,negated_conjecture,
    sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),divide(pv80,pv44)),times(minus(a_select2(x,pv83),divide(pv80,pv44)),a_select3(q,pv83,pv35)))) != n0,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_194,c_0_195]),c_0_195]) ).

cnf(c_0_199,plain,
    minus(n0,n1) = tptp_minus_1,
    inference(spm,[status(thm)],[c_0_196,c_0_197]) ).

cnf(c_0_200,plain,
    sum(n0,tptp_minus_1,X1) = n0,
    i_0_170 ).

cnf(c_0_201,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_198,c_0_199]),c_0_200])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWV046+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n008.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Tue Jun 14 16:07:54 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.46  # ENIGMATIC: Selected SinE mode:
% 0.19/0.47  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.19/0.47  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.19/0.47  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 6.99/2.37  # ENIGMATIC: Solved by autoschedule-lgb:
% 6.99/2.37  # No SInE strategy applied
% 6.99/2.37  # Trying AutoSched0 for 150 seconds
% 6.99/2.37  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 6.99/2.37  # and selection function SelectComplexExceptUniqMaxHorn.
% 6.99/2.37  #
% 6.99/2.37  # Preprocessing time       : 0.015 s
% 6.99/2.37  # Presaturation interreduction done
% 6.99/2.37  
% 6.99/2.37  # Proof found!
% 6.99/2.37  # SZS status Theorem
% 6.99/2.37  # SZS output start CNFRefutation
% See solution above
% 6.99/2.37  # Training examples: 0 positive, 0 negative
% 6.99/2.37  
% 6.99/2.37  # -------------------------------------------------
% 6.99/2.37  # User time                : 0.019 s
% 6.99/2.37  # System time              : 0.003 s
% 6.99/2.37  # Total time               : 0.022 s
% 6.99/2.37  # Maximum resident set size: 7124 pages
% 6.99/2.37  
%------------------------------------------------------------------------------