TSTP Solution File: SEU121+2 by E---3.1

View Problem - Process Solution

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

% Computer : n005.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:24:47 EDT 2023

% Result   : Theorem 0.20s 0.54s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   16 (   4 unt;   0 def)
%            Number of atoms       :   38 (   0 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   35 (  13   ~;  12   |;   6   &)
%                                         (   1 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   25 (   0 sgn;  14   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t1_xboole_1,conjecture,
    ! [X1,X2,X3] :
      ( ( subset(X1,X2)
        & subset(X2,X3) )
     => subset(X1,X3) ),
    file('/export/starexec/sandbox2/tmp/tmp.Dq98LgpjCR/E---3.1_15318.p',t1_xboole_1) ).

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

fof(c_0_2,negated_conjecture,
    ~ ! [X1,X2,X3] :
        ( ( subset(X1,X2)
          & subset(X2,X3) )
       => subset(X1,X3) ),
    inference(assume_negation,[status(cth)],[t1_xboole_1]) ).

fof(c_0_3,plain,
    ! [X8,X9,X10,X11,X12] :
      ( ( ~ subset(X8,X9)
        | ~ in(X10,X8)
        | in(X10,X9) )
      & ( in(esk4_2(X11,X12),X11)
        | subset(X11,X12) )
      & ( ~ in(esk4_2(X11,X12),X12)
        | subset(X11,X12) ) ),
    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])])])])])]) ).

