TSTP Solution File: QUA011^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : QUA011^1 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : QUA011^1 : TPTP v8.2.0. Released v4.1.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n027.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 13:39:37 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running higher-order theorem proving
% 0.20/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.20/0.49 # Version: 3.1.0-ho
% 0.20/0.49 # Preprocessing class: HSSSSMSSSLSCHSN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting sh2 with 1500s (5) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # Starting lpo1_def_fix with 300s (1) cores
% 0.20/0.49 # Starting ehoh_best8_lambda with 300s (1) cores
% 0.20/0.49 # sh2 with pid 32079 completed with status 0
% 0.20/0.49 # Result found by sh2
% 0.20/0.49 # Preprocessing class: HSSSSMSSSLSCHSN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting sh2 with 1500s (5) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: HGUSM-FFSF32-SHSFMSBN
% 0.20/0.49 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting sh2 with 901s (1) cores
% 0.20/0.49 # Starting sh5l with 151s (1) cores
% 0.20/0.49 # Starting lpo1_def_fix with 151s (1) cores
% 0.20/0.49 # Starting ehoh_best8_lambda with 151s (1) cores
% 0.20/0.49 # Starting ho_unfolding_6 with 146s (1) cores
% 0.20/0.49 # sh2 with pid 32086 completed with status 0
% 0.20/0.49 # Result found by sh2
% 0.20/0.49 # Preprocessing class: HSSSSMSSSLSCHSN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting sh2 with 1500s (5) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: HGUSM-FFSF32-SHSFMSBN
% 0.20/0.49 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.49 # Starting sh2 with 901s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% 0.20/0.49 thf(decl_22, type, emptyset: $i > $o).
% 0.20/0.49 thf(decl_25, type, zero: $i).
% 0.20/0.49 thf(decl_26, type, sup: ($i > $o) > $i).
% 0.20/0.49 thf(decl_31, type, multiplication: $i > $i > $i).
% 0.20/0.49 thf(decl_32, type, crossmult: ($i > $o) > ($i > $o) > $i > $o).
% 0.20/0.49 thf(decl_34, type, epred1_0: $i > $o).
% 0.20/0.49 thf(decl_35, type, epred2_0: $i > $o).
% 0.20/0.49 thf(decl_40, type, epred7_2: ($i > $o) > ($i > $o) > $i > $o).
% 0.20/0.49 thf(decl_41, type, esk1_3: $i > ($i > $o) > ($i > $o) > $i).
% 0.20/0.49 thf(decl_42, type, esk2_3: $i > ($i > $o) > ($i > $o) > $i).
% 0.20/0.49 thf(decl_94, type, esk52_0: $i).
% 0.20/0.49 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.20/0.49 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.20/0.49 thf(emptyset_def, axiom, ((emptyset)=(^[X1:$i]:(~($true)))), file('/export/starexec/sandbox/benchmark/Axioms/QUA001^0.ax', emptyset_def)).
% 0.20/0.49 thf(sup_es, axiom, ((sup @ emptyset)=(zero)), file('/export/starexec/sandbox/benchmark/Axioms/QUA001^0.ax', sup_es)).
% 0.20/0.49 thf(multiplication_anni, conjecture, ![X14:$i > $o]:(((multiplication @ (sup @ X14) @ zero)=(zero))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', multiplication_anni)).
% 0.20/0.49 thf(c_0_5, 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.20/0.49 thf(c_0_6, plain, ![X13:$i > $o, X3:$i > $o]:(((multiplication @ (sup @ X13) @ (sup @ X3))=(sup @ (^[Z0/* 5 */:$i]:(?[X26:$i, X27:$i]:(((X13 @ X26&X3 @ X27)&((Z0)=(multiplication @ X26 @ X27))))))))), inference(apply_def,[status(thm)],[multiplication_def, c_0_5])).
% 0.20/0.49 thf(c_0_7, plain, ((emptyset)=(^[Z0/* 4 */:$i]:(~($true)))), inference(fof_simplification,[status(thm)],[emptyset_def])).
% 0.20/0.49 thf(c_0_8, plain, ![X36:$i > $o, X37:$i > $o]:(((multiplication @ (sup @ X36) @ (sup @ X37))=(sup @ (^[Z0/* 5 */:$i]:(?[X26:$i, X27:$i]:(((X36 @ X26&X37 @ X27)&((Z0)=(multiplication @ X26 @ X27))))))))), inference(variable_rename,[status(thm)],[c_0_6])).
% 0.20/0.49 thf(c_0_9, plain, ![X50:$i, X2:$i > $o, X3:$i > $o]:(((epred7_2 @ X3 @ X2 @ X50)<=>?[X48:$i, X49:$i]:((((X2 @ X48)&(X3 @ X49))&((X50)=(multiplication @ X48 @ X49)))))), introduced(definition)).
% 0.20/0.49 thf(c_0_10, plain, ((sup @ (^[Z0/* 7 */:$i]:(~($true))))=(zero)), inference(apply_def,[status(thm)],[sup_es, c_0_7])).
% 0.20/0.49 thf(c_0_11, plain, ![X41:$i]:(((epred2_0 @ X41)<=>~(($true)))), introduced(definition)).
% 0.20/0.49 thf(c_0_12, negated_conjecture, ~(![X14:$i > $o]:(((multiplication @ (sup @ X14) @ zero)=(zero)))), inference(assume_negation,[status(cth)],[multiplication_anni])).
% 0.20/0.49 thf(c_0_13, plain, ![X3:$i > $o, X2:$i > $o]:(((multiplication @ (sup @ X2) @ (sup @ X3))=(sup @ (epred7_2 @ X3 @ X2)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_8]), c_0_9])).
% 0.20/0.49 thf(c_0_14, plain, ((sup @ epred2_0)=(zero)), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_10]), c_0_11])).
% 0.20/0.49 thf(c_0_15, negated_conjecture, ((multiplication @ (sup @ epred1_0) @ zero)!=(zero)), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])])).
% 0.20/0.49 thf(c_0_16, plain, ![X2:$i > $o]:(((sup @ (epred7_2 @ epred2_0 @ X2))=(multiplication @ (sup @ X2) @ zero))), inference(spm,[status(thm)],[c_0_13, c_0_14])).
% 0.20/0.49 thf(c_0_17, plain, ![X2:$i > $o, X3:$i > $o]:((((sup @ (epred7_2 @ X2 @ X3))=(zero))|((epred7_2 @ X2 @ X3)!=(epred2_0)))), inference(rw,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_14, c_0_13]), c_0_13])).
% 0.20/0.49 thf(c_0_18, plain, ![X58:$i]:(((~(epred2_0 @ X58)|~($true))&(($true)|(epred2_0 @ X58)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])).
% 0.20/0.49 thf(c_0_19, negated_conjecture, ((multiplication @ (sup @ epred1_0) @ zero)!=(zero)), inference(split_conjunct,[status(thm)],[c_0_15])).
% 0.20/0.49 thf(c_0_20, plain, ![X2:$i > $o]:((((multiplication @ (sup @ X2) @ zero)=(zero))|((epred7_2 @ epred2_0 @ X2)!=(epred2_0)))), inference(spm,[status(thm)],[c_0_16, c_0_17])).
% 0.20/0.49 thf(c_0_21, plain, ![X1:$i]:((~((epred2_0 @ X1))|~(($true)))), inference(split_conjunct,[status(thm)],[c_0_18])).
% 0.20/0.49 thf(c_0_22, plain, ![X51:$i, X52:$i > $o, X53:$i > $o, X56:$i, X57:$i]:((((((X52 @ (esk1_3 @ X51 @ X52 @ X53))|~(epred7_2 @ X53 @ X52 @ X51))&((X53 @ (esk2_3 @ X51 @ X52 @ X53))|~(epred7_2 @ X53 @ X52 @ X51)))&(((X51)=(multiplication @ (esk1_3 @ X51 @ X52 @ X53) @ (esk2_3 @ X51 @ X52 @ X53)))|~(epred7_2 @ X53 @ X52 @ X51)))&(~(X52 @ X56)|~(X53 @ X57)|((X51)!=(multiplication @ X56 @ X57))|(epred7_2 @ X53 @ X52 @ X51)))), 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.20/0.49 thf(c_0_23, negated_conjecture, ((epred7_2 @ epred2_0 @ epred1_0)!=(epred2_0)), inference(spm,[status(thm)],[c_0_19, c_0_20])).
% 0.20/0.49 thf(c_0_24, plain, ![X1:$i]:(~((epred2_0 @ X1))), inference(cn,[status(thm)],[c_0_21])).
% 0.20/0.49 thf(c_0_25, plain, ![X3:$i > $o, X2:$i > $o, X1:$i]:(((X2 @ (esk2_3 @ X1 @ X3 @ X2))|~((epred7_2 @ X2 @ X3 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_22])).
% 0.20/0.49 thf(c_0_26, negated_conjecture, ((epred7_2 @ epred2_0 @ epred1_0 @ esk52_0)<~>(epred2_0 @ esk52_0)), inference(neg_ext,[status(thm)],[c_0_23])).
% 0.20/0.49 thf(c_0_27, plain, ![X2:$i > $o, X1:$i]:(~((epred7_2 @ epred2_0 @ X2 @ X1))), inference(spm,[status(thm)],[c_0_24, c_0_25])).
% 0.20/0.49 thf(c_0_28, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_26]), c_0_27]), c_0_24]), ['proof']).
% 0.20/0.49 # SZS output end CNFRefutation
% 0.20/0.49 # Parsed axioms : 27
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 39
% 0.20/0.49 # Removed in clause preprocessing : 13
% 0.20/0.49 # Initial clauses in saturation : 26
% 0.20/0.49 # Processed clauses : 159
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 19
% 0.20/0.49 # ...remaining for further processing : 140
% 0.20/0.49 # Other redundant clauses eliminated : 5
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 0
% 0.20/0.49 # Backward-rewritten : 0
% 0.20/0.49 # Generated clauses : 307
% 0.20/0.49 # ...of the previous two non-redundant : 301
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 202
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 51
% 0.20/0.49 # Equation resolutions : 5
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 20
% 0.20/0.49 # ...of those cached : 13
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 99
% 0.20/0.49 # Positive orientable unit clauses : 12
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 18
% 0.20/0.49 # Non-unit-clauses : 69
% 0.20/0.49 # Current number of unprocessed clauses: 194
% 0.20/0.49 # ...number of literals in the above : 452
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 36
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 1050
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 823
% 0.20/0.49 # Non-unit clause-clause subsumptions : 3
% 0.20/0.49 # Unit Clause-clause subsumption calls : 74
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 6
% 0.20/0.49 # BW rewrite match successes : 0
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 6736
% 0.20/0.49 # Search garbage collected termcells : 581
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.013 s
% 0.20/0.49 # System time : 0.004 s
% 0.20/0.49 # Total time : 0.017 s
% 0.20/0.49 # Maximum resident set size: 2016 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.054 s
% 0.20/0.49 # System time : 0.016 s
% 0.20/0.49 # Total time : 0.070 s
% 0.20/0.49 # Maximum resident set size: 1756 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.50 % E exiting
%------------------------------------------------------------------------------