↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n014.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 00:13:07 EDT 2022

% Result   : Theorem 6.63s 2.34s
% Output   : CNFRefutation 6.63s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   33 (  10 unt;   5 nHn;  30 RR)
%            Number of literals    :   91 (   0 equ;  58 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   4 con; 0-2 aty)
%            Number of variables   :   52 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_14,plain,
    ( member(X1,X2)
    | ~ member(X1,X3)
    | ~ subset(X3,X2)
    | ~ ilf_type(X1,set_type)
    | ~ ilf_type(X2,set_type)
    | ~ ilf_type(X3,set_type) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-sfkdjk1x/input.p',i_0_14) ).

cnf(i_0_40,plain,
    ilf_type(X1,set_type),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-sfkdjk1x/input.p',i_0_40) ).

cnf(i_0_20,plain,
    ( member(X1,power_set(X2))
    | ~ ilf_type(X2,set_type)
    | ~ ilf_type(X1,set_type)
    | ~ member(esk6_2(X1,X2),X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-sfkdjk1x/input.p',i_0_20) ).

cnf(i_0_42,negated_conjecture,
    subset(esk12_0,cross_product(esk13_0,esk14_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-sfkdjk1x/input.p',i_0_42) ).

cnf(i_0_31,plain,
    ( ~ empty(X1)
    | ~ member(X2,X1)
    | ~ ilf_type(X2,set_type)
    | ~ ilf_type(X1,set_type) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-sfkdjk1x/input.p',i_0_31) ).

cnf(i_0_21,plain,
    ( member(X1,power_set(X2))
    | member(esk6_2(X1,X2),X1)
    | ~ ilf_type(X2,set_type)
    | ~ ilf_type(X1,set_type) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-sfkdjk1x/input.p',i_0_21) ).

cnf(i_0_26,plain,
    ( empty(X1)
    | ilf_type(X2,member_type(X1))
    | ~ member(X2,X1)
    | ~ ilf_type(X1,set_type)
    | ~ ilf_type(X2,set_type) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-sfkdjk1x/input.p',i_0_26) ).

cnf(i_0_16,plain,
    ( ilf_type(X1,subset_type(X2))
    | ~ ilf_type(X2,set_type)
    | ~ ilf_type(X1,set_type)
    | ~ ilf_type(X1,member_type(power_set(X2))) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-sfkdjk1x/input.p',i_0_16) ).

cnf(i_0_2,plain,
    ( ilf_type(X1,relation_type(X2,X3))
    | ~ ilf_type(X3,set_type)
    | ~ ilf_type(X2,set_type)
    | ~ ilf_type(X1,subset_type(cross_product(X2,X3))) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-sfkdjk1x/input.p',i_0_2) ).

cnf(i_0_41,negated_conjecture,
    ~ ilf_type(esk12_0,relation_type(esk13_0,esk14_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-sfkdjk1x/input.p',i_0_41) ).

cnf(c_0_53,plain,
    ( member(X1,X2)
    | ~ member(X1,X3)
    | ~ subset(X3,X2)
    | ~ ilf_type(X1,set_type)
    | ~ ilf_type(X2,set_type)
    | ~ ilf_type(X3,set_type) ),
    i_0_14 ).

cnf(c_0_54,plain,
    ilf_type(X1,set_type),
    i_0_40 ).

cnf(c_0_55,plain,
    ( member(X1,power_set(X2))
    | ~ ilf_type(X2,set_type)
    | ~ ilf_type(X1,set_type)
    | ~ member(esk6_2(X1,X2),X2) ),
    i_0_20 ).

cnf(c_0_56,plain,
    ( member(X1,X2)
    | ~ member(X1,X3)
    | ~ subset(X3,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54]),c_0_54]),c_0_54])]) ).

cnf(c_0_57,negated_conjecture,
    subset(esk12_0,cross_product(esk13_0,esk14_0)),
    i_0_42 ).

cnf(c_0_58,plain,
    ( ~ empty(X1)
    | ~ member(X2,X1)
    | ~ ilf_type(X2,set_type)
    | ~ ilf_type(X1,set_type) ),
    i_0_31 ).

cnf(c_0_59,plain,
    ( member(X1,power_set(X2))
    | ~ member(esk6_2(X1,X2),X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_54]),c_0_54])]) ).

cnf(c_0_60,negated_conjecture,
    ( member(X1,cross_product(esk13_0,esk14_0))
    | ~ member(X1,esk12_0) ),
    inference(spm,[status(thm)],[c_0_56,c_0_57]) ).

cnf(c_0_61,plain,
    ( member(X1,power_set(X2))
    | member(esk6_2(X1,X2),X1)
    | ~ ilf_type(X2,set_type)
    | ~ ilf_type(X1,set_type) ),
    i_0_21 ).

cnf(c_0_62,plain,
    ( empty(X1)
    | ilf_type(X2,member_type(X1))
    | ~ member(X2,X1)
    | ~ ilf_type(X1,set_type)
    | ~ ilf_type(X2,set_type) ),
    i_0_26 ).

cnf(c_0_63,plain,
    ( ~ member(X1,X2)
    | ~ empty(X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_54]),c_0_54])]) ).

cnf(c_0_64,plain,
    ( member(X1,power_set(cross_product(esk13_0,esk14_0)))
    | ~ member(esk6_2(X1,cross_product(esk13_0,esk14_0)),esk12_0) ),
    inference(spm,[status(thm)],[c_0_59,c_0_60]) ).

cnf(c_0_65,plain,
    ( member(esk6_2(X1,X2),X1)
    | member(X1,power_set(X2)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_54]),c_0_54])]) ).

cnf(c_0_66,plain,
    ( ilf_type(X1,subset_type(X2))
    | ~ ilf_type(X2,set_type)
    | ~ ilf_type(X1,set_type)
    | ~ ilf_type(X1,member_type(power_set(X2))) ),
    i_0_16 ).

cnf(c_0_67,plain,
    ( ilf_type(X1,member_type(X2))
    | ~ member(X1,X2) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_54]),c_0_54])]),c_0_63]) ).

