TSTP Solution File: SEV189^5 by E---3.2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.2.0
% Problem  : SEV189^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n032.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 : 300s
% WCLimit  : 300s
% DateTime : Mon Jun 24 15:53:55 EDT 2024

% Result   : Theorem 0.15s 0.40s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10  % Problem    : SEV189^5 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.10  % Command    : run_E %s %d THM
% 0.09/0.29  % Computer : n032.cluster.edu
% 0.09/0.29  % Model    : x86_64 x86_64
% 0.09/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29  % Memory   : 8042.1875MB
% 0.09/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29  % CPULimit   : 300
% 0.09/0.29  % WCLimit    : 300
% 0.09/0.29  % DateTime   : Fri Jun 21 19:27:53 EDT 2024
% 0.09/0.29  % CPUTime    : 
% 0.15/0.39  Running higher-order theorem proving
% 0.15/0.39  Running: /export/starexec/sandbox2/solver/bin/eprover-ho --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.r7VG0hsnFq/E---3.1_7884.p
% 0.15/0.40  # Version: 3.2.0-ho
% 0.15/0.40  # Preprocessing class: HSMSSMSSSSMNHHA.
% 0.15/0.40  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.40  # Starting ehoh_best4_fo with 1200s (4) cores
% 0.15/0.40  # Starting ehoh_best_nonlift_rwall with 600s (2) cores
% 0.15/0.40  # Starting lpo1_lambda_fix with 300s (1) cores
% 0.15/0.40  # Starting full_lambda_9 with 300s (1) cores
% 0.15/0.40  # ehoh_best4_fo with pid 7962 completed with status 0
% 0.15/0.40  # Result found by ehoh_best4_fo
% 0.15/0.40  # Preprocessing class: HSMSSMSSSSMNHHA.
% 0.15/0.40  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.40  # Starting ehoh_best4_fo with 1200s (4) cores
% 0.15/0.40  # No SInE strategy applied
% 0.15/0.40  # Search class: HGHNF-FFSF00-MHHFFSBN
% 0.15/0.40  # partial match(1): HGHNF-FFSF00-SHHFFSBN
% 0.15/0.40  # Scheduled 6 strats onto 4 cores with 1200 seconds (1200 total)
% 0.15/0.40  # Starting ehoh_best_nonlift with 649s (1) cores
% 0.15/0.40  # Starting ehoh_best4_fo with 121s (1) cores
% 0.15/0.40  # Starting post_as_ho9 with 109s (1) cores
% 0.15/0.40  # Starting post_as_ho7 with 109s (1) cores
% 0.15/0.40  # ehoh_best4_fo with pid 7968 completed with status 0
% 0.15/0.40  # Result found by ehoh_best4_fo
% 0.15/0.40  # Preprocessing class: HSMSSMSSSSMNHHA.
% 0.15/0.40  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.40  # Starting ehoh_best4_fo with 1200s (4) cores
% 0.15/0.40  # No SInE strategy applied
% 0.15/0.40  # Search class: HGHNF-FFSF00-MHHFFSBN
% 0.15/0.40  # partial match(1): HGHNF-FFSF00-SHHFFSBN
% 0.15/0.40  # Scheduled 6 strats onto 4 cores with 1200 seconds (1200 total)
% 0.15/0.40  # Starting ehoh_best_nonlift with 649s (1) cores
% 0.15/0.40  # Starting ehoh_best4_fo with 121s (1) cores
% 0.15/0.40  # Preprocessing time       : 0.001 s
% 0.15/0.40  # Presaturation interreduction done
% 0.15/0.40  
% 0.15/0.40  # Proof found!
% 0.15/0.40  # SZS status Theorem
% 0.15/0.40  # SZS output start CNFRefutation
% 0.15/0.40  thf(decl_sort1, type, b: $tType).
% 0.15/0.40  thf(decl_22, type, cQ: (b > $o) > $o).
% 0.15/0.40  thf(decl_23, type, cP: (b > $o) > $o).
% 0.15/0.40  thf(decl_24, type, epred1_1: ((b > $o) > $o) > b > $o).
% 0.15/0.40  thf(decl_25, type, epred2_1: ((b > $o) > $o) > b > $o).
% 0.15/0.40  thf(decl_26, type, epred3_0: (b > $o) > $o).
% 0.15/0.40  thf(cTHM567_pme, conjecture, ((![X1:(b > $o) > $o]:((![X2:b > $o]:(((X1 @ X2)=>(cP @ X2)))=>(cP @ (^[X3:b]:(![X4:b > $o]:(((X1 @ X4)=>(X4 @ X3))))))))&![X1:(b > $o) > $o]:((![X2:b > $o]:(((X1 @ X2)=>(cQ @ X2)))=>(cQ @ (^[X5:b]:(![X4:b > $o]:(((X1 @ X4)=>(X4 @ X5)))))))))=>![X1:(b > $o) > $o]:((![X2:b > $o]:(((X1 @ X2)=>((cP @ X2)&(cQ @ X2))))=>((cP @ (^[X6:b]:(![X4:b > $o]:(((X1 @ X4)=>(X4 @ X6))))))&(cQ @ (^[X7:b]:(![X4:b > $o]:(((X1 @ X4)=>(X4 @ X7)))))))))), file('/export/starexec/sandbox2/tmp/tmp.r7VG0hsnFq/E---3.1_7884.p', cTHM567_pme)).
% 0.15/0.40  thf(c_0_1, negated_conjecture, ~(((![X1:(b > $o) > $o]:((![X2:b > $o]:(((X1 @ X2)=>(cP @ X2)))=>(cP @ (^[Z0/* 6 */:b]:(![X4:b > $o]:((X1 @ X4=>X4 @ Z0)))))))&![X1:(b > $o) > $o]:((![X2:b > $o]:(((X1 @ X2)=>(cQ @ X2)))=>(cQ @ (^[Z0/* 6 */:b]:(![X4:b > $o]:((X1 @ X4=>X4 @ Z0))))))))=>![X1:(b > $o) > $o]:((![X2:b > $o]:(((X1 @ X2)=>((cP @ X2)&(cQ @ X2))))=>((cP @ (^[Z0/* 6 */:b]:(![X4:b > $o]:((X1 @ X4=>X4 @ Z0)))))&(cQ @ (^[Z0/* 6 */:b]:(![X4:b > $o]:((X1 @ X4=>X4 @ Z0)))))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM567_pme])])).
% 0.15/0.40  thf(c_0_2, negated_conjecture, ![X14:(b > $o) > $o, X16:(b > $o) > $o, X19:b > $o]:((((((X14 @ (epred1_1 @ X14))|(cP @ (^[Z0/* 6 */:b]:(![X4:b > $o]:((X14 @ X4=>X4 @ Z0))))))&(~(cP @ (epred1_1 @ X14))|(cP @ (^[Z0/* 6 */:b]:(![X4:b > $o]:((X14 @ X4=>X4 @ Z0)))))))&(((X16 @ (epred2_1 @ X16))|(cQ @ (^[Z0/* 6 */:b]:(![X4:b > $o]:((X16 @ X4=>X4 @ Z0))))))&(~(cQ @ (epred2_1 @ X16))|(cQ @ (^[Z0/* 6 */:b]:(![X4:b > $o]:((X16 @ X4=>X4 @ Z0))))))))&((((cP @ X19)|~(epred3_0 @ X19))&((cQ @ X19)|~(epred3_0 @ X19)))&(~(cP @ (^[Z0/* 6 */:b]:(![X4:b > $o]:((epred3_0 @ X4=>X4 @ Z0)))))|~(cQ @ (^[Z0/* 6 */:b]:(![X4:b > $o]:((epred3_0 @ X4=>X4 @ Z0))))))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])).
% 0.15/0.40  thf(c_0_3, negated_conjecture, (~((cP @ (^[Z0/* 6 */:b]:(![X20:b > $o]:(((epred3_0 @ X20)=>(X20 @ Z0)))))))|~((cQ @ (^[Z0/* 6 */:b]:(![X21:b > $o]:(((epred3_0 @ X21)=>(X21 @ Z0)))))))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.15/0.40  thf(c_0_4, negated_conjecture, ![X1:(b > $o) > $o]:(((X1 @ (epred2_1 @ X1))|(cQ @ (^[Z0/* 6 */:b]:(![X22:b > $o]:(((X1 @ X22)=>(X22 @ Z0)))))))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.15/0.40  thf(c_0_5, negated_conjecture, ((epred3_0 @ (epred2_1 @ epred3_0))|~((cP @ (^[Z0/* 6 */:b]:(![X23:b > $o]:(((epred3_0 @ X23)=>(X23 @ Z0)))))))), inference(spm,[status(thm)],[c_0_3, c_0_4])).
% 0.15/0.40  thf(c_0_6, negated_conjecture, ![X1:(b > $o) > $o]:(((X1 @ (epred1_1 @ X1))|(cP @ (^[Z0/* 6 */:b]:(![X24:b > $o]:(((X1 @ X24)=>(X24 @ Z0)))))))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.15/0.40  thf(c_0_7, negated_conjecture, ![X2:b > $o]:(((cP @ X2)|~((epred3_0 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.15/0.40  thf(c_0_8, negated_conjecture, ((epred3_0 @ (epred1_1 @ epred3_0))|(epred3_0 @ (epred2_1 @ epred3_0))), inference(spm,[status(thm)],[c_0_5, c_0_6])).
% 0.15/0.40  thf(c_0_9, negated_conjecture, ![X2:b > $o]:(((cQ @ X2)|~((epred3_0 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.15/0.40  thf(c_0_10, negated_conjecture, ((epred3_0 @ (epred2_1 @ epred3_0))|(cP @ (epred1_1 @ epred3_0))), inference(spm,[status(thm)],[c_0_7, c_0_8])).
% 0.15/0.40  thf(c_0_11, negated_conjecture, ![X1:(b > $o) > $o]:(((cQ @ (^[Z0/* 6 */:b]:(![X25:b > $o]:(((X1 @ X25)=>(X25 @ Z0))))))|~((cQ @ (epred2_1 @ X1))))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.15/0.40  thf(c_0_12, negated_conjecture, ((cP @ (epred1_1 @ epred3_0))|(cQ @ (epred2_1 @ epred3_0))), inference(spm,[status(thm)],[c_0_9, c_0_10])).
% 0.15/0.40  thf(c_0_13, negated_conjecture, ((cQ @ (^[Z0/* 6 */:b]:(![X26:b > $o]:(((epred3_0 @ X26)=>(X26 @ Z0))))))|(cP @ (epred1_1 @ epred3_0))), inference(spm,[status(thm)],[c_0_11, c_0_12])).
% 0.15/0.40  thf(c_0_14, negated_conjecture, ((cP @ (epred1_1 @ epred3_0))|~((cP @ (^[Z0/* 6 */:b]:(![X27:b > $o]:(((epred3_0 @ X27)=>(X27 @ Z0)))))))), inference(spm,[status(thm)],[c_0_3, c_0_13])).
% 0.15/0.40  thf(c_0_15, negated_conjecture, ![X1:(b > $o) > $o]:(((cP @ (^[Z0/* 6 */:b]:(![X28:b > $o]:(((X1 @ X28)=>(X28 @ Z0))))))|~((cP @ (epred1_1 @ X1))))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.15/0.40  thf(c_0_16, negated_conjecture, (cP @ (epred1_1 @ epred3_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_6]), c_0_7])).
% 0.15/0.40  thf(c_0_17, negated_conjecture, (cP @ (^[Z0/* 6 */:b]:(![X29:b > $o]:(((epred3_0 @ X29)=>(X29 @ Z0)))))), inference(spm,[status(thm)],[c_0_15, c_0_16])).
% 0.15/0.40  thf(c_0_18, negated_conjecture, (epred3_0 @ (epred2_1 @ epred3_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5, c_0_17])])).
% 0.15/0.40  thf(c_0_19, negated_conjecture, (cQ @ (epred2_1 @ epred3_0)), inference(spm,[status(thm)],[c_0_9, c_0_18])).
% 0.15/0.40  thf(c_0_20, negated_conjecture, ~((cQ @ (^[Z0/* 6 */:b]:(![X30:b > $o]:(((epred3_0 @ X30)=>(X30 @ Z0))))))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_3, c_0_17])])).
% 0.15/0.40  thf(c_0_21, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11, c_0_19]), c_0_20]), ['proof']).
% 0.15/0.40  # SZS output end CNFRefutation
% 0.15/0.40  # Parsed axioms                        : 4
% 0.15/0.40  # Removed by relevancy pruning/SinE    : 0
% 0.15/0.40  # Initial clauses                      : 10
% 0.15/0.40  # Removed in clause preprocessing      : 3
% 0.15/0.40  # Initial clauses in saturation        : 7
% 0.15/0.40  # Processed clauses                    : 35
% 0.15/0.40  # ...of these trivial                  : 0
% 0.15/0.40  # ...subsumed                          : 0
% 0.15/0.40  # ...remaining for further processing  : 34
% 0.15/0.40  # Other redundant clauses eliminated   : 0
% 0.15/0.40  # Clauses deleted for lack of memory   : 0
% 0.15/0.40  # Backward-subsumed                    : 2
% 0.15/0.40  # Backward-rewritten                   : 10
% 0.15/0.40  # Generated clauses                    : 44
% 0.15/0.40  # ...of the previous two non-redundant : 44
% 0.15/0.40  # ...aggressively subsumed             : 0
% 0.15/0.40  # Contextual simplify-reflections      : 1
% 0.15/0.40  # Paramodulations                      : 20
% 0.15/0.40  # Factorizations                       : 0
% 0.15/0.40  # NegExts                              : 2
% 0.15/0.40  # Equation resolutions                 : 0
% 0.15/0.40  # Disequality decompositions           : 0
% 0.15/0.40  # Total rewrite steps                  : 11
% 0.15/0.40  # ...of those cached                   : 6
% 0.15/0.40  # Propositional unsat checks           : 0
% 0.15/0.40  #    Propositional check models        : 0
% 0.15/0.40  #    Propositional check unsatisfiable : 0
% 0.15/0.40  #    Propositional clauses             : 0
% 0.15/0.40  #    Propositional clauses after purity: 0
% 0.15/0.40  #    Propositional unsat core size     : 0
% 0.15/0.40  #    Propositional preprocessing time  : 0.000
% 0.15/0.40  #    Propositional encoding time       : 0.000
% 0.15/0.40  #    Propositional solver time         : 0.000
% 0.15/0.40  #    Success case prop preproc time    : 0.000
% 0.15/0.40  #    Success case prop encoding time   : 0.000
% 0.15/0.40  #    Success case prop solver time     : 0.000
% 0.15/0.40  # Current number of processed clauses  : 15
% 0.15/0.40  #    Positive orientable unit clauses  : 7
% 0.15/0.40  #    Positive unorientable unit clauses: 0
% 0.15/0.40  #    Negative unit clauses             : 1
% 0.15/0.40  #    Non-unit-clauses                  : 7
% 0.15/0.40  # Current number of unprocessed clauses: 23
% 0.15/0.40  # ...number of literals in the above   : 58
% 0.15/0.40  # Current number of archived formulas  : 0
% 0.15/0.40  # Current number of archived clauses   : 19
% 0.15/0.40  # Clause-clause subsumption calls (NU) : 44
% 0.15/0.40  # Rec. Clause-clause subsumption calls : 43
% 0.15/0.40  # Non-unit clause-clause subsumptions  : 1
% 0.15/0.40  # Unit Clause-clause subsumption calls : 15
% 0.15/0.40  # Rewrite failures with RHS unbound    : 0
% 0.15/0.40  # BW rewrite match attempts            : 6
% 0.15/0.40  # BW rewrite match successes           : 5
% 0.15/0.40  # Condensation attempts                : 0
% 0.15/0.40  # Condensation successes               : 0
% 0.15/0.40  # Termbank termtop insertions          : 3804
% 0.15/0.40  # Search garbage collected termcells   : 285
% 0.15/0.40  
% 0.15/0.40  # -------------------------------------------------
% 0.15/0.40  # User time                : 0.006 s
% 0.15/0.40  # System time              : 0.000 s
% 0.15/0.40  # Total time               : 0.006 s
% 0.15/0.40  # Maximum resident set size: 1840 pages
% 0.15/0.40  
% 0.15/0.40  # -------------------------------------------------
% 0.15/0.40  # User time                : 0.012 s
% 0.15/0.40  # System time              : 0.004 s
% 0.15/0.40  # Total time               : 0.015 s
% 0.15/0.40  # Maximum resident set size: 1720 pages
% 0.15/0.40  % E---3.1 exiting
% 0.15/0.40  % E exiting
%------------------------------------------------------------------------------