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

View Problem - Process Solution

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

% Computer : n005.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:42 EDT 2022

% Result   : Theorem 8.43s 2.41s
% Output   : CNFRefutation 8.43s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   14 (  12 unt;   0 nHn;  12 RR)
%            Number of literals    :   22 (   0 equ;  11 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :    2 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_1,negated_conjecture,
    ( ~ leq(n0,n0)
    | ~ leq(n0,pv10)
    | ~ leq(n0,pv53)
    | ~ leq(pv10,minus(n135300,n1))
    | ~ leq(pv53,minus(n5,n1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4hcpgq7g/lgb.p',i_0_1) ).

cnf(i_0_137,plain,
    leq(X1,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4hcpgq7g/lgb.p',i_0_137) ).

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

cnf(i_0_4,negated_conjecture,
    leq(n0,pv53),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4hcpgq7g/lgb.p',i_0_4) ).

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

cnf(i_0_2,negated_conjecture,
    leq(pv53,minus(n5,n1)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-4hcpgq7g/lgb.p',i_0_2) ).

cnf(c_0_144,negated_conjecture,
    ( ~ leq(n0,n0)
    | ~ leq(n0,pv10)
    | ~ leq(n0,pv53)
    | ~ leq(pv10,minus(n135300,n1))
    | ~ leq(pv53,minus(n5,n1)) ),
    i_0_1 ).

cnf(c_0_145,plain,
    leq(X1,X1),
    i_0_137 ).

cnf(c_0_146,negated_conjecture,
    leq(n0,pv10),
    i_0_5 ).

cnf(c_0_147,negated_conjecture,
    leq(n0,pv53),
    i_0_4 ).

cnf(c_0_148,negated_conjecture,
    leq(pv10,minus(n135300,n1)),
    i_0_3 ).

cnf(c_0_149,negated_conjecture,
    leq(pv53,minus(n5,n1)),
    i_0_2 ).

cnf(c_0_150,negated_conjecture,
    ~ leq(pv53,minus(n5,n1)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_144,c_0_145]),c_0_146]),c_0_147]),c_0_148])]) ).

cnf(c_0_151,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[c_0_149,c_0_150]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWV065+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.03/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n005.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 : Wed Jun 15 09:36:26 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected SinE mode:
% 0.19/0.46  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.19/0.46  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.19/0.46  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 8.43/2.41  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.43/2.41  # No SInE strategy applied
% 8.43/2.41  # Trying AutoSched0 for 150 seconds
% 8.43/2.41  # AutoSched0-Mode selected heuristic G_E___300_C18_F1_URBAN_S0Y
% 8.43/2.41  # and selection function SelectMaxLComplexAvoidPosPred.
% 8.43/2.41  #
% 8.43/2.41  # Preprocessing time       : 0.024 s
% 8.43/2.41  
% 8.43/2.41  # Proof found!
% 8.43/2.41  # SZS status Theorem
% 8.43/2.41  # SZS output start CNFRefutation
% See solution above
% 8.43/2.41  # Training examples: 0 positive, 0 negative
% 8.43/2.41  
% 8.43/2.41  # -------------------------------------------------
% 8.43/2.41  # User time                : 0.025 s
% 8.43/2.41  # System time              : 0.006 s
% 8.43/2.41  # Total time               : 0.031 s
% 8.43/2.41  # Maximum resident set size: 7124 pages
% 8.43/2.41  
%------------------------------------------------------------------------------