TSTP Solution File: SET984+1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : SET984+1 : TPTP v8.2.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% 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  : 300s
% DateTime : Tue May 21 02:56:43 EDT 2024

% Result   : Theorem 0.21s 0.50s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   41 (  17 unt;   0 def)
%            Number of atoms       :  102 (  80 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   84 (  23   ~;  48   |;   8   &)
%                                         (   1 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   82 (  12 sgn  40   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t138_zfmisc_1,conjecture,
    ! [X1,X2,X3,X4] :
      ( subset(cartesian_product2(X1,X2),cartesian_product2(X3,X4))
     => ( cartesian_product2(X1,X2) = empty_set
        | ( subset(X1,X3)
          & subset(X2,X4) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t138_zfmisc_1) ).

fof(t134_zfmisc_1,axiom,
    ! [X1,X2,X3,X4] :
      ( cartesian_product2(X1,X2) = cartesian_product2(X3,X4)
     => ( X1 = empty_set
        | X2 = empty_set
        | ( X1 = X3
          & X2 = X4 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t134_zfmisc_1) ).

fof(t123_zfmisc_1,axiom,
    ! [X1,X2,X3,X4] : cartesian_product2(set_intersection2(X1,X2),set_intersection2(X3,X4)) = set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X4)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t123_zfmisc_1) ).

fof(t28_xboole_1,axiom,
    ! [X1,X2] :
      ( subset(X1,X2)
     => set_intersection2(X1,X2) = X1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t28_xboole_1) ).

fof(t17_xboole_1,axiom,
    ! [X1,X2] : subset(set_intersection2(X1,X2),X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t17_xboole_1) ).

fof(commutativity_k3_xboole_0,axiom,
    ! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).

fof(t113_zfmisc_1,axiom,
    ! [X1,X2] :
      ( cartesian_product2(X1,X2) = empty_set
    <=> ( X1 = empty_set
        | X2 = empty_set ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t113_zfmisc_1) ).

fof(c_0_7,negated_conjecture,
    ~ ! [X1,X2,X3,X4] :
        ( subset(cartesian_product2(X1,X2),cartesian_product2(X3,X4))
       => ( cartesian_product2(X1,X2) = empty_set
          | ( subset(X1,X3)
            & subset(X2,X4) ) ) ),
    inference(assume_negation,[status(cth)],[t138_zfmisc_1]) ).

fof(c_0_8,plain,
    ! [X17,X18,X19,X20] :
      ( ( X17 = X19
        | X17 = empty_set
        | X18 = empty_set
        | cartesian_product2(X17,X18) != cartesian_product2(X19,X20) )
      & ( X18 = X20
        | X17 = empty_set
        | X18 = empty_set
        | cartesian_product2(X17,X18) != cartesian_product2(X19,X20) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t134_zfmisc_1])])])]) ).

fof(c_0_9,plain,
    ! [X13,X14,X15,X16] : cartesian_product2(set_intersection2(X13,X14),set_intersection2(X15,X16)) = set_intersection2(cartesian_product2(X13,X15),cartesian_product2(X14,X16)),
    inference(variable_rename,[status(thm)],[t123_zfmisc_1]) ).

fof(c_0_10,plain,
    ! [X27,X28] :
      ( ~ subset(X27,X28)
      | set_intersection2(X27,X28) = X27 ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t28_xboole_1])])]) ).

