TSTP Solution File: QUA006^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : QUA006^1 : TPTP v8.2.0. Released v4.1.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 02:30:21 EDT 2024
% Result : Theorem 0.19s 0.51s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : QUA006^1 : TPTP v8.2.0. Released v4.1.0.
% 0.04/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 13:37:37 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running higher-order theorem proving
% 0.19/0.47 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.51 # Version: 3.1.0-ho
% 0.19/0.51 # Preprocessing class: HSSSSMSSSLSCHFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.19/0.51 # Starting sh2lt with 300s (1) cores
% 0.19/0.51 # Starting sh5l with 300s (1) cores
% 0.19/0.51 # Starting pre_casc_6 with 300s (1) cores
% 0.19/0.51 # sh2lt with pid 20464 completed with status 0
% 0.19/0.51 # Result found by sh2lt
% 0.19/0.51 # Preprocessing class: HSSSSMSSSLSCHFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.19/0.51 # Starting sh2lt with 300s (1) cores
% 0.19/0.51 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.19/0.51 # Search class: HGUSM-FFSF32-SHFFMSBN
% 0.19/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.51 # Starting ehoh_best2_full_lfho with 181s (1) cores
% 0.19/0.51 # ehoh_best2_full_lfho with pid 20473 completed with status 0
% 0.19/0.51 # Result found by ehoh_best2_full_lfho
% 0.19/0.51 # Preprocessing class: HSSSSMSSSLSCHFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.19/0.51 # Starting sh2lt with 300s (1) cores
% 0.19/0.51 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.19/0.51 # Search class: HGUSM-FFSF32-SHFFMSBN
% 0.19/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.51 # Starting ehoh_best2_full_lfho with 181s (1) cores
% 0.19/0.51 # Preprocessing time : 0.002 s
% 0.19/0.51
% 0.19/0.51 # Proof found!
% 0.19/0.51 # SZS status Theorem
% 0.19/0.51 # SZS output start CNFRefutation
% 0.19/0.51 thf(decl_22, type, emptyset: $i > $o).
% 0.19/0.51 thf(decl_24, type, singleton: $i > $i > $o).
% 0.19/0.51 thf(decl_25, type, zero: $i).
% 0.19/0.51 thf(decl_26, type, sup: ($i > $o) > $i).
% 0.19/0.51 thf(decl_31, type, multiplication: $i > $i > $i).
% 0.19/0.51 thf(decl_32, type, crossmult: ($i > $o) > ($i > $o) > $i > $o).
% 0.19/0.51 thf(decl_34, type, esk1_0: $i).
% 0.19/0.51 thf(decl_35, type, epred1_0: $i > $o).
% 0.19/0.51 thf(decl_36, type, epred2_2: ($i > $o) > ($i > $o) > $i > $o).
% 0.19/0.51 thf(decl_37, type, epred3_1: $i > $i > $o).
% 0.19/0.51 thf(decl_38, type, epred4_1: (($i > $o) > $o) > $i > $o).
% 0.19/0.51 thf(decl_41, type, esk2_3: $i > ($i > $o) > ($i > $o) > $i).
% 0.19/0.51 thf(decl_42, type, esk3_3: $i > ($i > $o) > ($i > $o) > $i).
% 0.19/0.51 thf(decl_43, type, epred7_2: $i > (($i > $o) > $o) > $i > $o).
% 0.19/0.51 thf(decl_67, type, esk26_1: ($i > $o) > $i).
% 0.19/0.51 thf(crossmult_def, axiom, ((crossmult)=(^[X10:$i > $o, X3:$i > $o, X11:$i]:(?[X8:$i, X12:$i]:((((X10 @ X8)&(X3 @ X12))&((X11)=(multiplication @ X8 @ X12))))))), file('/export/starexec/sandbox/benchmark/Axioms/QUA001^0.ax', crossmult_def)).
% 0.19/0.51 thf(multiplication_def, axiom, ![X13:$i > $o, X3:$i > $o]:(((multiplication @ (sup @ X13) @ (sup @ X3))=(sup @ (crossmult @ X13 @ X3)))), file('/export/starexec/sandbox/benchmark/Axioms/QUA001^0.ax', multiplication_def)).
% 0.19/0.51 thf(emptyset_def, axiom, ((emptyset)=(^[X1:$i]:(~($true)))), file('/export/starexec/sandbox/benchmark/Axioms/QUA001^0.ax', emptyset_def)).
% 0.19/0.51 thf(sup_es, axiom, ((sup @ emptyset)=(zero)), file('/export/starexec/sandbox/benchmark/Axioms/QUA001^0.ax', sup_es)).
% 0.19/0.51 thf(singleton_def, axiom, ((singleton)=(^[X1:$i, X4:$i]:(((X4)=(X1))))), file('/export/starexec/sandbox/benchmark/Axioms/QUA001^0.ax', singleton_def)).
% 0.19/0.51 thf(sup_singleset, axiom, ![X1:$i]:(((sup @ (singleton @ X1))=(X1))), file('/export/starexec/sandbox/benchmark/Axioms/QUA001^0.ax', sup_singleset)).
% 0.19/0.51 thf(multiplication_anni, conjecture, ![X8:$i]:(((multiplication @ zero @ X8)=(zero))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', multiplication_anni)).
% 0.19/0.51 thf(c_0_7, plain, ((crossmult)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o, Z2:$i]:(?[X8:$i, X12:$i]:((((Z0 @ X8)&(Z1 @ X12))&((Z2)=(multiplication @ X8 @ X12))))))), inference(fof_simplification,[status(thm)],[crossmult_def])).
% 0.19/0.51 thf(c_0_8, plain, ![X13:$i > $o, X3:$i > $o]:(((multiplication @ (sup @ X13) @ (sup @ X3))=(sup @ (^[Z0/* 5 */:$i]:(?[X23:$i, X24:$i]:(((X13 @ X23&X3 @ X24)&((Z0)=(multiplication @ X23 @ X24))))))))), inference(apply_def,[status(thm)],[multiplication_def, c_0_7])).
% 0.19/0.51 thf(c_0_9, plain, ((emptyset)=(^[Z0/* 4 */:$i]:(~($true)))), inference(fof_simplification,[status(thm)],[emptyset_def])).
% 0.19/0.51 thf(c_0_10, plain, ![X28:$i > $o, X29:$i > $o]:(((multiplication @ (sup @ X28) @ (sup @ X29))=(sup @ (^[Z0/* 5 */:$i]:(?[X23:$i, X24:$i]:(((X28 @ X23&X29 @ X24)&((Z0)=(multiplication @ X23 @ X24))))))))), inference(variable_rename,[status(thm)],[c_0_8])).
% 0.19/0.51 thf(c_0_11, plain, ![X39:$i, X2:$i > $o, X3:$i > $o]:(((epred2_2 @ X3 @ X2 @ X39)<=>?[X37:$i, X38:$i]:((((X2 @ X37)&(X3 @ X38))&((X39)=(multiplication @ X37 @ X38)))))), introduced(definition)).
% 0.19/0.51 thf(c_0_12, plain, ((sup @ (^[Z0/* 7 */:$i]:(~($true))))=(zero)), inference(apply_def,[status(thm)],[sup_es, c_0_9])).
% 0.19/0.51 thf(c_0_13, plain, ![X36:$i]:(((epred1_0 @ X36)<=>~(($true)))), introduced(definition)).
% 0.19/0.51 thf(c_0_14, plain, ![X3:$i > $o, X2:$i > $o]:(((multiplication @ (sup @ X2) @ (sup @ X3))=(sup @ (epred2_2 @ X3 @ X2)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_10]), c_0_11])).
% 0.19/0.51 thf(c_0_15, plain, ((sup @ epred1_0)=(zero)), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_12]), c_0_13])).
% 0.19/0.51 thf(c_0_16, plain, ![X57:$i, X58:($i > $o) > $o, X60:$i, X61:($i > $o) > $o, X62:$i > $o]:(((((X58 @ (epred7_2 @ X57 @ X58))|~(epred4_1 @ X58 @ X57))&(((sup @ (epred7_2 @ X57 @ X58))=(X57))|~(epred4_1 @ X58 @ X57)))&(~(X61 @ X62)|((sup @ X62)!=(X60))|(epred4_1 @ X61 @ X60)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])])])])])).
% 0.19/0.51 thf(c_0_17, plain, ((singleton)=(^[Z0/* 19 */:$i, Z1:$i]:((Z1)))), inference(fof_simplification,[status(thm)],[singleton_def])).
% 0.19/0.51 thf(c_0_18, plain, ![X2:$i > $o]:(((sup @ (epred2_2 @ X2 @ epred1_0))=(multiplication @ zero @ (sup @ X2)))), inference(spm,[status(thm)],[c_0_14, c_0_15])).
% 0.19/0.51 thf(c_0_19, plain, ![X47:$i]:(((~(epred1_0 @ X47)|~($true))&(($true)|(epred1_0 @ X47)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])).
% 0.19/0.51 thf(c_0_20, plain, ![X5:($i > $o) > $o, X2:$i > $o, X1:$i]:(((epred4_1 @ X5 @ X1)|~((X5 @ X2))|((sup @ X2)!=(X1)))), inference(split_conjunct,[status(thm)],[c_0_16])).
% 0.19/0.51 thf(c_0_21, plain, ![X1:$i]:(((sup @ (^[Z0/* 3 */:$i]:(((Z0)=(X1)))))=(X1))), inference(apply_def,[status(thm)],[sup_singleset, c_0_17])).
% 0.19/0.51 thf(c_0_22, plain, ![X2:$i > $o]:((((multiplication @ zero @ (sup @ X2))=(zero))|((epred2_2 @ X2 @ epred1_0)!=(epred1_0)))), inference(ext_sup,[status(thm)],[c_0_15, c_0_18])).
% 0.19/0.51 thf(c_0_23, plain, ![X1:$i]:((~((epred1_0 @ X1))|~(($true)))), inference(split_conjunct,[status(thm)],[c_0_19])).
% 0.19/0.51 thf(c_0_24, plain, ![X5:($i > $o) > $o, X2:$i > $o]:(((epred4_1 @ X5 @ (sup @ X2))|~((X5 @ X2)))), inference(er,[status(thm)],[c_0_20])).
% 0.19/0.51 thf(c_0_25, plain, ![X32:$i]:(((sup @ (^[Z0/* 3 */:$i]:(((Z0)=(X32)))))=(X32))), inference(variable_rename,[status(thm)],[c_0_21])).
% 0.19/0.51 thf(c_0_26, plain, ![X40:$i, X1:$i]:(((epred3_1 @ X1 @ X40)<=>((X40)=(X1)))), introduced(definition)).
% 0.19/0.51 thf(c_0_27, plain, ![X48:$i, X49:$i > $o, X50:$i > $o, X53:$i, X54:$i]:((((((X49 @ (esk2_3 @ X48 @ X49 @ X50))|~(epred2_2 @ X50 @ X49 @ X48))&((X50 @ (esk3_3 @ X48 @ X49 @ X50))|~(epred2_2 @ X50 @ X49 @ X48)))&(((X48)=(multiplication @ (esk2_3 @ X48 @ X49 @ X50) @ (esk3_3 @ X48 @ X49 @ X50)))|~(epred2_2 @ X50 @ X49 @ X48)))&(~(X49 @ X53)|~(X50 @ X54)|((X48)!=(multiplication @ X53 @ X54))|(epred2_2 @ X50 @ X49 @ X48)))), 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)],[])])])])])])).
% 0.19/0.51 thf(c_0_28, plain, ![X2:$i > $o]:((((multiplication @ zero @ (sup @ X2))=(zero))|((epred2_2 @ X2 @ epred1_0 @ (esk26_1 @ X2))<~>(epred1_0 @ (esk26_1 @ X2))))), inference(neg_ext,[status(thm)],[c_0_22])).
% 0.19/0.51 thf(c_0_29, plain, ![X1:$i]:(~((epred1_0 @ X1))), inference(cn,[status(thm)],[c_0_23])).
% 0.19/0.51 thf(c_0_30, plain, ![X2:$i > $o]:((epred4_1 @ (^[Z0/* 3 */:$i > $o]:(($true))) @ (sup @ X2))), inference(primitive_enumeration,[status(thm)],[c_0_24])).
% 0.19/0.51 thf(c_0_31, plain, ![X1:$i]:(((sup @ (epred3_1 @ X1))=(X1))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_25]), c_0_26])).
% 0.19/0.51 thf(c_0_32, negated_conjecture, ~(![X8:$i]:(((multiplication @ zero @ X8)=(zero)))), inference(assume_negation,[status(cth)],[multiplication_anni])).
% 0.19/0.51 thf(c_0_33, plain, ![X3:$i > $o, X2:$i > $o, X1:$i]:(((X2 @ (esk2_3 @ X1 @ X2 @ X3))|~((epred2_2 @ X3 @ X2 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_27])).
% 0.19/0.51 thf(c_0_34, plain, ![X2:$i > $o]:((((multiplication @ zero @ (sup @ X2))=(zero))|(epred2_2 @ X2 @ epred1_0 @ (esk26_1 @ X2)))), inference(sr,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_28]), c_0_29])).
% 0.19/0.51 thf(c_0_35, plain, ![X5:($i > $o) > $o, X1:$i]:((((sup @ (epred7_2 @ X1 @ X5))=(X1))|~((epred4_1 @ X5 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_16])).
% 0.19/0.51 thf(c_0_36, plain, ![X1:$i]:((epred4_1 @ (^[Z0/* 3 */:$i > $o]:(($true))) @ X1)), inference(spm,[status(thm)],[c_0_30, c_0_31])).
% 0.19/0.51 thf(c_0_37, negated_conjecture, ((multiplication @ zero @ esk1_0)!=(zero)), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_32])])])])).
% 0.19/0.51 thf(c_0_38, plain, ![X2:$i > $o]:(((multiplication @ zero @ (sup @ X2))=(zero))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_34]), c_0_29])).
% 0.19/0.51 thf(c_0_39, plain, ![X1:$i]:(((sup @ (epred7_2 @ X1 @ (^[Z0/* 3 */:$i > $o]:(($true)))))=(X1))), inference(spm,[status(thm)],[c_0_35, c_0_36])).
% 0.19/0.51 thf(c_0_40, negated_conjecture, ((multiplication @ zero @ esk1_0)!=(zero)), inference(split_conjunct,[status(thm)],[c_0_37])).
% 0.19/0.51 thf(c_0_41, plain, ![X1:$i]:(((multiplication @ zero @ X1)=(zero))), inference(spm,[status(thm)],[c_0_38, c_0_39])).
% 0.19/0.51 thf(c_0_42, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40, c_0_41])]), ['proof']).
% 0.19/0.51 # SZS output end CNFRefutation
% 0.19/0.51 # Parsed axioms : 27
% 0.19/0.51 # Removed by relevancy pruning/SinE : 12
% 0.19/0.51 # Initial clauses : 26
% 0.19/0.51 # Removed in clause preprocessing : 1
% 0.19/0.51 # Initial clauses in saturation : 25
% 0.19/0.51 # Processed clauses : 172
% 0.19/0.51 # ...of these trivial : 1
% 0.19/0.51 # ...subsumed : 10
% 0.19/0.51 # ...remaining for further processing : 161
% 0.19/0.51 # Other redundant clauses eliminated : 29
% 0.19/0.51 # Clauses deleted for lack of memory : 0
% 0.19/0.51 # Backward-subsumed : 0
% 0.19/0.51 # Backward-rewritten : 20
% 0.19/0.51 # Generated clauses : 591
% 0.19/0.51 # ...of the previous two non-redundant : 535
% 0.19/0.51 # ...aggressively subsumed : 0
% 0.19/0.51 # Contextual simplify-reflections : 0
% 0.19/0.51 # Paramodulations : 231
% 0.19/0.51 # Factorizations : 0
% 0.19/0.51 # NegExts : 78
% 0.19/0.51 # Equation resolutions : 29
% 0.19/0.51 # Disequality decompositions : 0
% 0.19/0.51 # Total rewrite steps : 84
% 0.19/0.51 # ...of those cached : 53
% 0.19/0.51 # Propositional unsat checks : 0
% 0.19/0.51 # Propositional check models : 0
% 0.19/0.51 # Propositional check unsatisfiable : 0
% 0.19/0.51 # Propositional clauses : 0
% 0.19/0.51 # Propositional clauses after purity: 0
% 0.19/0.51 # Propositional unsat core size : 0
% 0.19/0.51 # Propositional preprocessing time : 0.000
% 0.19/0.51 # Propositional encoding time : 0.000
% 0.19/0.51 # Propositional solver time : 0.000
% 0.19/0.51 # Success case prop preproc time : 0.000
% 0.19/0.51 # Success case prop encoding time : 0.000
% 0.19/0.51 # Success case prop solver time : 0.000
% 0.19/0.51 # Current number of processed clauses : 124
% 0.19/0.51 # Positive orientable unit clauses : 20
% 0.19/0.51 # Positive unorientable unit clauses: 0
% 0.19/0.51 # Negative unit clauses : 5
% 0.19/0.51 # Non-unit-clauses : 99
% 0.19/0.51 # Current number of unprocessed clauses: 380
% 0.19/0.51 # ...number of literals in the above : 975
% 0.19/0.51 # Current number of archived formulas : 0
% 0.19/0.51 # Current number of archived clauses : 32
% 0.19/0.51 # Clause-clause subsumption calls (NU) : 1730
% 0.19/0.51 # Rec. Clause-clause subsumption calls : 1573
% 0.19/0.51 # Non-unit clause-clause subsumptions : 6
% 0.19/0.51 # Unit Clause-clause subsumption calls : 8
% 0.19/0.51 # Rewrite failures with RHS unbound : 0
% 0.19/0.51 # BW rewrite match attempts : 22
% 0.19/0.51 # BW rewrite match successes : 10
% 0.19/0.51 # Condensation attempts : 0
% 0.19/0.51 # Condensation successes : 0
% 0.19/0.51 # Termbank termtop insertions : 13316
% 0.19/0.51 # Search garbage collected termcells : 574
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.024 s
% 0.19/0.51 # System time : 0.005 s
% 0.19/0.51 # Total time : 0.029 s
% 0.19/0.51 # Maximum resident set size: 2092 pages
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.026 s
% 0.19/0.51 # System time : 0.006 s
% 0.19/0.51 # Total time : 0.032 s
% 0.19/0.51 # Maximum resident set size: 1764 pages
% 0.19/0.51 % E---3.1 exiting
% 0.19/0.51 % E exiting
%------------------------------------------------------------------------------