TSTP Solution File: SEU127+2 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : SEU127+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n014.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:30:27 EDT 2023

% Result   : Theorem 0.17s 0.45s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   15 (   7 unt;   0 def)
%            Number of atoms       :   50 (   8 equ)
%            Maximal formula atoms :   20 (   3 avg)
%            Number of connectives :   56 (  21   ~;  23   |;   8   &)
%                                         (   3 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   5 avg)
%            Maximal term depth    :    3 (   1 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   :   35 (   2 sgn;  24   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t17_xboole_1,conjecture,
    ! [X1,X2] : subset(set_intersection2(X1,X2),X1),
    file('/export/starexec/sandbox2/tmp/tmp.CSw57bl36G/E---3.1_16523.p',t17_xboole_1) ).

fof(d3_xboole_0,axiom,
    ! [X1,X2,X3] :
      ( X3 = set_intersection2(X1,X2)
    <=> ! [X4] :
          ( in(X4,X3)
        <=> ( in(X4,X1)
            & in(X4,X2) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.CSw57bl36G/E---3.1_16523.p',d3_xboole_0) ).

fof(d3_tarski,axiom,
    ! [X1,X2] :
      ( subset(X1,X2)
    <=> ! [X3] :
          ( in(X3,X1)
         => in(X3,X2) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.CSw57bl36G/E---3.1_16523.p',d3_tarski) ).

fof(c_0_3,negated_conjecture,
    ~ ! [X1,X2] : subset(set_intersection2(X1,X2),X1),
    inference(assume_negation,[status(cth)],[t17_xboole_1]) ).

fof(c_0_4,plain,
    ! [X32,X33,X34,X35,X36,X37,X38,X39] :
      ( ( in(X35,X32)
        | ~ in(X35,X34)
        | X34 != set_intersection2(X32,X33) )
      & ( in(X35,X33)
        | ~ in(X35,X34)
        | X34 != set_intersection2(X32,X33) )
      & ( ~ in(X36,X32)
        | ~ in(X36,X33)
        | in(X36,X34)
        | X34 != set_intersection2(X32,X33) )
      & ( ~ in(esk4_3(X37,X38,X39),X39)
        | ~ in(esk4_3(X37,X38,X39),X37)
        | ~ in(esk4_3(X37,X38,X39),X38)
        | X39 = set_intersection2(X37,X38) )
      & ( in(esk4_3(X37,X38,X39),X37)
        | in(esk4_3(X37,X38,X39),X39)
        | X39 = set_intersection2(X37,X38) )
      & ( in(esk4_3(X37,X38,X39),X38)
        | in(esk4_3(X37,X38,X39),X39)
        | X39 = set_intersection2(X37,X38) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_xboole_0])])])])])]) ).

fof(c_0_5,negated_conjecture,
    ~ subset(set_intersection2(esk7_0,esk8_0),esk7_0),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).

fof(c_0_6,plain,
    ! [X26,X27,X28,X29,X30] :
      ( ( ~ subset(X26,X27)
        | ~ in(X28,X26)
        | in(X28,X27) )
      & ( in(esk3_2(X29,X30),X29)
        | subset(X29,X30) )
      & ( ~ in(esk3_2(X29,X30),X30)
        | subset(X29,X30) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_tarski])])])])])]) ).

