TSTP Solution File: SEV299^5 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : SEV299^5 : TPTP v8.2.0. Bugfixed v6.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n001.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 : Mon Jun 24 15:54:12 EDT 2024
% Result : Theorem 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEV299^5 : TPTP v8.2.0. Bugfixed v6.2.0.
% 0.07/0.12 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n001.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % 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 : Fri Jun 21 19:07:54 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.21/0.49 Running higher-order theorem proving
% 0.21/0.49 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/tmp/tmp.TYLBBemGd3/E---3.1_20741.p
% 0.21/0.51 # Version: 3.2.0-ho
% 0.21/0.51 # Preprocessing class: HSSSSMSSSLSNHHA.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.51 # Starting sh3l with 300s (1) cores
% 0.21/0.51 # Starting lpo6_lambda_fix with 300s (1) cores
% 0.21/0.51 # Starting full_lambda_8 with 300s (1) cores
% 0.21/0.51 # sh3l with pid 20854 completed with status 0
% 0.21/0.51 # Result found by sh3l
% 0.21/0.51 # Preprocessing class: HSSSSMSSSLSNHHA.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.51 # Starting sh3l with 300s (1) cores
% 0.21/0.51 # SinE strategy is gf120_gu_RUU_F100_L01000
% 0.21/0.51 # Search class: HGUNF-FFSF00-DHHFMSBN
% 0.21/0.51 # partial match(2): HGUNF-FFSF00-SHHFFSBN
% 0.21/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting ho_unfolding_3 with 135s (1) cores
% 0.21/0.51 # ho_unfolding_3 with pid 20858 completed with status 0
% 0.21/0.51 # Result found by ho_unfolding_3
% 0.21/0.51 # Preprocessing class: HSSSSMSSSLSNHHA.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.51 # Starting sh3l with 300s (1) cores
% 0.21/0.51 # SinE strategy is gf120_gu_RUU_F100_L01000
% 0.21/0.51 # Search class: HGUNF-FFSF00-DHHFMSBN
% 0.21/0.51 # partial match(2): HGUNF-FFSF00-SHHFFSBN
% 0.21/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting ho_unfolding_3 with 135s (1) cores
% 0.21/0.51 # Preprocessing time : 0.001 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Theorem
% 0.21/0.51 # SZS output start CNFRefutation
% 0.21/0.51 thf(decl_22, type, cNAT: (($i > $o) > $o) > $o).
% 0.21/0.51 thf(decl_23, type, cSUCC: (($i > $o) > $o) > ($i > $o) > $o).
% 0.21/0.51 thf(decl_24, type, cZERO: ($i > $o) > $o).
% 0.21/0.51 thf(decl_25, type, epred1_0: (($i > $o) > $o) > $o).
% 0.21/0.51 thf(decl_26, type, epred2_0: ($i > $o) > $o).
% 0.21/0.51 thf(decl_27, type, epred3_1: ((($i > $o) > $o) > $o) > ($i > $o) > $o).
% 0.21/0.51 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/tmp/tmp.TYLBBemGd3/E---3.1_20741.p', cNAT_def)).
% 0.21/0.51 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/tmp/tmp.TYLBBemGd3/E---3.1_20741.p', cSUCC_def)).
% 0.21/0.51 thf(cZERO_def, axiom, ((cZERO)=(^[X1:$i > $o]:(~(?[X2:$i]:((X1 @ X2)))))), file('/export/starexec/sandbox2/tmp/tmp.TYLBBemGd3/E---3.1_20741.p', cZERO_def)).
% 0.21/0.51 thf(cINDUCTION, conjecture, ![X7:(($i > $o) > $o) > $o]:((((X7 @ cZERO)&![X8:($i > $o) > $o]:(((X7 @ X8)=>(X7 @ (cSUCC @ X8)))))=>![X9:($i > $o) > $o]:(((cNAT @ X9)=>(X7 @ X9))))), file('/export/starexec/sandbox2/tmp/tmp.TYLBBemGd3/E---3.1_20741.p', cINDUCTION)).
% 0.21/0.51 thf(c_0_4, plain, ((cNAT)=(^[Z0/* 6 */:($i > $o) > $o]:(![X5:(($i > $o) > $o) > $o]:((((X5 @ (^[Z1/* 7 */:$i > $o]:(~(?[X13:$i]:((Z1 @ X13))))))&![X6:($i > $o) > $o]:(((X5 @ X6)=>(X5 @ (^[Z1/* 5 */:$i > $o]:(?[X14:$i]:(((Z1 @ X14)&(X6 @ (^[Z2/* 8 */:$i]:((((Z2)!=(X14))&(Z1 @ Z2)))))))))))))=>(X5 @ Z0)))))), inference(fof_simplification,[status(thm)],[cNAT_def])).
% 0.21/0.51 thf(c_0_5, 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.21/0.51 thf(c_0_6, plain, ((cZERO)=(^[Z0/* 7 */:$i > $o]:(~(?[X2:$i]:((Z0 @ X2)))))), inference(fof_simplification,[status(thm)],[cZERO_def])).
% 0.21/0.51 thf(c_0_7, plain, ((cNAT)=(^[Z0/* 6 */:($i > $o) > $o]:(![X5:(($i > $o) > $o) > $o]:((((X5 @ (^[Z1/* 7 */:$i > $o]:(~(?[X13:$i]:((Z1 @ X13))))))&![X6:($i > $o) > $o]:(((X5 @ X6)=>(X5 @ (^[Z1/* 5 */:$i > $o]:(?[X14:$i]:(((Z1 @ X14)&(X6 @ (^[Z2/* 8 */:$i]:((((Z2)!=(X14))&(Z1 @ Z2)))))))))))))=>(X5 @ Z0)))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_4, c_0_5]), c_0_6])).
% 0.21/0.51 thf(c_0_8, negated_conjecture, ~(![X7:(($i > $o) > $o) > $o]:((((X7 @ (^[Z0/* 7 */:$i > $o]:(~(?[X15:$i]:(Z0 @ X15)))))&![X8:($i > $o) > $o]:(((X7 @ X8)=>(X7 @ (^[Z0/* 5 */:$i > $o]:(?[X16:$i]:((Z0 @ X16&X8 @ (^[Z1/* 8 */:$i]:((~(((Z1)=(X16)))&Z0 @ Z1)))))))))))=>![X9:($i > $o) > $o]:((![X17:(($i > $o) > $o) > $o]:((((X17 @ (^[Z0/* 7 */:$i > $o]:(~(?[X18:$i]:(Z0 @ X18)))))&![X19:($i > $o) > $o]:(((X17 @ X19)=>(X17 @ (^[Z0/* 5 */:$i > $o]:(?[X20:$i]:((Z0 @ X20&X19 @ (^[Z1/* 8 */:$i]:((~(((Z1)=(X20)))&Z0 @ Z1)))))))))))=>(X17 @ X9)))=>(X7 @ X9)))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[cINDUCTION]), c_0_7]), c_0_5]), c_0_6])).
% 0.21/0.51 thf(c_0_9, negated_conjecture, ![X22:($i > $o) > $o, X24:(($i > $o) > $o) > $o]:((((epred1_0 @ (^[Z0/* 7 */:$i > $o]:(~(?[X15:$i]:(Z0 @ X15)))))&(~(epred1_0 @ X22)|(epred1_0 @ (^[Z0/* 5 */:$i > $o]:(?[X16:$i]:((Z0 @ X16&X22 @ (^[Z1/* 8 */:$i]:((~(((Z1)=(X16)))&Z0 @ Z1))))))))))&((((X24 @ (epred3_1 @ X24))|~(X24 @ (^[Z0/* 7 */:$i > $o]:(~(?[X18:$i]:(Z0 @ X18)))))|(X24 @ epred2_0))&(~(X24 @ (^[Z0/* 5 */:$i > $o]:(?[X20:$i]:((Z0 @ X20&epred3_1 @ X24 @ (^[Z1/* 8 */:$i]:((~(((Z1)=(X20)))&Z0 @ Z1))))))))|~(X24 @ (^[Z0/* 7 */:$i > $o]:(~(?[X18:$i]:(Z0 @ X18)))))|(X24 @ epred2_0)))&~(epred1_0 @ epred2_0)))), 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.21/0.51 thf(c_0_10, negated_conjecture, ![X5:(($i > $o) > $o) > $o]:(((X5 @ (epred3_1 @ X5))|(X5 @ epred2_0)|~((X5 @ (^[Z0/* 7 */:$i > $o]:(~(?[X37:$i]:((Z0 @ X37))))))))), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.21/0.51 thf(c_0_11, negated_conjecture, (epred1_0 @ (^[Z0/* 7 */:$i > $o]:(~(?[X38:$i]:((Z0 @ X38)))))), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.21/0.51 thf(c_0_12, negated_conjecture, ~((epred1_0 @ epred2_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.21/0.51 thf(c_0_13, negated_conjecture, ![X3:($i > $o) > $o]:(((epred1_0 @ (^[Z0/* 5 */:$i > $o]:(?[X39:$i]:(((Z0 @ X39)&(X3 @ (^[Z1/* 8 */:$i]:((~(((Z1)=(X39)))&(Z0 @ Z1))))))))))|~((epred1_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.21/0.51 thf(c_0_14, negated_conjecture, (epred1_0 @ (epred3_1 @ epred1_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_11]), c_0_12])).
% 0.21/0.51 thf(c_0_15, negated_conjecture, ![X5:(($i > $o) > $o) > $o]:(((X5 @ epred2_0)|~((X5 @ (^[Z0/* 5 */:$i > $o]:(?[X40:$i]:(((Z0 @ X40)&(epred3_1 @ X5 @ (^[Z1/* 8 */:$i]:((~(((Z1)=(X40)))&(Z0 @ Z1)))))))))))|~((X5 @ (^[Z0/* 7 */:$i > $o]:(~(?[X41:$i]:((Z0 @ X41))))))))), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.21/0.51 thf(c_0_16, negated_conjecture, (epred1_0 @ (^[Z0/* 5 */:$i > $o]:(?[X42:$i]:(((Z0 @ X42)&(epred3_1 @ epred1_0 @ (^[Z1/* 8 */:$i]:((~(((Z1)=(X42)))&(Z0 @ Z1)))))))))), inference(spm,[status(thm)],[c_0_13, c_0_14])).
% 0.21/0.51 thf(c_0_17, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_16]), c_0_11])]), c_0_12]), ['proof']).
% 0.21/0.51 # SZS output end CNFRefutation
% 0.21/0.51 # Parsed axioms : 7
% 0.21/0.51 # Removed by relevancy pruning/SinE : 3
% 0.21/0.51 # Initial clauses : 5
% 0.21/0.51 # Removed in clause preprocessing : 0
% 0.21/0.51 # Initial clauses in saturation : 5
% 0.21/0.51 # Processed clauses : 50
% 0.21/0.51 # ...of these trivial : 0
% 0.21/0.51 # ...subsumed : 2
% 0.21/0.51 # ...remaining for further processing : 48
% 0.21/0.51 # Other redundant clauses eliminated : 0
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 1
% 0.21/0.51 # Backward-rewritten : 0
% 0.21/0.51 # Generated clauses : 61
% 0.21/0.51 # ...of the previous two non-redundant : 53
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 0
% 0.21/0.51 # Paramodulations : 20
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 9
% 0.21/0.51 # Equation resolutions : 0
% 0.21/0.51 # Disequality decompositions : 0
% 0.21/0.51 # Total rewrite steps : 1
% 0.21/0.51 # ...of those cached : 0
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 34
% 0.21/0.51 # Positive orientable unit clauses : 4
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 4
% 0.21/0.51 # Non-unit-clauses : 26
% 0.21/0.51 # Current number of unprocessed clauses: 13
% 0.21/0.51 # ...number of literals in the above : 43
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 14
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 128
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 76
% 0.21/0.51 # Non-unit clause-clause subsumptions : 4
% 0.21/0.51 # Unit Clause-clause subsumption calls : 1
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 1
% 0.21/0.51 # BW rewrite match successes : 0
% 0.21/0.51 # Condensation attempts : 50
% 0.21/0.51 # Condensation successes : 1
% 0.21/0.51 # Termbank termtop insertions : 5627
% 0.21/0.51 # Search garbage collected termcells : 304
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.009 s
% 0.21/0.51 # System time : 0.002 s
% 0.21/0.51 # Total time : 0.011 s
% 0.21/0.51 # Maximum resident set size: 1896 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.010 s
% 0.21/0.51 # System time : 0.004 s
% 0.21/0.51 # Total time : 0.014 s
% 0.21/0.51 # Maximum resident set size: 1740 pages
% 0.21/0.51 % E---3.1 exiting
% 0.21/0.51 % E exiting
%------------------------------------------------------------------------------