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

View Problem - Process Solution

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

% Computer : n016.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 18:56:13 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
fof(m__,conjecture,
    ( ( ! [X1] :
          ( aElementOf0(X1,xA)
         => aElementOf0(X1,xB) )
      & aSubsetOf0(xA,xB)
      & ! [X1] :
          ( aElementOf0(X1,xB)
         => aElementOf0(X1,xC) )
      & aSubsetOf0(xB,xC) )
   => ( ! [X1] :
          ( aElementOf0(X1,xA)
         => aElementOf0(X1,xC) )
      | aSubsetOf0(xA,xC) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.FQegyC2xxS/E---3.1_24031.p',m__) ).

fof(c_0_1,negated_conjecture,
    ~ ( ( ! [X1] :
            ( aElementOf0(X1,xA)
           => aElementOf0(X1,xB) )
        & aSubsetOf0(xA,xB)
        & ! [X1] :
            ( aElementOf0(X1,xB)
           => aElementOf0(X1,xC) )
        & aSubsetOf0(xB,xC) )
     => ( ! [X1] :
            ( aElementOf0(X1,xA)
           => aElementOf0(X1,xC) )
        | aSubsetOf0(xA,xC) ) ),
    inference(assume_negation,[status(cth)],[m__]) ).

fof(c_0_2,negated_conjecture,
    ! [X4,X5] :
      ( ( ~ aElementOf0(X4,xA)
        | aElementOf0(X4,xB) )
      & aSubsetOf0(xA,xB)
      & ( ~ aElementOf0(X5,xB)
        | aElementOf0(X5,xC) )
      & aSubsetOf0(xB,xC)
      & aElementOf0(esk1_0,xA)
      & ~ aElementOf0(esk1_0,xC)
      & ~ aSubsetOf0(xA,xC) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])]) ).

