TSTP Solution File: SEV259^5 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : SEV259^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:07 EDT 2024
% Result : Theorem 0.38s 0.54s
% Output : CNFRefutation 0.38s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEV259^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.36 % Computer : n022.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Fri Jun 21 18:38:54 EDT 2024
% 0.13/0.36 % CPUTime :
% 0.38/0.52 Running higher-order theorem proving
% 0.38/0.53 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.U8UdxfIzcH/E---3.1_25135.p
% 0.38/0.54 # Version: 3.2.0-ho
% 0.38/0.54 # Preprocessing class: HSMSSMSSSSSNHHA.
% 0.38/0.54 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.54 # Starting full_lambda_6 with 900s (3) cores
% 0.38/0.54 # Starting post_as_ho1 with 300s (1) cores
% 0.38/0.54 # Starting lpo6_lambda_fix with 300s (1) cores
% 0.38/0.54 # Starting ho_unfolding_1 with 300s (1) cores
% 0.38/0.54 # Starting new_ho_10_unif with 300s (1) cores
% 0.38/0.54 # Starting ho_unfolding_2 with 300s (1) cores
% 0.38/0.54 # full_lambda_6 with pid 25214 completed with status 0
% 0.38/0.54 # Result found by full_lambda_6
% 0.38/0.54 # Preprocessing class: HSMSSMSSSSSNHHA.
% 0.38/0.54 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.54 # Starting full_lambda_6 with 900s (3) cores
% 0.38/0.54 # SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
% 0.38/0.54 # Search class: HGUSF-FFSF00-MHHFFMBN
% 0.38/0.54 # partial match(2): HGUNF-FFSF00-SHHFFMBN
% 0.38/0.54 # Scheduled 6 strats onto 3 cores with 900 seconds (900 total)
% 0.38/0.54 # Starting ehoh_best6_lambda with 487s (1) cores
% 0.38/0.54 # Starting full_lambda_6 with 91s (1) cores
% 0.38/0.54 # Starting ehoh_best_nonlift_nonlambdatoforall with 82s (1) cores
% 0.38/0.54 # ehoh_best6_lambda with pid 25220 completed with status 0
% 0.38/0.54 # Result found by ehoh_best6_lambda
% 0.38/0.54 # Preprocessing class: HSMSSMSSSSSNHHA.
% 0.38/0.54 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.54 # Starting full_lambda_6 with 900s (3) cores
% 0.38/0.54 # SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
% 0.38/0.54 # Search class: HGUSF-FFSF00-MHHFFMBN
% 0.38/0.54 # partial match(2): HGUNF-FFSF00-SHHFFMBN
% 0.38/0.54 # Scheduled 6 strats onto 3 cores with 900 seconds (900 total)
% 0.38/0.54 # Starting ehoh_best6_lambda with 487s (1) cores
% 0.38/0.54 # Preprocessing time : 0.001 s
% 0.38/0.54 # Presaturation interreduction done
% 0.38/0.54
% 0.38/0.54 # Proof found!
% 0.38/0.54 # SZS status Theorem
% 0.38/0.54 # SZS output start CNFRefutation
% 0.38/0.54 thf(decl_sort1, type, b: $tType).
% 0.38/0.54 thf(decl_22, type, epred1_1: ((b > $o) > $o) > $o).
% 0.38/0.54 thf(decl_23, type, epred2_0: (b > $o) > $o).
% 0.38/0.54 thf(decl_24, type, epred3_0: b > $o).
% 0.38/0.54 thf(decl_25, type, esk1_0: b).
% 0.38/0.54 thf(decl_26, type, epred4_0: b > $o).
% 0.38/0.54 thf(cCLOSURE_THM0_pme, conjecture, ![X1:(b > $o) > $o]:(((((![X2:b > $o]:((((X2)=(^[X3:b]:(~($true))))=>(X1 @ X2)))&![X2:b > $o]:((((X2)=(^[X3:b]:(~(~($true)))))=>(X1 @ X2))))&![X4:(b > $o) > $o, X2:b > $o]:(((![X5:b > $o]:(((X4 @ X5)=>(X1 @ X5)))&((X2)=(^[X3:b]:(?[X6:b > $o]:(((X4 @ X6)&(X6 @ X3)))))))=>(X1 @ X2))))&![X7:b > $o, X8:b > $o, X6:b > $o]:(((((X1 @ X7)&(X1 @ X8))&((X6)=(^[X3:b]:(((X7 @ X3)&(X8 @ X3))))))=>(X1 @ X6))))=>![X9:b > $o, X3:b]:(((X9 @ X3)=>![X6:b > $o]:(((![X10:b]:(((X9 @ X10)=>(X6 @ X10)))&![X2:b > $o]:((((X2)=(^[X10:b]:(~((X6 @ X10)))))=>(X1 @ X2))))=>(X6 @ X3))))))), file('/export/starexec/sandbox2/tmp/tmp.U8UdxfIzcH/E---3.1_25135.p', cCLOSURE_THM0_pme)).
% 0.38/0.54 thf(c_0_1, plain, ![X1:(b > $o) > $o]:(((epred1_1 @ X1)<=>(((![X2:b > $o]:((((X2)=(^[Z0/* 7 */:b]:(~($true))))=>(X1 @ X2)))&![X2:b > $o]:((((X2)=(^[Z0/* 7 */:b]:(~(~($true)))))=>(X1 @ X2))))&![X4:(b > $o) > $o, X2:b > $o]:(((![X5:b > $o]:(((X4 @ X5)=>(X1 @ X5)))&((X2)=(^[Z0/* 5 */:b]:(?[X6:b > $o]:((X4 @ X6&X6 @ Z0))))))=>(X1 @ X2))))&![X7:b > $o, X8:b > $o, X6:b > $o]:(((((X1 @ X7)&(X1 @ X8))&((X6)=(^[Z0/* 8 */:b]:((X7 @ Z0&X8 @ Z0)))))=>(X1 @ X6)))))), introduced(definition)).
% 0.38/0.54 thf(c_0_2, negated_conjecture, ~(![X1:(b > $o) > $o]:(((epred1_1 @ X1)=>![X9:b > $o, X3:b]:(((X9 @ X3)=>![X6:b > $o]:(((![X10:b]:(((X9 @ X10)=>(X6 @ X10)))&![X2:b > $o]:((((X2)=(^[Z0/* 7 */:b]:(~(X6 @ Z0))))=>(X1 @ X2))))=>(X6 @ X3)))))))), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cCLOSURE_THM0_pme])]), c_0_1])).
% 0.38/0.54 thf(c_0_3, negated_conjecture, ![X29:b, X30:b > $o]:(((epred1_1 @ epred2_0)&((epred3_0 @ esk1_0)&(((~(epred3_0 @ X29)|(epred4_0 @ X29))&(((X30)!=(^[Z0/* 7 */:b]:(~(epred4_0 @ Z0))))|(epred2_0 @ X30)))&~(epred4_0 @ esk1_0))))), 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_2])])])])])).
% 0.38/0.54 thf(c_0_4, negated_conjecture, ![X3:b]:(((epred4_0 @ X3)|~((epred3_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.38/0.54 thf(c_0_5, negated_conjecture, (epred3_0 @ esk1_0), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.38/0.54 thf(c_0_6, negated_conjecture, ~((epred4_0 @ esk1_0)), inference(split_conjunct,[status(thm)],[c_0_3])).
% 0.38/0.54 thf(c_0_7, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_4, c_0_5]), c_0_6]), ['proof']).
% 0.38/0.54 # SZS output end CNFRefutation
% 0.38/0.54 # Parsed axioms : 2
% 0.38/0.54 # Removed by relevancy pruning/SinE : 1
% 0.38/0.54 # Initial clauses : 10
% 0.38/0.54 # Removed in clause preprocessing : 0
% 0.38/0.54 # Initial clauses in saturation : 10
% 0.38/0.54 # Processed clauses : 20
% 0.38/0.54 # ...of these trivial : 0
% 0.38/0.54 # ...subsumed : 0
% 0.38/0.54 # ...remaining for further processing : 20
% 0.38/0.54 # Other redundant clauses eliminated : 6
% 0.38/0.54 # Clauses deleted for lack of memory : 0
% 0.38/0.54 # Backward-subsumed : 0
% 0.38/0.54 # Backward-rewritten : 0
% 0.38/0.54 # Generated clauses : 7
% 0.38/0.54 # ...of the previous two non-redundant : 6
% 0.38/0.54 # ...aggressively subsumed : 0
% 0.38/0.54 # Contextual simplify-reflections : 0
% 0.38/0.54 # Paramodulations : 1
% 0.38/0.54 # Factorizations : 0
% 0.38/0.54 # NegExts : 0
% 0.38/0.54 # Equation resolutions : 6
% 0.38/0.54 # Disequality decompositions : 0
% 0.38/0.54 # Total rewrite steps : 0
% 0.38/0.54 # ...of those cached : 0
% 0.38/0.54 # Propositional unsat checks : 0
% 0.38/0.54 # Propositional check models : 0
% 0.38/0.54 # Propositional check unsatisfiable : 0
% 0.38/0.54 # Propositional clauses : 0
% 0.38/0.54 # Propositional clauses after purity: 0
% 0.38/0.54 # Propositional unsat core size : 0
% 0.38/0.54 # Propositional preprocessing time : 0.000
% 0.38/0.54 # Propositional encoding time : 0.000
% 0.38/0.54 # Propositional solver time : 0.000
% 0.38/0.54 # Success case prop preproc time : 0.000
% 0.38/0.54 # Success case prop encoding time : 0.000
% 0.38/0.54 # Success case prop solver time : 0.000
% 0.38/0.54 # Current number of processed clauses : 4
% 0.38/0.54 # Positive orientable unit clauses : 2
% 0.38/0.54 # Positive unorientable unit clauses: 0
% 0.38/0.54 # Negative unit clauses : 1
% 0.38/0.54 # Non-unit-clauses : 1
% 0.38/0.54 # Current number of unprocessed clauses: 6
% 0.38/0.54 # ...number of literals in the above : 15
% 0.38/0.54 # Current number of archived formulas : 0
% 0.38/0.54 # Current number of archived clauses : 10
% 0.38/0.54 # Clause-clause subsumption calls (NU) : 36
% 0.38/0.54 # Rec. Clause-clause subsumption calls : 24
% 0.38/0.54 # Non-unit clause-clause subsumptions : 0
% 0.38/0.54 # Unit Clause-clause subsumption calls : 0
% 0.38/0.54 # Rewrite failures with RHS unbound : 0
% 0.38/0.54 # BW rewrite match attempts : 0
% 0.38/0.54 # BW rewrite match successes : 0
% 0.38/0.54 # Condensation attempts : 0
% 0.38/0.54 # Condensation successes : 0
% 0.38/0.54 # Termbank termtop insertions : 2076
% 0.38/0.54 # Search garbage collected termcells : 439
% 0.38/0.54
% 0.38/0.54 # -------------------------------------------------
% 0.38/0.54 # User time : 0.002 s
% 0.38/0.54 # System time : 0.002 s
% 0.38/0.54 # Total time : 0.004 s
% 0.38/0.54 # Maximum resident set size: 1912 pages
% 0.38/0.54
% 0.38/0.54 # -------------------------------------------------
% 0.38/0.54 # User time : 0.008 s
% 0.38/0.54 # System time : 0.005 s
% 0.38/0.54 # Total time : 0.013 s
% 0.38/0.54 # Maximum resident set size: 1724 pages
% 0.38/0.54 % E---3.1 exiting
% 0.43/0.54 % E exiting
%------------------------------------------------------------------------------