TSTP Solution File: SEV246^5 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : SEV246^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:05 EDT 2024
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEV246^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n017.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Fri Jun 21 19:09:08 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.20/0.48 Running higher-order theorem proving
% 0.20/0.48 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.Mccrnhze8T/E---3.1_16803.p
% 0.20/0.50 # Version: 3.2.0-ho
% 0.20/0.50 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.20/0.50 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting sh2lt with 1200s (4) cores
% 0.20/0.50 # Starting new_ho_10_unif with 300s (1) cores
% 0.20/0.50 # Starting full_lambda_6 with 300s (1) cores
% 0.20/0.50 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.50 # Starting ehoh_best3_rw with 300s (1) cores
% 0.20/0.50 # sh2lt with pid 16881 completed with status 0
% 0.20/0.50 # Result found by sh2lt
% 0.20/0.50 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.20/0.50 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting sh2lt with 1200s (4) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.20/0.50 # Search class: HGHNF-FFSF21-SHHFFMBN
% 0.20/0.50 # Scheduled 6 strats onto 4 cores with 1200 seconds (1200 total)
% 0.20/0.50 # Starting pre_casc_2 with 433s (1) cores
% 0.20/0.50 # Starting sh2lt with 121s (1) cores
% 0.20/0.50 # Starting ho_unfolding_2 with 163s (1) cores
% 0.20/0.50 # Starting pre_casc_6 with 163s (1) cores
% 0.20/0.50 # pre_casc_2 with pid 16889 completed with status 0
% 0.20/0.50 # Result found by pre_casc_2
% 0.20/0.50 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.20/0.50 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting sh2lt with 1200s (4) cores
% 0.20/0.50 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.20/0.50 # Search class: HGHNF-FFSF21-SHHFFMBN
% 0.20/0.50 # Scheduled 6 strats onto 4 cores with 1200 seconds (1200 total)
% 0.20/0.50 # Starting pre_casc_2 with 433s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Theorem
% 0.20/0.50 # SZS output start CNFRefutation
% 0.20/0.50 thf(decl_22, type, epred1_0: ($i > $o) > $i > $o).
% 0.20/0.50 thf(decl_23, type, esk1_2: ($i > $o) > ($i > $o) > $i).
% 0.20/0.50 thf(decl_24, type, esk2_0: $i).
% 0.20/0.50 thf(decl_25, type, esk3_1: ($i > $o) > $i).
% 0.20/0.50 thf(decl_26, type, epred2_0: $i > $o).
% 0.20/0.50 thf(decl_27, type, epred3_1: $i > $i > $o).
% 0.20/0.50 thf(decl_28, type, esk4_2: $i > ($i > $o) > $i).
% 0.20/0.50 thf(cTHM2A_ONE_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]:(((X1 @ (^[X4:$i]:(?[X6:$i > $o]:((![X7:$i]:(((X6 @ X7)=>(X1 @ X6 @ X7)))&(X6 @ X4))))) @ X5)=>?[X6:$i > $o]:((![X4:$i]:(((X6 @ X4)=>(X1 @ X6 @ X4)))&(X6 @ X5))))))), file('/export/starexec/sandbox2/tmp/tmp.Mccrnhze8T/E---3.1_16803.p', cTHM2A_ONE_pme)).
% 0.20/0.50 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]:(((X1 @ (^[Z0/* 5 */:$i]:(?[X6:$i > $o]:((![X7:$i]:((X6 @ X7=>X1 @ X6 @ X7))&X6 @ Z0)))) @ X5)=>?[X6:$i > $o]:((![X4:$i]:(((X6 @ X4)=>(X1 @ X6 @ X4)))&(X6 @ X5)))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM2A_ONE_pme])])).
% 0.20/0.50 thf(c_0_2, negated_conjecture, ![X17:$i > $o, X18:$i > $o, X20:$i, X22:$i > $o]:(((((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))))&((epred1_0 @ (^[Z0/* 5 */:$i]:(?[X6:$i > $o]:((![X7:$i]:((X6 @ X7=>epred1_0 @ X6 @ X7))&X6 @ Z0)))) @ esk2_0)&(((X22 @ (esk3_1 @ X22))|~(X22 @ esk2_0))&(~(epred1_0 @ X22 @ (esk3_1 @ X22))|~(X22 @ 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.50 thf(c_0_3, plain, ![X27:$i, X29:$i, X30:$i > $o]:((((~(epred3_1 @ X27 @ X29)|(epred1_0 @ (epred3_1 @ X27) @ X29)|~(epred2_0 @ X27))&((epred3_1 @ X27 @ X27)|~(epred2_0 @ X27)))&(((X30 @ (esk4_2 @ X27 @ X30))|~(X30 @ X27)|(epred2_0 @ X27))&(~(epred1_0 @ X30 @ (esk4_2 @ X27 @ X30))|~(X30 @ X27)|(epred2_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.50 thf(c_0_4, 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.50 thf(c_0_5, plain, ![X5:$i, X4:$i]:(((epred1_0 @ (epred3_1 @ X4) @ X5)|~((epred3_1 @ X4 @ X5))|~((epred2_0 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.20/0.50 thf(c_0_6, plain, ![X26:$i]:(((epred2_0 @ X26)<=>?[X24:$i > $o]:((![X25:$i]:(((X24 @ X25)=>(epred1_0 @ X24 @ X25)))&(X24 @ X26))))), introduced(definition)).
% 0.20/0.50 thf(c_0_7, 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.50 thf(c_0_8, plain, ![X2:$i > $o, X4:$i]:(((epred2_0 @ X4)|~((epred1_0 @ X2 @ (esk4_2 @ X4 @ X2)))|~((X2 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.20/0.50 thf(c_0_9, plain, ![X2:$i > $o, X4:$i]:(((X2 @ (esk4_2 @ X4 @ X2))|(epred2_0 @ X4)|~((X2 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.20/0.50 thf(c_0_10, plain, ![X2:$i > $o, X5:$i, X4:$i]:(((epred3_1 @ X4 @ (esk1_2 @ (epred3_1 @ X4) @ X2))|(epred1_0 @ X2 @ X5)|~((epred3_1 @ X4 @ X5))|~((epred2_0 @ X4)))), inference(spm,[status(thm)],[c_0_4, c_0_5])).
% 0.20/0.50 thf(c_0_11, plain, ![X4:$i]:(((epred3_1 @ X4 @ X4)|~((epred2_0 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.20/0.50 thf(c_0_12, negated_conjecture, ![X2:$i > $o]:(((X2 @ (esk3_1 @ X2))|~((X2 @ esk2_0)))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.20/0.50 thf(c_0_13, negated_conjecture, (((epred1_0 @ epred2_0 @ esk2_0))=(($true))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2]), c_0_6])).
% 0.20/0.50 thf(c_0_14, plain, ![X2:$i > $o, X4:$i, X5:$i]:(((epred1_0 @ X2 @ X4)|~((X2 @ (esk1_2 @ (epred3_1 @ X5) @ X2)))|~((epred3_1 @ X5 @ X4))|~((epred2_0 @ X5)))), inference(spm,[status(thm)],[c_0_7, c_0_5])).
% 0.20/0.50 thf(c_0_15, plain, ![X4:$i, X5:$i]:(((epred2_0 @ X4)|~((epred3_1 @ X5 @ X4))|~((epred2_0 @ X5)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8, c_0_5]), c_0_9])).
% 0.20/0.50 thf(c_0_16, plain, ![X2:$i > $o, X4:$i]:(((epred3_1 @ X4 @ (esk1_2 @ (epred3_1 @ X4) @ X2))|(epred1_0 @ X2 @ X4)|~((epred2_0 @ X4)))), inference(spm,[status(thm)],[c_0_10, c_0_11])).
% 0.20/0.50 thf(c_0_17, negated_conjecture, ![X2:$i > $o, X3:$i > $o]:(((epred1_0 @ X2 @ (esk3_1 @ (epred1_0 @ X3)))|~((X2 @ (esk1_2 @ X3 @ X2)))|~((epred1_0 @ X3 @ esk2_0)))), inference(spm,[status(thm)],[c_0_7, c_0_12])).
% 0.20/0.50 thf(c_0_18, negated_conjecture, (epred1_0 @ epred2_0 @ esk2_0), inference(cn,[status(thm)],[c_0_13])).
% 0.20/0.50 thf(c_0_19, plain, ![X2:$i > $o, X4:$i]:(((epred1_0 @ X2 @ X4)|~((X2 @ (esk1_2 @ (epred3_1 @ X4) @ X2)))|~((epred2_0 @ X4)))), inference(spm,[status(thm)],[c_0_14, c_0_11])).
% 0.20/0.50 thf(c_0_20, plain, ![X2:$i > $o, X4:$i]:(((epred2_0 @ (esk1_2 @ (epred3_1 @ X4) @ X2))|(epred1_0 @ X2 @ X4)|~((epred2_0 @ X4)))), inference(spm,[status(thm)],[c_0_15, c_0_16])).
% 0.20/0.50 thf(c_0_21, negated_conjecture, ![X2:$i > $o, X3:$i > $o]:(((epred1_0 @ X2 @ (esk3_1 @ (epred1_0 @ X3)))|(X3 @ (esk1_2 @ X3 @ X2))|~((epred1_0 @ X3 @ esk2_0)))), inference(spm,[status(thm)],[c_0_4, c_0_12])).
% 0.20/0.50 thf(c_0_22, negated_conjecture, ![X2:$i > $o]:(((epred1_0 @ X2 @ (esk3_1 @ (epred1_0 @ epred2_0)))|~((X2 @ (esk1_2 @ epred2_0 @ X2))))), inference(spm,[status(thm)],[c_0_17, c_0_18])).
% 0.20/0.50 thf(c_0_23, plain, ![X4:$i]:(((epred1_0 @ epred2_0 @ X4)|~((epred2_0 @ X4)))), inference(spm,[status(thm)],[c_0_19, c_0_20])).
% 0.20/0.50 thf(c_0_24, negated_conjecture, ![X2:$i > $o]:(((epred1_0 @ X2 @ (esk3_1 @ (epred1_0 @ epred2_0)))|(epred2_0 @ (esk1_2 @ epred2_0 @ X2)))), inference(spm,[status(thm)],[c_0_21, c_0_18])).
% 0.20/0.50 thf(c_0_25, negated_conjecture, ![X2:$i > $o]:((~((epred1_0 @ X2 @ (esk3_1 @ X2)))|~((X2 @ esk2_0)))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.20/0.50 thf(c_0_26, negated_conjecture, (epred1_0 @ (epred1_0 @ epred2_0) @ (esk3_1 @ (epred1_0 @ epred2_0))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_23]), c_0_24])).
% 0.20/0.50 thf(c_0_27, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_26]), c_0_18])]), ['proof']).
% 0.20/0.50 # SZS output end CNFRefutation
% 0.20/0.50 # Parsed axioms : 1
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 9
% 0.20/0.50 # Removed in clause preprocessing : 0
% 0.20/0.50 # Initial clauses in saturation : 9
% 0.20/0.50 # Processed clauses : 56
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 9
% 0.20/0.50 # ...remaining for further processing : 47
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 1
% 0.20/0.50 # Backward-rewritten : 0
% 0.20/0.50 # Generated clauses : 95
% 0.20/0.50 # ...of the previous two non-redundant : 79
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 3
% 0.20/0.50 # Paramodulations : 95
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 7
% 0.20/0.50 # ...of those cached : 4
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 37
% 0.20/0.50 # Positive orientable unit clauses : 4
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 1
% 0.20/0.50 # Non-unit-clauses : 32
% 0.20/0.50 # Current number of unprocessed clauses: 37
% 0.20/0.50 # ...number of literals in the above : 123
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 10
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 163
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 128
% 0.20/0.50 # Non-unit clause-clause subsumptions : 11
% 0.20/0.50 # Unit Clause-clause subsumption calls : 3
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 0
% 0.20/0.50 # BW rewrite match successes : 0
% 0.20/0.50 # Condensation attempts : 56
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 2974
% 0.20/0.50 # Search garbage collected termcells : 386
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.007 s
% 0.20/0.50 # System time : 0.004 s
% 0.20/0.50 # Total time : 0.010 s
% 0.20/0.50 # Maximum resident set size: 1936 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.016 s
% 0.20/0.50 # System time : 0.012 s
% 0.20/0.50 # Total time : 0.028 s
% 0.20/0.50 # Maximum resident set size: 1712 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.50 % E exiting
%------------------------------------------------------------------------------