TSTP Solution File: SEV242^5 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : SEV242^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n024.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 04:08:04 EDT 2024

% Result   : Theorem 0.19s 0.48s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem    : SEV242^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.13  % Command    : run_E %s %d THM
% 0.12/0.33  % Computer : n024.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   : Sun May 19 18:53:22 EDT 2024
% 0.12/0.33  % CPUTime    : 
% 0.19/0.46  Running higher-order theorem proving
% 0.19/0.46  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.47  # Version: 3.1.0-ho
% 0.19/0.47  # Preprocessing class: HSSSSMSSSSMNHHA.
% 0.19/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47  # Starting post_as_ho5 with 1500s (5) cores
% 0.19/0.47  # Starting sh2lt with 300s (1) cores
% 0.19/0.47  # Starting ehoh_best8_lambda with 300s (1) cores
% 0.19/0.47  # Starting post_as_ho10 with 300s (1) cores
% 0.19/0.47  # post_as_ho5 with pid 789 completed with status 0
% 0.19/0.47  # Result found by post_as_ho5
% 0.19/0.47  # Preprocessing class: HSSSSMSSSSMNHHA.
% 0.19/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47  # Starting post_as_ho5 with 1500s (5) cores
% 0.19/0.47  # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.19/0.47  # Search class: HGUSF-FFSF22-DHHFFMBN
% 0.19/0.47  # partial match(1): HGUSF-FFSF22-SHHFFMBN
% 0.19/0.47  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.47  # Starting new_ho_10 with 271s (1) cores
% 0.19/0.47  # Starting post_as_ho5 with 151s (1) cores
% 0.19/0.47  # Starting ho_unfolding_3 with 271s (1) cores
% 0.19/0.47  # Starting new_ho_10_cnf2 with 271s (1) cores
% 0.19/0.47  # Starting pre_casc_2 with 271s (1) cores
% 0.19/0.47  # ho_unfolding_3 with pid 797 completed with status 0
% 0.19/0.47  # Result found by ho_unfolding_3
% 0.19/0.48  # Preprocessing class: HSSSSMSSSSMNHHA.
% 0.19/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48  # Starting post_as_ho5 with 1500s (5) cores
% 0.19/0.48  # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.19/0.48  # Search class: HGUSF-FFSF22-DHHFFMBN
% 0.19/0.48  # partial match(1): HGUSF-FFSF22-SHHFFMBN
% 0.19/0.48  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.48  # Starting new_ho_10 with 271s (1) cores
% 0.19/0.48  # Starting post_as_ho5 with 151s (1) cores
% 0.19/0.48  # Starting ho_unfolding_3 with 271s (1) cores
% 0.19/0.48  # Preprocessing time       : 0.001 s
% 0.19/0.48  # Presaturation interreduction done
% 0.19/0.48  
% 0.19/0.48  # Proof found!
% 0.19/0.48  # SZS status Theorem
% 0.19/0.48  # SZS output start CNFRefutation
% 0.19/0.48  thf(decl_22, type, esk1_2: ($i > $o) > ($i > $o) > $i).
% 0.19/0.48  thf(decl_23, type, epred1_0: ($i > $o) > $o).
% 0.19/0.48  thf(decl_24, type, epred2_0: $i > $o).
% 0.19/0.48  thf(decl_25, type, epred3_0: $i > $o).
% 0.19/0.48  thf(decl_26, type, esk2_0: $i).
% 0.19/0.48  thf(decl_27, type, epred4_0: $i > $o).
% 0.19/0.48  thf(cTHM4A_pme, conjecture, (![X1:$i > $o, X2:$i > $o]:((![X3:$i]:(((X1 @ X3)<=>(X2 @ X3)))=>((X1)=(X2))))=>![X4:($i > $o) > $o, X5:$i > $o, X6:$i > $o]:(((X4 @ (^[X7:$i]:(?[X8:$i > $o]:(((((X8)=(X5))|((X8)=(X6)))&(X8 @ X7))))))=>(X4 @ (^[X9:$i]:(((X5 @ X9)|(X6 @ X9)))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cTHM4A_pme)).
% 0.19/0.48  thf(c_0_1, negated_conjecture, ~((![X1:$i > $o, X2:$i > $o]:((![X3:$i]:(((X1 @ X3)<=>(X2 @ X3)))=>((X1)=(X2))))=>![X4:($i > $o) > $o, X5:$i > $o, X6:$i > $o]:(((X4 @ (^[Z0/* 5 */:$i]:(?[X8:$i > $o]:(((((X8)=(X5))|((X8)=(X6)))&X8 @ Z0)))))=>(X4 @ (^[Z0/* 9 */:$i]:((X5 @ Z0|X6 @ Z0)))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM4A_pme])])).
% 0.19/0.48  thf(c_0_2, negated_conjecture, ![X16:$i > $o, X17:$i > $o]:((((~(X16 @ (esk1_2 @ X16 @ X17))|~(X17 @ (esk1_2 @ X16 @ X17))|((X16)=(X17)))&((X16 @ (esk1_2 @ X16 @ X17))|(X17 @ (esk1_2 @ X16 @ X17))|((X16)=(X17))))&((epred1_0 @ (^[Z0/* 5 */:$i]:(?[X8:$i > $o]:(((((X8)=(epred2_0))|((X8)=(epred3_0)))&X8 @ Z0)))))&~(epred1_0 @ (^[Z0/* 9 */:$i]:((epred2_0 @ Z0|epred3_0 @ Z0))))))), 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.48  thf(c_0_3, negated_conjecture, ~((epred1_0 @ (^[Z0/* 9 */:$i]:(((epred2_0 @ Z0)|(epred3_0 @ Z0)))))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.19/0.48  thf(c_0_4, negated_conjecture, (epred1_0 @ (^[Z0/* 5 */:$i]:(?[X40:$i > $o]:(((((X40)=(epred2_0))|((X40)=(epred3_0)))&(X40 @ Z0)))))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.19/0.48  thf(c_0_5, plain, ((^[Z0/* 5 */:$i]:(?[X41:$i > $o]:(((((X41)=(epred2_0))|((X41)=(epred3_0)))&(X41 @ Z0)))))!=(^[Z0/* 9 */:$i]:(((epred2_0 @ Z0)|(epred3_0 @ Z0))))), inference(ext_sup,[status(thm)],[c_0_3, c_0_4])).
% 0.19/0.48  thf(c_0_6, plain, (?[X42:$i > $o]:(((((X42)=(epred2_0))|((X42)=(epred3_0)))&(X42 @ esk2_0)))<~>((epred2_0 @ esk2_0)|(epred3_0 @ esk2_0))), inference(neg_ext,[status(thm)],[c_0_5])).
% 0.19/0.48  thf(c_0_7, plain, ~((epred2_0 @ esk2_0)), inference(er,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_6])])).
% 0.19/0.48  thf(c_0_8, plain, ~((epred3_0 @ esk2_0)), inference(er,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_6])])).
% 0.19/0.48  thf(c_0_9, plain, (((epred3_0)=(epred4_0))|((epred2_0)=(epred4_0))), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_6]), c_0_7]), c_0_8])).
% 0.19/0.48  thf(c_0_10, plain, ![X27:$i]:((((epred2_0 @ X27)<=>(epred4_0 @ X27))|((epred3_0)=(epred4_0)))), inference(arg_cong,[status(thm)],[c_0_9])).
% 0.19/0.48  thf(c_0_11, plain, ![X3:$i]:((((epred3_0)=(epred4_0))|(epred2_0 @ X3)|~((epred4_0 @ X3)))), inference(dynamic_cnf,[status(thm)],[c_0_10])).
% 0.19/0.48  thf(c_0_12, plain, (epred4_0 @ esk2_0), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_6]), c_0_7]), c_0_8])).
% 0.19/0.48  thf(c_0_13, plain, ((epred3_0)=(epred4_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11, c_0_12]), c_0_7])).
% 0.19/0.48  thf(c_0_14, plain, ![X37:$i]:(((epred3_0 @ X37)<=>(epred4_0 @ X37))), inference(arg_cong,[status(thm)],[c_0_13])).
% 0.19/0.48  thf(c_0_15, plain, ![X3:$i]:(((epred3_0 @ X3)|~((epred4_0 @ X3)))), inference(dynamic_cnf,[status(thm)],[c_0_14])).
% 0.19/0.48  thf(c_0_16, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8, c_0_15]), c_0_12])]), ['proof']).
% 0.19/0.48  # SZS output end CNFRefutation
% 0.19/0.48  # Parsed axioms                        : 1
% 0.19/0.48  # Removed by relevancy pruning/SinE    : 0
% 0.19/0.48  # Initial clauses                      : 4
% 0.19/0.48  # Removed in clause preprocessing      : 0
% 0.19/0.48  # Initial clauses in saturation        : 4
% 0.19/0.48  # Processed clauses                    : 27
% 0.19/0.48  # ...of these trivial                  : 0
% 0.19/0.48  # ...subsumed                          : 2
% 0.19/0.48  # ...remaining for further processing  : 25
% 0.19/0.48  # Other redundant clauses eliminated   : 4
% 0.19/0.48  # Clauses deleted for lack of memory   : 0
% 0.19/0.48  # Backward-subsumed                    : 0
% 0.19/0.48  # Backward-rewritten                   : 5
% 0.19/0.48  # Generated clauses                    : 46
% 0.19/0.48  # ...of the previous two non-redundant : 38
% 0.19/0.48  # ...aggressively subsumed             : 0
% 0.19/0.48  # Contextual simplify-reflections      : 0
% 0.19/0.48  # Paramodulations                      : 13
% 0.19/0.48  # Factorizations                       : 2
% 0.19/0.48  # NegExts                              : 1
% 0.19/0.48  # Equation resolutions                 : 4
% 0.19/0.48  # Disequality decompositions           : 0
% 0.19/0.48  # Total rewrite steps                  : 9
% 0.19/0.48  # ...of those cached                   : 6
% 0.19/0.48  # Propositional unsat checks           : 0
% 0.19/0.48  #    Propositional check models        : 0
% 0.19/0.48  #    Propositional check unsatisfiable : 0
% 0.19/0.48  #    Propositional clauses             : 0
% 0.19/0.48  #    Propositional clauses after purity: 0
% 0.19/0.48  #    Propositional unsat core size     : 0
% 0.19/0.48  #    Propositional preprocessing time  : 0.000
% 0.19/0.48  #    Propositional encoding time       : 0.000
% 0.19/0.48  #    Propositional solver time         : 0.000
% 0.19/0.48  #    Success case prop preproc time    : 0.000
% 0.19/0.48  #    Success case prop encoding time   : 0.000
% 0.19/0.48  #    Success case prop solver time     : 0.000
% 0.19/0.48  # Current number of processed clauses  : 11
% 0.19/0.48  #    Positive orientable unit clauses  : 4
% 0.19/0.48  #    Positive unorientable unit clauses: 0
% 0.19/0.48  #    Negative unit clauses             : 4
% 0.19/0.48  #    Non-unit-clauses                  : 3
% 0.19/0.48  # Current number of unprocessed clauses: 18
% 0.19/0.48  # ...number of literals in the above   : 59
% 0.19/0.48  # Current number of archived formulas  : 0
% 0.19/0.48  # Current number of archived clauses   : 14
% 0.19/0.48  # Clause-clause subsumption calls (NU) : 18
% 0.19/0.48  # Rec. Clause-clause subsumption calls : 11
% 0.19/0.48  # Non-unit clause-clause subsumptions  : 0
% 0.19/0.48  # Unit Clause-clause subsumption calls : 3
% 0.19/0.48  # Rewrite failures with RHS unbound    : 0
% 0.19/0.48  # BW rewrite match attempts            : 2
% 0.19/0.48  # BW rewrite match successes           : 2
% 0.19/0.48  # Condensation attempts                : 27
% 0.19/0.48  # Condensation successes               : 0
% 0.19/0.48  # Termbank termtop insertions          : 2192
% 0.19/0.48  # Search garbage collected termcells   : 211
% 0.19/0.48  
% 0.19/0.48  # -------------------------------------------------
% 0.19/0.48  # User time                : 0.003 s
% 0.19/0.48  # System time              : 0.004 s
% 0.19/0.48  # Total time               : 0.007 s
% 0.19/0.48  # Maximum resident set size: 1856 pages
% 0.19/0.48  
% 0.19/0.48  # -------------------------------------------------
% 0.19/0.48  # User time                : 0.013 s
% 0.19/0.48  # System time              : 0.009 s
% 0.19/0.48  # Total time               : 0.022 s
% 0.19/0.48  # Maximum resident set size: 1720 pages
% 0.19/0.48  % E---3.1 exiting
% 0.19/0.48  % E exiting
%------------------------------------------------------------------------------