TSTP Solution File: HWV089-1 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : HWV089-1 : TPTP v8.1.2. Released v6.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n006.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 17:54:40 EDT 2023

% Result   : Unsatisfiable 2.64s 2.99s
% Output   : CNFRefutation 2.64s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    1
% Syntax   : Number of clauses     :    3 (   3 unt;   0 nHn;   3 RR)
%            Number of literals    :    3 (   0 equ;   0 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    0 (   0 avg)
%            Number of predicates  :    1 (   0 usr;   1 prp; 0-0 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(u56157,negated_conjecture,
    $false,
    file('/export/starexec/sandbox2/tmp/tmp.KBXPSemsLe/E---3.1_21915.p',u56157) ).

cnf(c_0_1,negated_conjecture,
    $false,
    u56157 ).

cnf(c_0_2,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[c_0_1]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 1.14/1.30  % Problem    : HWV089-1 : TPTP v8.1.2. Released v6.1.0.
% 1.14/1.31  % Command    : run_E %s %d THM
% 1.30/1.51  % Computer : n006.cluster.edu
% 1.30/1.51  % Model    : x86_64 x86_64
% 1.30/1.51  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 1.30/1.51  % Memory   : 8042.1875MB
% 1.30/1.51  % OS       : Linux 3.10.0-693.el7.x86_64
% 1.30/1.51  % CPULimit   : 2400
% 1.30/1.51  % WCLimit    : 300
% 1.30/1.51  % DateTime   : Tue Oct  3 04:57:26 EDT 2023
% 1.30/1.51  % CPUTime    : 
% 2.61/2.82  Running first-order theorem proving
% 2.61/2.82  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.KBXPSemsLe/E---3.1_21915.p
% 2.64/2.99  # Version: 3.1pre001
% 2.64/2.99  # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.64/2.99  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.64/2.99  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.64/2.99  # Starting new_bool_3 with 300s (1) cores
% 2.64/2.99  # Starting new_bool_1 with 300s (1) cores
% 2.64/2.99  # Starting sh5l with 300s (1) cores
% 2.64/2.99  # new_bool_3 with pid 22001 completed with status 0
% 2.64/2.99  # Result found by new_bool_3
% 2.64/2.99  # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.64/2.99  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.64/2.99  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.64/2.99  # Starting new_bool_3 with 300s (1) cores
% 2.64/2.99  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.64/2.99  # Search class: FUHPF-FFSF00-SFFFFFNN
% 2.64/2.99  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.64/2.99  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 2.64/2.99  # SAT001_MinMin_p005000_rr_RG with pid 22004 completed with status 0
% 2.64/2.99  # Result found by SAT001_MinMin_p005000_rr_RG
% 2.64/2.99  # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.64/2.99  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.64/2.99  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.64/2.99  # Starting new_bool_3 with 300s (1) cores
% 2.64/2.99  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.64/2.99  # Search class: FUHPF-FFSF00-SFFFFFNN
% 2.64/2.99  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.64/2.99  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 2.64/2.99  # Preprocessing time       : 0.003 s
% 2.64/2.99  # Presaturation interreduction done
% 2.64/2.99  
% 2.64/2.99  # Proof found!
% 2.64/2.99  # SZS status Unsatisfiable
% 2.64/2.99  # SZS output start CNFRefutation
% See solution above
% 2.64/2.99  # Parsed axioms                        : 11791
% 2.64/2.99  # Removed by relevancy pruning/SinE    : 11790
% 2.64/2.99  # Initial clauses                      : 1
% 2.64/2.99  # Removed in clause preprocessing      : 0
% 2.64/2.99  # Initial clauses in saturation        : 1
% 2.64/2.99  # Processed clauses                    : 1
% 2.64/2.99  # ...of these trivial                  : 0
% 2.64/2.99  # ...subsumed                          : 0
% 2.64/2.99  # ...remaining for further processing  : 0
% 2.64/2.99  # Other redundant clauses eliminated   : 0
% 2.64/2.99  # Clauses deleted for lack of memory   : 0
% 2.64/2.99  # Backward-subsumed                    : 0
% 2.64/2.99  # Backward-rewritten                   : 0
% 2.64/2.99  # Generated clauses                    : 0
% 2.64/2.99  # ...of the previous two non-redundant : 0
% 2.64/2.99  # ...aggressively subsumed             : 0
% 2.64/2.99  # Contextual simplify-reflections      : 0
% 2.64/2.99  # Paramodulations                      : 0
% 2.64/2.99  # Factorizations                       : 0
% 2.64/2.99  # NegExts                              : 0
% 2.64/2.99  # Equation resolutions                 : 0
% 2.64/2.99  # Total rewrite steps                  : 0
% 2.64/2.99  # Propositional unsat checks           : 0
% 2.64/2.99  #    Propositional check models        : 0
% 2.64/2.99  #    Propositional check unsatisfiable : 0
% 2.64/2.99  #    Propositional clauses             : 0
% 2.64/2.99  #    Propositional clauses after purity: 0
% 2.64/2.99  #    Propositional unsat core size     : 0
% 2.64/2.99  #    Propositional preprocessing time  : 0.000
% 2.64/2.99  #    Propositional encoding time       : 0.000
% 2.64/2.99  #    Propositional solver time         : 0.000
% 2.64/2.99  #    Success case prop preproc time    : 0.000
% 2.64/2.99  #    Success case prop encoding time   : 0.000
% 2.64/2.99  #    Success case prop solver time     : 0.000
% 2.64/2.99  # Current number of processed clauses  : 0
% 2.64/2.99  #    Positive orientable unit clauses  : 0
% 2.64/2.99  #    Positive unorientable unit clauses: 0
% 2.64/2.99  #    Negative unit clauses             : 0
% 2.64/2.99  #    Non-unit-clauses                  : 0
% 2.64/2.99  # Current number of unprocessed clauses: 0
% 2.64/2.99  # ...number of literals in the above   : 0
% 2.64/2.99  # Current number of archived formulas  : 0
% 2.64/2.99  # Current number of archived clauses   : 0
% 2.64/2.99  # Clause-clause subsumption calls (NU) : 0
% 2.64/2.99  # Rec. Clause-clause subsumption calls : 0
% 2.64/2.99  # Non-unit clause-clause subsumptions  : 0
% 2.64/2.99  # Unit Clause-clause subsumption calls : 0
% 2.64/2.99  # Rewrite failures with RHS unbound    : 0
% 2.64/2.99  # BW rewrite match attempts            : 0
% 2.64/2.99  # BW rewrite match successes           : 0
% 2.64/2.99  # Condensation attempts                : 0
% 2.64/2.99  # Condensation successes               : 0
% 2.64/2.99  # Termbank termtop insertions          : 91035
% 2.64/2.99  
% 2.64/2.99  # -------------------------------------------------
% 2.64/2.99  # User time                : 0.019 s
% 2.64/2.99  # System time              : 0.012 s
% 2.64/2.99  # Total time               : 0.031 s
% 2.64/2.99  # Maximum resident set size: 11644 pages
% 2.64/2.99  
% 2.64/2.99  # -------------------------------------------------
% 2.64/2.99  # User time                : 0.149 s
% 2.64/2.99  # System time              : 0.021 s
% 2.64/2.99  # Total time               : 0.169 s
% 2.64/2.99  # Maximum resident set size: 8732 pages
% 2.64/2.99  % E---3.1 exiting
% 2.64/2.99  % E---3.1 exiting
%------------------------------------------------------------------------------