TSTP Solution File: SEV223^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV223^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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.19s 0.47s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEV223^5 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n014.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun May 19 18:25:52 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.19/0.46 Running higher-order theorem proving
% 0.19/0.46 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.19/0.47 # Version: 3.1.0-ho
% 0.19/0.47 # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.19/0.47 # Starting post_as_ho10 with 300s (1) cores
% 0.19/0.47 # Starting new_bool_9 with 300s (1) cores
% 0.19/0.47 # Starting sh5l with 300s (1) cores
% 0.19/0.47 # new_bool_9 with pid 14875 completed with status 0
% 0.19/0.47 # Result found by new_bool_9
% 0.19/0.47 # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.19/0.47 # Starting post_as_ho10 with 300s (1) cores
% 0.19/0.47 # Starting new_bool_9 with 300s (1) cores
% 0.19/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.19/0.47 # Search class: HUUPF-FFSF11-DSSFFFNN
% 0.19/0.47 # partial match(1): HUUPF-FFSF11-MSSFFFNN
% 0.19/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.47 # Starting new_ho_10 with 181s (1) cores
% 0.19/0.47 # new_ho_10 with pid 14879 completed with status 0
% 0.19/0.47 # Result found by new_ho_10
% 0.19/0.47 # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.19/0.47 # Starting post_as_ho10 with 300s (1) cores
% 0.19/0.47 # Starting new_bool_9 with 300s (1) cores
% 0.19/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.19/0.47 # Search class: HUUPF-FFSF11-DSSFFFNN
% 0.19/0.47 # partial match(1): HUUPF-FFSF11-MSSFFFNN
% 0.19/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.47 # Starting new_ho_10 with 181s (1) cores
% 0.19/0.47 # Preprocessing time : 0.001 s
% 0.19/0.47 # Presaturation interreduction done
% 0.19/0.47
% 0.19/0.47 # Proof found!
% 0.19/0.47 # SZS status Theorem
% 0.19/0.47 # SZS output start CNFRefutation
% 0.19/0.47 thf(decl_sort1, type, b: $tType).
% 0.19/0.47 thf(decl_sort2, type, a: $tType).
% 0.19/0.47 thf(decl_22, type, f: b > a).
% 0.19/0.47 thf(decl_23, type, w: (b > $o) > $o).
% 0.19/0.47 thf(decl_24, type, esk1_0: a).
% 0.19/0.47 thf(decl_25, type, epred1_0: a > $o).
% 0.19/0.47 thf(decl_26, type, epred2_0: b > $o).
% 0.19/0.47 thf(decl_27, type, esk2_0: b).
% 0.19/0.47 thf(decl_28, type, epred3_0: b > $o).
% 0.19/0.47 thf(decl_29, type, esk3_1: a > b).
% 0.19/0.47 thf(decl_30, type, esk4_1: a > b).
% 0.19/0.47 thf(decl_31, type, esk5_1: a > b).
% 0.19/0.47 thf(cX5204_pme, conjecture, ((^[X1:a]:(?[X2:b]:((?[X3:b > $o]:(((w @ X3)&(X3 @ X2)))&((X1)=(f @ X2))))))=(^[X4:a]:(?[X5:a > $o]:((?[X6:b > $o]:(((w @ X6)&((X5)=(^[X1:a]:(?[X7:b]:(((X6 @ X7)&((X1)=(f @ X7)))))))))&(X5 @ X4)))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', cX5204_pme)).
% 0.19/0.47 thf(c_0_1, negated_conjecture, ((^[Z0/* 5 */:a]:(?[X2:b]:((?[X3:b > $o]:(((w @ X3)&X3 @ X2))&((Z0)=(f @ X2))))))!=(^[Z0/* 5 */:a]:(?[X5:a > $o]:((?[X6:b > $o]:(((w @ X6)&((X5)=(^[Z1/* 5 */:a]:(?[X7:b]:((X6 @ X7&((Z1)=(f @ X7)))))))))&X5 @ Z0))))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cX5204_pme])])])).
% 0.19/0.47 thf(c_0_2, negated_conjecture, ((^[Z0/* 5 */:a]:(?[X2:b]:((?[X3:b > $o]:(((w @ X3)&X3 @ X2))&((Z0)=(f @ X2))))))!=(^[Z0/* 5 */:a]:(?[X5:a > $o]:((?[X6:b > $o]:(((w @ X6)&((X5)=(^[Z1/* 5 */:a]:(?[X7:b]:((X6 @ X7&((Z1)=(f @ X7)))))))))&X5 @ Z0))))), inference(fof_nnf,[status(thm)],[c_0_1])).
% 0.19/0.47 thf(c_0_3, negated_conjecture, ((^[Z0/* 5 */:a]:(?[X44:b]:((?[X45:b > $o]:(((w @ X45)&(X45 @ X44)))&((Z0)=(f @ X44))))))!=(^[Z0/* 5 */:a]:(?[X46:a > $o]:((?[X47:b > $o]:(((w @ X47)&((X46)=(^[Z1/* 5 */:a]:(?[X48:b]:(((X47 @ X48)&((Z1)=(f @ X48)))))))))&(X46 @ Z0)))))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.19/0.47 thf(c_0_4, negated_conjecture, (?[X49:a > $o]:((?[X50:b > $o]:(((w @ X50)&((X49)=(^[Z0/* 5 */:a]:(?[X51:b]:(((X50 @ X51)&((Z0)=(f @ X51)))))))))&(X49 @ esk1_0)))<~>?[X52:b]:((?[X53:b > $o]:(((w @ X53)&(X53 @ X52)))&((esk1_0)=(f @ X52))))), inference(neg_ext,[status(thm)],[c_0_3])).
% 0.19/0.47 thf(c_0_5, negated_conjecture, ![X6:b > $o, X3:b > $o, X2:b]:((((f @ X2)!=(esk1_0))|~(?[X54:b]:(((X3 @ X54)&((esk1_0)=(f @ X54)))))|~((w @ X3))|~((w @ X6))|~((X6 @ X2)))), inference(er,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_4])])).
% 0.19/0.47 thf(c_0_6, negated_conjecture, (((^[Z0/* 5 */:a]:(?[X55:b]:(((epred2_0 @ X55)&((Z0)=(f @ X55))))))=(epred1_0))|((f @ esk2_0)=(esk1_0))), inference(dynamic_cnf,[status(thm)],[c_0_4])).
% 0.19/0.47 thf(c_0_7, negated_conjecture, ![X3:b > $o, X2:b]:((((f @ X2)!=(esk1_0))|~((w @ X3))|~((X3 @ X2)))), inference(condense,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_5])])).
% 0.19/0.47 thf(c_0_8, negated_conjecture, (((f @ esk2_0)=(esk1_0))|(epred1_0 @ esk1_0)), inference(dynamic_cnf,[status(thm)],[c_0_4])).
% 0.19/0.47 thf(c_0_9, negated_conjecture, (((^[Z0/* 5 */:a]:(?[X56:b]:(((epred2_0 @ X56)&((Z0)=(f @ X56))))))=(epred1_0))|(w @ epred3_0)), inference(dynamic_cnf,[status(thm)],[c_0_4])).
% 0.19/0.47 thf(c_0_10, negated_conjecture, (((^[Z0/* 5 */:a]:(?[X57:b]:(((epred2_0 @ X57)&((Z0)=(f @ X57))))))=(epred1_0))|(epred3_0 @ esk2_0)), inference(dynamic_cnf,[status(thm)],[c_0_4])).
% 0.19/0.47 thf(c_0_11, negated_conjecture, ![X21:a]:(((?[X58:b]:(((epred2_0 @ X58)&((X21)=(f @ X58))))<=>(epred1_0 @ X21))|((f @ esk2_0)=(esk1_0)))), inference(arg_cong,[status(thm)],[c_0_6])).
% 0.19/0.47 thf(c_0_12, negated_conjecture, ![X3:b > $o]:(((epred1_0 @ esk1_0)|~((w @ X3))|~((X3 @ esk2_0)))), inference(spm,[status(thm)],[c_0_7, c_0_8])).
% 0.19/0.47 thf(c_0_13, negated_conjecture, ((epred1_0 @ esk1_0)|(w @ epred3_0)), inference(dynamic_cnf,[status(thm)],[c_0_4])).
% 0.19/0.47 thf(c_0_14, negated_conjecture, ((epred1_0 @ esk1_0)|(epred3_0 @ esk2_0)), inference(dynamic_cnf,[status(thm)],[c_0_4])).
% 0.19/0.47 thf(c_0_15, negated_conjecture, ![X27:a]:(((?[X59:b]:(((epred2_0 @ X59)&((X27)=(f @ X59))))<=>(epred1_0 @ X27))|(w @ epred3_0))), inference(arg_cong,[status(thm)],[c_0_9])).
% 0.19/0.47 thf(c_0_16, negated_conjecture, ![X28:a]:(((?[X60:b]:(((epred2_0 @ X60)&((X28)=(f @ X60))))<=>(epred1_0 @ X28))|(epred3_0 @ esk2_0))), inference(arg_cong,[status(thm)],[c_0_10])).
% 0.19/0.47 thf(c_0_17, negated_conjecture, ![X1:a]:((((f @ esk2_0)=(esk1_0))|((f @ (esk3_1 @ X1))=(X1))|~((epred1_0 @ X1)))), inference(dynamic_cnf,[status(thm)],[c_0_11])).
% 0.19/0.47 thf(c_0_18, negated_conjecture, (epred1_0 @ esk1_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13]), c_0_14])).
% 0.19/0.47 thf(c_0_19, negated_conjecture, ![X1:a]:((((f @ esk2_0)=(esk1_0))|(epred2_0 @ (esk3_1 @ X1))|~((epred1_0 @ X1)))), inference(dynamic_cnf,[status(thm)],[c_0_11])).
% 0.19/0.47 thf(c_0_20, negated_conjecture, ![X1:a]:((((f @ (esk4_1 @ X1))=(X1))|(w @ epred3_0)|~((epred1_0 @ X1)))), inference(dynamic_cnf,[status(thm)],[c_0_15])).
% 0.19/0.47 thf(c_0_21, negated_conjecture, ![X1:a]:((((f @ (esk5_1 @ X1))=(X1))|(epred3_0 @ esk2_0)|~((epred1_0 @ X1)))), inference(dynamic_cnf,[status(thm)],[c_0_16])).
% 0.19/0.47 thf(c_0_22, negated_conjecture, ![X3:b > $o]:((((f @ esk2_0)=(esk1_0))|~((X3 @ (esk3_1 @ esk1_0)))|~((w @ X3)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_7, c_0_17])]), c_0_18])])).
% 0.19/0.47 thf(c_0_23, negated_conjecture, (((f @ esk2_0)=(esk1_0))|(w @ epred2_0)), inference(dynamic_cnf,[status(thm)],[c_0_4])).
% 0.19/0.47 thf(c_0_24, negated_conjecture, (((f @ esk2_0)=(esk1_0))|(epred2_0 @ (esk3_1 @ esk1_0))), inference(spm,[status(thm)],[c_0_19, c_0_18])).
% 0.19/0.47 thf(c_0_25, negated_conjecture, ![X3:b > $o]:(((w @ epred3_0)|~((X3 @ (esk4_1 @ esk1_0)))|~((w @ X3)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_7, c_0_20])]), c_0_18])])).
% 0.19/0.47 thf(c_0_26, negated_conjecture, ((w @ epred2_0)|(w @ epred3_0)), inference(dynamic_cnf,[status(thm)],[c_0_4])).
% 0.19/0.47 thf(c_0_27, negated_conjecture, ![X3:b > $o]:(((epred3_0 @ esk2_0)|~((X3 @ (esk5_1 @ esk1_0)))|~((w @ X3)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_7, c_0_21])]), c_0_18])])).
% 0.19/0.47 thf(c_0_28, negated_conjecture, ((w @ epred2_0)|(epred3_0 @ esk2_0)), inference(dynamic_cnf,[status(thm)],[c_0_4])).
% 0.19/0.47 thf(c_0_29, negated_conjecture, ((f @ esk2_0)=(esk1_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_23]), c_0_24])).
% 0.19/0.47 thf(c_0_30, negated_conjecture, ![X1:a]:(((epred2_0 @ (esk4_1 @ X1))|(w @ epred3_0)|~((epred1_0 @ X1)))), inference(dynamic_cnf,[status(thm)],[c_0_15])).
% 0.19/0.47 thf(c_0_31, negated_conjecture, ((w @ epred3_0)|~((epred2_0 @ (esk4_1 @ esk1_0)))), inference(spm,[status(thm)],[c_0_25, c_0_26])).
% 0.19/0.47 thf(c_0_32, negated_conjecture, ((epred3_0 @ esk2_0)|~((epred2_0 @ (esk5_1 @ esk1_0)))), inference(spm,[status(thm)],[c_0_27, c_0_28])).
% 0.19/0.47 thf(c_0_33, negated_conjecture, ![X1:a]:(((epred2_0 @ (esk5_1 @ X1))|(epred3_0 @ esk2_0)|~((epred1_0 @ X1)))), inference(dynamic_cnf,[status(thm)],[c_0_16])).
% 0.19/0.47 thf(c_0_34, negated_conjecture, ![X3:b > $o]:((~((w @ X3))|~((X3 @ esk2_0)))), inference(spm,[status(thm)],[c_0_7, c_0_29])).
% 0.19/0.47 thf(c_0_35, negated_conjecture, (w @ epred3_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_18]), c_0_31])).
% 0.19/0.47 thf(c_0_36, negated_conjecture, (epred3_0 @ esk2_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32, c_0_33]), c_0_18])])).
% 0.19/0.47 thf(c_0_37, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34, c_0_35]), c_0_36])]), ['proof']).
% 0.19/0.47 # SZS output end CNFRefutation
% 0.19/0.47 # Parsed axioms : 5
% 0.19/0.47 # Removed by relevancy pruning/SinE : 4
% 0.19/0.47 # Initial clauses : 1
% 0.19/0.47 # Removed in clause preprocessing : 0
% 0.19/0.47 # Initial clauses in saturation : 1
% 0.19/0.47 # Processed clauses : 43
% 0.19/0.47 # ...of these trivial : 1
% 0.19/0.47 # ...subsumed : 0
% 0.19/0.47 # ...remaining for further processing : 41
% 0.19/0.47 # Other redundant clauses eliminated : 7
% 0.19/0.47 # Clauses deleted for lack of memory : 0
% 0.19/0.47 # Backward-subsumed : 5
% 0.19/0.47 # Backward-rewritten : 22
% 0.19/0.47 # Generated clauses : 72
% 0.19/0.47 # ...of the previous two non-redundant : 57
% 0.19/0.47 # ...aggressively subsumed : 0
% 0.19/0.47 # Contextual simplify-reflections : 4
% 0.19/0.47 # Paramodulations : 41
% 0.19/0.47 # Factorizations : 0
% 0.19/0.47 # NegExts : 1
% 0.19/0.47 # Equation resolutions : 7
% 0.19/0.47 # Disequality decompositions : 0
% 0.19/0.47 # Total rewrite steps : 33
% 0.19/0.47 # ...of those cached : 29
% 0.19/0.47 # Propositional unsat checks : 0
% 0.19/0.47 # Propositional check models : 0
% 0.19/0.47 # Propositional check unsatisfiable : 0
% 0.19/0.47 # Propositional clauses : 0
% 0.19/0.47 # Propositional clauses after purity: 0
% 0.19/0.47 # Propositional unsat core size : 0
% 0.19/0.47 # Propositional preprocessing time : 0.000
% 0.19/0.47 # Propositional encoding time : 0.000
% 0.19/0.47 # Propositional solver time : 0.000
% 0.19/0.47 # Success case prop preproc time : 0.000
% 0.19/0.47 # Success case prop encoding time : 0.000
% 0.19/0.47 # Success case prop solver time : 0.000
% 0.19/0.47 # Current number of processed clauses : 8
% 0.19/0.47 # Positive orientable unit clauses : 4
% 0.19/0.47 # Positive unorientable unit clauses: 0
% 0.19/0.47 # Negative unit clauses : 1
% 0.19/0.47 # Non-unit-clauses : 3
% 0.19/0.47 # Current number of unprocessed clauses: 2
% 0.19/0.47 # ...number of literals in the above : 3
% 0.19/0.47 # Current number of archived formulas : 0
% 0.19/0.47 # Current number of archived clauses : 33
% 0.19/0.47 # Clause-clause subsumption calls (NU) : 55
% 0.19/0.47 # Rec. Clause-clause subsumption calls : 40
% 0.19/0.47 # Non-unit clause-clause subsumptions : 6
% 0.19/0.47 # Unit Clause-clause subsumption calls : 6
% 0.19/0.47 # Rewrite failures with RHS unbound : 0
% 0.19/0.47 # BW rewrite match attempts : 4
% 0.19/0.47 # BW rewrite match successes : 4
% 0.19/0.47 # Condensation attempts : 43
% 0.19/0.47 # Condensation successes : 1
% 0.19/0.47 # Termbank termtop insertions : 2945
% 0.19/0.47 # Search garbage collected termcells : 29
% 0.19/0.47
% 0.19/0.47 # -------------------------------------------------
% 0.19/0.47 # User time : 0.007 s
% 0.19/0.47 # System time : 0.001 s
% 0.19/0.47 # Total time : 0.009 s
% 0.19/0.47 # Maximum resident set size: 1828 pages
% 0.19/0.47
% 0.19/0.47 # -------------------------------------------------
% 0.19/0.47 # User time : 0.008 s
% 0.19/0.47 # System time : 0.004 s
% 0.19/0.47 # Total time : 0.012 s
% 0.19/0.47 # Maximum resident set size: 1724 pages
% 0.19/0.47 % E---3.1 exiting
% 0.19/0.48 % E exiting
%------------------------------------------------------------------------------