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

View Problem - Process Solution

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

% Computer : n004.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:46:15 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_202,plain,
    ( a_select3(id_ds1_filter,X1,X2) = a_select3(id_ds1_filter,X2,X1)
    | ~ epred2_0
    | ~ leq(X2,n5)
    | ~ leq(n0,X2)
    | ~ leq(n0,X1)
    | ~ leq(X1,minus(pv57,n1)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fahtt4dr/lgb.p',i_0_202) ).

cnf(i_0_139,negated_conjecture,
    epred2_0,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fahtt4dr/lgb.p',i_0_139) ).

cnf(i_0_137,negated_conjecture,
    leq(esk21_0,minus(pv57,n1)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fahtt4dr/lgb.p',i_0_137) ).

cnf(i_0_138,negated_conjecture,
    leq(n0,esk21_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fahtt4dr/lgb.p',i_0_138) ).

cnf(i_0_132,negated_conjecture,
    a_select3(id_ds1_filter,esk22_0,esk21_0) != a_select3(id_ds1_filter,esk21_0,esk22_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fahtt4dr/lgb.p',i_0_132) ).

cnf(i_0_135,negated_conjecture,
    leq(esk22_0,n5),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fahtt4dr/lgb.p',i_0_135) ).

cnf(i_0_136,negated_conjecture,
    leq(n0,esk22_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fahtt4dr/lgb.p',i_0_136) ).

cnf(c_0_210,plain,
    ( a_select3(id_ds1_filter,X1,X2) = a_select3(id_ds1_filter,X2,X1)
    | ~ epred2_0
    | ~ leq(X2,n5)
    | ~ leq(n0,X2)
    | ~ leq(n0,X1)
    | ~ leq(X1,minus(pv57,n1)) ),
    i_0_202 ).

cnf(c_0_211,negated_conjecture,
    epred2_0,
    i_0_139 ).

cnf(c_0_212,plain,
    ( a_select3(id_ds1_filter,X1,X2) = a_select3(id_ds1_filter,X2,X1)
    | ~ leq(X1,minus(pv57,n1))
    | ~ leq(X2,n5)
    | ~ leq(n0,X2)
    | ~ leq(n0,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_210,c_0_211])]) ).

cnf(c_0_213,negated_conjecture,
    leq(esk21_0,minus(pv57,n1)),
    i_0_137 ).

cnf(c_0_214,negated_conjecture,
    leq(n0,esk21_0),
    i_0_138 ).

cnf(c_0_215,negated_conjecture,
    a_select3(id_ds1_filter,esk22_0,esk21_0) != a_select3(id_ds1_filter,esk21_0,esk22_0),
    i_0_132 ).

cnf(c_0_216,negated_conjecture,
    ( a_select3(id_ds1_filter,esk21_0,X1) = a_select3(id_ds1_filter,X1,esk21_0)
    | ~ leq(X1,n5)
    | ~ leq(n0,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_212,c_0_213]),c_0_214])]) ).

cnf(c_0_217,negated_conjecture,
    leq(esk22_0,n5),
    i_0_135 ).

cnf(c_0_218,negated_conjecture,
    leq(n0,esk22_0),
    i_0_136 ).

cnf(c_0_219,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_215,c_0_216]),c_0_217]),c_0_218])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SWV221+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 : n004.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.35  % DateTime : Wed Jun 15 16:45:55 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.46  # ENIGMATIC: Selected SinE mode:
% 0.20/0.47  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.47  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.20/0.47  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.20/0.47  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 8.23/2.50  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.23/2.50  # No SInE strategy applied
% 8.23/2.50  # Trying AutoSched0 for 150 seconds
% 8.23/2.50  # AutoSched0-Mode selected heuristic G_E___300_C18_F1_URBAN_S0Y
% 8.23/2.50  # and selection function SelectMaxLComplexAvoidPosPred.
% 8.23/2.50  #
% 8.23/2.50  # Preprocessing time       : 0.024 s
% 8.23/2.50  
% 8.23/2.50  # Proof found!
% 8.23/2.50  # SZS status Theorem
% 8.23/2.50  # SZS output start CNFRefutation
% See solution above
% 8.23/2.50  # Training examples: 0 positive, 0 negative
% 8.23/2.50  
% 8.23/2.50  # -------------------------------------------------
% 8.23/2.50  # User time                : 0.030 s
% 8.23/2.50  # System time              : 0.006 s
% 8.23/2.50  # Total time               : 0.036 s
% 8.23/2.50  # Maximum resident set size: 7120 pages
% 8.23/2.50  
%------------------------------------------------------------------------------