TSTP Solution File: SEU868^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU868^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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 03:30:43 EDT 2024
% Result : Theorem 0.18s 0.47s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SEU868^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n028.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Sun May 19 18:06:07 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.18/0.45 Running higher-order theorem proving
% 0.18/0.45 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.18/0.47 # Version: 3.1.0-ho
% 0.18/0.47 # Preprocessing class: HSSSSMSSSSMNHHA.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting post_as_ho5 with 1500s (5) cores
% 0.18/0.47 # Starting sh2lt with 300s (1) cores
% 0.18/0.47 # Starting ehoh_best8_lambda with 300s (1) cores
% 0.18/0.47 # Starting post_as_ho10 with 300s (1) cores
% 0.18/0.47 # sh2lt with pid 23125 completed with status 0
% 0.18/0.47 # Result found by sh2lt
% 0.18/0.47 # Preprocessing class: HSSSSMSSSSMNHHA.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting post_as_ho5 with 1500s (5) cores
% 0.18/0.47 # Starting sh2lt with 300s (1) cores
% 0.18/0.47 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.18/0.47 # Search class: HGUSF-FFSF31-SHHFFMBN
% 0.18/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.47 # Starting new_ho_10 with 181s (1) cores
% 0.18/0.47 # new_ho_10 with pid 23135 completed with status 0
% 0.18/0.47 # Result found by new_ho_10
% 0.18/0.47 # Preprocessing class: HSSSSMSSSSMNHHA.
% 0.18/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47 # Starting post_as_ho5 with 1500s (5) cores
% 0.18/0.47 # Starting sh2lt with 300s (1) cores
% 0.18/0.47 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.18/0.47 # Search class: HGUSF-FFSF31-SHHFFMBN
% 0.18/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.47 # Starting new_ho_10 with 181s (1) cores
% 0.18/0.47 # Preprocessing time : 0.001 s
% 0.18/0.47 # Presaturation interreduction done
% 0.18/0.47
% 0.18/0.47 # Proof found!
% 0.18/0.47 # SZS status Theorem
% 0.18/0.47 # SZS output start CNFRefutation
% 0.18/0.47 thf(decl_sort1, type, a: $tType).
% 0.18/0.47 thf(decl_22, type, cC: a > $o).
% 0.18/0.47 thf(decl_23, type, epred1_1: ((a > $o) > $o) > a > $o).
% 0.18/0.47 thf(decl_24, type, esk1_1: ((a > $o) > $o) > a).
% 0.18/0.47 thf(decl_25, type, epred2_0: (a > $o) > $o).
% 0.18/0.47 thf(decl_26, type, esk2_1: (a > $o) > a).
% 0.18/0.47 thf(decl_27, type, esk3_3: (a > $o) > a > (a > $o) > a).
% 0.18/0.47 thf(decl_28, type, epred3_1: ((a > $o) > $o) > a > $o).
% 0.18/0.47 thf(decl_29, type, epred4_0: a > $o).
% 0.18/0.47 thf(cTHM551_pme, conjecture, (![X1:(a > $o) > $o]:((((X1 @ (^[X2:a]:(~($true))))&![X3:a > $o, X2:a]:(((X1 @ X3)=>(X1 @ (^[X4:a]:(((X3 @ X4)|((X4)=(X2)))))))))=>(X1 @ cC)))=>![X5:(a > $o) > $o]:(((![X6:a > $o]:((~(?[X4:a]:((X6 @ X4)))=>(X5 @ X6)))&![X7:a > $o, X2:a, X8:a > $o]:((((X5 @ X7)&![X9:a]:(((X8 @ X9)<=>((X7 @ X9)|((X9)=(X2))))))=>(X5 @ X8))))=>(X5 @ cC)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cTHM551_pme)).
% 0.18/0.47 thf(c_0_1, negated_conjecture, ~((![X1:(a > $o) > $o]:((((X1 @ (^[Z0/* 7 */:a]:(~($true))))&![X3:a > $o, X2:a]:(((X1 @ X3)=>(X1 @ (^[Z0/* 9 */:a]:((X3 @ Z0|((Z0)=(X2)))))))))=>(X1 @ cC)))=>![X5:(a > $o) > $o]:(((![X6:a > $o]:((~(?[X4:a]:((X6 @ X4)))=>(X5 @ X6)))&![X7:a > $o, X2:a, X8:a > $o]:((((X5 @ X7)&![X9:a]:(((X8 @ X9)<=>((X7 @ X9)|((X9)=(X2))))))=>(X5 @ X8))))=>(X5 @ cC))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM551_pme])])).
% 0.18/0.47 thf(c_0_2, plain, ![X33:a]:(((~(epred4_0 @ X33)|~($true))&(($true)|(epred4_0 @ X33)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])).
% 0.18/0.47 thf(c_0_3, negated_conjecture, ![X20:(a > $o) > $o, X24:a > $o, X26:a > $o, X27:a, X28:a > $o]:(((((X20 @ (epred1_1 @ X20))|~(X20 @ (^[Z0/* 7 */:a]:(~($true))))|(X20 @ cC))&(~(X20 @ (^[Z0/* 9 */:a]:((epred1_1 @ X20 @ Z0|((Z0)=(esk1_1 @ X20))))))|~(X20 @ (^[Z0/* 7 */:a]:(~($true))))|(X20 @ cC)))&((((X24 @ (esk2_1 @ X24))|(epred2_0 @ X24))&(((~(X26 @ (esk3_3 @ X26 @ X27 @ X28))|~(X28 @ (esk3_3 @ X26 @ X27 @ X28))|~(epred2_0 @ X26)|(epred2_0 @ X28))&(((esk3_3 @ X26 @ X27 @ X28)!=(X27))|~(X28 @ (esk3_3 @ X26 @ X27 @ X28))|~(epred2_0 @ X26)|(epred2_0 @ X28)))&((X28 @ (esk3_3 @ X26 @ X27 @ X28))|((X26 @ (esk3_3 @ X26 @ X27 @ X28))|((esk3_3 @ X26 @ X27 @ X28)=(X27)))|~(epred2_0 @ X26)|(epred2_0 @ X28))))&~(epred2_0 @ cC)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])])).
% 0.18/0.47 thf(c_0_4, plain, ![X31:a]:(((epred4_0 @ X31)<=>~(($true)))), introduced(definition)).
% 0.18/0.47 thf(c_0_5, plain, ![X2:a]:((~((epred4_0 @ X2))|~(($true)))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.18/0.47 thf(c_0_6, negated_conjecture, ![X1:(a > $o) > $o]:(((X1 @ (epred1_1 @ X1))|(X1 @ cC)|~((((X1 @ epred4_0))=(($true)))))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_3]), c_0_4])).
% 0.18/0.47 thf(c_0_7, plain, ![X2:a]:(~((epred4_0 @ X2))), inference(cn,[status(thm)],[c_0_5])).
% 0.18/0.47 thf(c_0_8, negated_conjecture, ![X3:a > $o]:(((X3 @ (esk2_1 @ X3))|(epred2_0 @ X3))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.18/0.47 thf(c_0_9, negated_conjecture, ![X1:(a > $o) > $o]:(((X1 @ (epred1_1 @ X1))|(X1 @ cC)|~((X1 @ epred4_0)))), inference(cn,[status(thm)],[c_0_6])).
% 0.18/0.47 thf(c_0_10, plain, (epred2_0 @ epred4_0), inference(spm,[status(thm)],[c_0_7, c_0_8])).
% 0.18/0.47 thf(c_0_11, negated_conjecture, ~((epred2_0 @ cC)), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.18/0.47 thf(c_0_12, plain, ![X34:a, X35:(a > $o) > $o]:(((~(epred3_1 @ X35 @ X34)|((epred1_1 @ X35 @ X34)|((X34)=(esk1_1 @ X35))))&((~(epred1_1 @ X35 @ X34)|(epred3_1 @ X35 @ X34))&(((X34)!=(esk1_1 @ X35))|(epred3_1 @ X35 @ X34))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])])).
% 0.18/0.47 thf(c_0_13, negated_conjecture, ![X2:a, X3:a > $o, X6:a > $o]:(((X3 @ (esk3_3 @ X6 @ X2 @ X3))|(X6 @ (esk3_3 @ X6 @ X2 @ X3))|((esk3_3 @ X6 @ X2 @ X3)=(X2))|(epred2_0 @ X3)|~((epred2_0 @ X6)))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.18/0.47 thf(c_0_14, negated_conjecture, (epred2_0 @ (epred1_1 @ epred2_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9, c_0_10]), c_0_11])).
% 0.18/0.47 thf(c_0_15, plain, ![X1:(a > $o) > $o, X2:a]:(((epred3_1 @ X1 @ X2)|~((epred1_1 @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_12])).
% 0.18/0.47 thf(c_0_16, negated_conjecture, ![X2:a, X3:a > $o]:((((esk3_3 @ (epred1_1 @ epred2_0) @ X2 @ X3)=(X2))|(epred1_1 @ epred2_0 @ (esk3_3 @ (epred1_1 @ epred2_0) @ X2 @ X3))|(X3 @ (esk3_3 @ (epred1_1 @ epred2_0) @ X2 @ X3))|(epred2_0 @ X3))), inference(spm,[status(thm)],[c_0_13, c_0_14])).
% 0.18/0.47 thf(c_0_17, plain, ![X2:a, X3:a > $o]:((((esk3_3 @ (epred1_1 @ epred2_0) @ X2 @ X3)=(X2))|(epred3_1 @ epred2_0 @ (esk3_3 @ (epred1_1 @ epred2_0) @ X2 @ X3))|(X3 @ (esk3_3 @ (epred1_1 @ epred2_0) @ X2 @ X3))|(epred2_0 @ X3))), inference(spm,[status(thm)],[c_0_15, c_0_16])).
% 0.18/0.47 thf(c_0_18, plain, ![X1:(a > $o) > $o, X2:a]:(((epred1_1 @ X1 @ X2)|((X2)=(esk1_1 @ X1))|~((epred3_1 @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_12])).
% 0.18/0.47 thf(c_0_19, negated_conjecture, ![X2:a, X6:a > $o, X3:a > $o]:(((epred2_0 @ X6)|~((X3 @ (esk3_3 @ X3 @ X2 @ X6)))|~((X6 @ (esk3_3 @ X3 @ X2 @ X6)))|~((epred2_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.18/0.47 thf(c_0_20, plain, ![X2:a]:((((esk3_3 @ (epred1_1 @ epred2_0) @ X2 @ (epred3_1 @ epred2_0))=(X2))|(epred3_1 @ epred2_0 @ (esk3_3 @ (epred1_1 @ epred2_0) @ X2 @ (epred3_1 @ epred2_0)))|(epred2_0 @ (epred3_1 @ epred2_0)))), inference(ef,[status(thm)],[c_0_17])).
% 0.18/0.47 thf(c_0_21, plain, ![X2:a, X1:(a > $o) > $o]:((((esk3_3 @ (epred1_1 @ epred2_0) @ X2 @ (epred3_1 @ X1))=(esk1_1 @ X1))|((esk3_3 @ (epred1_1 @ epred2_0) @ X2 @ (epred3_1 @ X1))=(X2))|(epred1_1 @ epred2_0 @ (esk3_3 @ (epred1_1 @ epred2_0) @ X2 @ (epred3_1 @ X1)))|(epred1_1 @ X1 @ (esk3_3 @ (epred1_1 @ epred2_0) @ X2 @ (epred3_1 @ X1)))|(epred2_0 @ (epred3_1 @ X1)))), inference(spm,[status(thm)],[c_0_18, c_0_16])).
% 0.18/0.47 thf(c_0_22, negated_conjecture, ![X2:a]:((((esk3_3 @ (epred1_1 @ epred2_0) @ X2 @ (epred3_1 @ epred2_0))=(X2))|(epred2_0 @ (epred3_1 @ epred2_0))|~((epred1_1 @ epred2_0 @ (esk3_3 @ (epred1_1 @ epred2_0) @ X2 @ (epred3_1 @ epred2_0)))))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_20]), c_0_14])])).
% 0.18/0.47 thf(c_0_23, plain, ![X2:a]:((((esk3_3 @ (epred1_1 @ epred2_0) @ X2 @ (epred3_1 @ epred2_0))=(esk1_1 @ epred2_0))|((esk3_3 @ (epred1_1 @ epred2_0) @ X2 @ (epred3_1 @ epred2_0))=(X2))|(epred1_1 @ epred2_0 @ (esk3_3 @ (epred1_1 @ epred2_0) @ X2 @ (epred3_1 @ epred2_0)))|(epred2_0 @ (epred3_1 @ epred2_0)))), inference(ef,[status(thm)],[c_0_21])).
% 0.18/0.47 thf(c_0_24, plain, ![X30:a, X1:(a > $o) > $o]:(((epred3_1 @ X1 @ X30)<=>((epred1_1 @ X1 @ X30)|((X30)=(esk1_1 @ X1))))), introduced(definition)).
% 0.18/0.47 thf(c_0_25, plain, ![X2:a]:((((esk3_3 @ (epred1_1 @ epred2_0) @ X2 @ (epred3_1 @ epred2_0))=(esk1_1 @ epred2_0))|((esk3_3 @ (epred1_1 @ epred2_0) @ X2 @ (epred3_1 @ epred2_0))=(X2))|(epred2_0 @ (epred3_1 @ epred2_0)))), inference(spm,[status(thm)],[c_0_22, c_0_23])).
% 0.18/0.47 thf(c_0_26, plain, ![X2:a, X1:(a > $o) > $o]:(((epred3_1 @ X1 @ X2)|((X2)!=(esk1_1 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_12])).
% 0.18/0.47 thf(c_0_27, negated_conjecture, ![X1:(a > $o) > $o]:(((X1 @ cC)|~((((X1 @ (epred3_1 @ X1)))=(($true))))|~((((X1 @ epred4_0))=(($true)))))), inference(lift_lambdas,[status(thm)],[inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_3]), c_0_4]), c_0_24])).
% 0.18/0.47 thf(c_0_28, negated_conjecture, ![X2:a, X6:a > $o, X3:a > $o]:(((epred2_0 @ X6)|((esk3_3 @ X3 @ X2 @ X6)!=(X2))|~((X6 @ (esk3_3 @ X3 @ X2 @ X6)))|~((epred2_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.18/0.47 thf(c_0_29, plain, (((esk3_3 @ (epred1_1 @ epred2_0) @ (esk1_1 @ epred2_0) @ (epred3_1 @ epred2_0))=(esk1_1 @ epred2_0))|(epred2_0 @ (epred3_1 @ epred2_0))), inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_25])])).
% 0.18/0.47 thf(c_0_30, plain, ![X1:(a > $o) > $o]:((epred3_1 @ X1 @ (esk1_1 @ X1))), inference(er,[status(thm)],[c_0_26])).
% 0.18/0.47 thf(c_0_31, negated_conjecture, ![X1:(a > $o) > $o]:(((X1 @ cC)|~((X1 @ (epred3_1 @ X1)))|~((X1 @ epred4_0)))), inference(cn,[status(thm)],[c_0_27])).
% 0.18/0.47 thf(c_0_32, negated_conjecture, (epred2_0 @ (epred3_1 @ epred2_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_29]), c_0_30]), c_0_14])])).
% 0.18/0.47 thf(c_0_33, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31, c_0_32]), c_0_10])]), c_0_11]), ['proof']).
% 0.18/0.47 # SZS output end CNFRefutation
% 0.18/0.47 # Parsed axioms : 3
% 0.18/0.47 # Removed by relevancy pruning/SinE : 2
% 0.18/0.47 # Initial clauses : 12
% 0.18/0.47 # Removed in clause preprocessing : 1
% 0.18/0.47 # Initial clauses in saturation : 11
% 0.18/0.47 # Processed clauses : 50
% 0.18/0.47 # ...of these trivial : 0
% 0.18/0.47 # ...subsumed : 9
% 0.18/0.47 # ...remaining for further processing : 41
% 0.18/0.47 # Other redundant clauses eliminated : 4
% 0.18/0.47 # Clauses deleted for lack of memory : 0
% 0.18/0.47 # Backward-subsumed : 1
% 0.18/0.47 # Backward-rewritten : 4
% 0.18/0.47 # Generated clauses : 62
% 0.18/0.47 # ...of the previous two non-redundant : 45
% 0.18/0.47 # ...aggressively subsumed : 0
% 0.18/0.47 # Contextual simplify-reflections : 0
% 0.18/0.47 # Paramodulations : 50
% 0.18/0.47 # Factorizations : 8
% 0.18/0.47 # NegExts : 0
% 0.18/0.47 # Equation resolutions : 4
% 0.18/0.47 # Disequality decompositions : 0
% 0.18/0.47 # Total rewrite steps : 32
% 0.18/0.47 # ...of those cached : 28
% 0.18/0.47 # Propositional unsat checks : 0
% 0.18/0.47 # Propositional check models : 0
% 0.18/0.47 # Propositional check unsatisfiable : 0
% 0.18/0.47 # Propositional clauses : 0
% 0.18/0.47 # Propositional clauses after purity: 0
% 0.18/0.47 # Propositional unsat core size : 0
% 0.18/0.47 # Propositional preprocessing time : 0.000
% 0.18/0.47 # Propositional encoding time : 0.000
% 0.18/0.47 # Propositional solver time : 0.000
% 0.18/0.47 # Success case prop preproc time : 0.000
% 0.18/0.47 # Success case prop encoding time : 0.000
% 0.18/0.47 # Success case prop solver time : 0.000
% 0.18/0.47 # Current number of processed clauses : 24
% 0.18/0.47 # Positive orientable unit clauses : 4
% 0.18/0.47 # Positive unorientable unit clauses: 0
% 0.18/0.47 # Negative unit clauses : 2
% 0.18/0.47 # Non-unit-clauses : 18
% 0.18/0.47 # Current number of unprocessed clauses: 17
% 0.18/0.47 # ...number of literals in the above : 65
% 0.18/0.47 # Current number of archived formulas : 0
% 0.18/0.47 # Current number of archived clauses : 16
% 0.18/0.47 # Clause-clause subsumption calls (NU) : 155
% 0.18/0.47 # Rec. Clause-clause subsumption calls : 25
% 0.18/0.47 # Non-unit clause-clause subsumptions : 9
% 0.18/0.47 # Unit Clause-clause subsumption calls : 6
% 0.18/0.47 # Rewrite failures with RHS unbound : 0
% 0.18/0.47 # BW rewrite match attempts : 1
% 0.18/0.47 # BW rewrite match successes : 1
% 0.18/0.47 # Condensation attempts : 50
% 0.18/0.47 # Condensation successes : 0
% 0.18/0.47 # Termbank termtop insertions : 3196
% 0.18/0.47 # Search garbage collected termcells : 480
% 0.18/0.47
% 0.18/0.47 # -------------------------------------------------
% 0.18/0.47 # User time : 0.008 s
% 0.18/0.47 # System time : 0.001 s
% 0.18/0.47 # Total time : 0.009 s
% 0.18/0.47 # Maximum resident set size: 1940 pages
% 0.18/0.47
% 0.18/0.47 # -------------------------------------------------
% 0.18/0.47 # User time : 0.008 s
% 0.18/0.47 # System time : 0.004 s
% 0.18/0.47 # Total time : 0.012 s
% 0.18/0.47 # Maximum resident set size: 1732 pages
% 0.18/0.47 % E---3.1 exiting
% 0.18/0.48 % E exiting
%------------------------------------------------------------------------------