↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n006.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:38:49 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_12,plain,
    ( X1 = X2
    | X3 != unordered_pair(X2,X2)
    | ~ in(X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j5se0moh/input.p',i_0_12) ).

cnf(i_0_89,lemma,
    ( disjoint(X1,X2)
    | in(esk14_2(X1,X2),X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j5se0moh/input.p',i_0_89) ).

cnf(i_0_90,lemma,
    ( disjoint(X1,X2)
    | in(esk14_2(X1,X2),X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j5se0moh/input.p',i_0_90) ).

cnf(i_0_105,lemma,
    ( set_difference(X1,X2) = X1
    | ~ disjoint(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j5se0moh/input.p',i_0_105) ).

cnf(i_0_82,lemma,
    ( subset(set_difference(X1,X2),set_difference(X3,X2))
    | ~ subset(X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j5se0moh/input.p',i_0_82) ).

cnf(i_0_64,negated_conjecture,
    ~ subset(esk8_0,set_difference(esk9_0,unordered_pair(esk10_0,esk10_0))),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j5se0moh/input.p',i_0_64) ).

cnf(i_0_66,negated_conjecture,
    subset(esk8_0,esk9_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j5se0moh/input.p',i_0_66) ).

cnf(i_0_65,negated_conjecture,
    ~ in(esk10_0,esk8_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-j5se0moh/input.p',i_0_65) ).

cnf(c_0_114,plain,
    ( X1 = X2
    | X3 != unordered_pair(X2,X2)
    | ~ in(X1,X3) ),
    i_0_12 ).

cnf(c_0_115,plain,
    ( X1 = X2
    | ~ in(X1,unordered_pair(X2,X2)) ),
    inference(er,[status(thm)],[c_0_114]) ).

cnf(c_0_116,lemma,
    ( disjoint(X1,X2)
    | in(esk14_2(X1,X2),X2) ),
    i_0_89 ).

cnf(c_0_117,lemma,
    ( disjoint(X1,X2)
    | in(esk14_2(X1,X2),X1) ),
    i_0_90 ).

cnf(c_0_118,lemma,
    ( esk14_2(X1,unordered_pair(X2,X2)) = X2
    | disjoint(X1,unordered_pair(X2,X2)) ),
    inference(spm,[status(thm)],[c_0_115,c_0_116]) ).

cnf(c_0_119,lemma,
    ( set_difference(X1,X2) = X1
    | ~ disjoint(X1,X2) ),
    i_0_105 ).

cnf(c_0_120,lemma,
    ( disjoint(X1,unordered_pair(X2,X2))
    | in(X2,X1) ),
    inference(spm,[status(thm)],[c_0_117,c_0_118]) ).

cnf(c_0_121,lemma,
    ( subset(set_difference(X1,X2),set_difference(X3,X2))
    | ~ subset(X1,X3) ),
    i_0_82 ).

cnf(c_0_122,lemma,
    ( set_difference(X1,unordered_pair(X2,X2)) = X1
    | in(X2,X1) ),
    inference(spm,[status(thm)],[c_0_119,c_0_120]) ).

cnf(c_0_123,negated_conjecture,
    ~ subset(esk8_0,set_difference(esk9_0,unordered_pair(esk10_0,esk10_0))),
    i_0_64 ).

cnf(c_0_124,lemma,
    ( in(X1,X2)
    | subset(X2,set_difference(X3,unordered_pair(X1,X1)))
    | ~ subset(X2,X3) ),
    inference(spm,[status(thm)],[c_0_121,c_0_122]) ).

cnf(c_0_125,negated_conjecture,
    subset(esk8_0,esk9_0),
    i_0_66 ).

cnf(c_0_126,negated_conjecture,
    ~ in(esk10_0,esk8_0),
    i_0_65 ).

cnf(c_0_127,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_124]),c_0_125])]),c_0_126]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SEU145+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n006.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 Jun 19 19:02:57 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 16.45/3.55  # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d45-l8000-e0.15+coop-mzr02:
% 16.45/3.55  # ENIGMA: LightGBM model '/export/starexec/sandbox/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d45-l8000-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 33; version: 991; iters: 150)
% 16.45/3.55  # Preprocessing time       : 1.164 s
% 16.45/3.55  
% 16.45/3.55  # Proof found!
% 16.45/3.55  # SZS status Theorem
% 16.45/3.55  # SZS output start CNFRefutation
% See solution above
% 16.45/3.55  # Training examples: 0 positive, 0 negative
% 16.45/3.55  
% 16.45/3.55  # -------------------------------------------------
% 16.45/3.55  # User time                : 1.032 s
% 16.45/3.55  # System time              : 0.139 s
% 16.45/3.55  # Total time               : 1.171 s
% 16.45/3.55  # ...preprocessing         : 1.164 s
% 16.45/3.55  # ...main loop             : 0.007 s
% 16.45/3.55  # Maximum resident set size: 176440 pages
% 16.45/3.55  
%------------------------------------------------------------------------------