TSTP Solution File: SYO331^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO331^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:38 EDT 2024
% Result : Theorem 0.17s 0.46s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.11 % Problem : SYO331^5 : TPTP v8.2.0. Released v4.0.0.
% 0.04/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n027.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon May 20 09:53:08 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.17/0.45 Running higher-order theorem proving
% 0.17/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.17/0.46 # Version: 3.1.0-ho
% 0.17/0.46 # Preprocessing class: HSSSSMSSSSMNSSA.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting sh3 with 1500s (5) cores
% 0.17/0.46 # Starting lpo8_s with 300s (1) cores
% 0.17/0.46 # Starting sh2lt with 300s (1) cores
% 0.17/0.46 # Starting sh2l with 300s (1) cores
% 0.17/0.46 # lpo8_s with pid 5581 completed with status 0
% 0.17/0.46 # Result found by lpo8_s
% 0.17/0.46 # Preprocessing class: HSSSSMSSSSMNSSA.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting sh3 with 1500s (5) cores
% 0.17/0.46 # Starting lpo8_s with 300s (1) cores
% 0.17/0.46 # SinE strategy is GSinE(CountFormulas,hypos,4.0,,6,20000,1.0)
% 0.17/0.46 # Search class: HGUNF-FFSF21-SSSFFMBN
% 0.17/0.46 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 # Starting new_ho_10 with 163s (1) cores
% 0.17/0.46 # new_ho_10 with pid 5584 completed with status 0
% 0.17/0.46 # Result found by new_ho_10
% 0.17/0.46 # Preprocessing class: HSSSSMSSSSMNSSA.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting sh3 with 1500s (5) cores
% 0.17/0.46 # Starting lpo8_s with 300s (1) cores
% 0.17/0.46 # SinE strategy is GSinE(CountFormulas,hypos,4.0,,6,20000,1.0)
% 0.17/0.46 # Search class: HGUNF-FFSF21-SSSFFMBN
% 0.17/0.46 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 # Starting new_ho_10 with 163s (1) cores
% 0.17/0.46 # Preprocessing time : 0.001 s
% 0.17/0.46 # Presaturation interreduction done
% 0.17/0.46
% 0.17/0.46 # Proof found!
% 0.17/0.46 # SZS status Theorem
% 0.17/0.46 # SZS output start CNFRefutation
% 0.17/0.46 thf(decl_sort1, type, a: $tType).
% 0.17/0.46 thf(decl_22, type, cK: (a > $o) > a > $o).
% 0.17/0.46 thf(decl_23, type, esk1_1: (a > $o) > a).
% 0.17/0.46 thf(decl_24, type, esk2_2: (a > $o) > (a > $o) > a).
% 0.17/0.46 thf(decl_25, type, esk3_0: a).
% 0.17/0.46 thf(decl_26, type, epred1_0: a > $o).
% 0.17/0.46 thf(decl_27, type, epred2_0: a > $o).
% 0.17/0.46 thf(cTHM116_2SS_pme, conjecture, (![X1:a > $o]:((![X2:a]:(((X1 @ X2)=>?[X3:a > $o]:((![X4:a]:(((X3 @ X4)=>(cK @ X3 @ X4)))&(X3 @ X2)))))=>![X2:a]:(((cK @ X1 @ X2)=>(cK @ (^[X4:a]:(?[X3:a > $o]:((![X5:a]:(((X3 @ X5)=>(cK @ X3 @ X5)))&(X3 @ X4))))) @ X2)))))=>![X2:a]:((?[X3:a > $o]:((![X4:a]:(((X3 @ X4)=>(cK @ X3 @ X4)))&(X3 @ X2)))=>(cK @ (^[X4:a]:(?[X3:a > $o]:((![X5:a]:(((X3 @ X5)=>(cK @ X3 @ X5)))&(X3 @ X4))))) @ X2)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cTHM116_2SS_pme)).
% 0.17/0.46 thf(c_0_1, negated_conjecture, ~((![X1:a > $o]:((![X2:a]:(((X1 @ X2)=>?[X3:a > $o]:((![X4:a]:(((X3 @ X4)=>(cK @ X3 @ X4)))&(X3 @ X2)))))=>![X2:a]:(((cK @ X1 @ X2)=>(cK @ (^[Z0/* 5 */:a]:(?[X3:a > $o]:((![X5:a]:((X3 @ X5=>(cK @ X3 @ X5)))&X3 @ Z0)))) @ X2)))))=>![X2:a]:((?[X3:a > $o]:((![X4:a]:(((X3 @ X4)=>(cK @ X3 @ X4)))&(X3 @ X2)))=>(cK @ (^[Z0/* 5 */:a]:(?[X3:a > $o]:((![X5:a]:((X3 @ X5=>(cK @ X3 @ X5)))&X3 @ Z0)))) @ X2))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM116_2SS_pme])])).
% 0.17/0.46 thf(c_0_2, negated_conjecture, ![X14:a > $o, X16:a > $o, X18:a, X21:a]:(((((X14 @ (esk1_1 @ X14))|(~(cK @ X14 @ X18)|(cK @ (^[Z0/* 5 */:a]:(?[X3:a > $o]:((![X5:a]:((X3 @ X5=>(cK @ X3 @ X5)))&X3 @ Z0)))) @ X18)))&(((X16 @ (esk2_2 @ X14 @ X16))|~(X16 @ (esk1_1 @ X14))|(~(cK @ X14 @ X18)|(cK @ (^[Z0/* 5 */:a]:(?[X3:a > $o]:((![X5:a]:((X3 @ X5=>(cK @ X3 @ X5)))&X3 @ Z0)))) @ X18)))&(~(cK @ X16 @ (esk2_2 @ X14 @ X16))|~(X16 @ (esk1_1 @ X14))|(~(cK @ X14 @ X18)|(cK @ (^[Z0/* 5 */:a]:(?[X3:a > $o]:((![X5:a]:((X3 @ X5=>(cK @ X3 @ X5)))&X3 @ Z0)))) @ X18)))))&(((~(epred1_0 @ X21)|(cK @ epred1_0 @ X21))&(epred1_0 @ esk3_0))&~(cK @ (^[Z0/* 5 */:a]:(?[X3:a > $o]:((![X5:a]:((X3 @ X5=>(cK @ X3 @ X5)))&X3 @ Z0)))) @ esk3_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.17/0.46 thf(c_0_3, plain, ![X24:a]:(((epred2_0 @ X24)<=>?[X22:a > $o]:((![X23:a]:(((X22 @ X23)=>(cK @ X22 @ X23)))&(X22 @ X24))))), introduced(definition)).
% 0.17/0.46 thf(c_0_4, negated_conjecture, ![X1:a > $o, X2:a]:(((X1 @ (esk1_1 @ X1))|(((cK @ epred2_0 @ X2))=(($true)))|~((cK @ X1 @ X2)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2]), c_0_3])).
% 0.17/0.46 thf(c_0_5, negated_conjecture, ![X1:a > $o, X3:a > $o, X2:a]:(((((cK @ epred2_0 @ X2))=(($true)))|~((cK @ X1 @ (esk2_2 @ X3 @ X1)))|~((X1 @ (esk1_1 @ X3)))|~((cK @ X3 @ X2)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2]), c_0_3])).
% 0.17/0.46 thf(c_0_6, negated_conjecture, ![X1:a > $o, X3:a > $o, X2:a]:(((X1 @ (esk2_2 @ X3 @ X1))|(((cK @ epred2_0 @ X2))=(($true)))|~((X1 @ (esk1_1 @ X3)))|~((cK @ X3 @ X2)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2]), c_0_3])).
% 0.17/0.46 thf(c_0_7, negated_conjecture, ![X1:a > $o, X2:a]:(((cK @ epred2_0 @ X2)|(X1 @ (esk1_1 @ X1))|~((cK @ X1 @ X2)))), inference(cn,[status(thm)],[c_0_4])).
% 0.17/0.46 thf(c_0_8, negated_conjecture, ![X2:a]:(((cK @ epred1_0 @ X2)|~((epred1_0 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.17/0.46 thf(c_0_9, negated_conjecture, ~((((cK @ epred2_0 @ esk3_0))=(($true)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_2]), c_0_3])).
% 0.17/0.46 thf(c_0_10, negated_conjecture, ![X1:a > $o, X2:a, X3:a > $o]:(((cK @ epred2_0 @ X2)|~((cK @ X1 @ (esk2_2 @ X3 @ X1)))|~((cK @ X3 @ X2))|~((X1 @ (esk1_1 @ X3))))), inference(cn,[status(thm)],[c_0_5])).
% 0.17/0.46 thf(c_0_11, negated_conjecture, ![X1:a > $o, X2:a, X3:a > $o]:(((cK @ epred2_0 @ X2)|(X1 @ (esk2_2 @ X3 @ X1))|~((cK @ X3 @ X2))|~((X1 @ (esk1_1 @ X3))))), inference(cn,[status(thm)],[c_0_6])).
% 0.17/0.46 thf(c_0_12, negated_conjecture, ![X2:a]:(((epred1_0 @ (esk1_1 @ epred1_0))|(cK @ epred2_0 @ X2)|~((epred1_0 @ X2)))), inference(spm,[status(thm)],[c_0_7, c_0_8])).
% 0.17/0.46 thf(c_0_13, negated_conjecture, (epred1_0 @ esk3_0), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.17/0.46 thf(c_0_14, negated_conjecture, ~((cK @ epred2_0 @ esk3_0)), inference(cn,[status(thm)],[c_0_9])).
% 0.17/0.46 thf(c_0_15, negated_conjecture, ![X1:a > $o, X2:a]:(((cK @ epred2_0 @ X2)|~((epred1_0 @ (esk1_1 @ X1)))|~((cK @ X1 @ X2)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_8]), c_0_11])).
% 0.17/0.46 thf(c_0_16, negated_conjecture, (epred1_0 @ (esk1_1 @ epred1_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13]), c_0_14])).
% 0.17/0.46 thf(c_0_17, negated_conjecture, ![X2:a]:(((cK @ epred2_0 @ X2)|~((cK @ epred1_0 @ X2)))), inference(spm,[status(thm)],[c_0_15, c_0_16])).
% 0.17/0.46 thf(c_0_18, negated_conjecture, ![X2:a]:(((cK @ epred2_0 @ X2)|~((epred1_0 @ X2)))), inference(spm,[status(thm)],[c_0_17, c_0_8])).
% 0.17/0.46 thf(c_0_19, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_18]), c_0_13])]), ['proof']).
% 0.17/0.46 # SZS output end CNFRefutation
% 0.17/0.46 # Parsed axioms : 3
% 0.17/0.46 # Removed by relevancy pruning/SinE : 2
% 0.17/0.46 # Initial clauses : 10
% 0.17/0.46 # Removed in clause preprocessing : 0
% 0.17/0.46 # Initial clauses in saturation : 10
% 0.17/0.46 # Processed clauses : 35
% 0.17/0.46 # ...of these trivial : 0
% 0.17/0.46 # ...subsumed : 1
% 0.17/0.46 # ...remaining for further processing : 34
% 0.17/0.46 # Other redundant clauses eliminated : 0
% 0.17/0.46 # Clauses deleted for lack of memory : 0
% 0.17/0.46 # Backward-subsumed : 1
% 0.17/0.46 # Backward-rewritten : 1
% 0.17/0.46 # Generated clauses : 39
% 0.17/0.46 # ...of the previous two non-redundant : 35
% 0.17/0.46 # ...aggressively subsumed : 0
% 0.17/0.46 # Contextual simplify-reflections : 4
% 0.17/0.46 # Paramodulations : 39
% 0.17/0.46 # Factorizations : 0
% 0.17/0.46 # NegExts : 0
% 0.17/0.46 # Equation resolutions : 0
% 0.17/0.46 # Disequality decompositions : 0
% 0.17/0.46 # Total rewrite steps : 3
% 0.17/0.46 # ...of those cached : 1
% 0.17/0.46 # Propositional unsat checks : 0
% 0.17/0.46 # Propositional check models : 0
% 0.17/0.46 # Propositional check unsatisfiable : 0
% 0.17/0.46 # Propositional clauses : 0
% 0.17/0.46 # Propositional clauses after purity: 0
% 0.17/0.46 # Propositional unsat core size : 0
% 0.17/0.46 # Propositional preprocessing time : 0.000
% 0.17/0.46 # Propositional encoding time : 0.000
% 0.17/0.46 # Propositional solver time : 0.000
% 0.17/0.46 # Success case prop preproc time : 0.000
% 0.17/0.46 # Success case prop encoding time : 0.000
% 0.17/0.46 # Success case prop solver time : 0.000
% 0.17/0.46 # Current number of processed clauses : 22
% 0.17/0.46 # Positive orientable unit clauses : 4
% 0.17/0.46 # Positive unorientable unit clauses: 0
% 0.17/0.46 # Negative unit clauses : 1
% 0.17/0.46 # Non-unit-clauses : 17
% 0.17/0.46 # Current number of unprocessed clauses: 15
% 0.17/0.46 # ...number of literals in the above : 64
% 0.17/0.46 # Current number of archived formulas : 0
% 0.17/0.46 # Current number of archived clauses : 12
% 0.17/0.46 # Clause-clause subsumption calls (NU) : 163
% 0.17/0.46 # Rec. Clause-clause subsumption calls : 73
% 0.17/0.46 # Non-unit clause-clause subsumptions : 6
% 0.17/0.46 # Unit Clause-clause subsumption calls : 0
% 0.17/0.46 # Rewrite failures with RHS unbound : 0
% 0.17/0.46 # BW rewrite match attempts : 1
% 0.17/0.46 # BW rewrite match successes : 1
% 0.17/0.46 # Condensation attempts : 35
% 0.17/0.46 # Condensation successes : 0
% 0.17/0.46 # Termbank termtop insertions : 2439
% 0.17/0.46 # Search garbage collected termcells : 477
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.004 s
% 0.17/0.46 # System time : 0.004 s
% 0.17/0.46 # Total time : 0.008 s
% 0.17/0.46 # Maximum resident set size: 1924 pages
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.004 s
% 0.17/0.46 # System time : 0.007 s
% 0.17/0.46 # Total time : 0.011 s
% 0.17/0.46 # Maximum resident set size: 1720 pages
% 0.17/0.46 % E---3.1 exiting
% 0.17/0.47 % E exiting
%------------------------------------------------------------------------------