TSTP Solution File: SEV394^5 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : SEV394^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n001.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:54:24 EDT 2024
% Result : Theorem 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEV394^5 : TPTP v8.2.0. Released v4.0.0.
% 0.00/0.12 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n001.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Fri Jun 21 19:01:24 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.21/0.49 Running higher-order theorem proving
% 0.21/0.49 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.4N5yuMKbHB/E---3.1_5068.p
% 0.21/0.50 # Version: 3.2.0-ho
% 0.21/0.50 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.21/0.50 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting post_as_ho12 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_9 with 300s (1) cores
% 0.21/0.50 # Starting post_as_ho1 with 300s (1) cores
% 0.21/0.50 # Starting post_as_ho4 with 300s (1) cores
% 0.21/0.50 # Starting post_as_ho2 with 300s (1) cores
% 0.21/0.50 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.21/0.50 # Starting full_lambda_10 with 300s (1) cores
% 0.21/0.50 # Starting new_ho_8 with 300s (1) cores
% 0.21/0.50 # full_lambda_10 with pid 5208 completed with status 0
% 0.21/0.50 # Result found by full_lambda_10
% 0.21/0.50 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.21/0.50 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting post_as_ho12 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_9 with 300s (1) cores
% 0.21/0.50 # Starting post_as_ho1 with 300s (1) cores
% 0.21/0.50 # Starting post_as_ho4 with 300s (1) cores
% 0.21/0.50 # Starting post_as_ho2 with 300s (1) cores
% 0.21/0.50 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.21/0.50 # Starting full_lambda_10 with 300s (1) cores
% 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,5,,5,20000,3.0,true)
% 0.21/0.50 # Search class: HGUSF-FFSF00-MSSFFFNN
% 0.21/0.50 # partial match(1): HGUSF-FFSF00-SSSFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting new_ho_10 with 135s (1) cores
% 0.21/0.50 # new_ho_10 with pid 5213 completed with status 0
% 0.21/0.50 # Result found by new_ho_10
% 0.21/0.50 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.21/0.50 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting post_as_ho12 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_9 with 300s (1) cores
% 0.21/0.50 # Starting post_as_ho1 with 300s (1) cores
% 0.21/0.50 # Starting post_as_ho4 with 300s (1) cores
% 0.21/0.50 # Starting post_as_ho2 with 300s (1) cores
% 0.21/0.50 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.21/0.50 # Starting full_lambda_10 with 300s (1) cores
% 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,5,,5,20000,3.0,true)
% 0.21/0.50 # Search class: HGUSF-FFSF00-MSSFFFNN
% 0.21/0.50 # partial match(1): HGUSF-FFSF00-SSSFFFNN
% 0.21/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting new_ho_10 with 135s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Theorem
% 0.21/0.50 # SZS output start CNFRefutation
% 0.21/0.50 thf(decl_sort1, type, a: $tType).
% 0.21/0.50 thf(decl_22, type, epred1_0: a > $o).
% 0.21/0.50 thf(decl_23, type, epred2_0: a > $o).
% 0.21/0.50 thf(decl_24, type, epred3_0: a > $o).
% 0.21/0.50 thf(decl_25, type, esk1_0: a).
% 0.21/0.50 thf(cTHM269_pme, conjecture, ![X1:a > $o, X2:a > $o, X3:a > $o]:(((![X4:a]:((((X1 @ X4)&~((X3 @ X4)))=>(X2 @ X4)))&((^[X4:a]:(((X3 @ X4)&~((X2 @ X4)))))=(^[X4:a]:(~($true)))))=>![X4:a]:(((X1 @ X4)=>(X2 @ X4))))), file('/export/starexec/sandbox2/tmp/tmp.4N5yuMKbHB/E---3.1_5068.p', cTHM269_pme)).
% 0.21/0.50 thf(c_0_1, negated_conjecture, ~(![X1:a > $o, X2:a > $o, X3:a > $o]:(((![X4:a]:((((X1 @ X4)&~((X3 @ X4)))=>(X2 @ X4)))&((^[Z0/* 8 */:a]:((X3 @ Z0&~(X2 @ Z0))))=(^[Z0/* 7 */:a]:(~($true)))))=>![X4:a]:(((X1 @ X4)=>(X2 @ X4)))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM269_pme])])).
% 0.21/0.50 thf(c_0_2, negated_conjecture, ![X13:a]:((((~(epred1_0 @ X13)|(epred3_0 @ X13)|(epred2_0 @ X13))&((^[Z0/* 8 */:a]:((epred3_0 @ Z0&~(epred2_0 @ Z0))))=(^[Z0/* 7 */:a]:(~($true)))))&((epred1_0 @ esk1_0)&~(epred2_0 @ esk1_0)))), 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.21/0.50 thf(c_0_3, negated_conjecture, ((^[Z0/* 8 */:a]:(((epred3_0 @ Z0)&~((epred2_0 @ Z0)))))=(^[Z0/* 7 */:a]:(~(($true))))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.21/0.50 thf(c_0_4, negated_conjecture, ((^[Z0/* 8 */:a]:(((epred3_0 @ Z0)&~((epred2_0 @ Z0)))))=(^[Z0/* 4 */:a]:(~($true)))), inference(cn,[status(thm)],[c_0_3])).
% 0.21/0.50 thf(c_0_5, negated_conjecture, ![X15:a]:(~(((epred3_0 @ X15)&~((epred2_0 @ X15))))), inference(arg_cong,[status(thm)],[c_0_4])).
% 0.21/0.50 thf(c_0_6, negated_conjecture, ![X4:a]:(((epred2_0 @ X4)|~((epred3_0 @ X4)))), inference(dynamic_cnf,[status(thm)],[c_0_5])).
% 0.21/0.50 thf(c_0_7, negated_conjecture, ![X4:a]:(((epred3_0 @ X4)|(epred2_0 @ X4)|~((epred1_0 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.21/0.50 thf(c_0_8, negated_conjecture, ![X4:a]:(((epred2_0 @ X4)|~((epred1_0 @ X4)))), inference(spm,[status(thm)],[c_0_6, c_0_7])).
% 0.21/0.50 thf(c_0_9, negated_conjecture, (epred1_0 @ esk1_0), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.21/0.50 thf(c_0_10, negated_conjecture, ~((epred2_0 @ esk1_0)), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.21/0.50 thf(c_0_11, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8, c_0_9]), c_0_10]), ['proof']).
% 0.21/0.50 # SZS output end CNFRefutation
% 0.21/0.50 # Parsed axioms : 2
% 0.21/0.50 # Removed by relevancy pruning/SinE : 1
% 0.21/0.50 # Initial clauses : 4
% 0.21/0.50 # Removed in clause preprocessing : 0
% 0.21/0.50 # Initial clauses in saturation : 4
% 0.21/0.50 # Processed clauses : 11
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 0
% 0.21/0.50 # ...remaining for further processing : 11
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 1
% 0.21/0.50 # Backward-rewritten : 0
% 0.21/0.50 # Generated clauses : 4
% 0.21/0.50 # ...of the previous two non-redundant : 3
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 0
% 0.21/0.50 # Paramodulations : 2
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Disequality decompositions : 0
% 0.21/0.50 # Total rewrite steps : 0
% 0.21/0.50 # ...of those cached : 0
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 5
% 0.21/0.50 # Positive orientable unit clauses : 2
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 1
% 0.21/0.50 # Non-unit-clauses : 2
% 0.21/0.50 # Current number of unprocessed clauses: 0
% 0.21/0.50 # ...number of literals in the above : 0
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 6
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 3
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 3
% 0.21/0.50 # Non-unit clause-clause subsumptions : 1
% 0.21/0.50 # Unit Clause-clause subsumption calls : 0
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 0
% 0.21/0.50 # BW rewrite match successes : 0
% 0.21/0.50 # Condensation attempts : 11
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 505
% 0.21/0.50 # Search garbage collected termcells : 154
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.003 s
% 0.21/0.50 # System time : 0.000 s
% 0.21/0.50 # Total time : 0.003 s
% 0.21/0.50 # Maximum resident set size: 1776 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.005 s
% 0.21/0.50 # System time : 0.001 s
% 0.21/0.50 # Total time : 0.005 s
% 0.21/0.50 # Maximum resident set size: 1720 pages
% 0.21/0.50 % E---3.1 exiting
% 0.21/0.50 % E exiting
%------------------------------------------------------------------------------