TSTP Solution File: SET580+3 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : SET580+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n017.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 : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 19:23:00 EDT 2023

% Result   : Theorem 0.16s 0.42s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   34 (   8 unt;   0 def)
%            Number of atoms       :   96 (   3 equ)
%            Maximal formula atoms :   12 (   2 avg)
%            Number of connectives :  103 (  41   ~;  46   |;   9   &)
%                                         (   7 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   47 (   4 sgn;  25   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(prove_th23,conjecture,
    ! [X1,X2,X3] :
      ( member(X1,symmetric_difference(X2,X3))
    <=> ~ ( member(X1,X2)
        <=> member(X1,X3) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.9PhmeT0q8a/E---3.1_20745.p',prove_th23) ).

fof(symmetric_difference_defn,axiom,
    ! [X1,X2] : symmetric_difference(X1,X2) = union(difference(X1,X2),difference(X2,X1)),
    file('/export/starexec/sandbox2/tmp/tmp.9PhmeT0q8a/E---3.1_20745.p',symmetric_difference_defn) ).

fof(difference_defn,axiom,
    ! [X1,X2,X3] :
      ( member(X3,difference(X1,X2))
    <=> ( member(X3,X1)
        & ~ member(X3,X2) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.9PhmeT0q8a/E---3.1_20745.p',difference_defn) ).

fof(union_defn,axiom,
    ! [X1,X2,X3] :
      ( member(X3,union(X1,X2))
    <=> ( member(X3,X1)
        | member(X3,X2) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.9PhmeT0q8a/E---3.1_20745.p',union_defn) ).

fof(c_0_4,negated_conjecture,
    ~ ! [X1,X2,X3] :
        ( member(X1,symmetric_difference(X2,X3))
      <=> ~ ( member(X1,X2)
          <=> member(X1,X3) ) ),
    inference(assume_negation,[status(cth)],[prove_th23]) ).

fof(c_0_5,negated_conjecture,
    ( ( ~ member(esk2_0,esk3_0)
      | member(esk2_0,esk4_0)
      | ~ member(esk2_0,symmetric_difference(esk3_0,esk4_0)) )
    & ( ~ member(esk2_0,esk4_0)
      | member(esk2_0,esk3_0)
      | ~ member(esk2_0,symmetric_difference(esk3_0,esk4_0)) )
    & ( ~ member(esk2_0,esk3_0)
      | ~ member(esk2_0,esk4_0)
      | member(esk2_0,symmetric_difference(esk3_0,esk4_0)) )
    & ( member(esk2_0,esk3_0)
      | member(esk2_0,esk4_0)
      | member(esk2_0,symmetric_difference(esk3_0,esk4_0)) ) ),
    inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).

fof(c_0_6,plain,
    ! [X10,X11] : symmetric_difference(X10,X11) = union(difference(X10,X11),difference(X11,X10)),
    inference(variable_rename,[status(thm)],[symmetric_difference_defn]) ).

fof(c_0_7,plain,
    ! [X1,X2,X3] :
      ( member(X3,difference(X1,X2))
    <=> ( member(X3,X1)
        & ~ member(X3,X2) ) ),
    inference(fof_simplification,[status(thm)],[difference_defn]) ).

cnf(c_0_8,negated_conjecture,
    ( member(esk2_0,esk3_0)
    | ~ member(esk2_0,esk4_0)
    | ~ member(esk2_0,symmetric_difference(esk3_0,esk4_0)) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    symmetric_difference(X1,X2) = union(difference(X1,X2),difference(X2,X1)),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

fof(c_0_10,plain,
    ! [X4,X5,X6] :
      ( ( ~ member(X6,union(X4,X5))
        | member(X6,X4)
        | member(X6,X5) )
      & ( ~ member(X6,X4)
        | member(X6,union(X4,X5)) )
      & ( ~ member(X6,X5)
        | member(X6,union(X4,X5)) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[union_defn])])]) ).

fof(c_0_11,plain,
    ! [X7,X8,X9] :
      ( ( member(X9,X7)
        | ~ member(X9,difference(X7,X8)) )
      & ( ~ member(X9,X8)
        | ~ member(X9,difference(X7,X8)) )
      & ( ~ member(X9,X7)
        | member(X9,X8)
        | member(X9,difference(X7,X8)) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).

cnf(c_0_12,negated_conjecture,
    ( member(esk2_0,esk4_0)
    | ~ member(esk2_0,esk3_0)
    | ~ member(esk2_0,symmetric_difference(esk3_0,esk4_0)) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_13,negated_conjecture,
    ( member(esk2_0,esk3_0)
    | member(esk2_0,esk4_0)
    | member(esk2_0,symmetric_difference(esk3_0,esk4_0)) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_14,negated_conjecture,
    ( member(esk2_0,esk3_0)
    | ~ member(esk2_0,esk4_0)
    | ~ member(esk2_0,union(difference(esk3_0,esk4_0),difference(esk4_0,esk3_0))) ),
    inference(rw,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_15,plain,
    ( member(X1,union(X3,X2))
    | ~ member(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_16,plain,
    ( member(X1,X2)
    | ~ member(X1,difference(X2,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_17,plain,
    ( ~ member(X1,X2)
    | ~ member(X1,difference(X3,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_18,negated_conjecture,
    ( member(esk2_0,esk4_0)
    | ~ member(esk2_0,esk3_0)
    | ~ member(esk2_0,union(difference(esk3_0,esk4_0),difference(esk4_0,esk3_0))) ),
    inference(rw,[status(thm)],[c_0_12,c_0_9]) ).

cnf(c_0_19,plain,
    ( member(X1,union(X2,X3))
    | ~ member(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_20,plain,
    ( member(X1,X2)
    | member(X1,X3)
    | ~ member(X1,union(X2,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_21,negated_conjecture,
    ( member(esk2_0,esk3_0)
    | member(esk2_0,esk4_0)
    | member(esk2_0,union(difference(esk3_0,esk4_0),difference(esk4_0,esk3_0))) ),
    inference(rw,[status(thm)],[c_0_13,c_0_9]) ).

cnf(c_0_22,negated_conjecture,
    ~ member(esk2_0,difference(esk4_0,esk3_0)),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17]) ).

cnf(c_0_23,negated_conjecture,
    ~ member(esk2_0,difference(esk3_0,esk4_0)),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_16]),c_0_17]) ).

cnf(c_0_24,plain,
    ( member(X1,X3)
    | member(X1,difference(X2,X3))
    | ~ member(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_25,negated_conjecture,
    ( member(esk2_0,esk4_0)
    | member(esk2_0,esk3_0) ),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23]) ).

cnf(c_0_26,negated_conjecture,
    ( member(esk2_0,symmetric_difference(esk3_0,esk4_0))
    | ~ member(esk2_0,esk3_0)
    | ~ member(esk2_0,esk4_0) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_27,negated_conjecture,
    ( member(esk2_0,difference(esk4_0,X1))
    | member(esk2_0,esk3_0)
    | member(esk2_0,X1) ),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_28,negated_conjecture,
    ( member(esk2_0,union(difference(esk3_0,esk4_0),difference(esk4_0,esk3_0)))
    | ~ member(esk2_0,esk3_0)
    | ~ member(esk2_0,esk4_0) ),
    inference(rw,[status(thm)],[c_0_26,c_0_9]) ).

cnf(c_0_29,negated_conjecture,
    member(esk2_0,esk3_0),
    inference(spm,[status(thm)],[c_0_22,c_0_27]) ).

cnf(c_0_30,negated_conjecture,
    ( member(esk2_0,union(difference(esk3_0,esk4_0),difference(esk4_0,esk3_0)))
    | ~ member(esk2_0,esk4_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).

cnf(c_0_31,negated_conjecture,
    ( member(esk2_0,difference(esk3_0,X1))
    | member(esk2_0,X1) ),
    inference(spm,[status(thm)],[c_0_24,c_0_29]) ).

cnf(c_0_32,negated_conjecture,
    ~ member(esk2_0,esk4_0),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_30]),c_0_22]),c_0_23]) ).

cnf(c_0_33,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_31]),c_0_32]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09  % Problem    : SET580+3 : TPTP v8.1.2. Released v2.2.0.
% 0.02/0.10  % Command    : run_E %s %d THM
% 0.09/0.30  % Computer : n017.cluster.edu
% 0.09/0.30  % Model    : x86_64 x86_64
% 0.09/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30  % Memory   : 8042.1875MB
% 0.09/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30  % CPULimit   : 2400
% 0.09/0.30  % WCLimit    : 300
% 0.09/0.30  % DateTime   : Mon Oct  2 16:11:11 EDT 2023
% 0.09/0.30  % CPUTime    : 
% 0.16/0.41  Running first-order model finding
% 0.16/0.41  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.9PhmeT0q8a/E---3.1_20745.p
% 0.16/0.42  # Version: 3.1pre001
% 0.16/0.42  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.42  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.42  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.42  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.42  # Starting new_bool_1 with 300s (1) cores
% 0.16/0.42  # Starting sh5l with 300s (1) cores
% 0.16/0.42  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 20822 completed with status 0
% 0.16/0.42  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.42  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.42  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.42  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.42  # No SInE strategy applied
% 0.16/0.42  # Search class: FGHSS-FFSF22-SFFFFFNN
% 0.16/0.42  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.42  # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 811s (1) cores
% 0.16/0.42  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.42  # Starting new_bool_3 with 136s (1) cores
% 0.16/0.42  # Starting new_bool_1 with 136s (1) cores
% 0.16/0.42  # Starting sh5l with 136s (1) cores
% 0.16/0.42  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 20829 completed with status 0
% 0.16/0.42  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.42  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.42  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.42  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.42  # No SInE strategy applied
% 0.16/0.42  # Search class: FGHSS-FFSF22-SFFFFFNN
% 0.16/0.42  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.42  # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 811s (1) cores
% 0.16/0.42  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.42  # Preprocessing time       : 0.001 s
% 0.16/0.42  # Presaturation interreduction done
% 0.16/0.42  
% 0.16/0.42  # Proof found!
% 0.16/0.42  # SZS status Theorem
% 0.16/0.42  # SZS output start CNFRefutation
% See solution above
% 0.16/0.42  # Parsed axioms                        : 7
% 0.16/0.42  # Removed by relevancy pruning/SinE    : 0
% 0.16/0.42  # Initial clauses                      : 17
% 0.16/0.42  # Removed in clause preprocessing      : 3
% 0.16/0.42  # Initial clauses in saturation        : 14
% 0.16/0.42  # Processed clauses                    : 42
% 0.16/0.42  # ...of these trivial                  : 1
% 0.16/0.42  # ...subsumed                          : 5
% 0.16/0.42  # ...remaining for further processing  : 35
% 0.16/0.42  # Other redundant clauses eliminated   : 0
% 0.16/0.42  # Clauses deleted for lack of memory   : 0
% 0.16/0.42  # Backward-subsumed                    : 2
% 0.16/0.42  # Backward-rewritten                   : 5
% 0.16/0.42  # Generated clauses                    : 49
% 0.16/0.42  # ...of the previous two non-redundant : 38
% 0.16/0.42  # ...aggressively subsumed             : 0
% 0.16/0.42  # Contextual simplify-reflections      : 4
% 0.16/0.42  # Paramodulations                      : 47
% 0.16/0.42  # Factorizations                       : 2
% 0.16/0.42  # NegExts                              : 0
% 0.16/0.42  # Equation resolutions                 : 0
% 0.16/0.42  # Total rewrite steps                  : 6
% 0.16/0.42  # Propositional unsat checks           : 0
% 0.16/0.42  #    Propositional check models        : 0
% 0.16/0.42  #    Propositional check unsatisfiable : 0
% 0.16/0.42  #    Propositional clauses             : 0
% 0.16/0.42  #    Propositional clauses after purity: 0
% 0.16/0.42  #    Propositional unsat core size     : 0
% 0.16/0.42  #    Propositional preprocessing time  : 0.000
% 0.16/0.42  #    Propositional encoding time       : 0.000
% 0.16/0.42  #    Propositional solver time         : 0.000
% 0.16/0.42  #    Success case prop preproc time    : 0.000
% 0.16/0.42  #    Success case prop encoding time   : 0.000
% 0.16/0.42  #    Success case prop solver time     : 0.000
% 0.16/0.42  # Current number of processed clauses  : 15
% 0.16/0.42  #    Positive orientable unit clauses  : 1
% 0.16/0.42  #    Positive unorientable unit clauses: 1
% 0.16/0.42  #    Negative unit clauses             : 3
% 0.16/0.42  #    Non-unit-clauses                  : 10
% 0.16/0.42  # Current number of unprocessed clauses: 23
% 0.16/0.42  # ...number of literals in the above   : 73
% 0.16/0.42  # Current number of archived formulas  : 0
% 0.16/0.42  # Current number of archived clauses   : 21
% 0.16/0.42  # Clause-clause subsumption calls (NU) : 66
% 0.16/0.42  # Rec. Clause-clause subsumption calls : 64
% 0.16/0.42  # Non-unit clause-clause subsumptions  : 7
% 0.16/0.42  # Unit Clause-clause subsumption calls : 9
% 0.16/0.42  # Rewrite failures with RHS unbound    : 0
% 0.16/0.42  # BW rewrite match attempts            : 3
% 0.16/0.42  # BW rewrite match successes           : 3
% 0.16/0.42  # Condensation attempts                : 0
% 0.16/0.42  # Condensation successes               : 0
% 0.16/0.42  # Termbank termtop insertions          : 1599
% 0.16/0.42  
% 0.16/0.42  # -------------------------------------------------
% 0.16/0.42  # User time                : 0.006 s
% 0.16/0.42  # System time              : 0.001 s
% 0.16/0.42  # Total time               : 0.007 s
% 0.16/0.42  # Maximum resident set size: 1764 pages
% 0.16/0.42  
% 0.16/0.42  # -------------------------------------------------
% 0.16/0.42  # User time                : 0.021 s
% 0.16/0.42  # System time              : 0.003 s
% 0.16/0.42  # Total time               : 0.024 s
% 0.16/0.42  # Maximum resident set size: 1676 pages
% 0.16/0.42  % E---3.1 exiting
%------------------------------------------------------------------------------