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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SET914+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n015.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:12 EDT 2022

% Result   : Theorem 7.05s 2.42s
% Output   : CNFRefutation 7.05s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   21 (  11 unt;   0 nHn;  18 RR)
%            Number of literals    :   38 (  14 equ;  21 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   35 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_19,plain,
    ( set_intersection2(X1,X2) = empty_set
    | ~ disjoint(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ahebs5s5/lgb.p',i_0_19) ).

cnf(i_0_26,negated_conjecture,
    disjoint(unordered_pair(esk6_0,esk7_0),esk8_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ahebs5s5/lgb.p',i_0_26) ).

cnf(i_0_15,plain,
    ( in(X1,X2)
    | X2 != set_intersection2(X3,X4)
    | ~ in(X1,X4)
    | ~ in(X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ahebs5s5/lgb.p',i_0_15) ).

cnf(i_0_3,plain,
    set_intersection2(X1,X2) = set_intersection2(X2,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ahebs5s5/lgb.p',i_0_3) ).

cnf(i_0_5,plain,
    ( X1 != empty_set
    | ~ in(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ahebs5s5/lgb.p',i_0_5) ).

cnf(i_0_10,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != unordered_pair(X3,X4) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ahebs5s5/lgb.p',i_0_10) ).

cnf(i_0_25,negated_conjecture,
    in(esk6_0,esk8_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ahebs5s5/lgb.p',i_0_25) ).

cnf(c_0_34,plain,
    ( set_intersection2(X1,X2) = empty_set
    | ~ disjoint(X1,X2) ),
    i_0_19 ).

cnf(c_0_35,negated_conjecture,
    disjoint(unordered_pair(esk6_0,esk7_0),esk8_0),
    i_0_26 ).

cnf(c_0_36,plain,
    ( in(X1,X2)
    | X2 != set_intersection2(X3,X4)
    | ~ in(X1,X4)
    | ~ in(X1,X3) ),
    i_0_15 ).

cnf(c_0_37,negated_conjecture,
    set_intersection2(unordered_pair(esk6_0,esk7_0),esk8_0) = empty_set,
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_38,plain,
    set_intersection2(X1,X2) = set_intersection2(X2,X1),
    i_0_3 ).

cnf(c_0_39,plain,
    ( X1 != empty_set
    | ~ in(X2,X1) ),
    i_0_5 ).

cnf(c_0_40,plain,
    ( in(X1,set_intersection2(X2,X3))
    | ~ in(X1,X3)
    | ~ in(X1,X2) ),
    inference(er,[status(thm)],[c_0_36]) ).

cnf(c_0_41,negated_conjecture,
    set_intersection2(esk8_0,unordered_pair(esk6_0,esk7_0)) = empty_set,
    inference(rw,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_42,plain,
    ~ in(X1,empty_set),
    inference(er,[status(thm)],[c_0_39]) ).

cnf(c_0_43,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != unordered_pair(X3,X4) ),
    i_0_10 ).

cnf(c_0_44,negated_conjecture,
    ( ~ in(X1,unordered_pair(esk6_0,esk7_0))
    | ~ in(X1,esk8_0) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).

cnf(c_0_45,plain,
    in(X1,unordered_pair(X1,X2)),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_43])]) ).

cnf(c_0_46,negated_conjecture,
    in(esk6_0,esk8_0),
    i_0_25 ).

cnf(c_0_47,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : SET914+1 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n015.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 15:33:55 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.44  # ENIGMATIC: Selected complete mode:
% 7.05/2.42  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.05/2.42  # No SInE strategy applied
% 7.05/2.42  # Trying AutoSched0 for 150 seconds
% 7.05/2.42  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.05/2.42  # and selection function SelectComplexExceptUniqMaxHorn.
% 7.05/2.42  #
% 7.05/2.42  # Preprocessing time       : 0.013 s
% 7.05/2.42  # Presaturation interreduction done
% 7.05/2.42  
% 7.05/2.42  # Proof found!
% 7.05/2.42  # SZS status Theorem
% 7.05/2.42  # SZS output start CNFRefutation
% See solution above
% 7.05/2.42  # Training examples: 0 positive, 0 negative
% 7.05/2.42  
% 7.05/2.42  # -------------------------------------------------
% 7.05/2.42  # User time                : 0.014 s
% 7.05/2.42  # System time              : 0.004 s
% 7.05/2.42  # Total time               : 0.018 s
% 7.05/2.42  # Maximum resident set size: 7124 pages
% 7.05/2.42  
%------------------------------------------------------------------------------