TSTP Solution File: SEV289^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV289^5 : TPTP v8.2.0. Bugfixed v6.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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.19s 0.50s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEV289^5 : TPTP v8.2.0. Bugfixed v6.2.0.
% 0.04/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n026.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 : Sun May 19 19:17:38 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running higher-order theorem proving
% 0.19/0.47 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.19/0.50 # Version: 3.1.0-ho
% 0.19/0.50 # Preprocessing class: HSSSSMSSSLSNHHN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.19/0.50 # Starting sh5l with 300s (1) cores
% 0.19/0.50 # Starting full_lambda_10 with 300s (1) cores
% 0.19/0.50 # Starting full_lambda_6 with 300s (1) cores
% 0.19/0.50 # ehoh_best_nonlift_nonlambdatoforall with pid 18721 completed with status 0
% 0.19/0.50 # Result found by ehoh_best_nonlift_nonlambdatoforall
% 0.19/0.50 # Preprocessing class: HSSSSMSSSLSNHHN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.19/0.50 # No SInE strategy applied
% 0.19/0.50 # Search class: HGUNF-FFSF00-DHHFMSBN
% 0.19/0.50 # partial match(2): HGUNF-FFSF00-SHHFFSBN
% 0.19/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.50 # Starting ho_unfolding_3 with 675s (1) cores
% 0.19/0.50 # Starting ehoh_best_nonlift_nonlambdatoforall with 151s (1) cores
% 0.19/0.50 # Starting ehoh_best2_full_lfho with 169s (1) cores
% 0.19/0.50 # Starting lpo8_s with 169s (1) cores
% 0.19/0.50 # Starting lpo9_lambda_fix with 169s (1) cores
% 0.19/0.50 # lpo9_lambda_fix with pid 18732 completed with status 0
% 0.19/0.50 # Result found by lpo9_lambda_fix
% 0.19/0.50 # Preprocessing class: HSSSSMSSSLSNHHN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.19/0.50 # No SInE strategy applied
% 0.19/0.50 # Search class: HGUNF-FFSF00-DHHFMSBN
% 0.19/0.50 # partial match(2): HGUNF-FFSF00-SHHFFSBN
% 0.19/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.50 # Starting ho_unfolding_3 with 675s (1) cores
% 0.19/0.50 # Starting ehoh_best_nonlift_nonlambdatoforall with 151s (1) cores
% 0.19/0.50 # Starting ehoh_best2_full_lfho with 169s (1) cores
% 0.19/0.50 # Starting lpo8_s with 169s (1) cores
% 0.19/0.50 # Starting lpo9_lambda_fix with 169s (1) cores
% 0.19/0.50 # Preprocessing time : 0.001 s
% 0.19/0.50 # Presaturation interreduction done
% 0.19/0.50
% 0.19/0.50 # Proof found!
% 0.19/0.50 # SZS status Theorem
% 0.19/0.50 # SZS output start CNFRefutation
% 0.19/0.50 thf(decl_22, type, cNAT: (($i > $o) > $o) > $o).
% 0.19/0.50 thf(decl_23, type, cSUCC: (($i > $o) > $o) > ($i > $o) > $o).
% 0.19/0.50 thf(decl_24, type, cZERO: ($i > $o) > $o).
% 0.19/0.50 thf(decl_25, type, epred1_0: ($i > $o) > $o).
% 0.19/0.50 thf(decl_26, type, epred2_1: ((($i > $o) > $o) > $o) > ($i > $o) > $o).
% 0.19/0.50 thf(decl_27, type, epred3_0: (($i > $o) > $o) > $o).
% 0.19/0.50 thf(cNAT_def, axiom, ((cNAT)=(^[X3:($i > $o) > $o]:(![X5:(($i > $o) > $o) > $o]:((((X5 @ cZERO)&![X6:($i > $o) > $o]:(((X5 @ X6)=>(X5 @ (cSUCC @ X6)))))=>(X5 @ X3)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cNAT_def)).
% 0.19/0.50 thf(cZERO_def, axiom, ((cZERO)=(^[X1:$i > $o]:(~(?[X2:$i]:((X1 @ X2)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cZERO_def)).
% 0.19/0.50 thf(cSUCC_def, axiom, ((cSUCC)=(^[X3:($i > $o) > $o, X1:$i > $o]:(?[X2:$i]:(((X1 @ X2)&(X3 @ (^[X4:$i]:((((X4)!=(X2))&(X1 @ X4)))))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cSUCC_def)).
% 0.19/0.50 thf(cTTTP6101, conjecture, ![X7:($i > $o) > $o]:(((cNAT @ X7)=>(cNAT @ (cSUCC @ X7)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cTTTP6101)).
% 0.19/0.50 thf(c_0_4, plain, ((cNAT)=(^[Z0/* 6 */:($i > $o) > $o]:(![X5:(($i > $o) > $o) > $o]:((((X5 @ (^[Z1/* 7 */:$i > $o]:(~(?[X9:$i]:((Z1 @ X9))))))&![X6:($i > $o) > $o]:(((X5 @ X6)=>(X5 @ (^[Z1/* 5 */:$i > $o]:(?[X10:$i]:(((Z1 @ X10)&(X6 @ (^[Z2/* 8 */:$i]:((((Z2)!=(X10))&(Z1 @ Z2)))))))))))))=>(X5 @ Z0)))))), inference(fof_simplification,[status(thm)],[cNAT_def])).
% 0.19/0.50 thf(c_0_5, plain, ((cZERO)=(^[Z0/* 7 */:$i > $o]:(~(?[X2:$i]:((Z0 @ X2)))))), inference(fof_simplification,[status(thm)],[cZERO_def])).
% 0.19/0.50 thf(c_0_6, plain, ((cSUCC)=(^[Z0/* 19 */:($i > $o) > $o, Z1:$i > $o]:(?[X2:$i]:(((Z1 @ X2)&(Z0 @ (^[Z2/* 8 */:$i]:((((Z2)!=(X2))&(Z1 @ Z2)))))))))), inference(fof_simplification,[status(thm)],[cSUCC_def])).
% 0.19/0.50 thf(c_0_7, plain, ((cNAT)=(^[Z0/* 6 */:($i > $o) > $o]:(![X5:(($i > $o) > $o) > $o]:((((X5 @ (^[Z1/* 7 */:$i > $o]:(~(?[X9:$i]:((Z1 @ X9))))))&![X6:($i > $o) > $o]:(((X5 @ X6)=>(X5 @ (^[Z1/* 5 */:$i > $o]:(?[X10:$i]:(((Z1 @ X10)&(X6 @ (^[Z2/* 8 */:$i]:((((Z2)!=(X10))&(Z1 @ Z2)))))))))))))=>(X5 @ Z0)))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_4, c_0_5]), c_0_6])).
% 0.19/0.50 thf(c_0_8, negated_conjecture, ~(![X7:($i > $o) > $o]:((![X11:(($i > $o) > $o) > $o]:((((X11 @ (^[Z0/* 7 */:$i > $o]:(~(?[X12:$i]:(Z0 @ X12)))))&![X13:($i > $o) > $o]:(((X11 @ X13)=>(X11 @ (^[Z0/* 5 */:$i > $o]:(?[X14:$i]:((Z0 @ X14&X13 @ (^[Z1/* 8 */:$i]:((~(((Z1)=(X14)))&Z0 @ Z1)))))))))))=>(X11 @ X7)))=>![X16:(($i > $o) > $o) > $o]:((((X16 @ (^[Z0/* 7 */:$i > $o]:(~(?[X17:$i]:(Z0 @ X17)))))&![X18:($i > $o) > $o]:(((X16 @ X18)=>(X16 @ (^[Z0/* 5 */:$i > $o]:(?[X19:$i]:((Z0 @ X19&X18 @ (^[Z1/* 8 */:$i]:((~(((Z1)=(X19)))&Z0 @ Z1)))))))))))=>(X16 @ (^[Z0/* 5 */:$i > $o]:(?[X15:$i]:((Z0 @ X15&X7 @ (^[Z1/* 8 */:$i]:((~(((Z1)=(X15)))&Z0 @ Z1))))))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[cTTTP6101]), c_0_6]), c_0_7])).
% 0.19/0.50 thf(c_0_9, negated_conjecture, ![X21:(($i > $o) > $o) > $o, X24:($i > $o) > $o]:(((((X21 @ (epred2_1 @ X21))|~(X21 @ (^[Z0/* 7 */:$i > $o]:(~(?[X12:$i]:(Z0 @ X12)))))|(X21 @ epred1_0))&(~(X21 @ (^[Z0/* 5 */:$i > $o]:(?[X14:$i]:((Z0 @ X14&epred2_1 @ X21 @ (^[Z1/* 8 */:$i]:((~(((Z1)=(X14)))&Z0 @ Z1))))))))|~(X21 @ (^[Z0/* 7 */:$i > $o]:(~(?[X12:$i]:(Z0 @ X12)))))|(X21 @ epred1_0)))&(((epred3_0 @ (^[Z0/* 7 */:$i > $o]:(~(?[X17:$i]:(Z0 @ X17)))))&(~(epred3_0 @ X24)|(epred3_0 @ (^[Z0/* 5 */:$i > $o]:(?[X19:$i]:((Z0 @ X19&X24 @ (^[Z1/* 8 */:$i]:((~(((Z1)=(X19)))&Z0 @ Z1))))))))))&~(epred3_0 @ (^[Z0/* 5 */:$i > $o]:(?[X15:$i]:((Z0 @ X15&epred1_0 @ (^[Z1/* 8 */:$i]:((~(((Z1)=(X15)))&Z0 @ Z1))))))))))), 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_8])])])])])])).
% 0.19/0.50 thf(c_0_10, negated_conjecture, ![X5:(($i > $o) > $o) > $o]:(((X5 @ (epred2_1 @ X5))|(X5 @ epred1_0)|~((X5 @ (^[Z0/* 7 */:$i > $o]:(~(?[X56:$i]:((Z0 @ X56))))))))), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.19/0.50 thf(c_0_11, negated_conjecture, (epred3_0 @ (^[Z0/* 7 */:$i > $o]:(~(?[X57:$i]:((Z0 @ X57)))))), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.19/0.50 thf(c_0_12, negated_conjecture, ![X3:($i > $o) > $o]:(((epred3_0 @ (^[Z0/* 5 */:$i > $o]:(?[X58:$i]:(((Z0 @ X58)&(X3 @ (^[Z1/* 8 */:$i]:((~(((Z1)=(X58)))&(Z0 @ Z1))))))))))|~((epred3_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.19/0.50 thf(c_0_13, negated_conjecture, ((epred3_0 @ (epred2_1 @ epred3_0))|(epred3_0 @ epred1_0)), inference(spm,[status(thm)],[c_0_10, c_0_11])).
% 0.19/0.50 thf(c_0_14, negated_conjecture, ![X5:(($i > $o) > $o) > $o]:(((X5 @ epred1_0)|~((X5 @ (^[Z0/* 5 */:$i > $o]:(?[X59:$i]:(((Z0 @ X59)&(epred2_1 @ X5 @ (^[Z1/* 8 */:$i]:((~(((Z1)=(X59)))&(Z0 @ Z1)))))))))))|~((X5 @ (^[Z0/* 7 */:$i > $o]:(~(?[X60:$i]:((Z0 @ X60))))))))), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.19/0.50 thf(c_0_15, negated_conjecture, ((epred3_0 @ (^[Z0/* 5 */:$i > $o]:(?[X61:$i]:(((Z0 @ X61)&(epred2_1 @ epred3_0 @ (^[Z1/* 8 */:$i]:((~(((Z1)=(X61)))&(Z0 @ Z1))))))))))|(epred3_0 @ epred1_0)), inference(spm,[status(thm)],[c_0_12, c_0_13])).
% 0.19/0.50 thf(c_0_16, negated_conjecture, (epred3_0 @ epred1_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_11]), c_0_15])).
% 0.19/0.50 thf(c_0_17, negated_conjecture, ~((epred3_0 @ (^[Z0/* 5 */:$i > $o]:(?[X62:$i]:(((Z0 @ X62)&(epred1_0 @ (^[Z1/* 8 */:$i]:((~(((Z1)=(X62)))&(Z0 @ Z1))))))))))), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.19/0.50 thf(c_0_18, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_16]), c_0_17]), ['proof']).
% 0.19/0.50 # SZS output end CNFRefutation
% 0.19/0.50 # Parsed axioms : 7
% 0.19/0.50 # Removed by relevancy pruning/SinE : 0
% 0.19/0.50 # Initial clauses : 8
% 0.19/0.50 # Removed in clause preprocessing : 3
% 0.19/0.50 # Initial clauses in saturation : 5
% 0.19/0.50 # Processed clauses : 59
% 0.19/0.50 # ...of these trivial : 1
% 0.19/0.50 # ...subsumed : 4
% 0.19/0.50 # ...remaining for further processing : 54
% 0.19/0.50 # Other redundant clauses eliminated : 0
% 0.19/0.50 # Clauses deleted for lack of memory : 0
% 0.19/0.50 # Backward-subsumed : 5
% 0.19/0.50 # Backward-rewritten : 5
% 0.19/0.50 # Generated clauses : 72
% 0.19/0.50 # ...of the previous two non-redundant : 66
% 0.19/0.50 # ...aggressively subsumed : 0
% 0.19/0.50 # Contextual simplify-reflections : 1
% 0.19/0.50 # Paramodulations : 13
% 0.19/0.50 # Factorizations : 0
% 0.19/0.50 # NegExts : 11
% 0.19/0.50 # Equation resolutions : 0
% 0.19/0.50 # Disequality decompositions : 0
% 0.19/0.50 # Total rewrite steps : 5
% 0.19/0.50 # ...of those cached : 4
% 0.19/0.50 # Propositional unsat checks : 0
% 0.19/0.50 # Propositional check models : 0
% 0.19/0.50 # Propositional check unsatisfiable : 0
% 0.19/0.50 # Propositional clauses : 0
% 0.19/0.50 # Propositional clauses after purity: 0
% 0.19/0.50 # Propositional unsat core size : 0
% 0.19/0.50 # Propositional preprocessing time : 0.000
% 0.19/0.50 # Propositional encoding time : 0.000
% 0.19/0.50 # Propositional solver time : 0.000
% 0.19/0.50 # Success case prop preproc time : 0.000
% 0.19/0.50 # Success case prop encoding time : 0.000
% 0.19/0.50 # Success case prop solver time : 0.000
% 0.19/0.50 # Current number of processed clauses : 29
% 0.19/0.50 # Positive orientable unit clauses : 2
% 0.19/0.50 # Positive unorientable unit clauses: 0
% 0.19/0.50 # Negative unit clauses : 3
% 0.19/0.50 # Non-unit-clauses : 24
% 0.19/0.50 # Current number of unprocessed clauses: 16
% 0.19/0.50 # ...number of literals in the above : 41
% 0.19/0.50 # Current number of archived formulas : 0
% 0.19/0.50 # Current number of archived clauses : 25
% 0.19/0.50 # Clause-clause subsumption calls (NU) : 261
% 0.19/0.50 # Rec. Clause-clause subsumption calls : 104
% 0.19/0.50 # Non-unit clause-clause subsumptions : 5
% 0.19/0.50 # Unit Clause-clause subsumption calls : 7
% 0.19/0.50 # Rewrite failures with RHS unbound : 0
% 0.19/0.50 # BW rewrite match attempts : 1
% 0.19/0.50 # BW rewrite match successes : 1
% 0.19/0.50 # Condensation attempts : 0
% 0.19/0.50 # Condensation successes : 0
% 0.19/0.50 # Termbank termtop insertions : 8485
% 0.19/0.50 # Search garbage collected termcells : 328
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.011 s
% 0.19/0.50 # System time : 0.003 s
% 0.19/0.50 # Total time : 0.014 s
% 0.19/0.50 # Maximum resident set size: 1832 pages
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.045 s
% 0.19/0.50 # System time : 0.021 s
% 0.19/0.50 # Total time : 0.066 s
% 0.19/0.50 # Maximum resident set size: 1732 pages
% 0.19/0.50 % E---3.1 exiting
% 0.19/0.50 % E exiting
%------------------------------------------------------------------------------