TSTP Solution File: SEV246^6 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : SEV246^6 : TPTP v8.2.0. Released v5.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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.15s 0.43s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : SEV246^6 : TPTP v8.2.0. Released v5.1.0.
% 0.02/0.09 % Command : run_E %s %d THM
% 0.08/0.29 % Computer : n018.cluster.edu
% 0.08/0.29 % Model : x86_64 x86_64
% 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29 % Memory : 8042.1875MB
% 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29 % CPULimit : 300
% 0.08/0.29 % WCLimit : 300
% 0.08/0.29 % DateTime : Fri Jun 21 19:06:23 EDT 2024
% 0.08/0.29 % CPUTime :
% 0.15/0.41 Running higher-order theorem proving
% 0.15/0.41 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/tmp/tmp.yyhye5hug2/E---3.1_15650.p
% 0.15/0.43 # Version: 3.2.0-ho
% 0.15/0.43 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.15/0.43 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting post_as_ho12 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_9 with 300s (1) cores
% 0.15/0.43 # Starting post_as_ho1 with 300s (1) cores
% 0.15/0.43 # Starting post_as_ho4 with 300s (1) cores
% 0.15/0.43 # Starting post_as_ho2 with 300s (1) cores
% 0.15/0.43 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.15/0.43 # Starting full_lambda_10 with 300s (1) cores
% 0.15/0.43 # Starting new_ho_8 with 300s (1) cores
% 0.15/0.43 # post_as_ho1 with pid 15732 completed with status 0
% 0.15/0.43 # Result found by post_as_ho1
% 0.15/0.43 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.15/0.43 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting post_as_ho12 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_9 with 300s (1) cores
% 0.15/0.43 # Starting post_as_ho1 with 300s (1) cores
% 0.15/0.43 # No SInE strategy applied
% 0.15/0.43 # Search class: HGHNF-FFSF21-SSSFFMBN
% 0.15/0.43 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 # Starting new_ho_10 with 163s (1) cores
% 0.15/0.43 # new_ho_10 with pid 15744 completed with status 0
% 0.15/0.43 # Result found by new_ho_10
% 0.15/0.43 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.15/0.43 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting post_as_ho12 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_9 with 300s (1) cores
% 0.15/0.43 # Starting post_as_ho1 with 300s (1) cores
% 0.15/0.43 # No SInE strategy applied
% 0.15/0.43 # Search class: HGHNF-FFSF21-SSSFFMBN
% 0.15/0.43 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 # Starting new_ho_10 with 163s (1) cores
% 0.15/0.43 # Preprocessing time : 0.001 s
% 0.15/0.43 # Presaturation interreduction done
% 0.15/0.43
% 0.15/0.43 # Proof found!
% 0.15/0.43 # SZS status Theorem
% 0.15/0.43 # SZS output start CNFRefutation
% 0.15/0.43 thf(decl_sort1, type, a: $tType).
% 0.15/0.43 thf(decl_22, type, cK: (a > $o) > a > $o).
% 0.15/0.43 thf(decl_23, type, esk1_2: (a > $o) > (a > $o) > a).
% 0.15/0.43 thf(decl_24, type, esk2_0: a).
% 0.15/0.43 thf(decl_25, type, esk3_1: (a > $o) > a).
% 0.15/0.43 thf(decl_26, type, epred1_0: a > $o).
% 0.15/0.43 thf(decl_27, type, epred2_1: a > a > $o).
% 0.15/0.43 thf(decl_28, type, esk4_2: a > (a > $o) > a).
% 0.15/0.43 thf(cTHM116_1S, conjecture, (![X1:a > $o, X2:a > $o]:((![X3:a]:(((X1 @ X3)=>(X2 @ X3)))=>![X3:a]:(((cK @ X1 @ X3)=>(cK @ X2 @ X3)))))=>![X3:a]:(((cK @ (^[X4:a]:(?[X5:a > $o]:((![X6:a]:(((X5 @ X6)=>(cK @ X5 @ X6)))&(X5 @ X4))))) @ X3)=>?[X5:a > $o]:((![X4:a]:(((X5 @ X4)=>(cK @ X5 @ X4)))&(X5 @ X3)))))), file('/export/starexec/sandbox/tmp/tmp.yyhye5hug2/E---3.1_15650.p', cTHM116_1S)).
% 0.15/0.43 thf(c_0_1, negated_conjecture, ~((![X1:a > $o, X2:a > $o]:((![X3:a]:(((X1 @ X3)=>(X2 @ X3)))=>![X3:a]:(((cK @ X1 @ X3)=>(cK @ X2 @ X3)))))=>![X3:a]:(((cK @ (^[Z0/* 5 */:a]:(?[X5:a > $o]:((![X6:a]:((X5 @ X6=>(cK @ X5 @ X6)))&X5 @ Z0)))) @ X3)=>?[X5:a > $o]:((![X4:a]:(((X5 @ X4)=>(cK @ X5 @ X4)))&(X5 @ X3))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM116_1S])])).
% 0.15/0.43 thf(c_0_2, negated_conjecture, ![X14:a > $o, X15:a > $o, X17:a, X19:a > $o]:(((((X14 @ (esk1_2 @ X14 @ X15))|(~(cK @ X14 @ X17)|(cK @ X15 @ X17)))&(~(X15 @ (esk1_2 @ X14 @ X15))|(~(cK @ X14 @ X17)|(cK @ X15 @ X17))))&((cK @ (^[Z0/* 5 */:a]:(?[X5:a > $o]:((![X6:a]:((X5 @ X6=>(cK @ X5 @ X6)))&X5 @ Z0)))) @ esk2_0)&(((X19 @ (esk3_1 @ X19))|~(X19 @ esk2_0))&(~(cK @ X19 @ (esk3_1 @ X19))|~(X19 @ 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.15/0.43 thf(c_0_3, plain, ![X23:a]:(((epred1_0 @ X23)<=>?[X21:a > $o]:((![X22:a]:(((X21 @ X22)=>(cK @ X21 @ X22)))&(X21 @ X23))))), introduced(definition)).
% 0.15/0.43 thf(c_0_4, plain, ![X24:a, X26:a, X27:a > $o]:((((~(epred2_1 @ X24 @ X26)|(cK @ (epred2_1 @ X24) @ X26)|~(epred1_0 @ X24))&((epred2_1 @ X24 @ X24)|~(epred1_0 @ X24)))&(((X27 @ (esk4_2 @ X24 @ X27))|~(X27 @ X24)|(epred1_0 @ X24))&(~(cK @ X27 @ (esk4_2 @ X24 @ X27))|~(X27 @ X24)|(epred1_0 @ X24))))), 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.15/0.43 thf(c_0_5, negated_conjecture, ![X1:a > $o, X2:a > $o, X3:a]:(((X1 @ (esk1_2 @ X1 @ X2))|(cK @ X2 @ X3)|~((cK @ X1 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.15/0.43 thf(c_0_6, negated_conjecture, ![X1:a > $o]:(((X1 @ (esk3_1 @ X1))|~((X1 @ esk2_0)))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.15/0.43 thf(c_0_7, negated_conjecture, (((cK @ epred1_0 @ esk2_0))=(($true))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2]), c_0_3])).
% 0.15/0.43 thf(c_0_8, plain, ![X4:a, X3:a]:(((cK @ (epred2_1 @ X3) @ X4)|~((epred2_1 @ X3 @ X4))|~((epred1_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.15/0.43 thf(c_0_9, negated_conjecture, ![X1:a > $o]:((~((cK @ X1 @ (esk3_1 @ X1)))|~((X1 @ esk2_0)))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.15/0.43 thf(c_0_10, negated_conjecture, ![X1:a > $o, X2:a > $o, X3:a]:(((cK @ X1 @ X3)|~((X1 @ (esk1_2 @ X2 @ X1)))|~((cK @ X2 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.15/0.43 thf(c_0_11, negated_conjecture, ![X1:a > $o, X2:a > $o]:(((cK @ X1 @ (esk3_1 @ (cK @ X2)))|(X2 @ (esk1_2 @ X2 @ X1))|~((cK @ X2 @ esk2_0)))), inference(spm,[status(thm)],[c_0_5, c_0_6])).
% 0.15/0.43 thf(c_0_12, negated_conjecture, (cK @ epred1_0 @ esk2_0), inference(cn,[status(thm)],[c_0_7])).
% 0.15/0.43 thf(c_0_13, plain, ![X1:a > $o, X3:a]:(((epred1_0 @ X3)|~((cK @ X1 @ (esk4_2 @ X3 @ X1)))|~((X1 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.15/0.43 thf(c_0_14, plain, ![X1:a > $o, X3:a]:(((X1 @ (esk4_2 @ X3 @ X1))|(epred1_0 @ X3)|~((X1 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.15/0.43 thf(c_0_15, plain, ![X1:a > $o, X4:a, X3:a]:(((epred2_1 @ X3 @ (esk1_2 @ (epred2_1 @ X3) @ X1))|(cK @ X1 @ X4)|~((epred2_1 @ X3 @ X4))|~((epred1_0 @ X3)))), inference(spm,[status(thm)],[c_0_5, c_0_8])).
% 0.15/0.43 thf(c_0_16, plain, ![X3:a]:(((epred2_1 @ X3 @ X3)|~((epred1_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.15/0.43 thf(c_0_17, negated_conjecture, ![X3:a]:((~((epred2_1 @ X3 @ esk2_0))|~((epred1_0 @ X3)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9, c_0_8]), c_0_6])).
% 0.15/0.43 thf(c_0_18, negated_conjecture, ![X1:a > $o, X2:a > $o]:(((cK @ X1 @ (esk3_1 @ (cK @ X2)))|~((X1 @ (esk1_2 @ X2 @ X1)))|~((cK @ X2 @ esk2_0)))), inference(spm,[status(thm)],[c_0_10, c_0_6])).
% 0.15/0.43 thf(c_0_19, negated_conjecture, ![X1:a > $o]:(((cK @ X1 @ (esk3_1 @ (cK @ epred1_0)))|(epred1_0 @ (esk1_2 @ epred1_0 @ X1)))), inference(spm,[status(thm)],[c_0_11, c_0_12])).
% 0.15/0.43 thf(c_0_20, plain, ![X1:a > $o, X3:a, X4:a]:(((cK @ X1 @ X3)|~((X1 @ (esk1_2 @ (epred2_1 @ X4) @ X1)))|~((epred2_1 @ X4 @ X3))|~((epred1_0 @ X4)))), inference(spm,[status(thm)],[c_0_10, c_0_8])).
% 0.15/0.43 thf(c_0_21, plain, ![X3:a, X4:a]:(((epred1_0 @ X3)|~((epred2_1 @ X4 @ X3))|~((epred1_0 @ X4)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_8]), c_0_14])).
% 0.15/0.43 thf(c_0_22, plain, ![X1:a > $o, X3:a]:(((epred2_1 @ X3 @ (esk1_2 @ (epred2_1 @ X3) @ X1))|(cK @ X1 @ X3)|~((epred1_0 @ X3)))), inference(spm,[status(thm)],[c_0_15, c_0_16])).
% 0.15/0.43 thf(c_0_23, plain, ![X1:a > $o, X2:a > $o, X3:a]:(((cK @ X1 @ (esk4_2 @ X3 @ (cK @ X2)))|(X2 @ (esk1_2 @ X2 @ X1))|(epred1_0 @ X3)|~((cK @ X2 @ X3)))), inference(spm,[status(thm)],[c_0_5, c_0_14])).
% 0.15/0.43 thf(c_0_24, plain, ~((epred1_0 @ esk2_0)), inference(spm,[status(thm)],[c_0_17, c_0_16])).
% 0.15/0.43 thf(c_0_25, negated_conjecture, (cK @ epred1_0 @ (esk3_1 @ (cK @ epred1_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_19]), c_0_12])])).
% 0.15/0.43 thf(c_0_26, plain, ![X1:a > $o, X3:a]:(((cK @ X1 @ X3)|~((X1 @ (esk1_2 @ (epred2_1 @ X3) @ X1)))|~((epred1_0 @ X3)))), inference(spm,[status(thm)],[c_0_20, c_0_16])).
% 0.15/0.43 thf(c_0_27, plain, ![X1:a > $o, X3:a]:(((epred1_0 @ (esk1_2 @ (epred2_1 @ X3) @ X1))|(cK @ X1 @ X3)|~((epred1_0 @ X3)))), inference(spm,[status(thm)],[c_0_21, c_0_22])).
% 0.15/0.43 thf(c_0_28, negated_conjecture, ![X1:a > $o]:(((cK @ X1 @ (esk4_2 @ esk2_0 @ (cK @ epred1_0)))|(epred1_0 @ (esk1_2 @ epred1_0 @ X1)))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_12]), c_0_24])).
% 0.15/0.43 thf(c_0_29, negated_conjecture, ![X1:a > $o]:(((cK @ X1 @ (esk3_1 @ (cK @ epred1_0)))|~((X1 @ (esk1_2 @ epred1_0 @ X1))))), inference(spm,[status(thm)],[c_0_10, c_0_25])).
% 0.15/0.43 thf(c_0_30, plain, ![X3:a]:(((cK @ epred1_0 @ X3)|~((epred1_0 @ X3)))), inference(spm,[status(thm)],[c_0_26, c_0_27])).
% 0.15/0.43 thf(c_0_31, plain, (epred1_0 @ (esk1_2 @ epred1_0 @ (cK @ epred1_0))), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_28]), c_0_12])]), c_0_24])).
% 0.15/0.43 thf(c_0_32, negated_conjecture, (cK @ (cK @ epred1_0) @ (esk3_1 @ (cK @ epred1_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29, c_0_30]), c_0_31])])).
% 0.15/0.43 thf(c_0_33, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9, c_0_32]), c_0_12])]), ['proof']).
% 0.15/0.43 # SZS output end CNFRefutation
% 0.15/0.43 # Parsed axioms : 3
% 0.15/0.43 # Removed by relevancy pruning/SinE : 0
% 0.15/0.43 # Initial clauses : 11
% 0.15/0.43 # Removed in clause preprocessing : 2
% 0.15/0.43 # Initial clauses in saturation : 9
% 0.15/0.43 # Processed clauses : 58
% 0.15/0.43 # ...of these trivial : 1
% 0.15/0.43 # ...subsumed : 9
% 0.15/0.43 # ...remaining for further processing : 48
% 0.15/0.43 # Other redundant clauses eliminated : 0
% 0.15/0.43 # Clauses deleted for lack of memory : 0
% 0.15/0.43 # Backward-subsumed : 1
% 0.15/0.43 # Backward-rewritten : 0
% 0.15/0.43 # Generated clauses : 103
% 0.15/0.43 # ...of the previous two non-redundant : 92
% 0.15/0.43 # ...aggressively subsumed : 0
% 0.15/0.43 # Contextual simplify-reflections : 2
% 0.15/0.43 # Paramodulations : 103
% 0.15/0.43 # Factorizations : 0
% 0.15/0.43 # NegExts : 0
% 0.15/0.43 # Equation resolutions : 0
% 0.15/0.43 # Disequality decompositions : 0
% 0.15/0.43 # Total rewrite steps : 15
% 0.15/0.43 # ...of those cached : 12
% 0.15/0.43 # Propositional unsat checks : 0
% 0.15/0.43 # Propositional check models : 0
% 0.15/0.43 # Propositional check unsatisfiable : 0
% 0.15/0.43 # Propositional clauses : 0
% 0.15/0.43 # Propositional clauses after purity: 0
% 0.15/0.43 # Propositional unsat core size : 0
% 0.15/0.43 # Propositional preprocessing time : 0.000
% 0.15/0.43 # Propositional encoding time : 0.000
% 0.15/0.43 # Propositional solver time : 0.000
% 0.15/0.43 # Success case prop preproc time : 0.000
% 0.15/0.43 # Success case prop encoding time : 0.000
% 0.15/0.43 # Success case prop solver time : 0.000
% 0.15/0.43 # Current number of processed clauses : 38
% 0.15/0.43 # Positive orientable unit clauses : 5
% 0.15/0.43 # Positive unorientable unit clauses: 0
% 0.15/0.43 # Negative unit clauses : 1
% 0.15/0.43 # Non-unit-clauses : 32
% 0.15/0.43 # Current number of unprocessed clauses: 49
% 0.15/0.43 # ...number of literals in the above : 197
% 0.15/0.43 # Current number of archived formulas : 0
% 0.15/0.43 # Current number of archived clauses : 10
% 0.15/0.43 # Clause-clause subsumption calls (NU) : 234
% 0.15/0.43 # Rec. Clause-clause subsumption calls : 138
% 0.15/0.43 # Non-unit clause-clause subsumptions : 12
% 0.15/0.43 # Unit Clause-clause subsumption calls : 5
% 0.15/0.43 # Rewrite failures with RHS unbound : 0
% 0.15/0.43 # BW rewrite match attempts : 0
% 0.15/0.43 # BW rewrite match successes : 0
% 0.15/0.43 # Condensation attempts : 58
% 0.15/0.43 # Condensation successes : 0
% 0.15/0.43 # Termbank termtop insertions : 3447
% 0.15/0.43 # Search garbage collected termcells : 353
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.009 s
% 0.15/0.43 # System time : 0.000 s
% 0.15/0.43 # Total time : 0.009 s
% 0.15/0.43 # Maximum resident set size: 1900 pages
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.009 s
% 0.15/0.43 # System time : 0.002 s
% 0.15/0.43 # Total time : 0.011 s
% 0.15/0.43 # Maximum resident set size: 1708 pages
% 0.15/0.43 % E---3.1 exiting
% 0.15/0.43 % E exiting
%------------------------------------------------------------------------------