fof(c_0_4,negated_conjecture,
    ( subset(esk1_0,esk2_0)
    & subset(esk2_0,esk3_0)
    & ~ subset(esk1_0,esk3_0) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).

cnf(c_0_5,plain,
    ( in(X3,X2)
    | ~ subset(X1,X2)
    | ~ in(X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,negated_conjecture,
    subset(esk2_0,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,plain,
    ( subset(X1,X2)
    | ~ in(esk4_2(X1,X2),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_8,negated_conjecture,
    ( in(X1,esk3_0)
    | ~ in(X1,esk2_0) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_9,negated_conjecture,
    subset(esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_10,negated_conjecture,
    ( subset(X1,esk3_0)
    | ~ in(esk4_2(X1,esk3_0),esk2_0) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,negated_conjecture,
    ( in(X1,esk2_0)
    | ~ in(X1,esk1_0) ),
    inference(spm,[status(thm)],[c_0_5,c_0_9]) ).

cnf(c_0_12,negated_conjecture,
    ( subset(X1,esk3_0)
    | ~ in(esk4_2(X1,esk3_0),esk1_0) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_13,plain,
    ( in(esk4_2(X1,X2),X1)
    | subset(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_14,negated_conjecture,
    ~ subset(esk1_0,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.15  % Problem    : SEU121+2 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.16  % Command    : run_E %s %d THM
% 0.14/0.37  % Computer : n005.cluster.edu
% 0.14/0.37  % Model    : x86_64 x86_64
% 0.14/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37  % Memory   : 8042.1875MB
% 0.14/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37  % CPULimit   : 2400
% 0.14/0.37  % WCLimit    : 300
% 0.14/0.37  % DateTime   : Mon Oct  2 08:37:16 EDT 2023
% 0.14/0.38  % CPUTime    : 
% 0.20/0.52  Running first-order theorem proving
% 0.20/0.52  Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.Dq98LgpjCR/E---3.1_15318.p
% 0.20/0.54  # Version: 3.1pre001
% 0.20/0.54  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.54  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.54  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.54  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.54  # Starting sh5l with 300s (1) cores
% 0.20/0.54  # new_bool_1 with pid 15398 completed with status 0
% 0.20/0.54  # Result found by new_bool_1
% 0.20/0.54  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.54  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.54  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.54  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.54  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.54  # Search class: FGHSS-FFMS32-SFFFFFNN
% 0.20/0.54  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.54  # Starting SAT001_MinMin_p005000_rr_RG with 131s (1) cores
% 0.20/0.54  # SAT001_MinMin_p005000_rr_RG with pid 15400 completed with status 0
% 0.20/0.54  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.54  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.54  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.54  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.54  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.54  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.54  # Search class: FGHSS-FFMS32-SFFFFFNN
% 0.20/0.54  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.54  # Starting SAT001_MinMin_p005000_rr_RG with 131s (1) cores
% 0.20/0.54  # Preprocessing time       : 0.001 s
% 0.20/0.54  # Presaturation interreduction done
% 0.20/0.54  
% 0.20/0.54  # Proof found!
% 0.20/0.54  # SZS status Theorem
% 0.20/0.54  # SZS output start CNFRefutation
% See solution above
% 0.20/0.54  # Parsed axioms                        : 20
% 0.20/0.54  # Removed by relevancy pruning/SinE    : 5
% 0.20/0.54  # Initial clauses                      : 26
% 0.20/0.54  # Removed in clause preprocessing      : 0
% 0.20/0.54  # Initial clauses in saturation        : 26
% 0.20/0.54  # Processed clauses                    : 80
% 0.20/0.54  # ...of these trivial                  : 0
% 0.20/0.54  # ...subsumed                          : 8
% 0.20/0.54  # ...remaining for further processing  : 72
% 0.20/0.54  # Other redundant clauses eliminated   : 5
% 0.20/0.54  # Clauses deleted for lack of memory   : 0
% 0.20/0.54  # Backward-subsumed                    : 0
% 0.20/0.54  # Backward-rewritten                   : 1
% 0.20/0.54  # Generated clauses                    : 57
% 0.20/0.54  # ...of the previous two non-redundant : 45
% 0.20/0.54  # ...aggressively subsumed             : 0
% 0.20/0.54  # Contextual simplify-reflections      : 0
% 0.20/0.54  # Paramodulations                      : 52
% 0.20/0.54  # Factorizations                       : 0
% 0.20/0.54  # NegExts                              : 0
% 0.20/0.54  # Equation resolutions                 : 5
% 0.20/0.54  # Total rewrite steps                  : 10
% 0.20/0.54  # Propositional unsat checks           : 0
% 0.20/0.54  #    Propositional check models        : 0
% 0.20/0.54  #    Propositional check unsatisfiable : 0
% 0.20/0.54  #    Propositional clauses             : 0
% 0.20/0.54  #    Propositional clauses after purity: 0
% 0.20/0.54  #    Propositional unsat core size     : 0
% 0.20/0.54  #    Propositional preprocessing time  : 0.000
% 0.20/0.54  #    Propositional encoding time       : 0.000
% 0.20/0.54  #    Propositional solver time         : 0.000
% 0.20/0.54  #    Success case prop preproc time    : 0.000
% 0.20/0.54  #    Success case prop encoding time   : 0.000
% 0.20/0.54  #    Success case prop solver time     : 0.000
% 0.20/0.54  # Current number of processed clauses  : 42
% 0.20/0.54  #    Positive orientable unit clauses  : 7
% 0.20/0.54  #    Positive unorientable unit clauses: 1
% 0.20/0.54  #    Negative unit clauses             : 7
% 0.20/0.54  #    Non-unit-clauses                  : 27
% 0.20/0.54  # Current number of unprocessed clauses: 17
% 0.20/0.54  # ...number of literals in the above   : 42
% 0.20/0.54  # Current number of archived formulas  : 0
% 0.20/0.54  # Current number of archived clauses   : 27
% 0.20/0.54  # Clause-clause subsumption calls (NU) : 135
% 0.20/0.54  # Rec. Clause-clause subsumption calls : 114
% 0.20/0.54  # Non-unit clause-clause subsumptions  : 5
% 0.20/0.54  # Unit Clause-clause subsumption calls : 56
% 0.20/0.54  # Rewrite failures with RHS unbound    : 0
% 0.20/0.54  # BW rewrite match attempts            : 15
% 0.20/0.54  # BW rewrite match successes           : 9
% 0.20/0.54  # Condensation attempts                : 0
% 0.20/0.54  # Condensation successes               : 0
% 0.20/0.54  # Termbank termtop insertions          : 1881
% 0.20/0.54  
% 0.20/0.54  # -------------------------------------------------
% 0.20/0.54  # User time                : 0.006 s
% 0.20/0.54  # System time              : 0.002 s
% 0.20/0.54  # Total time               : 0.008 s
% 0.20/0.54  # Maximum resident set size: 1752 pages
% 0.20/0.54  
% 0.20/0.54  # -------------------------------------------------
% 0.20/0.54  # User time                : 0.007 s
% 0.20/0.54  # System time              : 0.004 s
% 0.20/0.54  # Total time               : 0.011 s
% 0.20/0.54  # Maximum resident set size: 1688 pages
% 0.20/0.54  % E---3.1 exiting
% 0.20/0.54  % E---3.1 exiting
%------------------------------------------------------------------------------