cnf(c_0_7,plain,
    ( in(X1,X2)
    | ~ in(X1,X3)
    | X3 != set_intersection2(X2,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,negated_conjecture,
    ~ subset(set_intersection2(esk7_0,esk8_0),esk7_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    ( in(esk3_2(X1,X2),X1)
    | subset(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,plain,
    ( subset(X1,X2)
    | ~ in(esk3_2(X1,X2),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

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

cnf(c_0_12,negated_conjecture,
    in(esk3_2(set_intersection2(esk7_0,esk8_0),esk7_0),set_intersection2(esk7_0,esk8_0)),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_13,negated_conjecture,
    ~ in(esk3_2(set_intersection2(esk7_0,esk8_0),esk7_0),esk7_0),
    inference(spm,[status(thm)],[c_0_8,c_0_10]) ).

cnf(c_0_14,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10  % Problem    : SEU127+2 : TPTP v8.1.2. Released v3.3.0.
% 0.05/0.11  % Command    : run_E %s %d THM
% 0.11/0.32  % Computer : n014.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 2400
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Mon Oct  2 08:37:20 EDT 2023
% 0.11/0.32  % CPUTime    : 
% 0.17/0.43  Running first-order model finding
% 0.17/0.43  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.CSw57bl36G/E---3.1_16523.p
% 0.17/0.45  # Version: 3.1pre001
% 0.17/0.45  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.45  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45  # Starting new_bool_1 with 300s (1) cores
% 0.17/0.45  # Starting sh5l with 300s (1) cores
% 0.17/0.45  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 16600 completed with status 0
% 0.17/0.45  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.45  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.45  # No SInE strategy applied
% 0.17/0.45  # Search class: FGHSM-FFMF32-SFFFFFNN
% 0.17/0.45  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.45  # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 813s (1) cores
% 0.17/0.45  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.45  # Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/0.45  # Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S022A with 136s (1) cores
% 0.17/0.45  # Starting H----_011_C18_F1_PI_SE_SP_S2S with 136s (1) cores
% 0.17/0.45  # G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 16608 completed with status 0
% 0.17/0.45  # Result found by G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.45  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.45  # No SInE strategy applied
% 0.17/0.45  # Search class: FGHSM-FFMF32-SFFFFFNN
% 0.17/0.45  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.45  # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 813s (1) cores
% 0.17/0.45  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.45  # Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/0.45  # Preprocessing time       : 0.001 s
% 0.17/0.45  # Presaturation interreduction done
% 0.17/0.45  
% 0.17/0.45  # Proof found!
% 0.17/0.45  # SZS status Theorem
% 0.17/0.45  # SZS output start CNFRefutation
% See solution above
% 0.17/0.45  # Parsed axioms                        : 35
% 0.17/0.45  # Removed by relevancy pruning/SinE    : 0
% 0.17/0.45  # Initial clauses                      : 54
% 0.17/0.45  # Removed in clause preprocessing      : 3
% 0.17/0.45  # Initial clauses in saturation        : 51
% 0.17/0.45  # Processed clauses                    : 166
% 0.17/0.45  # ...of these trivial                  : 5
% 0.17/0.45  # ...subsumed                          : 48
% 0.17/0.45  # ...remaining for further processing  : 113
% 0.17/0.45  # Other redundant clauses eliminated   : 11
% 0.17/0.45  # Clauses deleted for lack of memory   : 0
% 0.17/0.45  # Backward-subsumed                    : 0
% 0.17/0.45  # Backward-rewritten                   : 1
% 0.17/0.45  # Generated clauses                    : 167
% 0.17/0.45  # ...of the previous two non-redundant : 116
% 0.17/0.45  # ...aggressively subsumed             : 0
% 0.17/0.45  # Contextual simplify-reflections      : 0
% 0.17/0.45  # Paramodulations                      : 156
% 0.17/0.45  # Factorizations                       : 0
% 0.17/0.45  # NegExts                              : 0
% 0.17/0.45  # Equation resolutions                 : 11
% 0.17/0.45  # Total rewrite steps                  : 39
% 0.17/0.45  # Propositional unsat checks           : 0
% 0.17/0.45  #    Propositional check models        : 0
% 0.17/0.45  #    Propositional check unsatisfiable : 0
% 0.17/0.45  #    Propositional clauses             : 0
% 0.17/0.45  #    Propositional clauses after purity: 0
% 0.17/0.45  #    Propositional unsat core size     : 0
% 0.17/0.45  #    Propositional preprocessing time  : 0.000
% 0.17/0.45  #    Propositional encoding time       : 0.000
% 0.17/0.45  #    Propositional solver time         : 0.000
% 0.17/0.45  #    Success case prop preproc time    : 0.000
% 0.17/0.45  #    Success case prop encoding time   : 0.000
% 0.17/0.45  #    Success case prop solver time     : 0.000
% 0.17/0.45  # Current number of processed clauses  : 54
% 0.17/0.45  #    Positive orientable unit clauses  : 15
% 0.17/0.45  #    Positive unorientable unit clauses: 2
% 0.17/0.45  #    Negative unit clauses             : 6
% 0.17/0.45  #    Non-unit-clauses                  : 31
% 0.17/0.45  # Current number of unprocessed clauses: 47
% 0.17/0.45  # ...number of literals in the above   : 111
% 0.17/0.45  # Current number of archived formulas  : 0
% 0.17/0.45  # Current number of archived clauses   : 50
% 0.17/0.45  # Clause-clause subsumption calls (NU) : 389
% 0.17/0.45  # Rec. Clause-clause subsumption calls : 304
% 0.17/0.45  # Non-unit clause-clause subsumptions  : 29
% 0.17/0.45  # Unit Clause-clause subsumption calls : 19
% 0.17/0.45  # Rewrite failures with RHS unbound    : 0
% 0.17/0.45  # BW rewrite match attempts            : 43
% 0.17/0.45  # BW rewrite match successes           : 33
% 0.17/0.45  # Condensation attempts                : 0
% 0.17/0.45  # Condensation successes               : 0
% 0.17/0.45  # Termbank termtop insertions          : 3807
% 0.17/0.45  
% 0.17/0.45  # -------------------------------------------------
% 0.17/0.45  # User time                : 0.007 s
% 0.17/0.45  # System time              : 0.004 s
% 0.17/0.45  # Total time               : 0.011 s
% 0.17/0.45  # Maximum resident set size: 1864 pages
% 0.17/0.45  
% 0.17/0.45  # -------------------------------------------------
% 0.17/0.45  # User time                : 0.036 s
% 0.17/0.45  # System time              : 0.007 s
% 0.17/0.45  # Total time               : 0.043 s
% 0.17/0.45  # Maximum resident set size: 1700 pages
% 0.17/0.45  % E---3.1 exiting
%------------------------------------------------------------------------------