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

View Problem - Process Solution

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

% Computer : n026.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:37 EDT 2022

% Result   : Theorem 8.03s 2.45s
% Output   : CNFRefutation 8.03s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   19 (   5 unt;   4 nHn;  15 RR)
%            Number of literals    :   33 (   0 equ;  17 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   4 con; 0-5 aty)
%            Number of variables   :   48 (  12 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_15,plain,
    ( ~ disjoint(X1,X2)
    | ~ in(X3,set_intersection2(X1,X2)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0a0bvdob/lgb.p',i_0_15) ).

cnf(i_0_11,plain,
    ( in(esk3_5(X1,X2,X3,X4,X5),set_intersection2(X2,X4))
    | ~ in(X1,set_intersection2(cartesian_product2(X2,X3),cartesian_product2(X4,X5))) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0a0bvdob/lgb.p',i_0_11) ).

cnf(i_0_16,plain,
    ( disjoint(X1,X2)
    | in(esk9_2(X1,X2),set_intersection2(X1,X2)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0a0bvdob/lgb.p',i_0_16) ).

cnf(i_0_10,plain,
    ( in(esk4_5(X1,X2,X3,X4,X5),set_intersection2(X3,X5))
    | ~ in(X1,set_intersection2(cartesian_product2(X2,X3),cartesian_product2(X4,X5))) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0a0bvdob/lgb.p',i_0_10) ).

cnf(i_0_13,negated_conjecture,
    ~ disjoint(cartesian_product2(esk5_0,esk7_0),cartesian_product2(esk6_0,esk8_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0a0bvdob/lgb.p',i_0_13) ).

cnf(i_0_14,negated_conjecture,
    ( disjoint(esk5_0,esk6_0)
    | disjoint(esk7_0,esk8_0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0a0bvdob/lgb.p',i_0_14) ).

cnf(c_0_23,plain,
    ( ~ disjoint(X1,X2)
    | ~ in(X3,set_intersection2(X1,X2)) ),
    i_0_15 ).

cnf(c_0_24,plain,
    ( in(esk3_5(X1,X2,X3,X4,X5),set_intersection2(X2,X4))
    | ~ in(X1,set_intersection2(cartesian_product2(X2,X3),cartesian_product2(X4,X5))) ),
    i_0_11 ).

cnf(c_0_25,plain,
    ( ~ in(X1,set_intersection2(cartesian_product2(X2,X3),cartesian_product2(X4,X5)))
    | ~ disjoint(X2,X4) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_26,plain,
    ( disjoint(X1,X2)
    | in(esk9_2(X1,X2),set_intersection2(X1,X2)) ),
    i_0_16 ).

cnf(c_0_27,plain,
    ( in(esk4_5(X1,X2,X3,X4,X5),set_intersection2(X3,X5))
    | ~ in(X1,set_intersection2(cartesian_product2(X2,X3),cartesian_product2(X4,X5))) ),
    i_0_10 ).

cnf(c_0_28,negated_conjecture,
    ~ disjoint(cartesian_product2(esk5_0,esk7_0),cartesian_product2(esk6_0,esk8_0)),
    i_0_13 ).

cnf(c_0_29,plain,
    ( disjoint(cartesian_product2(X1,X2),cartesian_product2(X3,X4))
    | ~ disjoint(X1,X3) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_30,plain,
    ( ~ in(X1,set_intersection2(cartesian_product2(X2,X3),cartesian_product2(X4,X5)))
    | ~ disjoint(X3,X5) ),
    inference(spm,[status(thm)],[c_0_23,c_0_27]) ).

cnf(c_0_31,negated_conjecture,
    ( disjoint(esk5_0,esk6_0)
    | disjoint(esk7_0,esk8_0) ),
    i_0_14 ).

cnf(c_0_32,negated_conjecture,
    ~ disjoint(esk5_0,esk6_0),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_33,plain,
    ( disjoint(cartesian_product2(X1,X2),cartesian_product2(X3,X4))
    | ~ disjoint(X2,X4) ),
    inference(spm,[status(thm)],[c_0_30,c_0_26]) ).

cnf(c_0_34,negated_conjecture,
    disjoint(esk7_0,esk8_0),
    inference(sr,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_35,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_33]),c_0_34])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SET974+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.14/0.35  % Computer : n026.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Sun Jul 10 15:16:28 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.21/0.46  # ENIGMATIC: Selected complete mode:
% 8.03/2.45  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.03/2.45  # No SInE strategy applied
% 8.03/2.45  # Trying AutoSched0 for 150 seconds
% 8.03/2.45  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 8.03/2.45  # and selection function SelectComplexExceptUniqMaxHorn.
% 8.03/2.45  #
% 8.03/2.45  # Preprocessing time       : 0.023 s
% 8.03/2.45  # Presaturation interreduction done
% 8.03/2.45  
% 8.03/2.45  # Proof found!
% 8.03/2.45  # SZS status Theorem
% 8.03/2.45  # SZS output start CNFRefutation
% See solution above
% 8.03/2.45  # Training examples: 0 positive, 0 negative
% 8.03/2.45  
% 8.03/2.45  # -------------------------------------------------
% 8.03/2.45  # User time                : 0.022 s
% 8.03/2.45  # System time              : 0.009 s
% 8.03/2.45  # Total time               : 0.032 s
% 8.03/2.45  # Maximum resident set size: 7128 pages
% 8.03/2.45  
%------------------------------------------------------------------------------