fof(c_0_11,negated_conjecture,
    ( subset(cartesian_product2(esk3_0,esk4_0),cartesian_product2(esk5_0,esk6_0))
    & cartesian_product2(esk3_0,esk4_0) != empty_set
    & ( ~ subset(esk3_0,esk5_0)
      | ~ subset(esk4_0,esk6_0) ) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).

cnf(c_0_12,plain,
    ( X1 = X2
    | X3 = empty_set
    | X1 = empty_set
    | cartesian_product2(X3,X1) != cartesian_product2(X4,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,plain,
    cartesian_product2(set_intersection2(X1,X2),set_intersection2(X3,X4)) = set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X4)),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_14,plain,
    ( set_intersection2(X1,X2) = X1
    | ~ subset(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_15,negated_conjecture,
    subset(cartesian_product2(esk3_0,esk4_0),cartesian_product2(esk5_0,esk6_0)),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

fof(c_0_16,plain,
    ! [X25,X26] : subset(set_intersection2(X25,X26),X25),
    inference(variable_rename,[status(thm)],[t17_xboole_1]) ).

fof(c_0_17,plain,
    ! [X5,X6] : set_intersection2(X5,X6) = set_intersection2(X6,X5),
    inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).

cnf(c_0_18,plain,
    ( X1 = set_intersection2(X2,X3)
    | X1 = empty_set
    | X4 = empty_set
    | cartesian_product2(X4,X1) != set_intersection2(cartesian_product2(X5,X2),cartesian_product2(X6,X3)) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_19,negated_conjecture,
    set_intersection2(cartesian_product2(esk3_0,esk4_0),cartesian_product2(esk5_0,esk6_0)) = cartesian_product2(esk3_0,esk4_0),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_20,plain,
    ( X1 = X2
    | X1 = empty_set
    | X3 = empty_set
    | cartesian_product2(X1,X3) != cartesian_product2(X2,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_21,plain,
    subset(set_intersection2(X1,X2),X1),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_22,plain,
    set_intersection2(X1,X2) = set_intersection2(X2,X1),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_23,negated_conjecture,
    ( X1 = set_intersection2(esk4_0,esk6_0)
    | X2 = empty_set
    | X1 = empty_set
    | cartesian_product2(X2,X1) != cartesian_product2(esk3_0,esk4_0) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_24,plain,
    ( X1 = set_intersection2(X2,X3)
    | X1 = empty_set
    | X4 = empty_set
    | cartesian_product2(X1,X4) != set_intersection2(cartesian_product2(X2,X5),cartesian_product2(X3,X6)) ),
    inference(spm,[status(thm)],[c_0_20,c_0_13]) ).

cnf(c_0_25,plain,
    subset(set_intersection2(X1,X2),X2),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_26,negated_conjecture,
    ( set_intersection2(esk4_0,esk6_0) = esk4_0
    | esk4_0 = empty_set
    | esk3_0 = empty_set ),
    inference(er,[status(thm)],[c_0_23]) ).

cnf(c_0_27,negated_conjecture,
    ( X1 = set_intersection2(esk3_0,esk5_0)
    | X2 = empty_set
    | X1 = empty_set
    | cartesian_product2(X1,X2) != cartesian_product2(esk3_0,esk4_0) ),
    inference(spm,[status(thm)],[c_0_24,c_0_19]) ).

cnf(c_0_28,negated_conjecture,
    ( ~ subset(esk3_0,esk5_0)
    | ~ subset(esk4_0,esk6_0) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_29,negated_conjecture,
    ( esk3_0 = empty_set
    | esk4_0 = empty_set
    | subset(esk4_0,esk6_0) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

fof(c_0_30,plain,
    ! [X11,X12] :
      ( ( cartesian_product2(X11,X12) != empty_set
        | X11 = empty_set
        | X12 = empty_set )
      & ( X11 != empty_set
        | cartesian_product2(X11,X12) = empty_set )
      & ( X12 != empty_set
        | cartesian_product2(X11,X12) = empty_set ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t113_zfmisc_1])])])]) ).

cnf(c_0_31,negated_conjecture,
    ( set_intersection2(esk3_0,esk5_0) = esk3_0
    | esk3_0 = empty_set
    | esk4_0 = empty_set ),
    inference(er,[status(thm)],[c_0_27]) ).

cnf(c_0_32,negated_conjecture,
    ( esk4_0 = empty_set
    | esk3_0 = empty_set
    | ~ subset(esk3_0,esk5_0) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_33,plain,
    ( cartesian_product2(X2,X1) = empty_set
    | X1 != empty_set ),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

cnf(c_0_34,negated_conjecture,
    cartesian_product2(esk3_0,esk4_0) != empty_set,
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_35,negated_conjecture,
    ( esk4_0 = empty_set
    | esk3_0 = empty_set ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_31]),c_0_32]) ).

cnf(c_0_36,plain,
    cartesian_product2(X1,empty_set) = empty_set,
    inference(er,[status(thm)],[c_0_33]) ).

cnf(c_0_37,plain,
    ( cartesian_product2(X1,X2) = empty_set
    | X1 != empty_set ),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

cnf(c_0_38,negated_conjecture,
    esk3_0 = empty_set,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).

cnf(c_0_39,plain,
    cartesian_product2(empty_set,X1) = empty_set,
    inference(er,[status(thm)],[c_0_37]) ).

cnf(c_0_40,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_38]),c_0_39])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : SET984+1 : TPTP v8.2.0. Released v3.2.0.
% 0.06/0.13  % Command    : run_E %s %d THM
% 0.14/0.34  % Computer : n013.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Mon May 20 11:56:23 EDT 2024
% 0.14/0.34  % CPUTime    : 
% 0.21/0.47  Running first-order theorem proving
% 0.21/0.47  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.50  # Version: 3.1.0
% 0.21/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50  # Starting sh5l with 300s (1) cores
% 0.21/0.50  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 30960 completed with status 0
% 0.21/0.50  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50  # No SInE strategy applied
% 0.21/0.50  # Search class: FGHSM-FFSS22-SFFFFFNN
% 0.21/0.50  # partial match(1): FGHSF-FFSS22-SFFFFFNN
% 0.21/0.50  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.50  # Starting new_bool_3 with 136s (1) cores
% 0.21/0.50  # Starting new_bool_1 with 136s (1) cores
% 0.21/0.50  # Starting sh5l with 136s (1) cores
% 0.21/0.50  # SAT001_MinMin_p005000_rr_RG with pid 30965 completed with status 0
% 0.21/0.50  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50  # No SInE strategy applied
% 0.21/0.50  # Search class: FGHSM-FFSS22-SFFFFFNN
% 0.21/0.50  # partial match(1): FGHSF-FFSS22-SFFFFFNN
% 0.21/0.50  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.50  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.50  # Preprocessing time       : 0.001 s
% 0.21/0.50  # Presaturation interreduction done
% 0.21/0.50  
% 0.21/0.50  # Proof found!
% 0.21/0.50  # SZS status Theorem
% 0.21/0.50  # SZS output start CNFRefutation
% See solution above
% 0.21/0.50  # Parsed axioms                        : 12
% 0.21/0.50  # Removed by relevancy pruning/SinE    : 0
% 0.21/0.50  # Initial clauses                      : 17
% 0.21/0.50  # Removed in clause preprocessing      : 0
% 0.21/0.50  # Initial clauses in saturation        : 17
% 0.21/0.50  # Processed clauses                    : 269
% 0.21/0.50  # ...of these trivial                  : 18
% 0.21/0.50  # ...subsumed                          : 131
% 0.21/0.50  # ...remaining for further processing  : 120
% 0.21/0.50  # Other redundant clauses eliminated   : 2
% 0.21/0.50  # Clauses deleted for lack of memory   : 0
% 0.21/0.50  # Backward-subsumed                    : 10
% 0.21/0.50  # Backward-rewritten                   : 45
% 0.21/0.50  # Generated clauses                    : 947
% 0.21/0.50  # ...of the previous two non-redundant : 764
% 0.21/0.50  # ...aggressively subsumed             : 0
% 0.21/0.50  # Contextual simplify-reflections      : 1
% 0.21/0.50  # Paramodulations                      : 938
% 0.21/0.50  # Factorizations                       : 0
% 0.21/0.50  # NegExts                              : 0
% 0.21/0.50  # Equation resolutions                 : 9
% 0.21/0.50  # Disequality decompositions           : 0
% 0.21/0.50  # Total rewrite steps                  : 1058
% 0.21/0.50  # ...of those cached                   : 861
% 0.21/0.50  # Propositional unsat checks           : 0
% 0.21/0.50  #    Propositional check models        : 0
% 0.21/0.50  #    Propositional check unsatisfiable : 0
% 0.21/0.50  #    Propositional clauses             : 0
% 0.21/0.50  #    Propositional clauses after purity: 0
% 0.21/0.50  #    Propositional unsat core size     : 0
% 0.21/0.50  #    Propositional preprocessing time  : 0.000
% 0.21/0.50  #    Propositional encoding time       : 0.000
% 0.21/0.50  #    Propositional solver time         : 0.000
% 0.21/0.50  #    Success case prop preproc time    : 0.000
% 0.21/0.50  #    Success case prop encoding time   : 0.000
% 0.21/0.50  #    Success case prop solver time     : 0.000
% 0.21/0.50  # Current number of processed clauses  : 46
% 0.21/0.50  #    Positive orientable unit clauses  : 30
% 0.21/0.50  #    Positive unorientable unit clauses: 3
% 0.21/0.50  #    Negative unit clauses             : 2
% 0.21/0.50  #    Non-unit-clauses                  : 11
% 0.21/0.50  # Current number of unprocessed clauses: 439
% 0.21/0.50  # ...number of literals in the above   : 938
% 0.21/0.50  # Current number of archived formulas  : 0
% 0.21/0.50  # Current number of archived clauses   : 72
% 0.21/0.50  # Clause-clause subsumption calls (NU) : 408
% 0.21/0.50  # Rec. Clause-clause subsumption calls : 393
% 0.21/0.50  # Non-unit clause-clause subsumptions  : 88
% 0.21/0.50  # Unit Clause-clause subsumption calls : 18
% 0.21/0.50  # Rewrite failures with RHS unbound    : 0
% 0.21/0.50  # BW rewrite match attempts            : 98
% 0.21/0.50  # BW rewrite match successes           : 61
% 0.21/0.50  # Condensation attempts                : 0
% 0.21/0.50  # Condensation successes               : 0
% 0.21/0.50  # Termbank termtop insertions          : 13447
% 0.21/0.50  # Search garbage collected termcells   : 135
% 0.21/0.50  
% 0.21/0.50  # -------------------------------------------------
% 0.21/0.50  # User time                : 0.017 s
% 0.21/0.50  # System time              : 0.003 s
% 0.21/0.50  # Total time               : 0.021 s
% 0.21/0.50  # Maximum resident set size: 1752 pages
% 0.21/0.50  
% 0.21/0.50  # -------------------------------------------------
% 0.21/0.50  # User time                : 0.085 s
% 0.21/0.50  # System time              : 0.006 s
% 0.21/0.50  # Total time               : 0.091 s
% 0.21/0.50  # Maximum resident set size: 1696 pages
% 0.21/0.50  % E---3.1 exiting
% 0.21/0.51  % E exiting
%------------------------------------------------------------------------------