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

View Problem - Process Solution

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

% Computer : n027.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:07:37 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
fof(m__,conjecture,
    ( ( aSet0(slbdtrb0(sz00))
      & ! [X1] : ~ aElementOf0(X1,slbdtrb0(sz00)) )
   => ( ~ ? [X1] : aElementOf0(X1,slbdtrb0(sz00))
      | slbdtrb0(sz00) = slcrc0 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.FYE3p34Tfw/E---3.1_12679.p',m__) ).

fof(c_0_1,negated_conjecture,
    ~ ( ( aSet0(slbdtrb0(sz00))
        & ! [X1] : ~ aElementOf0(X1,slbdtrb0(sz00)) )
     => ( ~ ? [X1] : aElementOf0(X1,slbdtrb0(sz00))
        | slbdtrb0(sz00) = slcrc0 ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).

fof(c_0_2,negated_conjecture,
    ! [X5] :
      ( aSet0(slbdtrb0(sz00))
      & ~ aElementOf0(X5,slbdtrb0(sz00))
      & aElementOf0(esk1_0,slbdtrb0(sz00))
      & slbdtrb0(sz00) != slcrc0 ),
    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(esk1_0,slbdtrb0(sz00)),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4,negated_conjecture,
    ~ aElementOf0(X1,slbdtrb0(sz00)),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_5,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[c_0_3,c_0_4]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14  % Problem    : NUM540+2 : TPTP v8.1.2. Released v4.0.0.
% 0.04/0.15  % Command    : run_E %s %d THM
% 0.15/0.36  % Computer : n027.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 15:11:00 EDT 2023
% 0.15/0.37  % CPUTime    : 
% 0.23/0.51  Running first-order model finding
% 0.23/0.52  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.FYE3p34Tfw/E---3.1_12679.p
% 408.34/136.53  # Version: 3.1pre001
% 408.34/136.53  # Preprocessing class: FSLSSMSSSSSNFFN.
% 408.34/136.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.34/136.53  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 408.34/136.53  # Starting new_bool_3 with 300s (1) cores
% 408.34/136.53  # Starting new_bool_1 with 300s (1) cores
% 408.34/136.53  # Starting sh5l with 300s (1) cores
% 408.34/136.53  # sh5l with pid 12759 completed with status 0
% 408.34/136.53  # Result found by sh5l
% 408.34/136.53  # Preprocessing class: FSLSSMSSSSSNFFN.
% 408.34/136.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.34/136.53  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 408.34/136.53  # Starting new_bool_3 with 300s (1) cores
% 408.34/136.53  # Starting new_bool_1 with 300s (1) cores
% 408.34/136.53  # Starting sh5l with 300s (1) cores
% 408.34/136.53  # SinE strategy is gf500_gu_R04_F100_L20000
% 408.34/136.53  # Search class: FGHSF-FFMM31-MFFFFFNN
% 408.34/136.53  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.34/136.53  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 181s (1) cores
% 408.34/136.53  # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 12760 completed with status 0
% 408.34/136.53  # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 408.34/136.53  # Preprocessing class: FSLSSMSSSSSNFFN.
% 408.34/136.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.34/136.53  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 408.34/136.53  # Starting new_bool_3 with 300s (1) cores
% 408.34/136.53  # Starting new_bool_1 with 300s (1) cores
% 408.34/136.53  # Starting sh5l with 300s (1) cores
% 408.34/136.53  # SinE strategy is gf500_gu_R04_F100_L20000
% 408.34/136.53  # Search class: FGHSF-FFMM31-MFFFFFNN
% 408.34/136.53  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.34/136.53  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 181s (1) cores
% 408.34/136.53  # Preprocessing time       : 0.003 s
% 408.34/136.53  
% 408.34/136.53  # Proof found!
% 408.34/136.53  # SZS status Theorem
% 408.34/136.53  # SZS output start CNFRefutation
% See solution above
% 408.34/136.53  # Parsed axioms                        : 52
% 408.34/136.53  # Removed by relevancy pruning/SinE    : 3
% 408.34/136.53  # Initial clauses                      : 89
% 408.34/136.53  # Removed in clause preprocessing      : 5
% 408.34/136.53  # Initial clauses in saturation        : 84
% 408.34/136.53  # Processed clauses                    : 13
% 408.34/136.53  # ...of these trivial                  : 0
% 408.34/136.53  # ...subsumed                          : 0
% 408.34/136.53  # ...remaining for further processing  : 13
% 408.34/136.53  # Other redundant clauses eliminated   : 0
% 408.34/136.53  # Clauses deleted for lack of memory   : 0
% 408.34/136.53  # Backward-subsumed                    : 0
% 408.34/136.53  # Backward-rewritten                   : 0
% 408.34/136.53  # Generated clauses                    : 2
% 408.34/136.53  # ...of the previous two non-redundant : 0
% 408.34/136.53  # ...aggressively subsumed             : 0
% 408.34/136.53  # Contextual simplify-reflections      : 1
% 408.34/136.53  # Paramodulations                      : 1
% 408.34/136.53  # Factorizations                       : 0
% 408.34/136.53  # NegExts                              : 0
% 408.34/136.53  # Equation resolutions                 : 0
% 408.34/136.53  # Total rewrite steps                  : 0
% 408.34/136.53  # Propositional unsat checks           : 0
% 408.34/136.53  #    Propositional check models        : 0
% 408.34/136.53  #    Propositional check unsatisfiable : 0
% 408.34/136.53  #    Propositional clauses             : 0
% 408.34/136.53  #    Propositional clauses after purity: 0
% 408.34/136.53  #    Propositional unsat core size     : 0
% 408.34/136.53  #    Propositional preprocessing time  : 0.000
% 408.34/136.53  #    Propositional encoding time       : 0.000
% 408.34/136.53  #    Propositional solver time         : 0.000
% 408.34/136.53  #    Success case prop preproc time    : 0.000
% 408.34/136.53  #    Success case prop encoding time   : 0.000
% 408.34/136.53  #    Success case prop solver time     : 0.000
% 408.34/136.53  # Current number of processed clauses  : 12
% 408.34/136.53  #    Positive orientable unit clauses  : 5
% 408.34/136.53  #    Positive unorientable unit clauses: 0
% 408.34/136.53  #    Negative unit clauses             : 2
% 408.34/136.53  #    Non-unit-clauses                  : 5
% 408.34/136.53  # Current number of unprocessed clauses: 71
% 408.34/136.53  # ...number of literals in the above   : 309
% 408.34/136.53  # Current number of archived formulas  : 0
% 408.34/136.53  # Current number of archived clauses   : 1
% 408.34/136.53  # Clause-clause subsumption calls (NU) : 2
% 408.34/136.53  # Rec. Clause-clause subsumption calls : 2
% 408.34/136.53  # Non-unit clause-clause subsumptions  : 1
% 408.34/136.53  # Unit Clause-clause subsumption calls : 0
% 408.34/136.53  # Rewrite failures with RHS unbound    : 0
% 408.34/136.53  # BW rewrite match attempts            : 0
% 408.34/136.53  # BW rewrite match successes           : 0
% 408.34/136.53  # Condensation attempts                : 0
% 408.34/136.53  # Condensation successes               : 0
% 408.34/136.53  # Termbank termtop insertions          : 5747
% 408.34/136.53  
% 408.34/136.53  # -------------------------------------------------
% 408.34/136.53  # User time                : 0.008 s
% 408.34/136.53  # System time              : 0.002 s
% 408.34/136.53  # Total time               : 0.010 s
% 408.34/136.53  # Maximum resident set size: 2060 pages
% 408.34/136.53  
% 408.34/136.53  # -------------------------------------------------
% 408.34/136.53  # User time                : 0.011 s
% 408.34/136.53  # System time              : 0.003 s
% 408.34/136.53  # Total time               : 0.014 s
% 408.34/136.53  # Maximum resident set size: 1732 pages
% 408.34/136.53  % E---3.1 exiting
%------------------------------------------------------------------------------