↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n013.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:09 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_11,plain,
    ( subset_complement(X1,X2) = set_difference(X1,X2)
    | ~ element(X2,powerset(X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vsqx58or/input.p',i_0_11) ).

cnf(i_0_36,negated_conjecture,
    element(esk11_0,powerset(esk9_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vsqx58or/input.p',i_0_36) ).

cnf(i_0_9,plain,
    ( X1 != set_difference(X2,X3)
    | ~ in(X4,X1)
    | ~ in(X4,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vsqx58or/input.p',i_0_9) ).

cnf(i_0_14,plain,
    ( element(subset_complement(X1,X2),powerset(X1))
    | ~ element(X2,powerset(X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vsqx58or/input.p',i_0_14) ).

cnf(i_0_20,plain,
    ( subset_complement(X1,subset_complement(X1,X2)) = X2
    | ~ element(X2,powerset(X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vsqx58or/input.p',i_0_20) ).

cnf(i_0_32,plain,
    ( disjoint(X1,X2)
    | in(esk8_2(X1,X2),X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vsqx58or/input.p',i_0_32) ).

cnf(i_0_4,plain,
    ( in(X1,X2)
    | ~ in(X1,X3)
    | ~ subset(X3,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vsqx58or/input.p',i_0_4) ).

cnf(i_0_33,plain,
    ( disjoint(X1,X2)
    | in(esk8_2(X1,X2),X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vsqx58or/input.p',i_0_33) ).

cnf(i_0_34,negated_conjecture,
    ( disjoint(esk10_0,esk11_0)
    | subset(esk10_0,subset_complement(esk9_0,esk11_0)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vsqx58or/input.p',i_0_34) ).

cnf(i_0_8,plain,
    ( in(X1,X2)
    | in(X1,X3)
    | X2 != set_difference(X4,X3)
    | ~ in(X1,X4) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vsqx58or/input.p',i_0_8) ).

cnf(i_0_21,plain,
    ( in(X1,X2)
    | ~ in(X1,X3)
    | ~ element(X3,powerset(X2)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vsqx58or/input.p',i_0_21) ).

cnf(i_0_37,negated_conjecture,
    element(esk10_0,powerset(esk9_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vsqx58or/input.p',i_0_37) ).

cnf(i_0_31,plain,
    ( ~ in(X1,X2)
    | ~ in(X1,X3)
    | ~ disjoint(X3,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vsqx58or/input.p',i_0_31) ).

cnf(i_0_2,plain,
    ( subset(X1,X2)
    | ~ in(esk1_2(X1,X2),X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vsqx58or/input.p',i_0_2) ).

cnf(i_0_3,plain,
    ( subset(X1,X2)
    | in(esk1_2(X1,X2),X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vsqx58or/input.p',i_0_3) ).

cnf(i_0_35,negated_conjecture,
    ( ~ disjoint(esk10_0,esk11_0)
    | ~ subset(esk10_0,subset_complement(esk9_0,esk11_0)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vsqx58or/input.p',i_0_35) ).

cnf(c_0_54,plain,
    ( subset_complement(X1,X2) = set_difference(X1,X2)
    | ~ element(X2,powerset(X1)) ),
    i_0_11 ).

cnf(c_0_55,negated_conjecture,
    element(esk11_0,powerset(esk9_0)),
    i_0_36 ).

cnf(c_0_56,plain,
    ( X1 != set_difference(X2,X3)
    | ~ in(X4,X1)
    | ~ in(X4,X3) ),
    i_0_9 ).

cnf(c_0_57,plain,
    ( element(subset_complement(X1,X2),powerset(X1))
    | ~ element(X2,powerset(X1)) ),
    i_0_14 ).

cnf(c_0_58,negated_conjecture,
    subset_complement(esk9_0,esk11_0) = set_difference(esk9_0,esk11_0),
    inference(spm,[status(thm)],[c_0_54,c_0_55]) ).

cnf(c_0_59,plain,
    ( subset_complement(X1,subset_complement(X1,X2)) = X2
    | ~ element(X2,powerset(X1)) ),
    i_0_20 ).

cnf(c_0_60,plain,
    ( ~ in(X1,set_difference(X2,X3))
    | ~ in(X1,X3) ),
    inference(er,[status(thm)],[c_0_56]) ).

cnf(c_0_61,plain,
    ( disjoint(X1,X2)
    | in(esk8_2(X1,X2),X2) ),
    i_0_32 ).

cnf(c_0_62,negated_conjecture,
    element(set_difference(esk9_0,esk11_0),powerset(esk9_0)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_55]),c_0_58]) ).

cnf(c_0_63,negated_conjecture,
    subset_complement(esk9_0,set_difference(esk9_0,esk11_0)) = esk11_0,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_55]),c_0_58]) ).

cnf(c_0_64,plain,
    ( disjoint(X1,set_difference(X2,X3))
    | ~ in(esk8_2(X1,set_difference(X2,X3)),X3) ),
    inference(spm,[status(thm)],[c_0_60,c_0_61]) ).

cnf(c_0_65,plain,
    set_difference(esk9_0,set_difference(esk9_0,esk11_0)) = esk11_0,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_62]),c_0_63]) ).

cnf(c_0_66,plain,
    ( in(X1,X2)
    | ~ in(X1,X3)
    | ~ subset(X3,X2) ),
    i_0_4 ).

cnf(c_0_67,plain,
    ( disjoint(X1,X2)
    | in(esk8_2(X1,X2),X1) ),
    i_0_33 ).

cnf(c_0_68,plain,
    ( disjoint(X1,esk11_0)
    | ~ in(esk8_2(X1,esk11_0),set_difference(esk9_0,esk11_0)) ),
    inference(spm,[status(thm)],[c_0_64,c_0_65]) ).

cnf(c_0_69,plain,
    ( disjoint(X1,X2)
    | in(esk8_2(X1,X2),X3)
    | ~ subset(X1,X3) ),
    inference(spm,[status(thm)],[c_0_66,c_0_67]) ).

cnf(c_0_70,negated_conjecture,
    ( disjoint(esk10_0,esk11_0)
    | subset(esk10_0,subset_complement(esk9_0,esk11_0)) ),
    i_0_34 ).

cnf(c_0_71,plain,
    ( disjoint(X1,esk11_0)
    | ~ subset(X1,set_difference(esk9_0,esk11_0)) ),
    inference(spm,[status(thm)],[c_0_68,c_0_69]) ).

cnf(c_0_72,negated_conjecture,
    ( disjoint(esk10_0,esk11_0)
    | subset(esk10_0,set_difference(esk9_0,esk11_0)) ),
    inference(rw,[status(thm)],[c_0_70,c_0_58]) ).

cnf(c_0_73,plain,
    ( in(X1,X2)
    | in(X1,X3)
    | X2 != set_difference(X4,X3)
    | ~ in(X1,X4) ),
    i_0_8 ).

cnf(c_0_74,plain,
    ( in(X1,X2)
    | ~ in(X1,X3)
    | ~ element(X3,powerset(X2)) ),
    i_0_21 ).

cnf(c_0_75,negated_conjecture,
    element(esk10_0,powerset(esk9_0)),
    i_0_37 ).

cnf(c_0_76,plain,
    ( ~ in(X1,X2)
    | ~ in(X1,X3)
    | ~ disjoint(X3,X2) ),
    i_0_31 ).

cnf(c_0_77,negated_conjecture,
    disjoint(esk10_0,esk11_0),
    inference(spm,[status(thm)],[c_0_71,c_0_72]) ).

cnf(c_0_78,plain,
    ( subset(X1,X2)
    | ~ in(esk1_2(X1,X2),X2) ),
    i_0_2 ).

cnf(c_0_79,plain,
    ( in(X1,set_difference(X2,X3))
    | in(X1,X3)
    | ~ in(X1,X2) ),
    inference(er,[status(thm)],[c_0_73]) ).

cnf(c_0_80,negated_conjecture,
    ( in(X1,esk9_0)
    | ~ in(X1,esk10_0) ),
    inference(spm,[status(thm)],[c_0_74,c_0_75]) ).

cnf(c_0_81,plain,
    ( subset(X1,X2)
    | in(esk1_2(X1,X2),X1) ),
    i_0_3 ).

cnf(c_0_82,negated_conjecture,
    ( ~ disjoint(esk10_0,esk11_0)
    | ~ subset(esk10_0,subset_complement(esk9_0,esk11_0)) ),
    i_0_35 ).

cnf(c_0_83,plain,
    ( ~ in(X1,esk10_0)
    | ~ in(X1,esk11_0) ),
    inference(spm,[status(thm)],[c_0_76,c_0_77]) ).

cnf(c_0_84,plain,
    ( in(esk1_2(X1,set_difference(X2,X3)),X3)
    | subset(X1,set_difference(X2,X3))
    | ~ in(esk1_2(X1,set_difference(X2,X3)),X2) ),
    inference(spm,[status(thm)],[c_0_78,c_0_79]) ).

cnf(c_0_85,plain,
    ( in(esk1_2(esk10_0,X1),esk9_0)
    | subset(esk10_0,X1) ),
    inference(spm,[status(thm)],[c_0_80,c_0_81]) ).

cnf(c_0_86,negated_conjecture,
    ( ~ disjoint(esk10_0,esk11_0)
    | ~ subset(esk10_0,set_difference(esk9_0,esk11_0)) ),
    inference(rw,[status(thm)],[c_0_82,c_0_58]) ).

cnf(c_0_87,plain,
    ( subset(esk10_0,X1)
    | ~ in(esk1_2(esk10_0,X1),esk11_0) ),
    inference(spm,[status(thm)],[c_0_83,c_0_81]) ).

cnf(c_0_88,plain,
    ( in(esk1_2(esk10_0,set_difference(esk9_0,X1)),X1)
    | subset(esk10_0,set_difference(esk9_0,X1)) ),
    inference(spm,[status(thm)],[c_0_84,c_0_85]) ).

cnf(c_0_89,negated_conjecture,
    ~ subset(esk10_0,set_difference(esk9_0,esk11_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_77])]) ).

cnf(c_0_90,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_89]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SEU170+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n013.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 05:21:45 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 11.37/2.80  # ENIGMATIC: Solved by autoschedule:
% 11.37/2.80  # No SInE strategy applied
% 11.37/2.80  # Trying AutoSched0 for 150 seconds
% 11.37/2.80  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S02CN
% 11.37/2.80  # and selection function SelectAntiRROptimalLit.
% 11.37/2.80  #
% 11.37/2.80  # Preprocessing time       : 0.020 s
% 11.37/2.80  # Presaturation interreduction done
% 11.37/2.80  
% 11.37/2.80  # Proof found!
% 11.37/2.80  # SZS status Theorem
% 11.37/2.80  # SZS output start CNFRefutation
% See solution above
% 11.37/2.80  # Training examples: 0 positive, 0 negative
% 11.37/2.80  
% 11.37/2.80  # -------------------------------------------------
% 11.37/2.80  # User time                : 0.156 s
% 11.37/2.80  # System time              : 0.013 s
% 11.37/2.80  # Total time               : 0.169 s
% 11.37/2.80  # Maximum resident set size: 7124 pages
% 11.37/2.80  
%------------------------------------------------------------------------------