↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n003.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 08:40:31 EDT 2022

% Result   : Theorem 9.37s 2.93s
% Output   : CNFRefutation 9.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   11 (   8 unt;   0 nHn;   7 RR)
%            Number of literals    :   16 (   0 equ;   7 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   11 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_1204,lemma,
    ( finite(X1)
    | ~ finite(X2)
    | ~ subset(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tzc2rzw2/lgb.p',i_0_1204) ).

cnf(i_0_1307,lemma,
    subset(set_difference(X1,X2),X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tzc2rzw2/lgb.p',i_0_1307) ).

cnf(i_0_1218,negated_conjecture,
    finite(esk232_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tzc2rzw2/lgb.p',i_0_1218) ).

cnf(i_0_1217,negated_conjecture,
    ~ finite(set_difference(esk232_0,set_difference(esk232_0,esk233_0))),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tzc2rzw2/lgb.p',i_0_1217) ).

cnf(c_0_1312,lemma,
    ( finite(X1)
    | ~ finite(X2)
    | ~ subset(X1,X2) ),
    i_0_1204 ).

cnf(c_0_1313,lemma,
    subset(set_difference(X1,X2),X1),
    i_0_1307 ).

cnf(c_0_1314,lemma,
    ( finite(set_difference(X1,X2))
    | ~ finite(X1) ),
    inference(spm,[status(thm)],[c_0_1312,c_0_1313]) ).

cnf(c_0_1315,negated_conjecture,
    finite(esk232_0),
    i_0_1218 ).

cnf(c_0_1316,negated_conjecture,
    ~ finite(set_difference(esk232_0,set_difference(esk232_0,esk233_0))),
    i_0_1217 ).

cnf(c_0_1317,negated_conjecture,
    finite(set_difference(esk232_0,X1)),
    inference(spm,[status(thm)],[c_0_1314,c_0_1315]) ).

cnf(c_0_1318,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_1316,c_0_1317])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SEU295+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n003.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sun Jun 19 04:15:15 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected SinE mode:
% 0.18/0.46  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.46  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.18/0.46  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.18/0.46  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 9.37/2.93  # ENIGMATIC: Solved by autoschedule-lgb:
% 9.37/2.93  # No SInE strategy applied
% 9.37/2.93  # Trying AutoSched0 for 150 seconds
% 9.37/2.93  # AutoSched0-Mode selected heuristic G_E___200_B02_F1_SE_CS_SP_PI_S0S
% 9.37/2.93  # and selection function SelectComplexG.
% 9.37/2.93  #
% 9.37/2.93  # Preprocessing time       : 0.023 s
% 9.37/2.93  
% 9.37/2.93  # Proof found!
% 9.37/2.93  # SZS status Theorem
% 9.37/2.93  # SZS output start CNFRefutation
% See solution above
% 9.37/2.93  # Training examples: 0 positive, 0 negative
% 9.37/2.93  
% 9.37/2.93  # -------------------------------------------------
% 9.37/2.93  # User time                : 0.027 s
% 9.37/2.93  # System time              : 0.006 s
% 9.37/2.93  # Total time               : 0.032 s
% 9.37/2.93  # Maximum resident set size: 7128 pages
% 9.37/2.93  
%------------------------------------------------------------------------------