↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n027.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:39:26 EDT 2022

% Result   : Theorem 9.64s 2.66s
% Output   : CNFRefutation 9.64s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   13 (   5 unt;   3 nHn;   9 RR)
%            Number of literals    :   24 (   0 equ;  10 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   19 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_228,lemma,
    ( in(X1,X2)
    | ~ relation(X3)
    | ~ in(X1,relation_rng(relation_rng_restriction(X2,X3))) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-857elbf3/input.p',i_0_228) ).

cnf(i_0_81,plain,
    ( subset(X1,X2)
    | in(esk27_2(X1,X2),X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-857elbf3/input.p',i_0_81) ).

cnf(i_0_80,plain,
    ( subset(X1,X2)
    | ~ in(esk27_2(X1,X2),X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-857elbf3/input.p',i_0_80) ).

cnf(i_0_229,negated_conjecture,
    ~ subset(relation_rng(relation_rng_restriction(esk54_0,esk55_0)),esk54_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-857elbf3/input.p',i_0_229) ).

cnf(i_0_230,negated_conjecture,
    relation(esk55_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-857elbf3/input.p',i_0_230) ).

cnf(c_0_236,lemma,
    ( in(X1,X2)
    | ~ relation(X3)
    | ~ in(X1,relation_rng(relation_rng_restriction(X2,X3))) ),
    i_0_228 ).

cnf(c_0_237,plain,
    ( subset(X1,X2)
    | in(esk27_2(X1,X2),X1) ),
    i_0_81 ).

cnf(c_0_238,plain,
    ( subset(X1,X2)
    | ~ in(esk27_2(X1,X2),X2) ),
    i_0_80 ).

cnf(c_0_239,lemma,
    ( in(esk27_2(relation_rng(relation_rng_restriction(X1,X2)),X3),X1)
    | subset(relation_rng(relation_rng_restriction(X1,X2)),X3)
    | ~ relation(X2) ),
    inference(spm,[status(thm)],[c_0_236,c_0_237]) ).

cnf(c_0_240,negated_conjecture,
    ~ subset(relation_rng(relation_rng_restriction(esk54_0,esk55_0)),esk54_0),
    i_0_229 ).

cnf(c_0_241,plain,
    ( subset(relation_rng(relation_rng_restriction(X1,X2)),X1)
    | ~ relation(X2) ),
    inference(spm,[status(thm)],[c_0_238,c_0_239]) ).

cnf(c_0_242,negated_conjecture,
    relation(esk55_0),
    i_0_230 ).

cnf(c_0_243,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_240,c_0_241]),c_0_242])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SEU198+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n027.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 02:09:27 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 9.64/2.66  # ENIGMATIC: Solved by autoschedule:
% 9.64/2.66  # No SInE strategy applied
% 9.64/2.66  # Trying AutoSched0 for 150 seconds
% 9.64/2.66  # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y
% 9.64/2.66  # and selection function SelectMaxLComplexAvoidPosPred.
% 9.64/2.66  #
% 9.64/2.66  # Preprocessing time       : 0.032 s
% 9.64/2.66  
% 9.64/2.66  # Proof found!
% 9.64/2.66  # SZS status Theorem
% 9.64/2.66  # SZS output start CNFRefutation
% See solution above
% 9.64/2.66  # Training examples: 0 positive, 0 negative
% 9.64/2.66  
% 9.64/2.66  # -------------------------------------------------
% 9.64/2.66  # User time                : 0.264 s
% 9.64/2.66  # System time              : 0.019 s
% 9.64/2.66  # Total time               : 0.282 s
% 9.64/2.66  # Maximum resident set size: 7124 pages
% 9.64/2.66  
%------------------------------------------------------------------------------