TSTP Solution File: SEV290^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV290^5 : TPTP v8.2.0. Bugfixed v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:08 EDT 2024
% Result : Theorem 0.17s 0.45s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEV290^5 : TPTP v8.2.0. Bugfixed v5.2.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n022.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Sun May 19 18:21:37 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running higher-order theorem proving
% 0.17/0.44 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.17/0.45 # Version: 3.1.0-ho
% 0.17/0.45 # Preprocessing class: HSSSSMSSSLSNHHA.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.17/0.45 # Starting sh3l with 300s (1) cores
% 0.17/0.45 # Starting lpo6_lambda_fix with 300s (1) cores
% 0.17/0.45 # Starting full_lambda_8 with 300s (1) cores
% 0.17/0.45 # sh3l with pid 1102 completed with status 0
% 0.17/0.45 # Result found by sh3l
% 0.17/0.45 # Preprocessing class: HSSSSMSSSLSNHHA.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.17/0.45 # Starting sh3l with 300s (1) cores
% 0.17/0.45 # SinE strategy is gf120_gu_RUU_F100_L01000
% 0.17/0.45 # Search class: HHUNS-FFSF00-DHHFMSBN
% 0.17/0.45 # partial match(3): HHUNF-FFSF00-SHSFMSBN
% 0.17/0.45 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.45 # Starting ho_unfolding_3 with 163s (1) cores
% 0.17/0.45 # ho_unfolding_3 with pid 1106 completed with status 0
% 0.17/0.45 # Result found by ho_unfolding_3
% 0.17/0.45 # Preprocessing class: HSSSSMSSSLSNHHA.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.17/0.45 # Starting sh3l with 300s (1) cores
% 0.17/0.45 # SinE strategy is gf120_gu_RUU_F100_L01000
% 0.17/0.45 # Search class: HHUNS-FFSF00-DHHFMSBN
% 0.17/0.45 # partial match(3): HHUNF-FFSF00-SHSFMSBN
% 0.17/0.45 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.45 # Starting ho_unfolding_3 with 163s (1) cores
% 0.17/0.45 # Preprocessing time : 0.001 s
% 0.17/0.45 # Presaturation interreduction done
% 0.17/0.45
% 0.17/0.45 # Proof found!
% 0.17/0.45 # SZS status Theorem
% 0.17/0.45 # SZS output start CNFRefutation
% 0.17/0.45 thf(decl_22, type, c0: ($i > $o) > $o).
% 0.17/0.45 thf(decl_23, type, cSUCC: (($i > $o) > $o) > ($i > $o) > $o).
% 0.17/0.45 thf(decl_24, type, c_less__eq_: (($i > $o) > $o) > (($i > $o) > $o) > $o).
% 0.17/0.45 thf(decl_25, type, epred1_1: ((($i > $o) > $o) > $o) > ($i > $o) > $o).
% 0.17/0.45 thf(decl_26, type, epred2_1: ((($i > $o) > $o) > $o) > (($i > $o) > $o) > $o).
% 0.17/0.45 thf(c_less__eq__def, axiom, ((c_less__eq_)=(^[X5:($i > $o) > $o, X6:($i > $o) > $o]:(![X7:(($i > $o) > $o) > $o]:((((X7 @ X5)&![X8:($i > $o) > $o]:(((X7 @ X8)=>(X7 @ (cSUCC @ X8)))))=>(X7 @ X6)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', c_less__eq__def)).
% 0.17/0.45 thf(cSUCC_def, axiom, ((cSUCC)=(^[X1:($i > $o) > $o, X2:$i > $o]:(?[X3:$i]:(((X2 @ X3)&(X1 @ (^[X4:$i]:((((X4)!=(X3))&(X2 @ X4)))))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cSUCC_def)).
% 0.17/0.45 thf(cBLEDSOE1, conjecture, ?[X9:(($i > $o) > $o) > $o]:(![X10:($i > $o) > $o]:(((X9 @ X10)=>(c_less__eq_ @ X10 @ c0)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cBLEDSOE1)).
% 0.17/0.45 thf(c_0_3, plain, ((c_less__eq_)=(^[Z0/* 19 */:($i > $o) > $o, Z1:($i > $o) > $o]:(![X7:(($i > $o) > $o) > $o]:((((X7 @ Z0)&![X8:($i > $o) > $o]:(((X7 @ X8)=>(X7 @ (^[Z2/* 5 */:$i > $o]:(?[X13:$i]:(((Z2 @ X13)&(X8 @ (^[Z3/* 8 */:$i]:((((Z3)!=(X13))&(Z2 @ Z3)))))))))))))=>(X7 @ Z1)))))), inference(fof_simplification,[status(thm)],[c_less__eq__def])).
% 0.17/0.45 thf(c_0_4, plain, ((cSUCC)=(^[Z0/* 19 */:($i > $o) > $o, Z1:$i > $o]:(?[X3:$i]:(((Z1 @ X3)&(Z0 @ (^[Z2/* 8 */:$i]:((((Z2)!=(X3))&(Z1 @ Z2)))))))))), inference(fof_simplification,[status(thm)],[cSUCC_def])).
% 0.17/0.45 thf(c_0_5, plain, ((c_less__eq_)=(^[Z0/* 19 */:($i > $o) > $o, Z1:($i > $o) > $o]:(![X7:(($i > $o) > $o) > $o]:((((X7 @ Z0)&![X8:($i > $o) > $o]:(((X7 @ X8)=>(X7 @ (^[Z2/* 5 */:$i > $o]:(?[X13:$i]:(((Z2 @ X13)&(X8 @ (^[Z3/* 8 */:$i]:((((Z3)!=(X13))&(Z2 @ Z3)))))))))))))=>(X7 @ Z1)))))), inference(apply_def,[status(thm)],[c_0_3, c_0_4])).
% 0.17/0.45 thf(c_0_6, negated_conjecture, ~(?[X9:(($i > $o) > $o) > $o]:(![X10:($i > $o) > $o]:(((X9 @ X10)=>![X14:(($i > $o) > $o) > $o]:((((X14 @ X10)&![X15:($i > $o) > $o]:(((X14 @ X15)=>(X14 @ (^[Z0/* 5 */:$i > $o]:(?[X16:$i]:((Z0 @ X16&X15 @ (^[Z1/* 8 */:$i]:((~(((Z1)=(X16)))&Z0 @ Z1)))))))))))=>(X14 @ c0))))))), inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[cBLEDSOE1]), c_0_5])).
% 0.17/0.45 thf(c_0_7, negated_conjecture, ![X17:(($i > $o) > $o) > $o, X20:($i > $o) > $o]:(((X17 @ (epred1_1 @ X17))&(((epred2_1 @ X17 @ (epred1_1 @ X17))&(~(epred2_1 @ X17 @ X20)|(epred2_1 @ X17 @ (^[Z0/* 5 */:$i > $o]:(?[X16:$i]:((Z0 @ X16&X20 @ (^[Z1/* 8 */:$i]:((~(((Z1)=(X16)))&Z0 @ Z1))))))))))&~(epred2_1 @ X17 @ c0)))), 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_6])])])])])).
% 0.17/0.45 thf(c_0_8, negated_conjecture, ![X7:(($i > $o) > $o) > $o]:((X7 @ (epred1_1 @ X7))), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.17/0.45 thf(c_0_9, negated_conjecture, ($false), inference(flex_resolve,[status(thm)],[c_0_8]), ['proof']).
% 0.17/0.45 # SZS output end CNFRefutation
% 0.17/0.45 # Parsed axioms : 6
% 0.17/0.45 # Removed by relevancy pruning/SinE : 3
% 0.17/0.45 # Initial clauses : 4
% 0.17/0.45 # Removed in clause preprocessing : 0
% 0.17/0.45 # Initial clauses in saturation : 4
% 0.17/0.45 # Processed clauses : 2
% 0.17/0.45 # ...of these trivial : 0
% 0.17/0.45 # ...subsumed : 0
% 0.17/0.45 # ...remaining for further processing : 1
% 0.17/0.45 # Other redundant clauses eliminated : 0
% 0.17/0.45 # Clauses deleted for lack of memory : 0
% 0.17/0.45 # Backward-subsumed : 0
% 0.17/0.45 # Backward-rewritten : 0
% 0.17/0.45 # Generated clauses : 0
% 0.17/0.45 # ...of the previous two non-redundant : 0
% 0.17/0.45 # ...aggressively subsumed : 0
% 0.17/0.45 # Contextual simplify-reflections : 0
% 0.17/0.45 # Paramodulations : 0
% 0.17/0.45 # Factorizations : 0
% 0.17/0.45 # NegExts : 0
% 0.17/0.45 # Equation resolutions : 0
% 0.17/0.45 # Disequality decompositions : 0
% 0.17/0.45 # Total rewrite steps : 0
% 0.17/0.45 # ...of those cached : 0
% 0.17/0.45 # Propositional unsat checks : 0
% 0.17/0.45 # Propositional check models : 0
% 0.17/0.45 # Propositional check unsatisfiable : 0
% 0.17/0.45 # Propositional clauses : 0
% 0.17/0.45 # Propositional clauses after purity: 0
% 0.17/0.45 # Propositional unsat core size : 0
% 0.17/0.45 # Propositional preprocessing time : 0.000
% 0.17/0.45 # Propositional encoding time : 0.000
% 0.17/0.45 # Propositional solver time : 0.000
% 0.17/0.45 # Success case prop preproc time : 0.000
% 0.17/0.45 # Success case prop encoding time : 0.000
% 0.17/0.45 # Success case prop solver time : 0.000
% 0.17/0.45 # Current number of processed clauses : 1
% 0.17/0.45 # Positive orientable unit clauses : 0
% 0.17/0.45 # Positive unorientable unit clauses: 0
% 0.17/0.45 # Negative unit clauses : 1
% 0.17/0.45 # Non-unit-clauses : 0
% 0.17/0.45 # Current number of unprocessed clauses: 2
% 0.17/0.45 # ...number of literals in the above : 3
% 0.17/0.45 # Current number of archived formulas : 0
% 0.17/0.45 # Current number of archived clauses : 0
% 0.17/0.45 # Clause-clause subsumption calls (NU) : 0
% 0.17/0.45 # Rec. Clause-clause subsumption calls : 0
% 0.17/0.45 # Non-unit clause-clause subsumptions : 0
% 0.17/0.45 # Unit Clause-clause subsumption calls : 0
% 0.17/0.45 # Rewrite failures with RHS unbound : 0
% 0.17/0.45 # BW rewrite match attempts : 0
% 0.17/0.45 # BW rewrite match successes : 0
% 0.17/0.45 # Condensation attempts : 2
% 0.17/0.45 # Condensation successes : 0
% 0.17/0.45 # Termbank termtop insertions : 480
% 0.17/0.45 # Search garbage collected termcells : 168
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.002 s
% 0.17/0.45 # System time : 0.002 s
% 0.17/0.45 # Total time : 0.004 s
% 0.17/0.45 # Maximum resident set size: 1764 pages
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.003 s
% 0.17/0.45 # System time : 0.004 s
% 0.17/0.45 # Total time : 0.006 s
% 0.17/0.45 # Maximum resident set size: 1732 pages
% 0.17/0.45 % E---3.1 exiting
% 0.17/0.45 % E exiting
%------------------------------------------------------------------------------