↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SET792+4 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n010.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 : Tue Jul 19 00:14:12 EDT 2022

% Result   : Theorem 7.11s 2.38s
% Output   : CNFRefutation 7.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   30 (   9 unt;   6 nHn;  24 RR)
%            Number of literals    :   76 (   8 equ;  43 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-3 aty)
%            Number of variables   :   51 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_13,plain,
    ( apply(X1,X2,X3)
    | ~ member(X3,X4)
    | ~ least(X2,X1,X4) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_elph27s/lgb.p',i_0_13) ).

cnf(i_0_37,negated_conjecture,
    least(esk10_0,esk8_0,esk9_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_elph27s/lgb.p',i_0_37) ).

cnf(i_0_14,plain,
    ( member(X1,X2)
    | ~ least(X1,X3,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_elph27s/lgb.p',i_0_14) ).

cnf(i_0_109,plain,
    ( X1 = X2
    | ~ member(X2,X3)
    | ~ member(X1,X3)
    | ~ epred1_2(X4,X3)
    | ~ apply(X4,X2,X1)
    | ~ apply(X4,X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_elph27s/lgb.p',i_0_109) ).

cnf(i_0_30,plain,
    ( min(X1,X2,X3)
    | apply(X2,esk7_3(X2,X3,X1),X1)
    | ~ member(X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_elph27s/lgb.p',i_0_30) ).

cnf(i_0_36,negated_conjecture,
    ~ min(esk10_0,esk8_0,esk9_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_elph27s/lgb.p',i_0_36) ).

cnf(i_0_31,plain,
    ( min(X1,X2,X3)
    | member(esk7_3(X2,X3,X1),X3)
    | ~ member(X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_elph27s/lgb.p',i_0_31) ).

cnf(i_0_29,plain,
    ( min(X1,X2,X3)
    | esk7_3(X2,X3,X1) != X1
    | ~ member(X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_elph27s/lgb.p',i_0_29) ).

cnf(i_0_35,plain,
    ( epred1_2(X1,X2)
    | ~ order(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_elph27s/lgb.p',i_0_35) ).

cnf(i_0_38,negated_conjecture,
    order(esk8_0,esk9_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_elph27s/lgb.p',i_0_38) ).

cnf(c_0_120,plain,
    ( apply(X1,X2,X3)
    | ~ member(X3,X4)
    | ~ least(X2,X1,X4) ),
    i_0_13 ).

cnf(c_0_121,negated_conjecture,
    least(esk10_0,esk8_0,esk9_0),
    i_0_37 ).

cnf(c_0_122,plain,
    ( member(X1,X2)
    | ~ least(X1,X3,X2) ),
    i_0_14 ).

cnf(c_0_123,plain,
    ( X1 = X2
    | ~ member(X2,X3)
    | ~ member(X1,X3)
    | ~ epred1_2(X4,X3)
    | ~ apply(X4,X2,X1)
    | ~ apply(X4,X1,X2) ),
    i_0_109 ).

cnf(c_0_124,negated_conjecture,
    ( apply(esk8_0,esk10_0,X1)
    | ~ member(X1,esk9_0) ),
    inference(spm,[status(thm)],[c_0_120,c_0_121]) ).

cnf(c_0_125,plain,
    ( min(X1,X2,X3)
    | apply(X2,esk7_3(X2,X3,X1),X1)
    | ~ member(X1,X3) ),
    i_0_30 ).

cnf(c_0_126,negated_conjecture,
    member(esk10_0,esk9_0),
    inference(spm,[status(thm)],[c_0_122,c_0_121]) ).

cnf(c_0_127,negated_conjecture,
    ( X1 = esk10_0
    | ~ member(esk10_0,X2)
    | ~ member(X1,esk9_0)
    | ~ member(X1,X2)
    | ~ apply(esk8_0,X1,esk10_0)
    | ~ epred1_2(esk8_0,X2) ),
    inference(spm,[status(thm)],[c_0_123,c_0_124]) ).

cnf(c_0_128,negated_conjecture,
    ( apply(X1,esk7_3(X1,esk9_0,esk10_0),esk10_0)
    | min(esk10_0,X1,esk9_0) ),
    inference(spm,[status(thm)],[c_0_125,c_0_126]) ).

cnf(c_0_129,negated_conjecture,
    ~ min(esk10_0,esk8_0,esk9_0),
    i_0_36 ).

cnf(c_0_130,plain,
    ( min(X1,X2,X3)
    | member(esk7_3(X2,X3,X1),X3)
    | ~ member(X1,X3) ),
    i_0_31 ).

cnf(c_0_131,negated_conjecture,
    ( esk7_3(esk8_0,esk9_0,esk10_0) = esk10_0
    | ~ member(esk7_3(esk8_0,esk9_0,esk10_0),esk9_0)
    | ~ member(esk7_3(esk8_0,esk9_0,esk10_0),X1)
    | ~ member(esk10_0,X1)
    | ~ epred1_2(esk8_0,X1) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_127,c_0_128]),c_0_129]) ).

cnf(c_0_132,negated_conjecture,
    ( member(esk7_3(X1,esk9_0,esk10_0),esk9_0)
    | min(esk10_0,X1,esk9_0) ),
    inference(spm,[status(thm)],[c_0_130,c_0_126]) ).

cnf(c_0_133,negated_conjecture,
    ( esk7_3(esk8_0,esk9_0,esk10_0) = esk10_0
    | ~ member(esk7_3(esk8_0,esk9_0,esk10_0),X1)
    | ~ member(esk10_0,X1)
    | ~ epred1_2(esk8_0,X1) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_132]),c_0_129]) ).

cnf(c_0_134,plain,
    ( min(X1,X2,X3)
    | esk7_3(X2,X3,X1) != X1
    | ~ member(X1,X3) ),
    i_0_29 ).

cnf(c_0_135,negated_conjecture,
    ( esk7_3(esk8_0,esk9_0,esk10_0) = esk10_0
    | ~ epred1_2(esk8_0,esk9_0) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_133,c_0_132]),c_0_126])]),c_0_129]) ).

cnf(c_0_136,plain,
    ~ epred1_2(esk8_0,esk9_0),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_135]),c_0_126])]),c_0_129]) ).

cnf(c_0_137,plain,
    ( epred1_2(X1,X2)
    | ~ order(X1,X2) ),
    i_0_35 ).

cnf(c_0_138,negated_conjecture,
    order(esk8_0,esk9_0),
    i_0_38 ).

cnf(c_0_139,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_136,c_0_137]),c_0_138])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : SET792+4 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n010.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 : Sun Jul 10 05:16:32 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.18/0.45  # ENIGMATIC: Selected SinE mode:
% 0.18/0.45  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.18/0.45  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.18/0.45  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 7.11/2.38  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.11/2.38  # No SInE strategy applied
% 7.11/2.38  # Trying AutoSched0 for 150 seconds
% 7.11/2.38  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.11/2.38  # and selection function SelectComplexExceptUniqMaxHorn.
% 7.11/2.38  #
% 7.11/2.38  # Preprocessing time       : 0.013 s
% 7.11/2.38  # Presaturation interreduction done
% 7.11/2.38  
% 7.11/2.38  # Proof found!
% 7.11/2.38  # SZS status Theorem
% 7.11/2.38  # SZS output start CNFRefutation
% See solution above
% 7.11/2.38  # Training examples: 0 positive, 0 negative
% 7.11/2.38  
% 7.11/2.38  # -------------------------------------------------
% 7.11/2.38  # User time                : 0.015 s
% 7.11/2.38  # System time              : 0.004 s
% 7.11/2.38  # Total time               : 0.020 s
% 7.11/2.38  # Maximum resident set size: 7128 pages
% 7.11/2.38  
%------------------------------------------------------------------------------