↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n029.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:04 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_51,plain,
    ( in(X1,X2)
    | X2 != union(X3)
    | ~ in(X4,X3)
    | ~ in(X1,X4) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4aab00ap/input.p',i_0_51) ).

cnf(i_0_17,plain,
    ( in(X1,X2)
    | X2 != powerset(X3)
    | ~ subset(X1,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4aab00ap/input.p',i_0_17) ).

cnf(i_0_18,plain,
    ( subset(X1,X2)
    | X3 != powerset(X2)
    | ~ in(X1,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4aab00ap/input.p',i_0_18) ).

cnf(i_0_52,plain,
    ( in(esk13_3(X1,X2,X3),X1)
    | X2 != union(X1)
    | ~ in(X3,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4aab00ap/input.p',i_0_52) ).

cnf(i_0_101,plain,
    subset(X1,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4aab00ap/input.p',i_0_101) ).

cnf(i_0_41,plain,
    ( in(X1,X2)
    | ~ in(X1,X3)
    | ~ subset(X3,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4aab00ap/input.p',i_0_41) ).

cnf(i_0_53,plain,
    ( in(X1,esk13_3(X2,X3,X1))
    | X3 != union(X2)
    | ~ in(X1,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4aab00ap/input.p',i_0_53) ).

cnf(i_0_39,plain,
    ( subset(X1,X2)
    | ~ in(esk11_2(X1,X2),X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4aab00ap/input.p',i_0_39) ).

cnf(i_0_40,plain,
    ( subset(X1,X2)
    | in(esk11_2(X1,X2),X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4aab00ap/input.p',i_0_40) ).

cnf(i_0_6,plain,
    ( X1 = X2
    | ~ subset(X2,X1)
    | ~ subset(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4aab00ap/input.p',i_0_6) ).

cnf(i_0_158,negated_conjecture,
    union(powerset(esk22_0)) != esk22_0,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4aab00ap/input.p',i_0_158) ).

cnf(c_0_170,plain,
    ( in(X1,X2)
    | X2 != union(X3)
    | ~ in(X4,X3)
    | ~ in(X1,X4) ),
    i_0_51 ).

cnf(c_0_171,plain,
    ( in(X1,X2)
    | X2 != powerset(X3)
    | ~ subset(X1,X3) ),
    i_0_17 ).

cnf(c_0_172,plain,
    ( subset(X1,X2)
    | X3 != powerset(X2)
    | ~ in(X1,X3) ),
    i_0_18 ).

cnf(c_0_173,plain,
    ( in(esk13_3(X1,X2,X3),X1)
    | X2 != union(X1)
    | ~ in(X3,X2) ),
    i_0_52 ).

cnf(c_0_174,plain,
    ( in(X1,union(X2))
    | ~ in(X3,X2)
    | ~ in(X1,X3) ),
    inference(er,[status(thm)],[c_0_170]) ).

cnf(c_0_175,plain,
    ( in(X1,powerset(X2))
    | ~ subset(X1,X2) ),
    inference(er,[status(thm)],[c_0_171]) ).

cnf(c_0_176,plain,
    ( subset(X1,X2)
    | ~ in(X1,powerset(X2)) ),
    inference(er,[status(thm)],[c_0_172]) ).

cnf(c_0_177,plain,
    ( in(esk13_3(X1,union(X1),X2),X1)
    | ~ in(X2,union(X1)) ),
    inference(er,[status(thm)],[c_0_173]) ).

cnf(c_0_178,plain,
    ( in(X1,union(powerset(X2)))
    | ~ in(X1,X3)
    | ~ subset(X3,X2) ),
    inference(spm,[status(thm)],[c_0_174,c_0_175]) ).

cnf(c_0_179,plain,
    subset(X1,X1),
    i_0_101 ).

cnf(c_0_180,plain,
    ( in(X1,X2)
    | ~ in(X1,X3)
    | ~ subset(X3,X2) ),
    i_0_41 ).

cnf(c_0_181,plain,
    ( subset(esk13_3(powerset(X1),union(powerset(X1)),X2),X1)
    | ~ in(X2,union(powerset(X1))) ),
    inference(spm,[status(thm)],[c_0_176,c_0_177]) ).

cnf(c_0_182,plain,
    ( in(X1,esk13_3(X2,X3,X1))
    | X3 != union(X2)
    | ~ in(X1,X3) ),
    i_0_53 ).

cnf(c_0_183,plain,
    ( subset(X1,X2)
    | ~ in(esk11_2(X1,X2),X2) ),
    i_0_39 ).

cnf(c_0_184,plain,
    ( in(X1,union(powerset(X2)))
    | ~ in(X1,X2) ),
    inference(spm,[status(thm)],[c_0_178,c_0_179]) ).

cnf(c_0_185,plain,
    ( in(X1,X2)
    | ~ in(X1,esk13_3(powerset(X2),union(powerset(X2)),X3))
    | ~ in(X3,union(powerset(X2))) ),
    inference(spm,[status(thm)],[c_0_180,c_0_181]) ).

cnf(c_0_186,plain,
    ( in(X1,esk13_3(X2,union(X2),X1))
    | ~ in(X1,union(X2)) ),
    inference(er,[status(thm)],[c_0_182]) ).

cnf(c_0_187,plain,
    ( subset(X1,union(powerset(X2)))
    | ~ in(esk11_2(X1,union(powerset(X2))),X2) ),
    inference(spm,[status(thm)],[c_0_183,c_0_184]) ).

cnf(c_0_188,plain,
    ( subset(X1,X2)
    | in(esk11_2(X1,X2),X1) ),
    i_0_40 ).

cnf(c_0_189,plain,
    ( in(X1,X2)
    | ~ in(X1,union(powerset(X2))) ),
    inference(spm,[status(thm)],[c_0_185,c_0_186]) ).

cnf(c_0_190,plain,
    ( X1 = X2
    | ~ subset(X2,X1)
    | ~ subset(X1,X2) ),
    i_0_6 ).

cnf(c_0_191,plain,
    subset(X1,union(powerset(X1))),
    inference(spm,[status(thm)],[c_0_187,c_0_188]) ).

cnf(c_0_192,plain,
    ( in(esk11_2(union(powerset(X1)),X2),X1)
    | subset(union(powerset(X1)),X2) ),
    inference(spm,[status(thm)],[c_0_189,c_0_188]) ).

cnf(c_0_193,plain,
    ( union(powerset(X1)) = X1
    | ~ subset(union(powerset(X1)),X1) ),
    inference(spm,[status(thm)],[c_0_190,c_0_191]) ).

cnf(c_0_194,plain,
    subset(union(powerset(X1)),X1),
    inference(spm,[status(thm)],[c_0_183,c_0_192]) ).

cnf(c_0_195,negated_conjecture,
    union(powerset(esk22_0)) != esk22_0,
    i_0_158 ).

cnf(c_0_196,plain,
    union(powerset(X1)) = X1,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_193,c_0_194])]) ).

cnf(c_0_197,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_195,c_0_196])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : SEU164+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 : n029.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 : Mon Jun 20 08:07:02 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 17.91/3.72  # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d60-l8000-e0.15+coop-eprover73:
% 17.91/3.72  # ENIGMA: LightGBM model '/export/starexec/sandbox2/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d60-l8000-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 23; version: 991; iters: 150)
% 17.91/3.72  # Preprocessing time       : 1.260 s
% 17.91/3.72  # Presaturation interreduction done
% 17.91/3.72  
% 17.91/3.72  # Proof found!
% 17.91/3.72  # SZS status Theorem
% 17.91/3.72  # SZS output start CNFRefutation
% See solution above
% 17.91/3.72  # Training examples: 0 positive, 0 negative
% 17.91/3.72  
% 17.91/3.72  # -------------------------------------------------
% 17.91/3.72  # User time                : 1.168 s
% 17.91/3.72  # System time              : 0.157 s
% 17.91/3.72  # Total time               : 1.325 s
% 17.91/3.72  # ...preprocessing         : 1.260 s
% 17.91/3.72  # ...main loop             : 0.065 s
% 17.91/3.72  # Maximum resident set size: 186800 pages
% 17.91/3.72  
%------------------------------------------------------------------------------