cnf(c_0_3,negated_conjecture,
    ( aElementOf0(X1,xB)
    | ~ aElementOf0(X1,xA) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4,negated_conjecture,
    aElementOf0(esk1_0,xA),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_5,negated_conjecture,
    ~ aElementOf0(esk1_0,xC),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_6,negated_conjecture,
    ( aElementOf0(X1,xC)
    | ~ aElementOf0(X1,xB) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_7,negated_conjecture,
    aElementOf0(esk1_0,xB),
    inference(spm,[status(thm)],[c_0_3,c_0_4]) ).

cnf(c_0_8,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : NUM533+2 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14  % Command    : run_E %s %d THM
% 0.15/0.36  % Computer : n016.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 2400
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Mon Oct  2 14:24:21 EDT 2023
% 0.15/0.36  % CPUTime    : 
% 0.22/0.51  Running first-order theorem proving
% 0.22/0.51  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.FQegyC2xxS/E---3.1_24031.p
% 0.36/0.53  # Version: 3.1pre001
% 0.36/0.53  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.36/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.53  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.36/0.53  # Starting new_bool_3 with 300s (1) cores
% 0.36/0.53  # Starting new_bool_1 with 300s (1) cores
% 0.36/0.53  # Starting sh5l with 300s (1) cores
% 0.36/0.53  # new_bool_3 with pid 24111 completed with status 0
% 0.36/0.53  # Result found by new_bool_3
% 0.36/0.53  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.36/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.53  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.36/0.53  # Starting new_bool_3 with 300s (1) cores
% 0.36/0.53  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.36/0.53  # Search class: FGHSF-FFSM21-SFFFFFNN
% 0.36/0.53  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.36/0.53  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.36/0.53  # SAT001_MinMin_p005000_rr_RG with pid 24118 completed with status 0
% 0.36/0.53  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.36/0.53  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.36/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.53  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.36/0.53  # Starting new_bool_3 with 300s (1) cores
% 0.36/0.53  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.36/0.53  # Search class: FGHSF-FFSM21-SFFFFFNN
% 0.36/0.53  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.36/0.53  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.36/0.53  # Preprocessing time       : 0.001 s
% 0.36/0.53  # Presaturation interreduction done
% 0.36/0.53  
% 0.36/0.53  # Proof found!
% 0.36/0.53  # SZS status Theorem
% 0.36/0.53  # SZS output start CNFRefutation
% See solution above
% 0.36/0.53  # Parsed axioms                        : 15
% 0.36/0.53  # Removed by relevancy pruning/SinE    : 2
% 0.36/0.53  # Initial clauses                      : 26
% 0.36/0.53  # Removed in clause preprocessing      : 3
% 0.36/0.53  # Initial clauses in saturation        : 23
% 0.36/0.53  # Processed clauses                    : 44
% 0.36/0.53  # ...of these trivial                  : 0
% 0.36/0.53  # ...subsumed                          : 0
% 0.36/0.53  # ...remaining for further processing  : 44
% 0.36/0.53  # Other redundant clauses eliminated   : 3
% 0.36/0.53  # Clauses deleted for lack of memory   : 0
% 0.36/0.53  # Backward-subsumed                    : 0
% 0.36/0.53  # Backward-rewritten                   : 0
% 0.36/0.53  # Generated clauses                    : 8
% 0.36/0.53  # ...of the previous two non-redundant : 4
% 0.36/0.53  # ...aggressively subsumed             : 0
% 0.36/0.53  # Contextual simplify-reflections      : 1
% 0.36/0.53  # Paramodulations                      : 5
% 0.36/0.53  # Factorizations                       : 0
% 0.36/0.53  # NegExts                              : 0
% 0.36/0.53  # Equation resolutions                 : 3
% 0.36/0.53  # Total rewrite steps                  : 6
% 0.36/0.53  # Propositional unsat checks           : 0
% 0.36/0.53  #    Propositional check models        : 0
% 0.36/0.53  #    Propositional check unsatisfiable : 0
% 0.36/0.53  #    Propositional clauses             : 0
% 0.36/0.53  #    Propositional clauses after purity: 0
% 0.36/0.53  #    Propositional unsat core size     : 0
% 0.36/0.53  #    Propositional preprocessing time  : 0.000
% 0.36/0.53  #    Propositional encoding time       : 0.000
% 0.36/0.53  #    Propositional solver time         : 0.000
% 0.36/0.53  #    Success case prop preproc time    : 0.000
% 0.36/0.53  #    Success case prop encoding time   : 0.000
% 0.36/0.53  #    Success case prop solver time     : 0.000
% 0.36/0.53  # Current number of processed clauses  : 18
% 0.36/0.53  #    Positive orientable unit clauses  : 9
% 0.36/0.53  #    Positive unorientable unit clauses: 0
% 0.36/0.53  #    Negative unit clauses             : 4
% 0.36/0.53  #    Non-unit-clauses                  : 5
% 0.36/0.53  # Current number of unprocessed clauses: 6
% 0.36/0.53  # ...number of literals in the above   : 23
% 0.36/0.53  # Current number of archived formulas  : 0
% 0.36/0.53  # Current number of archived clauses   : 23
% 0.36/0.53  # Clause-clause subsumption calls (NU) : 17
% 0.36/0.53  # Rec. Clause-clause subsumption calls : 10
% 0.36/0.53  # Non-unit clause-clause subsumptions  : 1
% 0.36/0.53  # Unit Clause-clause subsumption calls : 2
% 0.36/0.53  # Rewrite failures with RHS unbound    : 0
% 0.36/0.53  # BW rewrite match attempts            : 0
% 0.36/0.53  # BW rewrite match successes           : 0
% 0.36/0.53  # Condensation attempts                : 0
% 0.36/0.53  # Condensation successes               : 0
% 0.36/0.53  # Termbank termtop insertions          : 1332
% 0.36/0.53  
% 0.36/0.53  # -------------------------------------------------
% 0.36/0.53  # User time                : 0.006 s
% 0.36/0.53  # System time              : 0.001 s
% 0.36/0.53  # Total time               : 0.007 s
% 0.36/0.53  # Maximum resident set size: 1704 pages
% 0.36/0.53  
% 0.36/0.53  # -------------------------------------------------
% 0.36/0.53  # User time                : 0.008 s
% 0.36/0.53  # System time              : 0.002 s
% 0.36/0.53  # Total time               : 0.011 s
% 0.36/0.53  # Maximum resident set size: 1684 pages
% 0.36/0.53  % E---3.1 exiting
% 0.36/0.53  % E---3.1 exiting
%------------------------------------------------------------------------------