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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : SEV282^5 : TPTP v8.2.0. Bugfixed v6.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n008.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:07 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.12  % Problem    : SEV282^5 : TPTP v8.2.0. Bugfixed v6.2.0.
% 0.03/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n008.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Sun May 19 19:00:08 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.19/0.47  Running higher-order theorem proving
% 0.19/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.19/0.48  # Version: 3.1.0-ho
% 0.19/0.48  # Preprocessing class: HSSSSMSSSLSNHHN.
% 0.19/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48  # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.19/0.48  # Starting sh5l with 300s (1) cores
% 0.19/0.48  # Starting full_lambda_10 with 300s (1) cores
% 0.19/0.48  # Starting full_lambda_6 with 300s (1) cores
% 0.19/0.48  # full_lambda_10 with pid 8532 completed with status 0
% 0.19/0.48  # Result found by full_lambda_10
% 0.19/0.48  # Preprocessing class: HSSSSMSSSLSNHHN.
% 0.19/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48  # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.19/0.48  # Starting sh5l with 300s (1) cores
% 0.19/0.48  # Starting full_lambda_10 with 300s (1) cores
% 0.19/0.48  # SinE strategy is GSinE(CountFormulas,hypos,5,,5,20000,3.0,true)
% 0.19/0.48  # Search class: HHUNF-FFSF00-DHHFMFBN
% 0.19/0.48  # partial match(3): HHUNF-FFSF00-SHHSMFNN
% 0.19/0.48  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48  # Starting new_ho_10 with 163s (1) cores
% 0.19/0.48  # new_ho_10 with pid 8535 completed with status 0
% 0.19/0.48  # Result found by new_ho_10
% 0.19/0.48  # Preprocessing class: HSSSSMSSSLSNHHN.
% 0.19/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48  # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.19/0.48  # Starting sh5l with 300s (1) cores
% 0.19/0.48  # Starting full_lambda_10 with 300s (1) cores
% 0.19/0.48  # SinE strategy is GSinE(CountFormulas,hypos,5,,5,20000,3.0,true)
% 0.19/0.48  # Search class: HHUNF-FFSF00-DHHFMFBN
% 0.19/0.48  # partial match(3): HHUNF-FFSF00-SHHSMFNN
% 0.19/0.48  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48  # Starting new_ho_10 with 163s (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, cNAT: (($i > $o) > $o) > $o).
% 0.19/0.48  thf(decl_23, type, cSUCC: (($i > $o) > $o) > ($i > $o) > $o).
% 0.19/0.48  thf(decl_24, type, cZERO: ($i > $o) > $o).
% 0.19/0.48  thf(decl_25, type, epred1_0: (($i > $o) > $o) > $o).
% 0.19/0.48  thf(cNAT_def, axiom, ((cNAT)=(^[X3:($i > $o) > $o]:(![X5:(($i > $o) > $o) > $o]:((((X5 @ cZERO)&![X6:($i > $o) > $o]:(((X5 @ X6)=>(X5 @ (cSUCC @ X6)))))=>(X5 @ X3)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cNAT_def)).
% 0.19/0.48  thf(cZERO_def, axiom, ((cZERO)=(^[X1:$i > $o]:(~(?[X2:$i]:((X1 @ X2)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cZERO_def)).
% 0.19/0.48  thf(cSUCC_def, axiom, ((cSUCC)=(^[X3:($i > $o) > $o, X1:$i > $o]:(?[X2:$i]:(((X1 @ X2)&(X3 @ (^[X4:$i]:((((X4)!=(X2))&(X1 @ X4)))))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cSUCC_def)).
% 0.19/0.48  thf(cTTTP6100, conjecture, (cNAT @ cZERO), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cTTTP6100)).
% 0.19/0.48  thf(c_0_4, plain, ((cNAT)=(^[Z0/* 6 */:($i > $o) > $o]:(![X5:(($i > $o) > $o) > $o]:((((X5 @ (^[Z1/* 7 */:$i > $o]:(~(?[X7:$i]:((Z1 @ X7))))))&![X6:($i > $o) > $o]:(((X5 @ X6)=>(X5 @ (^[Z1/* 5 */:$i > $o]:(?[X8:$i]:(((Z1 @ X8)&(X6 @ (^[Z2/* 8 */:$i]:((((Z2)!=(X8))&(Z1 @ Z2)))))))))))))=>(X5 @ Z0)))))), inference(fof_simplification,[status(thm)],[cNAT_def])).
% 0.19/0.48  thf(c_0_5, plain, ((cZERO)=(^[Z0/* 7 */:$i > $o]:(~(?[X2:$i]:((Z0 @ X2)))))), inference(fof_simplification,[status(thm)],[cZERO_def])).
% 0.19/0.48  thf(c_0_6, plain, ((cSUCC)=(^[Z0/* 19 */:($i > $o) > $o, Z1:$i > $o]:(?[X2:$i]:(((Z1 @ X2)&(Z0 @ (^[Z2/* 8 */:$i]:((((Z2)!=(X2))&(Z1 @ Z2)))))))))), inference(fof_simplification,[status(thm)],[cSUCC_def])).
% 0.19/0.48  thf(c_0_7, plain, ((cNAT)=(^[Z0/* 6 */:($i > $o) > $o]:(![X5:(($i > $o) > $o) > $o]:((((X5 @ (^[Z1/* 7 */:$i > $o]:(~(?[X7:$i]:((Z1 @ X7))))))&![X6:($i > $o) > $o]:(((X5 @ X6)=>(X5 @ (^[Z1/* 5 */:$i > $o]:(?[X8:$i]:(((Z1 @ X8)&(X6 @ (^[Z2/* 8 */:$i]:((((Z2)!=(X8))&(Z1 @ Z2)))))))))))))=>(X5 @ Z0)))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_4, c_0_5]), c_0_6])).
% 0.19/0.48  thf(c_0_8, negated_conjecture, ~(![X10:(($i > $o) > $o) > $o]:((((X10 @ (^[Z0/* 7 */:$i > $o]:(~(?[X11:$i]:(Z0 @ X11)))))&![X12:($i > $o) > $o]:(((X10 @ X12)=>(X10 @ (^[Z0/* 5 */:$i > $o]:(?[X13:$i]:((Z0 @ X13&X12 @ (^[Z1/* 8 */:$i]:((~(((Z1)=(X13)))&Z0 @ Z1)))))))))))=>(X10 @ (^[Z0/* 7 */:$i > $o]:(~(?[X9:$i]:(Z0 @ X9)))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[cTTTP6100]), c_0_7]), c_0_5])).
% 0.19/0.48  thf(c_0_9, negated_conjecture, ![X15:($i > $o) > $o]:((((epred1_0 @ (^[Z0/* 7 */:$i > $o]:(~(?[X11:$i]:(Z0 @ X11)))))&(~(epred1_0 @ X15)|(epred1_0 @ (^[Z0/* 5 */:$i > $o]:(?[X13:$i]:((Z0 @ X13&X15 @ (^[Z1/* 8 */:$i]:((~(((Z1)=(X13)))&Z0 @ Z1))))))))))&~(epred1_0 @ (^[Z0/* 7 */:$i > $o]:(~(?[X9:$i]:(Z0 @ X9))))))), 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_8])])])])])).
% 0.19/0.48  thf(c_0_10, negated_conjecture, ~((epred1_0 @ (^[Z0/* 7 */:$i > $o]:(~(?[X16:$i]:((Z0 @ X16))))))), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.19/0.48  thf(c_0_11, negated_conjecture, (epred1_0 @ (^[Z0/* 7 */:$i > $o]:(~(?[X17:$i]:((Z0 @ X17)))))), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.19/0.48  thf(c_0_12, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10, c_0_11])]), ['proof']).
% 0.19/0.48  # SZS output end CNFRefutation
% 0.19/0.48  # Parsed axioms                        : 7
% 0.19/0.48  # Removed by relevancy pruning/SinE    : 3
% 0.19/0.48  # Initial clauses                      : 3
% 0.19/0.48  # Removed in clause preprocessing      : 0
% 0.19/0.48  # Initial clauses in saturation        : 3
% 0.19/0.48  # Processed clauses                    : 2
% 0.19/0.48  # ...of these trivial                  : 0
% 0.19/0.48  # ...subsumed                          : 0
% 0.19/0.48  # ...remaining for further processing  : 1
% 0.19/0.48  # Other redundant clauses eliminated   : 0
% 0.19/0.48  # Clauses deleted for lack of memory   : 0
% 0.19/0.48  # Backward-subsumed                    : 0
% 0.19/0.48  # Backward-rewritten                   : 0
% 0.19/0.48  # Generated clauses                    : 0
% 0.19/0.48  # ...of the previous two non-redundant : 0
% 0.19/0.48  # ...aggressively subsumed             : 0
% 0.19/0.48  # Contextual simplify-reflections      : 0
% 0.19/0.48  # Paramodulations                      : 0
% 0.19/0.48  # Factorizations                       : 0
% 0.19/0.48  # NegExts                              : 0
% 0.19/0.48  # Equation resolutions                 : 0
% 0.19/0.48  # Disequality decompositions           : 0
% 0.19/0.48  # Total rewrite steps                  : 1
% 0.19/0.48  # ...of those cached                   : 0
% 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  : 1
% 0.19/0.48  #    Positive orientable unit clauses  : 1
% 0.19/0.48  #    Positive unorientable unit clauses: 0
% 0.19/0.48  #    Negative unit clauses             : 0
% 0.19/0.48  #    Non-unit-clauses                  : 0
% 0.19/0.48  # Current number of unprocessed clauses: 1
% 0.19/0.48  # ...number of literals in the above   : 2
% 0.19/0.48  # Current number of archived formulas  : 0
% 0.19/0.48  # Current number of archived clauses   : 0
% 0.19/0.48  # Clause-clause subsumption calls (NU) : 0
% 0.19/0.48  # Rec. Clause-clause subsumption calls : 0
% 0.19/0.48  # Non-unit clause-clause subsumptions  : 0
% 0.19/0.48  # Unit Clause-clause subsumption calls : 0
% 0.19/0.48  # Rewrite failures with RHS unbound    : 0
% 0.19/0.48  # BW rewrite match attempts            : 0
% 0.19/0.48  # BW rewrite match successes           : 0
% 0.19/0.48  # Condensation attempts                : 2
% 0.19/0.48  # Condensation successes               : 0
% 0.19/0.48  # Termbank termtop insertions          : 504
% 0.19/0.48  # Search garbage collected termcells   : 138
% 0.19/0.48  
% 0.19/0.48  # -------------------------------------------------
% 0.19/0.48  # User time                : 0.003 s
% 0.19/0.48  # System time              : 0.001 s
% 0.19/0.48  # Total time               : 0.005 s
% 0.19/0.48  # Maximum resident set size: 1716 pages
% 0.19/0.48  
% 0.19/0.48  # -------------------------------------------------
% 0.19/0.48  # User time                : 0.006 s
% 0.19/0.48  # System time              : 0.002 s
% 0.19/0.48  # Total time               : 0.008 s
% 0.19/0.48  # Maximum resident set size: 1736 pages
% 0.19/0.48  % E---3.1 exiting
% 0.19/0.48  % E exiting
%------------------------------------------------------------------------------