TSTP Solution File: SEV258^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV258^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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 : Tue May 21 04:08:05 EDT 2024
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEV258^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n019.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 18:22:23 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running higher-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.20/0.50 # Version: 3.1.0-ho
% 0.20/0.50 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.20/0.50 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting sh2lt with 1200s (4) cores
% 0.20/0.50 # Starting new_ho_10_unif with 300s (1) cores
% 0.20/0.50 # Starting full_lambda_6 with 300s (1) cores
% 0.20/0.50 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.50 # Starting ehoh_best3_rw with 300s (1) cores
% 0.20/0.50 # full_lambda_6 with pid 26819 completed with status 0
% 0.20/0.50 # Result found by full_lambda_6
% 0.20/0.50 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.20/0.50 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting sh2lt with 1200s (4) cores
% 0.20/0.50 # Starting new_ho_10_unif with 300s (1) cores
% 0.20/0.50 # Starting full_lambda_6 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
% 0.20/0.50 # Search class: HGHPF-FFSM00-MHHFFFNN
% 0.20/0.50 # partial match(3): HUHPF-FFSF00-SHHFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.50 # new_ho_10 with pid 26822 completed with status 0
% 0.20/0.50 # Result found by new_ho_10
% 0.20/0.50 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.20/0.50 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting sh2lt with 1200s (4) cores
% 0.20/0.50 # Starting new_ho_10_unif with 300s (1) cores
% 0.20/0.50 # Starting full_lambda_6 with 300s (1) cores
% 0.20/0.50 # SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
% 0.20/0.50 # Search class: HGHPF-FFSM00-MHHFFFNN
% 0.20/0.50 # partial match(3): HUHPF-FFSF00-SHHFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Theorem
% 0.20/0.50 # SZS output start CNFRefutation
% 0.20/0.50 thf(decl_sort1, type, a: $tType).
% 0.20/0.50 thf(decl_22, type, epred1_0: a > $o).
% 0.20/0.50 thf(decl_23, type, epred2_0: a > $o).
% 0.20/0.50 thf(decl_24, type, epred3_0: (a > $o) > $o).
% 0.20/0.50 thf(decl_25, type, epred4_0: a > $o).
% 0.20/0.50 thf(decl_26, type, epred5_0: a > $o).
% 0.20/0.50 thf(decl_27, type, epred6_0: a > $o).
% 0.20/0.50 thf(decl_28, type, epred7_0: a > $o).
% 0.20/0.50 thf(cDISCRETE_TOPOLOGY_pme, conjecture, (((![X1:a > $o]:((((X1)=(^[X2:a]:(~($true))))=>($true)))&![X1:a > $o]:((((X1)=(^[X2:a]:(~(~($true)))))=>($true))))&![X3:(a > $o) > $o, X1:a > $o]:(((![X4:a > $o]:(((X3 @ X4)=>($true)))&((X1)=(^[X2:a]:(?[X5:a > $o]:(((X3 @ X5)&(X5 @ X2)))))))=>($true))))&![X6:a > $o, X7:a > $o, X5:a > $o]:((((($true)&($true))&((X5)=(^[X2:a]:(((X6 @ X2)&(X7 @ X2))))))=>($true)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', cDISCRETE_TOPOLOGY_pme)).
% 0.20/0.50 thf(c_0_1, negated_conjecture, ~((((![X1:a > $o]:((((X1)=(^[Z0/* 7 */:a]:(~($true))))=>$true))&![X1:a > $o]:((((X1)=(^[Z0/* 7 */:a]:(~(~($true)))))=>$true)))&![X3:(a > $o) > $o, X1:a > $o]:(((![X4:a > $o]:(((X3 @ X4)=>$true))&((X1)=(^[Z0/* 5 */:a]:(?[X5:a > $o]:((X3 @ X5&X5 @ Z0))))))=>$true)))&![X6:a > $o, X7:a > $o, X5:a > $o]:((($true&((X5)=(^[Z0/* 8 */:a]:((X6 @ Z0&X7 @ Z0)))))=>$true)))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cDISCRETE_TOPOLOGY_pme])])])).
% 0.20/0.50 thf(c_0_2, negated_conjecture, ![X20:a > $o]:((((((((($true)|(~(epred3_0 @ X20)|($true)|(((epred2_0)=(^[Z0/* 7 */:a]:(~(~($true)))))|((epred1_0)=(^[Z0/* 7 */:a]:(~($true)))))))&(((epred7_0)=(^[Z0/* 8 */:a]:((epred5_0 @ Z0&epred6_0 @ Z0))))|(~(epred3_0 @ X20)|($true)|(((epred2_0)=(^[Z0/* 7 */:a]:(~(~($true)))))|((epred1_0)=(^[Z0/* 7 */:a]:(~($true))))))))&(~($true)|(~(epred3_0 @ X20)|($true)|(((epred2_0)=(^[Z0/* 7 */:a]:(~(~($true)))))|((epred1_0)=(^[Z0/* 7 */:a]:(~($true))))))))&(((($true)|(((epred4_0)=(^[Z0/* 5 */:a]:(?[X5:a > $o]:((epred3_0 @ X5&X5 @ Z0)))))|(((epred2_0)=(^[Z0/* 7 */:a]:(~(~($true)))))|((epred1_0)=(^[Z0/* 7 */:a]:(~($true)))))))&(((epred7_0)=(^[Z0/* 8 */:a]:((epred5_0 @ Z0&epred6_0 @ Z0))))|(((epred4_0)=(^[Z0/* 5 */:a]:(?[X5:a > $o]:((epred3_0 @ X5&X5 @ Z0)))))|(((epred2_0)=(^[Z0/* 7 */:a]:(~(~($true)))))|((epred1_0)=(^[Z0/* 7 */:a]:(~($true))))))))&(~($true)|(((epred4_0)=(^[Z0/* 5 */:a]:(?[X5:a > $o]:((epred3_0 @ X5&X5 @ Z0)))))|(((epred2_0)=(^[Z0/* 7 */:a]:(~(~($true)))))|((epred1_0)=(^[Z0/* 7 */:a]:(~($true)))))))))&(((($true)|(~($true)|(((epred2_0)=(^[Z0/* 7 */:a]:(~(~($true)))))|((epred1_0)=(^[Z0/* 7 */:a]:(~($true)))))))&(((epred7_0)=(^[Z0/* 8 */:a]:((epred5_0 @ Z0&epred6_0 @ Z0))))|(~($true)|(((epred2_0)=(^[Z0/* 7 */:a]:(~(~($true)))))|((epred1_0)=(^[Z0/* 7 */:a]:(~($true))))))))&(~($true)|(~($true)|(((epred2_0)=(^[Z0/* 7 */:a]:(~(~($true)))))|((epred1_0)=(^[Z0/* 7 */:a]:(~($true)))))))))&(((((($true)|(~(epred3_0 @ X20)|($true)|(~($true)|((epred1_0)=(^[Z0/* 7 */:a]:(~($true)))))))&(((epred7_0)=(^[Z0/* 8 */:a]:((epred5_0 @ Z0&epred6_0 @ Z0))))|(~(epred3_0 @ X20)|($true)|(~($true)|((epred1_0)=(^[Z0/* 7 */:a]:(~($true))))))))&(~($true)|(~(epred3_0 @ X20)|($true)|(~($true)|((epred1_0)=(^[Z0/* 7 */:a]:(~($true))))))))&(((($true)|(((epred4_0)=(^[Z0/* 5 */:a]:(?[X5:a > $o]:((epred3_0 @ X5&X5 @ Z0)))))|(~($true)|((epred1_0)=(^[Z0/* 7 */:a]:(~($true)))))))&(((epred7_0)=(^[Z0/* 8 */:a]:((epred5_0 @ Z0&epred6_0 @ Z0))))|(((epred4_0)=(^[Z0/* 5 */:a]:(?[X5:a > $o]:((epred3_0 @ X5&X5 @ Z0)))))|(~($true)|((epred1_0)=(^[Z0/* 7 */:a]:(~($true))))))))&(~($true)|(((epred4_0)=(^[Z0/* 5 */:a]:(?[X5:a > $o]:((epred3_0 @ X5&X5 @ Z0)))))|(~($true)|((epred1_0)=(^[Z0/* 7 */:a]:(~($true)))))))))&(((($true)|(~($true)|(~($true)|((epred1_0)=(^[Z0/* 7 */:a]:(~($true)))))))&(((epred7_0)=(^[Z0/* 8 */:a]:((epred5_0 @ Z0&epred6_0 @ Z0))))|(~($true)|(~($true)|((epred1_0)=(^[Z0/* 7 */:a]:(~($true))))))))&(~($true)|(~($true)|(~($true)|((epred1_0)=(^[Z0/* 7 */:a]:(~($true))))))))))&((((((($true)|(~(epred3_0 @ X20)|($true)|(((epred2_0)=(^[Z0/* 7 */:a]:(~(~($true)))))|~($true))))&(((epred7_0)=(^[Z0/* 8 */:a]:((epred5_0 @ Z0&epred6_0 @ Z0))))|(~(epred3_0 @ X20)|($true)|(((epred2_0)=(^[Z0/* 7 */:a]:(~(~($true)))))|~($true)))))&(~($true)|(~(epred3_0 @ X20)|($true)|(((epred2_0)=(^[Z0/* 7 */:a]:(~(~($true)))))|~($true)))))&(((($true)|(((epred4_0)=(^[Z0/* 5 */:a]:(?[X5:a > $o]:((epred3_0 @ X5&X5 @ Z0)))))|(((epred2_0)=(^[Z0/* 7 */:a]:(~(~($true)))))|~($true))))&(((epred7_0)=(^[Z0/* 8 */:a]:((epred5_0 @ Z0&epred6_0 @ Z0))))|(((epred4_0)=(^[Z0/* 5 */:a]:(?[X5:a > $o]:((epred3_0 @ X5&X5 @ Z0)))))|(((epred2_0)=(^[Z0/* 7 */:a]:(~(~($true)))))|~($true)))))&(~($true)|(((epred4_0)=(^[Z0/* 5 */:a]:(?[X5:a > $o]:((epred3_0 @ X5&X5 @ Z0)))))|(((epred2_0)=(^[Z0/* 7 */:a]:(~(~($true)))))|~($true))))))&(((($true)|(~($true)|(((epred2_0)=(^[Z0/* 7 */:a]:(~(~($true)))))|~($true))))&(((epred7_0)=(^[Z0/* 8 */:a]:((epred5_0 @ Z0&epred6_0 @ Z0))))|(~($true)|(((epred2_0)=(^[Z0/* 7 */:a]:(~(~($true)))))|~($true)))))&(~($true)|(~($true)|(((epred2_0)=(^[Z0/* 7 */:a]:(~(~($true)))))|~($true))))))&(((((($true)|(~(epred3_0 @ X20)|($true)|(~($true)|~($true))))&(((epred7_0)=(^[Z0/* 8 */:a]:((epred5_0 @ Z0&epred6_0 @ Z0))))|(~(epred3_0 @ X20)|($true)|(~($true)|~($true)))))&(~($true)|(~(epred3_0 @ X20)|($true)|(~($true)|~($true)))))&(((($true)|(((epred4_0)=(^[Z0/* 5 */:a]:(?[X5:a > $o]:((epred3_0 @ X5&X5 @ Z0)))))|(~($true)|~($true))))&(((epred7_0)=(^[Z0/* 8 */:a]:((epred5_0 @ Z0&epred6_0 @ Z0))))|(((epred4_0)=(^[Z0/* 5 */:a]:(?[X5:a > $o]:((epred3_0 @ X5&X5 @ Z0)))))|(~($true)|~($true)))))&(~($true)|(((epred4_0)=(^[Z0/* 5 */:a]:(?[X5:a > $o]:((epred3_0 @ X5&X5 @ Z0)))))|(~($true)|~($true))))))&(((($true)|(~($true)|(~($true)|~($true))))&(((epred7_0)=(^[Z0/* 8 */:a]:((epred5_0 @ Z0&epred6_0 @ Z0))))|(~($true)|(~($true)|~($true)))))&(~($true)|(~($true)|(~($true)|~($true))))))))), 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.20/0.50 thf(c_0_3, negated_conjecture, (~(($true))|~(($true))|~(($true))|~(($true))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.20/0.50 thf(c_0_4, negated_conjecture, ($false), inference(cn,[status(thm)],[c_0_3]), ['proof']).
% 0.20/0.50 # SZS output end CNFRefutation
% 0.20/0.50 # Parsed axioms : 2
% 0.20/0.50 # Removed by relevancy pruning/SinE : 1
% 0.20/0.50 # Initial clauses : 36
% 0.20/0.50 # Removed in clause preprocessing : 20
% 0.20/0.50 # Initial clauses in saturation : 16
% 0.20/0.50 # Processed clauses : 1
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 0
% 0.20/0.50 # ...remaining for further processing : 0
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 0
% 0.20/0.50 # Backward-rewritten : 0
% 0.20/0.50 # Generated clauses : 0
% 0.20/0.50 # ...of the previous two non-redundant : 0
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 0
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 0
% 0.20/0.50 # ...of those cached : 0
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 0
% 0.20/0.50 # Positive orientable unit clauses : 0
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 0
% 0.20/0.50 # Non-unit-clauses : 0
% 0.20/0.50 # Current number of unprocessed clauses: 15
% 0.20/0.50 # ...number of literals in the above : 32
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 0
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.50 # Non-unit clause-clause subsumptions : 0
% 0.20/0.50 # Unit Clause-clause subsumption calls : 0
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 0
% 0.20/0.50 # BW rewrite match successes : 0
% 0.20/0.50 # Condensation attempts : 1
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 1467
% 0.20/0.50 # Search garbage collected termcells : 333
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.002 s
% 0.20/0.50 # System time : 0.003 s
% 0.20/0.50 # Total time : 0.005 s
% 0.20/0.50 # Maximum resident set size: 1916 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.003 s
% 0.20/0.50 # System time : 0.006 s
% 0.20/0.50 # Total time : 0.009 s
% 0.20/0.50 # Maximum resident set size: 1720 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.50 % E exiting
%------------------------------------------------------------------------------