TSTP Solution File: SEV222^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV222^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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:01 EDT 2024
% Result : Theorem 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SEV222^5 : TPTP v8.2.0. Released v4.0.0.
% 0.08/0.13 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n025.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 19 18:38:53 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running higher-order theorem proving
% 0.21/0.50 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/benchmark/theBenchmark.p
% 0.21/0.51 # Version: 3.1.0-ho
% 0.21/0.51 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.21/0.51 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting post_as_ho12 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_9 with 300s (1) cores
% 0.21/0.51 # Starting post_as_ho1 with 300s (1) cores
% 0.21/0.51 # Starting post_as_ho4 with 300s (1) cores
% 0.21/0.51 # Starting post_as_ho2 with 300s (1) cores
% 0.21/0.51 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.21/0.51 # Starting full_lambda_10 with 300s (1) cores
% 0.21/0.51 # Starting new_ho_8 with 300s (1) cores
% 0.21/0.51 # new_bool_9 with pid 25168 completed with status 0
% 0.21/0.51 # Result found by new_bool_9
% 0.21/0.51 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.21/0.51 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting post_as_ho12 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_9 with 300s (1) cores
% 0.21/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.21/0.51 # Search class: HGHSF-FFSF00-MSSFFSBN
% 0.21/0.51 # partial match(1): HGHSF-FFSF00-SSSFFSBN
% 0.21/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting ho_unfolding_3 with 163s (1) cores
% 0.21/0.51 # ho_unfolding_3 with pid 25176 completed with status 0
% 0.21/0.51 # Result found by ho_unfolding_3
% 0.21/0.51 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.21/0.51 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting post_as_ho12 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_9 with 300s (1) cores
% 0.21/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.21/0.51 # Search class: HGHSF-FFSF00-MSSFFSBN
% 0.21/0.51 # partial match(1): HGHSF-FFSF00-SSSFFSBN
% 0.21/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting ho_unfolding_3 with 163s (1) cores
% 0.21/0.51 # Preprocessing time : 0.001 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Theorem
% 0.21/0.51 # SZS output start CNFRefutation
% 0.21/0.51 thf(decl_sort1, type, a: $tType).
% 0.21/0.51 thf(decl_22, type, cZ: a > $o).
% 0.21/0.51 thf(decl_23, type, cW: (a > $o) > $o).
% 0.21/0.51 thf(decl_24, type, esk1_0: a).
% 0.21/0.51 thf(decl_25, type, epred1_0: a > $o).
% 0.21/0.51 thf(decl_26, type, epred2_0: a > $o).
% 0.21/0.51 thf(decl_27, type, epred3_0: a > $o).
% 0.21/0.51 thf(cTHM60_pme, conjecture, ![X1:a]:(((![X2:a > $o]:(((cW @ X2)=>(X2 @ X1)))|(cZ @ X1))<=>![X2:a > $o]:((?[X3:a > $o]:(((cW @ X3)&((X2)=(^[X4:a]:(((cZ @ X4)|(X3 @ X4)))))))=>(X2 @ X1))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cTHM60_pme)).
% 0.21/0.51 thf(c_0_1, negated_conjecture, ~(![X1:a]:(((![X2:a > $o]:(((cW @ X2)=>(X2 @ X1)))|(cZ @ X1))<=>![X2:a > $o]:((?[X3:a > $o]:(((cW @ X3)&((X2)=(^[Z0/* 9 */:a]:(((cZ @ Z0)|X3 @ Z0))))))=>(X2 @ X1)))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM60_pme])])).
% 0.21/0.51 thf(c_0_2, negated_conjecture, ![X13:a > $o, X14:a > $o, X15:a > $o]:((((((((cW @ epred3_0)|(cW @ epred1_0))&(((epred2_0)=(^[Z0/* 9 */:a]:(((cZ @ Z0)|epred3_0 @ Z0))))|(cW @ epred1_0)))&(~(epred2_0 @ esk1_0)|(cW @ epred1_0)))&((((cW @ epred3_0)|~(epred1_0 @ esk1_0))&(((epred2_0)=(^[Z0/* 9 */:a]:(((cZ @ Z0)|epred3_0 @ Z0))))|~(epred1_0 @ esk1_0)))&(~(epred2_0 @ esk1_0)|~(epred1_0 @ esk1_0))))&((((cW @ epred3_0)|~(cZ @ esk1_0))&(((epred2_0)=(^[Z0/* 9 */:a]:(((cZ @ Z0)|epred3_0 @ Z0))))|~(cZ @ esk1_0)))&(~(epred2_0 @ esk1_0)|~(cZ @ esk1_0))))&(~(cW @ X13)|(X13 @ esk1_0)|(cZ @ esk1_0)|(~(cW @ X15)|((X14)!=(^[Z0/* 9 */:a]:(((cZ @ Z0)|X15 @ Z0))))|(X14 @ esk1_0))))), 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.21/0.51 thf(c_0_3, negated_conjecture, ![X2:a > $o, X6:a > $o, X3:a > $o]:(((X2 @ esk1_0)|(cZ @ esk1_0)|(X6 @ esk1_0)|~((cW @ X2))|~((cW @ X3))|((X6)!=(^[Z0/* 9 */:a]:(((cZ @ Z0)|(X3 @ Z0))))))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.21/0.51 thf(c_0_4, negated_conjecture, ![X3:a > $o, X2:a > $o]:(((cZ @ esk1_0)|(X3 @ esk1_0)|(cZ @ esk1_0)|(X2 @ esk1_0)|~((cW @ X3))|~((cW @ X2)))), inference(er,[status(thm)],[c_0_3])).
% 0.21/0.51 thf(c_0_5, negated_conjecture, (((epred2_0)=(^[Z0/* 9 */:a]:(((cZ @ Z0)|(epred3_0 @ Z0)))))|~((cZ @ esk1_0))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.21/0.51 thf(c_0_6, negated_conjecture, ![X2:a > $o]:(((cZ @ esk1_0)|(X2 @ esk1_0)|~((cW @ X2)))), inference(condense,[status(thm)],[inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_4])])])).
% 0.21/0.51 thf(c_0_7, negated_conjecture, ((cW @ epred1_0)|~((epred2_0 @ esk1_0))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.21/0.51 thf(c_0_8, negated_conjecture, (~((epred2_0 @ esk1_0))|~((epred1_0 @ esk1_0))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.21/0.51 thf(c_0_9, negated_conjecture, (~((epred2_0 @ esk1_0))|~((cZ @ esk1_0))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.21/0.51 thf(c_0_10, negated_conjecture, ![X18:a]:(((((cZ @ X18)|(epred3_0 @ X18))<=>(epred2_0 @ X18))|~((cZ @ esk1_0)))), inference(arg_cong,[status(thm)],[c_0_5])).
% 0.21/0.51 thf(c_0_11, negated_conjecture, (((epred2_0)=(^[Z0/* 9 */:a]:(((cZ @ Z0)|(epred3_0 @ Z0)))))|(cW @ epred1_0)), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.21/0.51 thf(c_0_12, negated_conjecture, ((cW @ epred3_0)|(cW @ epred1_0)), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.21/0.51 thf(c_0_13, negated_conjecture, ((cW @ epred3_0)|~((epred1_0 @ esk1_0))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.21/0.51 thf(c_0_14, negated_conjecture, ((cW @ epred3_0)|~((cZ @ esk1_0))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.21/0.51 thf(c_0_15, negated_conjecture, ~((epred2_0 @ esk1_0)), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_6, c_0_7]), c_0_8]), c_0_9])).
% 0.21/0.51 thf(c_0_16, negated_conjecture, ![X1:a]:(((epred2_0 @ X1)|~((cZ @ esk1_0))|~((cZ @ X1)))), inference(dynamic_cnf,[status(thm)],[c_0_10])).
% 0.21/0.51 thf(c_0_17, negated_conjecture, ![X20:a]:(((((cZ @ X20)|(epred3_0 @ X20))<=>(epred2_0 @ X20))|(cW @ epred1_0))), inference(arg_cong,[status(thm)],[c_0_11])).
% 0.21/0.51 thf(c_0_18, negated_conjecture, (cW @ epred3_0), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_6, c_0_12]), c_0_13]), c_0_14])).
% 0.21/0.51 thf(c_0_19, negated_conjecture, ~((cZ @ esk1_0)), inference(spm,[status(thm)],[c_0_15, c_0_16])).
% 0.21/0.51 thf(c_0_20, negated_conjecture, (((epred2_0)=(^[Z0/* 9 */:a]:(((cZ @ Z0)|(epred3_0 @ Z0)))))|~((epred1_0 @ esk1_0))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.21/0.51 thf(c_0_21, negated_conjecture, ![X1:a]:(((cW @ epred1_0)|(epred2_0 @ X1)|~((epred3_0 @ X1)))), inference(dynamic_cnf,[status(thm)],[c_0_17])).
% 0.21/0.51 thf(c_0_22, negated_conjecture, (epred3_0 @ esk1_0), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_6, c_0_18]), c_0_19])).
% 0.21/0.51 thf(c_0_23, negated_conjecture, ![X19:a]:(((((cZ @ X19)|(epred3_0 @ X19))<=>(epred2_0 @ X19))|~((epred1_0 @ esk1_0)))), inference(arg_cong,[status(thm)],[c_0_20])).
% 0.21/0.51 thf(c_0_24, negated_conjecture, (cW @ epred1_0), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_22]), c_0_15])).
% 0.21/0.51 thf(c_0_25, negated_conjecture, ![X1:a]:(((epred2_0 @ X1)|~((epred1_0 @ esk1_0))|~((epred3_0 @ X1)))), inference(dynamic_cnf,[status(thm)],[c_0_23])).
% 0.21/0.51 thf(c_0_26, negated_conjecture, (epred1_0 @ esk1_0), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_6, c_0_24]), c_0_19])).
% 0.21/0.51 thf(c_0_27, negated_conjecture, ![X1:a]:(((epred2_0 @ X1)|~((epred3_0 @ X1)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25, c_0_26])])).
% 0.21/0.51 thf(c_0_28, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_27]), c_0_22])]), ['proof']).
% 0.21/0.51 # SZS output end CNFRefutation
% 0.21/0.51 # Parsed axioms : 4
% 0.21/0.51 # Removed by relevancy pruning/SinE : 3
% 0.21/0.51 # Initial clauses : 10
% 0.21/0.51 # Removed in clause preprocessing : 0
% 0.21/0.51 # Initial clauses in saturation : 10
% 0.21/0.51 # Processed clauses : 45
% 0.21/0.51 # ...of these trivial : 0
% 0.21/0.51 # ...subsumed : 2
% 0.21/0.51 # ...remaining for further processing : 43
% 0.21/0.51 # Other redundant clauses eliminated : 1
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 8
% 0.21/0.51 # Backward-rewritten : 10
% 0.21/0.51 # Generated clauses : 29
% 0.21/0.51 # ...of the previous two non-redundant : 29
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 4
% 0.21/0.51 # Paramodulations : 11
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 1
% 0.21/0.51 # Equation resolutions : 1
% 0.21/0.51 # Disequality decompositions : 0
% 0.21/0.51 # Total rewrite steps : 11
% 0.21/0.51 # ...of those cached : 7
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 9
% 0.21/0.51 # Positive orientable unit clauses : 4
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 2
% 0.21/0.51 # Non-unit-clauses : 3
% 0.21/0.51 # Current number of unprocessed clauses: 4
% 0.21/0.51 # ...number of literals in the above : 12
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 33
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 27
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 21
% 0.21/0.51 # Non-unit clause-clause subsumptions : 5
% 0.21/0.51 # Unit Clause-clause subsumption calls : 9
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 3
% 0.21/0.51 # BW rewrite match successes : 3
% 0.21/0.51 # Condensation attempts : 45
% 0.21/0.51 # Condensation successes : 1
% 0.21/0.51 # Termbank termtop insertions : 1979
% 0.21/0.51 # Search garbage collected termcells : 217
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.005 s
% 0.21/0.51 # System time : 0.001 s
% 0.21/0.51 # Total time : 0.007 s
% 0.21/0.51 # Maximum resident set size: 1724 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.005 s
% 0.21/0.51 # System time : 0.005 s
% 0.21/0.51 # Total time : 0.010 s
% 0.21/0.51 # Maximum resident set size: 1716 pages
% 0.21/0.51 % E---3.1 exiting
% 0.21/0.51 % E exiting
%------------------------------------------------------------------------------