TSTP Solution File: SYO324^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO324^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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.19s 0.50s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYO324^5 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n025.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon May 20 09:53:38 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.48 Running higher-order theorem proving
% 0.19/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/benchmark/theBenchmark.p
% 0.19/0.50 # Version: 3.1.0-ho
% 0.19/0.50 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.19/0.50 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting sh2lt with 1200s (4) cores
% 0.19/0.50 # Starting new_ho_10_unif with 300s (1) cores
% 0.19/0.50 # Starting full_lambda_6 with 300s (1) cores
% 0.19/0.50 # Starting post_as_ho1 with 300s (1) cores
% 0.19/0.50 # Starting ehoh_best3_rw with 300s (1) cores
% 0.19/0.50 # post_as_ho1 with pid 17161 completed with status 0
% 0.19/0.50 # Result found by post_as_ho1
% 0.19/0.50 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.19/0.50 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting sh2lt with 1200s (4) cores
% 0.19/0.50 # Starting new_ho_10_unif with 300s (1) cores
% 0.19/0.50 # Starting full_lambda_6 with 300s (1) cores
% 0.19/0.50 # Starting post_as_ho1 with 300s (1) cores
% 0.19/0.50 # No SInE strategy applied
% 0.19/0.50 # Search class: HGHNF-FFSF00-SHHFFMBN
% 0.19/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 # Starting new_ho_10 with 163s (1) cores
% 0.19/0.50 # new_ho_10 with pid 17169 completed with status 0
% 0.19/0.50 # Result found by new_ho_10
% 0.19/0.50 # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.19/0.50 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting sh2lt with 1200s (4) cores
% 0.19/0.50 # Starting new_ho_10_unif with 300s (1) cores
% 0.19/0.50 # Starting full_lambda_6 with 300s (1) cores
% 0.19/0.50 # Starting post_as_ho1 with 300s (1) cores
% 0.19/0.50 # No SInE strategy applied
% 0.19/0.50 # Search class: HGHNF-FFSF00-SHHFFMBN
% 0.19/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 # Starting new_ho_10 with 163s (1) cores
% 0.19/0.50 # Preprocessing time : 0.001 s
% 0.19/0.50 # Presaturation interreduction done
% 0.19/0.50
% 0.19/0.50 # Proof found!
% 0.19/0.50 # SZS status Theorem
% 0.19/0.50 # SZS output start CNFRefutation
% 0.19/0.50 thf(decl_22, type, esk1_0: ($i > $o) > $i).
% 0.19/0.50 thf(decl_23, type, epred1_2: ($i > $o) > ($i > $o) > $i > $o).
% 0.19/0.50 thf(decl_24, type, epred2_0: $i > $o).
% 0.19/0.50 thf(decl_25, type, epred3_0: $i > $o).
% 0.19/0.50 thf(decl_26, type, epred4_1: $i > $i > $o).
% 0.19/0.50 thf(decl_27, type, epred5_2: $i > ($i > $o) > $i > $o).
% 0.19/0.50 thf(cTHM143_EXPANDB, conjecture, ![X1:($i > $o) > $i]:((?[X2:$i > $o, X3:$i > $o]:((![X4:$i > $o]:((~((X4 @ (X1 @ X2)))|(X4 @ (X1 @ X3))))&?[X5:$i]:(~(((X2 @ X5)<=>(X3 @ X5))))))|![X6:$i > $o]:(((X6 @ (X1 @ X6))|?[X3:$i > $o]:(((X3 @ (X1 @ (^[X7:$i]:(?[X8:$i > $o]:((~((X8 @ (X1 @ X8)))&![X9:$i > $o]:((~((X9 @ X7))|(X9 @ (X1 @ X8))))))))))&~((X3 @ (X1 @ X6))))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cTHM143_EXPANDB)).
% 0.19/0.50 thf(c_0_1, negated_conjecture, ~(![X1:($i > $o) > $i]:((?[X2:$i > $o, X3:$i > $o]:((![X4:$i > $o]:((~((X4 @ (X1 @ X2)))|(X4 @ (X1 @ X3))))&?[X5:$i]:(~(((X2 @ X5)<=>(X3 @ X5))))))|![X6:$i > $o]:(((X6 @ (X1 @ X6))|?[X3:$i > $o]:(((X3 @ (X1 @ (^[Z0/* 5 */:$i]:(?[X8:$i > $o]:((~(X8 @ (X1 @ X8))&![X9:$i > $o]:((~(X9 @ Z0)|X9 @ (X1 @ X8)))))))))&~((X3 @ (X1 @ X6)))))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM143_EXPANDB])])).
% 0.19/0.50 thf(c_0_2, negated_conjecture, ![X18:$i > $o, X19:$i > $o, X21:$i, X23:$i > $o]:(((((~(X18 @ X21)|(X19 @ X21)|(epred1_2 @ X18 @ X19 @ (esk1_0 @ X18)))&(~(X19 @ X21)|(X18 @ X21)|(epred1_2 @ X18 @ X19 @ (esk1_0 @ X18))))&((~(X18 @ X21)|(X19 @ X21)|~(epred1_2 @ X18 @ X19 @ (esk1_0 @ X19)))&(~(X19 @ X21)|(X18 @ X21)|~(epred1_2 @ X18 @ X19 @ (esk1_0 @ X19)))))&(~(epred2_0 @ (esk1_0 @ epred2_0))&(~(X23 @ (esk1_0 @ (^[Z0/* 5 */:$i]:(?[X8:$i > $o]:((~(X8 @ (esk1_0 @ X8))&![X9:$i > $o]:((~(X9 @ Z0)|X9 @ (esk1_0 @ X8)))))))))|(X23 @ (esk1_0 @ epred2_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.19/0.50 thf(c_0_3, plain, ![X26:$i]:(((epred3_0 @ X26)<=>?[X24:$i > $o]:((~((X24 @ (esk1_0 @ X24)))&![X25:$i > $o]:((~((X25 @ X26))|(X25 @ (esk1_0 @ X24)))))))), introduced(definition)).
% 0.19/0.50 thf(c_0_4, plain, ![X27:$i, X29:$i > $o, X30:$i, X31:$i > $o]:((((~(epred4_1 @ X27 @ (esk1_0 @ (epred4_1 @ X27)))|~(epred3_0 @ X27))&(~(X29 @ X27)|(X29 @ (esk1_0 @ (epred4_1 @ X27)))|~(epred3_0 @ X27)))&(((epred5_2 @ X30 @ X31 @ X30)|(X31 @ (esk1_0 @ X31))|(epred3_0 @ X30))&(~(epred5_2 @ X30 @ X31 @ (esk1_0 @ X31))|(X31 @ (esk1_0 @ X31))|(epred3_0 @ X30))))), 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)],[])])])])])])])).
% 0.19/0.50 thf(c_0_5, negated_conjecture, ![X2:$i > $o]:(((X2 @ (esk1_0 @ epred2_0))|~((((X2 @ (esk1_0 @ epred3_0)))=(($true)))))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2]), c_0_3])).
% 0.19/0.50 thf(c_0_6, plain, ![X5:$i, X2:$i > $o]:(((X2 @ (esk1_0 @ X2))|(epred3_0 @ X5)|~((epred5_2 @ X5 @ X2 @ (esk1_0 @ X2))))), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.19/0.50 thf(c_0_7, negated_conjecture, ![X2:$i > $o]:(((X2 @ (esk1_0 @ epred2_0))|~((X2 @ (esk1_0 @ epred3_0))))), inference(cn,[status(thm)],[c_0_5])).
% 0.19/0.50 thf(c_0_8, negated_conjecture, ~((epred2_0 @ (esk1_0 @ epred2_0))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.19/0.50 thf(c_0_9, negated_conjecture, ![X5:$i]:(((epred3_0 @ X5)|~((epred5_2 @ X5 @ epred2_0 @ (esk1_0 @ epred3_0))))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_6, c_0_7]), c_0_8])).
% 0.19/0.50 thf(c_0_10, plain, ![X2:$i > $o, X5:$i]:(((epred5_2 @ X5 @ X2 @ X5)|(X2 @ (esk1_0 @ X2))|(epred3_0 @ X5))), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.19/0.50 thf(c_0_11, negated_conjecture, ![X2:$i > $o, X5:$i, X3:$i > $o]:(((X3 @ X5)|~((X2 @ X5))|~((epred1_2 @ X2 @ X3 @ (esk1_0 @ X3))))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.19/0.50 thf(c_0_12, negated_conjecture, ![X2:$i > $o, X3:$i > $o, X5:$i]:(((X3 @ X5)|(epred1_2 @ X2 @ X3 @ (esk1_0 @ X2))|~((X2 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.19/0.50 thf(c_0_13, plain, (epred3_0 @ (esk1_0 @ epred3_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9, c_0_10]), c_0_8])).
% 0.19/0.50 thf(c_0_14, negated_conjecture, ![X2:$i > $o, X5:$i]:(((epred2_0 @ X5)|~((epred1_2 @ X2 @ epred2_0 @ (esk1_0 @ epred3_0)))|~((X2 @ X5)))), inference(spm,[status(thm)],[c_0_11, c_0_7])).
% 0.19/0.50 thf(c_0_15, negated_conjecture, ![X2:$i > $o]:(((epred1_2 @ epred3_0 @ X2 @ (esk1_0 @ epred3_0))|(X2 @ (esk1_0 @ epred3_0)))), inference(spm,[status(thm)],[c_0_12, c_0_13])).
% 0.19/0.50 thf(c_0_16, negated_conjecture, ~((epred2_0 @ (esk1_0 @ epred3_0))), inference(spm,[status(thm)],[c_0_8, c_0_7])).
% 0.19/0.50 thf(c_0_17, negated_conjecture, ![X5:$i]:(((epred2_0 @ X5)|~((epred3_0 @ X5)))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_16])).
% 0.19/0.50 thf(c_0_18, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_13])]), ['proof']).
% 0.19/0.50 # SZS output end CNFRefutation
% 0.19/0.50 # Parsed axioms : 1
% 0.19/0.50 # Removed by relevancy pruning/SinE : 0
% 0.19/0.50 # Initial clauses : 10
% 0.19/0.50 # Removed in clause preprocessing : 0
% 0.19/0.50 # Initial clauses in saturation : 10
% 0.19/0.50 # Processed clauses : 38
% 0.19/0.50 # ...of these trivial : 0
% 0.19/0.50 # ...subsumed : 0
% 0.19/0.50 # ...remaining for further processing : 38
% 0.19/0.50 # Other redundant clauses eliminated : 0
% 0.19/0.50 # Clauses deleted for lack of memory : 0
% 0.19/0.50 # Backward-subsumed : 0
% 0.19/0.50 # Backward-rewritten : 1
% 0.19/0.50 # Generated clauses : 65
% 0.19/0.50 # ...of the previous two non-redundant : 55
% 0.19/0.50 # ...aggressively subsumed : 0
% 0.19/0.50 # Contextual simplify-reflections : 1
% 0.19/0.50 # Paramodulations : 63
% 0.19/0.50 # Factorizations : 2
% 0.19/0.50 # NegExts : 0
% 0.19/0.50 # Equation resolutions : 0
% 0.19/0.50 # Disequality decompositions : 0
% 0.19/0.50 # Total rewrite steps : 10
% 0.19/0.50 # ...of those cached : 8
% 0.19/0.50 # Propositional unsat checks : 0
% 0.19/0.50 # Propositional check models : 0
% 0.19/0.50 # Propositional check unsatisfiable : 0
% 0.19/0.50 # Propositional clauses : 0
% 0.19/0.50 # Propositional clauses after purity: 0
% 0.19/0.50 # Propositional unsat core size : 0
% 0.19/0.50 # Propositional preprocessing time : 0.000
% 0.19/0.50 # Propositional encoding time : 0.000
% 0.19/0.50 # Propositional solver time : 0.000
% 0.19/0.50 # Success case prop preproc time : 0.000
% 0.19/0.50 # Success case prop encoding time : 0.000
% 0.19/0.50 # Success case prop solver time : 0.000
% 0.19/0.50 # Current number of processed clauses : 27
% 0.19/0.50 # Positive orientable unit clauses : 2
% 0.19/0.50 # Positive unorientable unit clauses: 0
% 0.19/0.50 # Negative unit clauses : 3
% 0.19/0.50 # Non-unit-clauses : 22
% 0.19/0.50 # Current number of unprocessed clauses: 35
% 0.19/0.50 # ...number of literals in the above : 120
% 0.19/0.50 # Current number of archived formulas : 0
% 0.19/0.50 # Current number of archived clauses : 11
% 0.19/0.50 # Clause-clause subsumption calls (NU) : 79
% 0.19/0.50 # Rec. Clause-clause subsumption calls : 66
% 0.19/0.50 # Non-unit clause-clause subsumptions : 1
% 0.19/0.50 # Unit Clause-clause subsumption calls : 1
% 0.19/0.50 # Rewrite failures with RHS unbound : 0
% 0.19/0.50 # BW rewrite match attempts : 1
% 0.19/0.50 # BW rewrite match successes : 1
% 0.19/0.50 # Condensation attempts : 38
% 0.19/0.50 # Condensation successes : 0
% 0.19/0.50 # Termbank termtop insertions : 2291
% 0.19/0.50 # Search garbage collected termcells : 395
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.006 s
% 0.19/0.50 # System time : 0.003 s
% 0.19/0.50 # Total time : 0.008 s
% 0.19/0.50 # Maximum resident set size: 1856 pages
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.006 s
% 0.19/0.50 # System time : 0.005 s
% 0.19/0.50 # Total time : 0.011 s
% 0.19/0.50 # Maximum resident set size: 1712 pages
% 0.19/0.50 % E---3.1 exiting
% 0.19/0.50 % E exiting
%------------------------------------------------------------------------------