TSTP Solution File: SET936+1 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SET936+1 : TPTP v8.1.0. Bugfixed v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n005.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:15:23 EDT 2022

% Result   : Theorem 8.59s 2.67s
% Output   : CNFRefutation 8.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   38 (  14 unt;   8 nHn;  29 RR)
%            Number of literals    :   78 (  14 equ;  32 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-3 aty)
%            Number of variables   :   63 (   5 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_17,plain,
    subset(set_intersection2(X1,X2),X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bfggiwrh/input.p',i_0_17) ).

cnf(i_0_2,plain,
    set_intersection2(X1,X2) = set_intersection2(X2,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bfggiwrh/input.p',i_0_2) ).

cnf(i_0_6,plain,
    ( subset(X1,X2)
    | X3 != powerset(X2)
    | ~ in(X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bfggiwrh/input.p',i_0_6) ).

cnf(i_0_22,negated_conjecture,
    powerset(set_intersection2(esk6_0,esk7_0)) != set_intersection2(powerset(esk6_0),powerset(esk7_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bfggiwrh/input.p',i_0_22) ).

cnf(i_0_7,plain,
    ( X1 = set_intersection2(X2,X3)
    | in(esk2_3(X2,X3,X1),X1)
    | in(esk2_3(X2,X3,X1),X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bfggiwrh/input.p',i_0_7) ).

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

cnf(i_0_5,plain,
    ( in(X1,X2)
    | X2 != powerset(X3)
    | ~ subset(X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bfggiwrh/input.p',i_0_5) ).

cnf(i_0_8,plain,
    ( X1 = set_intersection2(X2,X3)
    | in(esk2_3(X2,X3,X1),X1)
    | in(esk2_3(X2,X3,X1),X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bfggiwrh/input.p',i_0_8) ).

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

cnf(i_0_9,plain,
    ( X1 = set_intersection2(X2,X3)
    | ~ in(esk2_3(X2,X3,X1),X1)
    | ~ in(esk2_3(X2,X3,X1),X3)
    | ~ in(esk2_3(X2,X3,X1),X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bfggiwrh/input.p',i_0_9) ).

cnf(c_0_33,plain,
    subset(set_intersection2(X1,X2),X1),
    i_0_17 ).

cnf(c_0_34,plain,
    set_intersection2(X1,X2) = set_intersection2(X2,X1),
    i_0_2 ).

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

cnf(c_0_36,negated_conjecture,
    powerset(set_intersection2(esk6_0,esk7_0)) != set_intersection2(powerset(esk6_0),powerset(esk7_0)),
    i_0_22 ).

cnf(c_0_37,plain,
    ( X1 = set_intersection2(X2,X3)
    | in(esk2_3(X2,X3,X1),X1)
    | in(esk2_3(X2,X3,X1),X3) ),
    i_0_7 ).

cnf(c_0_38,plain,
    ( subset(X1,X2)
    | ~ subset(X3,X2)
    | ~ subset(X1,X3) ),
    i_0_19 ).

cnf(c_0_39,plain,
    subset(set_intersection2(X1,X2),X2),
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

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

cnf(c_0_41,negated_conjecture,
    ( in(esk2_3(powerset(esk6_0),powerset(esk7_0),powerset(set_intersection2(esk6_0,esk7_0))),powerset(set_intersection2(esk6_0,esk7_0)))
    | in(esk2_3(powerset(esk6_0),powerset(esk7_0),powerset(set_intersection2(esk6_0,esk7_0))),powerset(esk7_0)) ),
    inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37])]) ).

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

cnf(c_0_43,plain,
    ( X1 = set_intersection2(X2,X3)
    | in(esk2_3(X2,X3,X1),X1)
    | in(esk2_3(X2,X3,X1),X2) ),
    i_0_8 ).

cnf(c_0_44,plain,
    ( subset(X1,X2)
    | ~ subset(X1,set_intersection2(X3,X2)) ),
    inference(spm,[status(thm)],[c_0_38,c_0_39]) ).

cnf(c_0_45,plain,
    ( in(esk2_3(powerset(esk6_0),powerset(esk7_0),powerset(set_intersection2(esk6_0,esk7_0))),powerset(esk7_0))
    | subset(esk2_3(powerset(esk6_0),powerset(esk7_0),powerset(set_intersection2(esk6_0,esk7_0))),set_intersection2(esk6_0,esk7_0)) ),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

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

cnf(c_0_47,negated_conjecture,
    ( in(esk2_3(powerset(esk6_0),powerset(esk7_0),powerset(set_intersection2(esk6_0,esk7_0))),powerset(set_intersection2(esk6_0,esk7_0)))
    | in(esk2_3(powerset(esk6_0),powerset(esk7_0),powerset(set_intersection2(esk6_0,esk7_0))),powerset(esk6_0)) ),
    inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_43])]) ).

cnf(c_0_48,plain,
    in(esk2_3(powerset(esk6_0),powerset(esk7_0),powerset(set_intersection2(esk6_0,esk7_0))),powerset(esk7_0)),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]) ).

cnf(c_0_49,plain,
    ( subset(X1,X2)
    | ~ subset(X1,set_intersection2(X2,X3)) ),
    inference(spm,[status(thm)],[c_0_38,c_0_33]) ).

cnf(c_0_50,plain,
    ( in(esk2_3(powerset(esk6_0),powerset(esk7_0),powerset(set_intersection2(esk6_0,esk7_0))),powerset(esk6_0))
    | subset(esk2_3(powerset(esk6_0),powerset(esk7_0),powerset(set_intersection2(esk6_0,esk7_0))),set_intersection2(esk6_0,esk7_0)) ),
    inference(spm,[status(thm)],[c_0_40,c_0_47]) ).

cnf(c_0_51,plain,
    ( subset(X1,set_intersection2(X2,X3))
    | ~ subset(X1,X3)
    | ~ subset(X1,X2) ),
    i_0_18 ).

cnf(c_0_52,plain,
    subset(esk2_3(powerset(esk6_0),powerset(esk7_0),powerset(set_intersection2(esk6_0,esk7_0))),esk7_0),
    inference(spm,[status(thm)],[c_0_40,c_0_48]) ).

cnf(c_0_53,plain,
    in(esk2_3(powerset(esk6_0),powerset(esk7_0),powerset(set_intersection2(esk6_0,esk7_0))),powerset(esk6_0)),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_46]) ).

cnf(c_0_54,plain,
    ( X1 = set_intersection2(X2,X3)
    | ~ in(esk2_3(X2,X3,X1),X1)
    | ~ in(esk2_3(X2,X3,X1),X3)
    | ~ in(esk2_3(X2,X3,X1),X2) ),
    i_0_9 ).

cnf(c_0_55,plain,
    ( subset(esk2_3(powerset(esk6_0),powerset(esk7_0),powerset(set_intersection2(esk6_0,esk7_0))),set_intersection2(X1,esk7_0))
    | ~ subset(esk2_3(powerset(esk6_0),powerset(esk7_0),powerset(set_intersection2(esk6_0,esk7_0))),X1) ),
    inference(spm,[status(thm)],[c_0_51,c_0_52]) ).

cnf(c_0_56,plain,
    subset(esk2_3(powerset(esk6_0),powerset(esk7_0),powerset(set_intersection2(esk6_0,esk7_0))),esk6_0),
    inference(spm,[status(thm)],[c_0_40,c_0_53]) ).

cnf(c_0_57,plain,
    ( ~ in(esk2_3(powerset(esk6_0),powerset(esk7_0),powerset(set_intersection2(esk6_0,esk7_0))),powerset(set_intersection2(esk6_0,esk7_0)))
    | ~ in(esk2_3(powerset(esk6_0),powerset(esk7_0),powerset(set_intersection2(esk6_0,esk7_0))),powerset(esk6_0)) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_48]),c_0_36]) ).

cnf(c_0_58,plain,
    subset(esk2_3(powerset(esk6_0),powerset(esk7_0),powerset(set_intersection2(esk6_0,esk7_0))),set_intersection2(esk6_0,esk7_0)),
    inference(spm,[status(thm)],[c_0_55,c_0_56]) ).

cnf(c_0_59,plain,
    ~ in(esk2_3(powerset(esk6_0),powerset(esk7_0),powerset(set_intersection2(esk6_0,esk7_0))),powerset(set_intersection2(esk6_0,esk7_0))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_53])]) ).

cnf(c_0_60,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_58]),c_0_59]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SET936+1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.12/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n005.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 Jul 10 02:02:08 EDT 2022
% 0.19/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 8.59/2.67  # ENIGMATIC: Solved by autoschedule:
% 8.59/2.67  # No SInE strategy applied
% 8.59/2.67  # Trying AutoSched0 for 150 seconds
% 8.59/2.67  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S006A
% 8.59/2.67  # and selection function SelectLargestNegLit.
% 8.59/2.67  #
% 8.59/2.67  # Preprocessing time       : 0.023 s
% 8.59/2.67  # Presaturation interreduction done
% 8.59/2.67  
% 8.59/2.67  # Proof found!
% 8.59/2.67  # SZS status Theorem
% 8.59/2.67  # SZS output start CNFRefutation
% See solution above
% 8.59/2.67  # Training examples: 0 positive, 0 negative
% 8.59/2.67  
% 8.59/2.67  # -------------------------------------------------
% 8.59/2.67  # User time                : 0.154 s
% 8.59/2.67  # System time              : 0.009 s
% 8.59/2.67  # Total time               : 0.163 s
% 8.59/2.67  # Maximum resident set size: 7120 pages
% 8.59/2.67  
%------------------------------------------------------------------------------