TSTP Solution File: SEV245^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV245^5 : TPTP v8.2.0. Released v4.0.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 04:08:04 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.07/0.12 % Problem : SEV245^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/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 : Sun May 19 18:53:52 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: HSSSSMSSSSSNHHA.
% 0.20/0.49 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting sh2lt with 1200s (4) cores
% 0.20/0.49 # Starting new_ho_10_unif with 300s (1) cores
% 0.20/0.49 # Starting full_lambda_6 with 300s (1) cores
% 0.20/0.49 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.49 # Starting ehoh_best3_rw with 300s (1) cores
% 0.20/0.49 # post_as_ho1 with pid 29020 completed with status 0
% 0.20/0.49 # Result found by post_as_ho1
% 0.20/0.49 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.20/0.49 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting sh2lt with 1200s (4) cores
% 0.20/0.49 # Starting new_ho_10_unif with 300s (1) cores
% 0.20/0.49 # Starting full_lambda_6 with 300s (1) cores
% 0.20/0.49 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: HGUNF-FFSF22-SHHFFSBN
% 0.20/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting ho_unfolding_3 with 163s (1) cores
% 0.20/0.49 # ho_unfolding_3 with pid 29025 completed with status 0
% 0.20/0.49 # Result found by ho_unfolding_3
% 0.20/0.49 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.20/0.49 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting sh2lt with 1200s (4) cores
% 0.20/0.49 # Starting new_ho_10_unif with 300s (1) cores
% 0.20/0.49 # Starting full_lambda_6 with 300s (1) cores
% 0.20/0.49 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.49 # No SInE strategy applied
% 0.20/0.49 # Search class: HGUNF-FFSF22-SHHFFSBN
% 0.20/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting ho_unfolding_3 with 163s (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, epred1_0: ($i > $o) > $i > $o).
% 0.20/0.49 thf(decl_23, type, esk1_2: ($i > $o) > ($i > $o) > $i).
% 0.20/0.49 thf(decl_24, type, esk2_0: $i).
% 0.20/0.49 thf(decl_25, type, epred2_0: $i > $o).
% 0.20/0.49 thf(decl_26, type, epred3_0: $i > $o).
% 0.20/0.49 thf(decl_27, type, epred4_1: $i > $i > $o).
% 0.20/0.49 thf(decl_28, type, esk3_2: $i > ($i > $o) > $i).
% 0.20/0.49 thf(cTHM2A_TWO_pme, conjecture, ![X1:($i > $o) > $i > $o]:((![X2:$i > $o, X3:$i > $o]:((![X4:$i]:(((X2 @ X4)=>(X3 @ X4)))=>![X4:$i]:(((X1 @ X2 @ X4)=>(X1 @ X3 @ X4)))))=>![X5:$i]:((?[X6:$i > $o]:((![X4:$i]:(((X6 @ X4)=>(X1 @ X6 @ X4)))&(X6 @ X5)))=>(X1 @ (^[X4:$i]:(?[X6:$i > $o]:((![X7:$i]:(((X6 @ X7)=>(X1 @ X6 @ X7)))&(X6 @ X4))))) @ X5))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', cTHM2A_TWO_pme)).
% 0.20/0.49 thf(c_0_1, negated_conjecture, ~(![X1:($i > $o) > $i > $o]:((![X2:$i > $o, X3:$i > $o]:((![X4:$i]:(((X2 @ X4)=>(X3 @ X4)))=>![X4:$i]:(((X1 @ X2 @ X4)=>(X1 @ X3 @ X4)))))=>![X5:$i]:((?[X6:$i > $o]:((![X4:$i]:(((X6 @ X4)=>(X1 @ X6 @ X4)))&(X6 @ X5)))=>(X1 @ (^[Z0/* 5 */:$i]:(?[X6:$i > $o]:((![X7:$i]:((X6 @ X7=>X1 @ X6 @ X7))&X6 @ Z0)))) @ X5)))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM2A_TWO_pme])])).
% 0.20/0.49 thf(c_0_2, negated_conjecture, ![X17:$i > $o, X18:$i > $o, X20:$i, X23:$i]:(((((X17 @ (esk1_2 @ X17 @ X18))|(~(epred1_0 @ X17 @ X20)|(epred1_0 @ X18 @ X20)))&(~(X18 @ (esk1_2 @ X17 @ X18))|(~(epred1_0 @ X17 @ X20)|(epred1_0 @ X18 @ X20))))&(((~(epred2_0 @ X23)|(epred1_0 @ epred2_0 @ X23))&(epred2_0 @ esk2_0))&~(epred1_0 @ (^[Z0/* 5 */:$i]:(?[X6:$i > $o]:((![X7:$i]:((X6 @ X7=>epred1_0 @ X6 @ X7))&X6 @ Z0)))) @ esk2_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_1])])])])])])).
% 0.20/0.49 thf(c_0_3, negated_conjecture, ![X4:$i]:(((epred1_0 @ epred2_0 @ X4)|~((epred2_0 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.20/0.49 thf(c_0_4, negated_conjecture, (epred2_0 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.20/0.49 thf(c_0_5, plain, ![X27:$i, X29:$i, X30:$i > $o]:((((~(epred4_1 @ X27 @ X29)|(epred1_0 @ (epred4_1 @ X27) @ X29)|~(epred3_0 @ X27))&((epred4_1 @ X27 @ X27)|~(epred3_0 @ X27)))&(((X30 @ (esk3_2 @ X27 @ X30))|~(X30 @ X27)|(epred3_0 @ X27))&(~(epred1_0 @ X30 @ (esk3_2 @ X27 @ X30))|~(X30 @ X27)|(epred3_0 @ X27))))), 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_6, negated_conjecture, ![X2:$i > $o, X3:$i > $o, X4:$i]:(((X2 @ (esk1_2 @ X2 @ X3))|(epred1_0 @ X3 @ X4)|~((epred1_0 @ X2 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.20/0.49 thf(c_0_7, negated_conjecture, (epred1_0 @ epred2_0 @ esk2_0), inference(spm,[status(thm)],[c_0_3, c_0_4])).
% 0.20/0.49 thf(c_0_8, plain, ![X2:$i > $o, X4:$i]:(((X2 @ (esk3_2 @ X4 @ X2))|(epred3_0 @ X4)|~((X2 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.20/0.49 thf(c_0_9, negated_conjecture, ![X2:$i > $o]:(((epred2_0 @ (esk1_2 @ epred2_0 @ X2))|(epred1_0 @ X2 @ esk2_0))), inference(spm,[status(thm)],[c_0_6, c_0_7])).
% 0.20/0.49 thf(c_0_10, plain, ![X2:$i > $o]:(((epred2_0 @ (esk3_2 @ (esk1_2 @ epred2_0 @ X2) @ epred2_0))|(epred3_0 @ (esk1_2 @ epred2_0 @ X2))|(epred1_0 @ X2 @ esk2_0))), inference(spm,[status(thm)],[c_0_8, c_0_9])).
% 0.20/0.49 thf(c_0_11, plain, ![X26:$i]:(((epred3_0 @ X26)<=>?[X24:$i > $o]:((![X25:$i]:(((X24 @ X25)=>(epred1_0 @ X24 @ X25)))&(X24 @ X26))))), introduced(definition)).
% 0.20/0.49 thf(c_0_12, plain, ![X2:$i > $o, X4:$i]:(((epred3_0 @ X4)|~((epred1_0 @ X2 @ (esk3_2 @ X4 @ X2)))|~((X2 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.20/0.49 thf(c_0_13, negated_conjecture, ![X2:$i > $o]:(((epred1_0 @ epred2_0 @ (esk3_2 @ (esk1_2 @ epred2_0 @ X2) @ epred2_0))|(epred3_0 @ (esk1_2 @ epred2_0 @ X2))|(epred1_0 @ X2 @ esk2_0))), inference(spm,[status(thm)],[c_0_3, c_0_10])).
% 0.20/0.49 thf(c_0_14, negated_conjecture, ~((((epred1_0 @ epred3_0 @ esk2_0))=(($true)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2]), c_0_11])).
% 0.20/0.49 thf(c_0_15, negated_conjecture, ![X2:$i > $o, X3:$i > $o, X4:$i]:(((epred1_0 @ X2 @ X4)|~((X2 @ (esk1_2 @ X3 @ X2)))|~((epred1_0 @ X3 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.20/0.49 thf(c_0_16, plain, ![X2:$i > $o]:(((epred3_0 @ (esk1_2 @ epred2_0 @ X2))|(epred1_0 @ X2 @ esk2_0))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13]), c_0_9])).
% 0.20/0.49 thf(c_0_17, negated_conjecture, ~((epred1_0 @ epred3_0 @ esk2_0)), inference(cn,[status(thm)],[c_0_14])).
% 0.20/0.49 thf(c_0_18, negated_conjecture, ![X4:$i]:(((epred1_0 @ epred3_0 @ X4)|~((epred1_0 @ epred2_0 @ X4)))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_16]), c_0_17])).
% 0.20/0.49 thf(c_0_19, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_7]), c_0_17]), ['proof']).
% 0.20/0.49 # SZS output end CNFRefutation
% 0.20/0.49 # Parsed axioms : 1
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 9
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 9
% 0.20/0.49 # Processed clauses : 63
% 0.20/0.49 # ...of these trivial : 1
% 0.20/0.49 # ...subsumed : 2
% 0.20/0.49 # ...remaining for further processing : 60
% 0.20/0.49 # Other redundant clauses eliminated : 3
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 2
% 0.20/0.49 # Backward-rewritten : 11
% 0.20/0.49 # Generated clauses : 84
% 0.20/0.49 # ...of the previous two non-redundant : 70
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 2
% 0.20/0.49 # Paramodulations : 63
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 4
% 0.20/0.49 # Equation resolutions : 3
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 25
% 0.20/0.49 # ...of those cached : 20
% 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 : 34
% 0.20/0.49 # Positive orientable unit clauses : 5
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 4
% 0.20/0.49 # Non-unit-clauses : 25
% 0.20/0.49 # Current number of unprocessed clauses: 21
% 0.20/0.49 # ...number of literals in the above : 59
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 26
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 108
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 78
% 0.20/0.49 # Non-unit clause-clause subsumptions : 4
% 0.20/0.49 # Unit Clause-clause subsumption calls : 9
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 3
% 0.20/0.49 # BW rewrite match successes : 3
% 0.20/0.49 # Condensation attempts : 63
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 2640
% 0.20/0.49 # Search garbage collected termcells : 394
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.007 s
% 0.20/0.49 # System time : 0.002 s
% 0.20/0.49 # Total time : 0.009 s
% 0.20/0.49 # Maximum resident set size: 1876 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.007 s
% 0.20/0.49 # System time : 0.005 s
% 0.20/0.49 # Total time : 0.012 s
% 0.20/0.49 # Maximum resident set size: 1716 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------