cnf(c_0_68,plain,
    member(esk12_0,power_set(cross_product(esk13_0,esk14_0))),
    inference(spm,[status(thm)],[c_0_64,c_0_65]) ).

cnf(c_0_69,plain,
    ( ilf_type(X1,relation_type(X2,X3))
    | ~ ilf_type(X3,set_type)
    | ~ ilf_type(X2,set_type)
    | ~ ilf_type(X1,subset_type(cross_product(X2,X3))) ),
    i_0_2 ).

cnf(c_0_70,plain,
    ( ilf_type(X1,subset_type(X2))
    | ~ ilf_type(X1,member_type(power_set(X2))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_54]),c_0_54])]) ).

cnf(c_0_71,plain,
    ilf_type(esk12_0,member_type(power_set(cross_product(esk13_0,esk14_0)))),
    inference(spm,[status(thm)],[c_0_67,c_0_68]) ).

cnf(c_0_72,plain,
    ( ilf_type(X1,relation_type(X2,X3))
    | ~ ilf_type(X1,subset_type(cross_product(X2,X3))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_54]),c_0_54])]) ).

cnf(c_0_73,plain,
    ilf_type(esk12_0,subset_type(cross_product(esk13_0,esk14_0))),
    inference(spm,[status(thm)],[c_0_70,c_0_71]) ).

cnf(c_0_74,negated_conjecture,
    ~ ilf_type(esk12_0,relation_type(esk13_0,esk14_0)),
    i_0_41 ).

cnf(c_0_75,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_74]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SET641+3 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n014.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sun Jul 10 08:22:21 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 6.63/2.34  # ENIGMATIC: Solved by autoschedule:
% 6.63/2.34  # No SInE strategy applied
% 6.63/2.34  # Trying AutoSched0 for 150 seconds
% 6.63/2.34  # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 6.63/2.34  # and selection function SelectMaxLComplexAvoidPosPred.
% 6.63/2.34  #
% 6.63/2.34  # Preprocessing time       : 0.013 s
% 6.63/2.34  
% 6.63/2.34  # Proof found!
% 6.63/2.34  # SZS status Theorem
% 6.63/2.34  # SZS output start CNFRefutation
% See solution above
% 6.63/2.34  # Training examples: 0 positive, 0 negative
% 6.63/2.34  
% 6.63/2.34  # -------------------------------------------------
% 6.63/2.34  # User time                : 0.021 s
% 6.63/2.34  # System time              : 0.003 s
% 6.63/2.34  # Total time               : 0.024 s
% 6.63/2.34  # Maximum resident set size: 7120 pages
% 6.63/2.34  
%------------------------------------------------------------------------------