TSTP Solution File: SEV311^5 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : SEV311^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:14 EDT 2024
% Result : Theorem 0.16s 0.46s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : SEV311^5 : TPTP v8.2.0. Released v4.0.0.
% 0.09/0.10 % Command : run_E %s %d THM
% 0.10/0.29 % Computer : n029.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Fri Jun 21 18:51:24 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.16/0.44 Running higher-order theorem proving
% 0.16/0.44 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.eRFK1VfeE5/E---3.1_25153.p
% 0.16/0.46 # Version: 3.2.0-ho
% 0.16/0.46 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.16/0.46 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting post_as_ho12 with 300s (1) cores
% 0.16/0.46 # Starting new_bool_9 with 300s (1) cores
% 0.16/0.46 # Starting post_as_ho1 with 300s (1) cores
% 0.16/0.46 # Starting post_as_ho4 with 300s (1) cores
% 0.16/0.46 # Starting post_as_ho2 with 300s (1) cores
% 0.16/0.46 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.16/0.46 # Starting full_lambda_10 with 300s (1) cores
% 0.16/0.46 # Starting new_ho_8 with 300s (1) cores
% 0.16/0.46 # post_as_ho1 with pid 25294 completed with status 0
% 0.16/0.46 # Result found by post_as_ho1
% 0.16/0.46 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.16/0.46 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting post_as_ho12 with 300s (1) cores
% 0.16/0.46 # Starting new_bool_9 with 300s (1) cores
% 0.16/0.46 # Starting post_as_ho1 with 300s (1) cores
% 0.16/0.46 # No SInE strategy applied
% 0.16/0.46 # Search class: HGUNF-FFSF22-SSSFFSBN
% 0.16/0.46 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.46 # Starting new_ho_10 with 163s (1) cores
% 0.16/0.46 # new_ho_10 with pid 25302 completed with status 0
% 0.16/0.46 # Result found by new_ho_10
% 0.16/0.46 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.16/0.46 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46 # Starting post_as_ho12 with 300s (1) cores
% 0.16/0.46 # Starting new_bool_9 with 300s (1) cores
% 0.16/0.46 # Starting post_as_ho1 with 300s (1) cores
% 0.16/0.46 # No SInE strategy applied
% 0.16/0.46 # Search class: HGUNF-FFSF22-SSSFFSBN
% 0.16/0.46 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.46 # Starting new_ho_10 with 163s (1) cores
% 0.16/0.46 # Preprocessing time : 0.001 s
% 0.16/0.46 # Presaturation interreduction done
% 0.16/0.46
% 0.16/0.46 # Proof found!
% 0.16/0.46 # SZS status Theorem
% 0.16/0.46 # SZS output start CNFRefutation
% 0.16/0.46 thf(decl_sort1, type, a: $tType).
% 0.16/0.46 thf(decl_22, type, cF: (a > $o) > a > $o).
% 0.16/0.46 thf(decl_23, type, esk1_2: (a > $o) > (a > $o) > a).
% 0.16/0.46 thf(decl_24, type, esk2_0: a).
% 0.16/0.46 thf(decl_25, type, epred1_0: a > $o).
% 0.16/0.46 thf(decl_26, type, epred2_0: a > $o).
% 0.16/0.46 thf(decl_27, type, esk3_2: a > (a > $o) > a).
% 0.16/0.46 thf(decl_28, type, epred3_1: a > a > $o).
% 0.16/0.46 thf(cTHM521_pme, conjecture, (![X1:a > $o, X2:a > $o]:((![X3:a]:(((X1 @ X3)=>(X2 @ X3)))=>![X3:a]:(((cF @ X1 @ X3)=>(cF @ X2 @ X3)))))=>![X3:a]:(((cF @ (^[X4:a]:(![X5:a > $o]:((![X6:a]:(((cF @ X5 @ X6)=>(X5 @ X6)))=>(X5 @ X4))))) @ X3)=>![X5:a > $o]:((![X4:a]:(((cF @ X5 @ X4)=>(X5 @ X4)))=>(X5 @ X3)))))), file('/export/starexec/sandbox2/tmp/tmp.eRFK1VfeE5/E---3.1_25153.p', cTHM521_pme)).
% 0.16/0.46 thf(c_0_1, negated_conjecture, ~((![X1:a > $o, X2:a > $o]:((![X3:a]:(((X1 @ X3)=>(X2 @ X3)))=>![X3:a]:(((cF @ X1 @ X3)=>(cF @ X2 @ X3)))))=>![X3:a]:(((cF @ (^[Z0/* 6 */:a]:(![X5:a > $o]:((![X6:a]:(((cF @ X5 @ X6)=>X5 @ X6))=>X5 @ Z0)))) @ X3)=>![X5:a > $o]:((![X4:a]:(((cF @ X5 @ X4)=>(X5 @ X4)))=>(X5 @ X3))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM521_pme])])).
% 0.16/0.46 thf(c_0_2, negated_conjecture, ![X14:a > $o, X15:a > $o, X17:a, X20:a]:(((((X14 @ (esk1_2 @ X14 @ X15))|(~(cF @ X14 @ X17)|(cF @ X15 @ X17)))&(~(X15 @ (esk1_2 @ X14 @ X15))|(~(cF @ X14 @ X17)|(cF @ X15 @ X17))))&((cF @ (^[Z0/* 6 */:a]:(![X5:a > $o]:((![X6:a]:(((cF @ X5 @ X6)=>X5 @ X6))=>X5 @ Z0)))) @ esk2_0)&((~(cF @ epred1_0 @ X20)|(epred1_0 @ X20))&~(epred1_0 @ 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.16/0.46 thf(c_0_3, plain, ![X23:a]:(((epred2_0 @ X23)<=>![X21:a > $o]:((![X22:a]:(((cF @ X21 @ X22)=>(X21 @ X22)))=>(X21 @ X23))))), introduced(definition)).
% 0.16/0.46 thf(c_0_4, negated_conjecture, (((cF @ epred2_0 @ esk2_0))=(($true))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2]), c_0_3])).
% 0.16/0.46 thf(c_0_5, plain, ![X24:a, X25:a > $o, X28:a]:(((((cF @ X25 @ (esk3_2 @ X24 @ X25))|(X25 @ X24)|~(epred2_0 @ X24))&(~(X25 @ (esk3_2 @ X24 @ X25))|(X25 @ X24)|~(epred2_0 @ X24)))&((~(cF @ (epred3_1 @ X24) @ X28)|(epred3_1 @ X24 @ X28)|(epred2_0 @ X24))&(~(epred3_1 @ X24 @ X24)|(epred2_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.16/0.46 thf(c_0_6, negated_conjecture, ![X1:a > $o, X2:a > $o, X3:a]:(((cF @ X1 @ X3)|~((X1 @ (esk1_2 @ X2 @ X1)))|~((cF @ X2 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.16/0.46 thf(c_0_7, negated_conjecture, (cF @ epred2_0 @ esk2_0), inference(cn,[status(thm)],[c_0_4])).
% 0.16/0.46 thf(c_0_8, negated_conjecture, ![X3:a]:(((epred1_0 @ X3)|~((cF @ epred1_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.16/0.46 thf(c_0_9, plain, ![X1:a > $o, X3:a]:(((cF @ X1 @ (esk3_2 @ X3 @ X1))|(X1 @ X3)|~((epred2_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.16/0.46 thf(c_0_10, plain, ![X1:a > $o, X3:a]:(((X1 @ X3)|~((X1 @ (esk3_2 @ X3 @ X1)))|~((epred2_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.16/0.46 thf(c_0_11, negated_conjecture, ![X1:a > $o, X2:a > $o, X3:a]:(((X1 @ (esk1_2 @ X1 @ X2))|(cF @ X2 @ X3)|~((cF @ X1 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.16/0.46 thf(c_0_12, negated_conjecture, ![X1:a > $o]:(((cF @ X1 @ esk2_0)|~((X1 @ (esk1_2 @ epred2_0 @ X1))))), inference(spm,[status(thm)],[c_0_6, c_0_7])).
% 0.16/0.46 thf(c_0_13, negated_conjecture, ![X3:a]:(((epred1_0 @ X3)|~((epred2_0 @ X3)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8, c_0_9]), c_0_10])).
% 0.16/0.46 thf(c_0_14, negated_conjecture, ![X1:a > $o]:(((epred2_0 @ (esk1_2 @ epred2_0 @ X1))|(cF @ X1 @ esk2_0))), inference(spm,[status(thm)],[c_0_11, c_0_7])).
% 0.16/0.46 thf(c_0_15, negated_conjecture, (cF @ epred1_0 @ esk2_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13]), c_0_14])).
% 0.16/0.46 thf(c_0_16, negated_conjecture, ~((epred1_0 @ esk2_0)), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.16/0.46 thf(c_0_17, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8, c_0_15]), c_0_16]), ['proof']).
% 0.16/0.46 # SZS output end CNFRefutation
% 0.16/0.46 # Parsed axioms : 3
% 0.16/0.46 # Removed by relevancy pruning/SinE : 0
% 0.16/0.46 # Initial clauses : 11
% 0.16/0.46 # Removed in clause preprocessing : 2
% 0.16/0.46 # Initial clauses in saturation : 9
% 0.16/0.46 # Processed clauses : 25
% 0.16/0.46 # ...of these trivial : 0
% 0.16/0.46 # ...subsumed : 1
% 0.16/0.46 # ...remaining for further processing : 24
% 0.16/0.46 # Other redundant clauses eliminated : 0
% 0.16/0.46 # Clauses deleted for lack of memory : 0
% 0.16/0.46 # Backward-subsumed : 0
% 0.16/0.46 # Backward-rewritten : 0
% 0.16/0.46 # Generated clauses : 16
% 0.16/0.46 # ...of the previous two non-redundant : 13
% 0.16/0.46 # ...aggressively subsumed : 0
% 0.16/0.46 # Contextual simplify-reflections : 3
% 0.16/0.46 # Paramodulations : 16
% 0.16/0.46 # Factorizations : 0
% 0.16/0.46 # NegExts : 0
% 0.16/0.46 # Equation resolutions : 0
% 0.16/0.46 # Disequality decompositions : 0
% 0.16/0.46 # Total rewrite steps : 1
% 0.16/0.46 # ...of those cached : 0
% 0.16/0.46 # Propositional unsat checks : 0
% 0.16/0.46 # Propositional check models : 0
% 0.16/0.46 # Propositional check unsatisfiable : 0
% 0.16/0.46 # Propositional clauses : 0
% 0.16/0.46 # Propositional clauses after purity: 0
% 0.16/0.46 # Propositional unsat core size : 0
% 0.16/0.46 # Propositional preprocessing time : 0.000
% 0.16/0.46 # Propositional encoding time : 0.000
% 0.16/0.46 # Propositional solver time : 0.000
% 0.16/0.46 # Success case prop preproc time : 0.000
% 0.16/0.46 # Success case prop encoding time : 0.000
% 0.16/0.46 # Success case prop solver time : 0.000
% 0.16/0.46 # Current number of processed clauses : 15
% 0.16/0.46 # Positive orientable unit clauses : 2
% 0.16/0.46 # Positive unorientable unit clauses: 0
% 0.16/0.46 # Negative unit clauses : 2
% 0.16/0.46 # Non-unit-clauses : 11
% 0.16/0.46 # Current number of unprocessed clauses: 4
% 0.16/0.46 # ...number of literals in the above : 15
% 0.16/0.46 # Current number of archived formulas : 0
% 0.16/0.46 # Current number of archived clauses : 9
% 0.16/0.46 # Clause-clause subsumption calls (NU) : 27
% 0.16/0.46 # Rec. Clause-clause subsumption calls : 23
% 0.16/0.46 # Non-unit clause-clause subsumptions : 4
% 0.16/0.46 # Unit Clause-clause subsumption calls : 5
% 0.16/0.46 # Rewrite failures with RHS unbound : 0
% 0.16/0.46 # BW rewrite match attempts : 0
% 0.16/0.46 # BW rewrite match successes : 0
% 0.16/0.46 # Condensation attempts : 25
% 0.16/0.46 # Condensation successes : 0
% 0.16/0.46 # Termbank termtop insertions : 1311
% 0.16/0.46 # Search garbage collected termcells : 362
% 0.16/0.46
% 0.16/0.46 # -------------------------------------------------
% 0.16/0.46 # User time : 0.001 s
% 0.16/0.46 # System time : 0.003 s
% 0.16/0.46 # Total time : 0.004 s
% 0.16/0.46 # Maximum resident set size: 1900 pages
% 0.16/0.46
% 0.16/0.46 # -------------------------------------------------
% 0.16/0.46 # User time : 0.001 s
% 0.16/0.46 # System time : 0.007 s
% 0.16/0.46 # Total time : 0.008 s
% 0.16/0.46 # Maximum resident set size: 1716 pages
% 0.16/0.46 % E---3.1 exiting
% 0.16/0.46 % E exiting
%------------------------------------------------------------------------------