TSTP Solution File: SYO325^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO325^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 08:45:37 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.06/0.11 % Problem : SYO325^5 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.14/0.33 % Computer : n028.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Mon May 20 09:29:53 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running higher-order theorem proving
% 0.20/0.47 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.20/0.49 # Version: 3.1.0-ho
% 0.20/0.49 # Preprocessing class: HSSSSMSSSSMNSSA.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting sh3 with 1500s (5) cores
% 0.20/0.49 # Starting lpo8_s with 300s (1) cores
% 0.20/0.49 # Starting sh2lt with 300s (1) cores
% 0.20/0.49 # Starting sh2l with 300s (1) cores
% 0.20/0.49 # sh2l with pid 11646 completed with status 0
% 0.20/0.49 # Result found by sh2l
% 0.20/0.49 # Preprocessing class: HSSSSMSSSSMNSSA.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting sh3 with 1500s (5) cores
% 0.20/0.49 # Starting lpo8_s with 300s (1) cores
% 0.20/0.49 # Starting sh2lt with 300s (1) cores
% 0.20/0.49 # Starting sh2l with 300s (1) cores
% 0.20/0.49 # SinE strategy is gf120_gu_RUU_F100_L01000
% 0.20/0.49 # Search class: HGUNF-FFSF22-SSSFFMBN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting new_ho_10 with 181s (1) cores
% 0.20/0.49 # new_ho_10 with pid 11649 completed with status 0
% 0.20/0.49 # Result found by new_ho_10
% 0.20/0.49 # Preprocessing class: HSSSSMSSSSMNSSA.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting sh3 with 1500s (5) cores
% 0.20/0.49 # Starting lpo8_s with 300s (1) cores
% 0.20/0.49 # Starting sh2lt with 300s (1) cores
% 0.20/0.49 # Starting sh2l with 300s (1) cores
% 0.20/0.49 # SinE strategy is gf120_gu_RUU_F100_L01000
% 0.20/0.49 # Search class: HGUNF-FFSF22-SSSFFMBN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting new_ho_10 with 181s (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_sort1, type, a: $tType).
% 0.20/0.49 thf(decl_22, type, cK: (a > $o) > a > $o).
% 0.20/0.49 thf(decl_23, type, esk1_2: (a > $o) > (a > $o) > a).
% 0.20/0.49 thf(decl_24, type, esk2_0: a).
% 0.20/0.49 thf(decl_25, type, epred1_0: a > $o).
% 0.20/0.49 thf(decl_26, type, epred2_1: a > a > $o).
% 0.20/0.49 thf(decl_27, type, esk3_2: a > (a > $o) > a).
% 0.20/0.49 thf(cTHM116_1SS, 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)=>(cK @ (cK @ (^[X4:a]:(?[X5:a > $o]:((![X6:a]:(((X5 @ X6)=>(cK @ X5 @ X6)))&(X5 @ X4)))))) @ X3)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cTHM116_1SS)).
% 0.20/0.49 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)=>(cK @ (cK @ (^[Z0/* 5 */:a]:(?[X5:a > $o]:((![X6:a]:((X5 @ X6=>(cK @ X5 @ X6)))&X5 @ Z0))))) @ X3))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM116_1SS])])).
% 0.20/0.49 thf(c_0_2, negated_conjecture, ![X12:a > $o, X13:a > $o, X15:a]:(((((X12 @ (esk1_2 @ X12 @ X13))|(~(cK @ X12 @ X15)|(cK @ X13 @ X15)))&(~(X13 @ (esk1_2 @ X12 @ X13))|(~(cK @ X12 @ X15)|(cK @ X13 @ X15))))&((cK @ (^[Z0/* 5 */:a]:(?[X5:a > $o]:((![X6:a]:((X5 @ X6=>(cK @ X5 @ X6)))&X5 @ Z0)))) @ esk2_0)&~(cK @ (cK @ (^[Z0/* 5 */:a]:(?[X5:a > $o]:((![X6:a]:((X5 @ X6=>(cK @ X5 @ X6)))&X5 @ 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, plain, ![X23:a, X25:a, X26:a > $o]:((((~(epred2_1 @ X23 @ X25)|(cK @ (epred2_1 @ X23) @ X25)|~(epred1_0 @ X23))&((epred2_1 @ X23 @ X23)|~(epred1_0 @ X23)))&(((X26 @ (esk3_2 @ X23 @ X26))|~(X26 @ X23)|(epred1_0 @ X23))&(~(cK @ X26 @ (esk3_2 @ X23 @ X26))|~(X26 @ X23)|(epred1_0 @ X23))))), 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_4, 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.20/0.49 thf(c_0_5, plain, ![X4:a, X3:a]:(((cK @ (epred2_1 @ X3) @ X4)|~((epred2_1 @ X3 @ X4))|~((epred1_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.20/0.49 thf(c_0_6, plain, ![X19:a]:(((epred1_0 @ X19)<=>?[X17:a > $o]:((![X18:a]:(((X17 @ X18)=>(cK @ X17 @ X18)))&(X17 @ X19))))), introduced(definition)).
% 0.20/0.49 thf(c_0_7, 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.20/0.49 thf(c_0_8, plain, ![X1:a > $o, X3:a]:(((epred1_0 @ X3)|~((cK @ X1 @ (esk3_2 @ X3 @ X1)))|~((X1 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.20/0.49 thf(c_0_9, plain, ![X1:a > $o, X3:a]:(((X1 @ (esk3_2 @ X3 @ X1))|(epred1_0 @ X3)|~((X1 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.20/0.49 thf(c_0_10, 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_4, c_0_5])).
% 0.20/0.49 thf(c_0_11, plain, ![X3:a]:(((epred2_1 @ X3 @ X3)|~((epred1_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.20/0.49 thf(c_0_12, negated_conjecture, (((cK @ epred1_0 @ esk2_0))=(($true))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2]), c_0_6])).
% 0.20/0.49 thf(c_0_13, 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_7, c_0_5])).
% 0.20/0.49 thf(c_0_14, 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_8, c_0_5]), c_0_9])).
% 0.20/0.49 thf(c_0_15, 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_10, c_0_11])).
% 0.20/0.49 thf(c_0_16, negated_conjecture, (cK @ epred1_0 @ esk2_0), inference(cn,[status(thm)],[c_0_12])).
% 0.20/0.49 thf(c_0_17, 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_13, c_0_11])).
% 0.20/0.49 thf(c_0_18, 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_14, c_0_15])).
% 0.20/0.49 thf(c_0_19, negated_conjecture, ~((((cK @ (cK @ epred1_0) @ esk2_0))=(($true)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2]), c_0_6])).
% 0.20/0.49 thf(c_0_20, negated_conjecture, ![X1:a > $o]:(((cK @ X1 @ esk2_0)|~((X1 @ (esk1_2 @ epred1_0 @ X1))))), inference(spm,[status(thm)],[c_0_7, c_0_16])).
% 0.20/0.49 thf(c_0_21, plain, ![X3:a]:(((cK @ epred1_0 @ X3)|~((epred1_0 @ X3)))), inference(spm,[status(thm)],[c_0_17, c_0_18])).
% 0.20/0.49 thf(c_0_22, negated_conjecture, ~((cK @ (cK @ epred1_0) @ esk2_0)), inference(cn,[status(thm)],[c_0_19])).
% 0.20/0.49 thf(c_0_23, negated_conjecture, ~((epred1_0 @ (esk1_2 @ epred1_0 @ (cK @ epred1_0)))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_21]), c_0_22])).
% 0.20/0.49 thf(c_0_24, negated_conjecture, ![X1:a > $o]:(((epred1_0 @ (esk1_2 @ epred1_0 @ X1))|(cK @ X1 @ esk2_0))), inference(spm,[status(thm)],[c_0_4, c_0_16])).
% 0.20/0.49 thf(c_0_25, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_24]), c_0_22]), ['proof']).
% 0.20/0.49 # SZS output end CNFRefutation
% 0.20/0.49 # Parsed axioms : 3
% 0.20/0.49 # Removed by relevancy pruning/SinE : 2
% 0.20/0.49 # Initial clauses : 8
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 8
% 0.20/0.49 # Processed clauses : 47
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 6
% 0.20/0.49 # ...remaining for further processing : 41
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 0
% 0.20/0.49 # Backward-rewritten : 0
% 0.20/0.49 # Generated clauses : 88
% 0.20/0.49 # ...of the previous two non-redundant : 77
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 1
% 0.20/0.49 # Paramodulations : 87
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 5
% 0.20/0.49 # ...of those cached : 4
% 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 : 32
% 0.20/0.49 # Positive orientable unit clauses : 1
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 2
% 0.20/0.49 # Non-unit-clauses : 29
% 0.20/0.49 # Current number of unprocessed clauses: 45
% 0.20/0.49 # ...number of literals in the above : 212
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 9
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 264
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 140
% 0.20/0.49 # Non-unit clause-clause subsumptions : 7
% 0.20/0.49 # Unit Clause-clause subsumption calls : 0
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 0
% 0.20/0.49 # BW rewrite match successes : 0
% 0.20/0.49 # Condensation attempts : 47
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 3173
% 0.20/0.49 # Search garbage collected termcells : 330
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.005 s
% 0.20/0.49 # System time : 0.003 s
% 0.20/0.49 # Total time : 0.008 s
% 0.20/0.49 # Maximum resident set size: 1916 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.005 s
% 0.20/0.49 # System time : 0.006 s
% 0.20/0.49 # Total time : 0.011 s
% 0.20/0.49 # Maximum resident set size: 1724 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------