↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SEU354+1 : 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:41:06 EDT 2022

% Result   : Theorem 7.69s 2.33s
% Output   : CNFRefutation 7.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   22 (  10 unt;   2 nHn;  17 RR)
%            Number of literals    :   38 (  11 equ;  19 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    :    4 (   4 usr;   2 con; 0-1 aty)
%            Number of variables   :   20 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_42,plain,
    ( X1 != union(X2)
    | ~ element(X1,X2)
    | ~ proper_element(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0jz74eds/lgb.p',i_0_42) ).

cnf(i_0_84,plain,
    union(powerset(X1)) = X1,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0jz74eds/lgb.p',i_0_84) ).

cnf(i_0_74,plain,
    ( element(X1,powerset(X2))
    | ~ subset(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0jz74eds/lgb.p',i_0_74) ).

cnf(i_0_71,plain,
    subset(X1,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0jz74eds/lgb.p',i_0_71) ).

cnf(i_0_41,plain,
    ( X1 = union(X2)
    | proper_element(X1,X2)
    | ~ element(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0jz74eds/lgb.p',i_0_41) ).

cnf(i_0_80,negated_conjecture,
    element(esk7_0,powerset(esk6_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0jz74eds/lgb.p',i_0_80) ).

cnf(i_0_79,negated_conjecture,
    ( esk6_0 = esk7_0
    | ~ proper_element(esk7_0,powerset(esk6_0)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0jz74eds/lgb.p',i_0_79) ).

cnf(i_0_78,negated_conjecture,
    ( proper_element(esk7_0,powerset(esk6_0))
    | esk6_0 != esk7_0 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0jz74eds/lgb.p',i_0_78) ).

cnf(c_0_93,plain,
    ( X1 != union(X2)
    | ~ element(X1,X2)
    | ~ proper_element(X1,X2) ),
    i_0_42 ).

cnf(c_0_94,plain,
    ( ~ element(union(X1),X1)
    | ~ proper_element(union(X1),X1) ),
    inference(er,[status(thm)],[c_0_93]) ).

cnf(c_0_95,plain,
    union(powerset(X1)) = X1,
    i_0_84 ).

cnf(c_0_96,plain,
    ( element(X1,powerset(X2))
    | ~ subset(X1,X2) ),
    i_0_74 ).

cnf(c_0_97,plain,
    subset(X1,X1),
    i_0_71 ).

cnf(c_0_98,plain,
    ( X1 = union(X2)
    | proper_element(X1,X2)
    | ~ element(X1,X2) ),
    i_0_41 ).

cnf(c_0_99,negated_conjecture,
    element(esk7_0,powerset(esk6_0)),
    i_0_80 ).

cnf(c_0_100,negated_conjecture,
    ( esk6_0 = esk7_0
    | ~ proper_element(esk7_0,powerset(esk6_0)) ),
    i_0_79 ).

cnf(c_0_101,plain,
    ( ~ element(X1,powerset(X1))
    | ~ proper_element(X1,powerset(X1)) ),
    inference(spm,[status(thm)],[c_0_94,c_0_95]) ).

cnf(c_0_102,plain,
    element(X1,powerset(X1)),
    inference(spm,[status(thm)],[c_0_96,c_0_97]) ).

cnf(c_0_103,negated_conjecture,
    ( proper_element(esk7_0,powerset(esk6_0))
    | esk6_0 != esk7_0 ),
    i_0_78 ).

cnf(c_0_104,negated_conjecture,
    esk6_0 = esk7_0,
    inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_95]),c_0_100]) ).

cnf(c_0_105,plain,
    ~ proper_element(X1,powerset(X1)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_101,c_0_102])]) ).

cnf(c_0_106,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_103,c_0_104]),c_0_104])]),c_0_105]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SEU354+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.33  % Computer : n006.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Sat Jun 18 21:23:57 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 7.69/2.33  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.69/2.33  # No SInE strategy applied
% 7.69/2.33  # Trying AutoSched0 for 150 seconds
% 7.69/2.33  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S058I
% 7.69/2.33  # and selection function PSelectMin2Infpos.
% 7.69/2.33  #
% 7.69/2.33  # Preprocessing time       : 0.023 s
% 7.69/2.33  # Presaturation interreduction done
% 7.69/2.33  
% 7.69/2.33  # Proof found!
% 7.69/2.33  # SZS status Theorem
% 7.69/2.33  # SZS output start CNFRefutation
% See solution above
% 7.69/2.33  # Training examples: 0 positive, 0 negative
% 7.69/2.33  
% 7.69/2.33  # -------------------------------------------------
% 7.69/2.33  # User time                : 0.026 s
% 7.69/2.33  # System time              : 0.005 s
% 7.69/2.33  # Total time               : 0.031 s
% 7.69/2.33  # Maximum resident set size: 7124 pages
% 7.69/2.33  
%------------------------------------------------------------------------------