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

View Problem - Process Solution

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

% Computer : n019.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.20s 0.48s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SEV272^5 : TPTP v8.2.0. Bugfixed v5.2.0.
% 0.07/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n019.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:13:53 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.20/0.47  Running higher-order theorem proving
% 0.20/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.20/0.48  # Version: 3.1.0-ho
% 0.20/0.48  # Preprocessing class: HSSSSMSSSLSNHHN.
% 0.20/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48  # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.20/0.48  # Starting sh5l with 300s (1) cores
% 0.20/0.48  # Starting full_lambda_10 with 300s (1) cores
% 0.20/0.48  # Starting full_lambda_6 with 300s (1) cores
% 0.20/0.48  # sh5l with pid 9519 completed with status 0
% 0.20/0.48  # Result found by sh5l
% 0.20/0.48  # Preprocessing class: HSSSSMSSSLSNHHN.
% 0.20/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48  # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.20/0.48  # Starting sh5l with 300s (1) cores
% 0.20/0.48  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.48  # Search class: HUHPF-FFSF00-SHHFMFNN
% 0.20/0.48  # partial match(1): HUHPF-FFSF00-SHHFFFNN
% 0.20/0.48  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48  # Starting new_ho_10 with 181s (1) cores
% 0.20/0.48  # new_ho_10 with pid 9522 completed with status 0
% 0.20/0.48  # Result found by new_ho_10
% 0.20/0.48  # Preprocessing class: HSSSSMSSSLSNHHN.
% 0.20/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48  # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.20/0.48  # Starting sh5l with 300s (1) cores
% 0.20/0.48  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.48  # Search class: HUHPF-FFSF00-SHHFMFNN
% 0.20/0.48  # partial match(1): HUHPF-FFSF00-SHHFFFNN
% 0.20/0.48  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48  # Starting new_ho_10 with 181s (1) cores
% 0.20/0.48  # Preprocessing time       : 0.001 s
% 0.20/0.48  # Presaturation interreduction done
% 0.20/0.48  
% 0.20/0.48  # Proof found!
% 0.20/0.48  # SZS status Theorem
% 0.20/0.48  # SZS output start CNFRefutation
% 0.20/0.48  thf(decl_22, type, cSUCC: (($i > $o) > $o) > ($i > $o) > $o).
% 0.20/0.48  thf(decl_23, type, cZERO: ($i > $o) > $o).
% 0.20/0.48  thf(cSUCC_def, axiom, ((cSUCC)=(^[X1:($i > $o) > $o, X2:$i > $o]:(?[X3:$i]:(((X2 @ X3)&(X1 @ (^[X4:$i]:((((X4)!=(X3))&(X2 @ X4)))))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cSUCC_def)).
% 0.20/0.48  thf(cZERO_def, axiom, ((cZERO)=(^[X2:$i > $o]:(~(?[X3:$i]:((X2 @ X3)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cZERO_def)).
% 0.20/0.48  thf(cX6007A_pme, conjecture, ((^[X5:($i > $o) > $o]:(![X6:(($i > $o) > $o) > $o]:((((X6 @ cZERO)&![X7:($i > $o) > $o]:(((X6 @ X7)=>(X6 @ (cSUCC @ X7)))))=>(X6 @ X5)))))=(^[X8:($i > $o) > $o]:(![X9:(($i > $o) > $o) > $o]:((((X9 @ cZERO)&![X7:($i > $o) > $o]:(((X9 @ X7)=>(X9 @ (cSUCC @ X7)))))=>(X9 @ X8)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cX6007A_pme)).
% 0.20/0.48  thf(c_0_3, plain, ((cSUCC)=(^[Z0/* 19 */:($i > $o) > $o, Z1:$i > $o]:(?[X3:$i]:(((Z1 @ X3)&(Z0 @ (^[Z2/* 8 */:$i]:((((Z2)!=(X3))&(Z1 @ Z2)))))))))), inference(fof_simplification,[status(thm)],[cSUCC_def])).
% 0.20/0.48  thf(c_0_4, plain, ((cZERO)=(^[Z0/* 7 */:$i > $o]:(~(?[X3:$i]:((Z0 @ X3)))))), inference(fof_simplification,[status(thm)],[cZERO_def])).
% 0.20/0.48  thf(c_0_5, negated_conjecture, ((^[Z0/* 6 */:($i > $o) > $o]:(![X6:(($i > $o) > $o) > $o]:(((X6 @ (^[Z1/* 7 */:$i > $o]:(~(?[X10:$i]:(Z1 @ X10))))&![X7:($i > $o) > $o]:((X6 @ X7=>X6 @ (^[Z1/* 5 */:$i > $o]:(?[X11:$i]:((Z1 @ X11&X7 @ (^[Z2/* 8 */:$i]:((~(((Z2)=(X11)))&Z1 @ Z2))))))))))=>X6 @ Z0))))!=(^[Z0/* 6 */:($i > $o) > $o]:(![X9:(($i > $o) > $o) > $o]:(((X9 @ (^[Z1/* 7 */:$i > $o]:(~(?[X12:$i]:(Z1 @ X12))))&![X7:($i > $o) > $o]:((X9 @ X7=>X9 @ (^[Z1/* 5 */:$i > $o]:(?[X13:$i]:((Z1 @ X13&X7 @ (^[Z2/* 8 */:$i]:((~(((Z2)=(X13)))&Z1 @ Z2))))))))))=>X9 @ Z0))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cX6007A_pme])]), c_0_3]), c_0_4])])).
% 0.20/0.48  thf(c_0_6, negated_conjecture, ((^[Z0/* 6 */:($i > $o) > $o]:(![X6:(($i > $o) > $o) > $o]:(((X6 @ (^[Z1/* 7 */:$i > $o]:(~(?[X10:$i]:(Z1 @ X10))))&![X7:($i > $o) > $o]:((X6 @ X7=>X6 @ (^[Z1/* 5 */:$i > $o]:(?[X11:$i]:((Z1 @ X11&X7 @ (^[Z2/* 8 */:$i]:((~(((Z2)=(X11)))&Z1 @ Z2))))))))))=>X6 @ Z0))))!=(^[Z0/* 6 */:($i > $o) > $o]:(![X9:(($i > $o) > $o) > $o]:(((X9 @ (^[Z1/* 7 */:$i > $o]:(~(?[X12:$i]:(Z1 @ X12))))&![X7:($i > $o) > $o]:((X9 @ X7=>X9 @ (^[Z1/* 5 */:$i > $o]:(?[X13:$i]:((Z1 @ X13&X7 @ (^[Z2/* 8 */:$i]:((~(((Z2)=(X13)))&Z1 @ Z2))))))))))=>X9 @ Z0))))), inference(fof_nnf,[status(thm)],[c_0_5])).
% 0.20/0.48  thf(c_0_7, negated_conjecture, ((^[Z0/* 6 */:($i > $o) > $o]:(![X14:(($i > $o) > $o) > $o]:((((X14 @ (^[Z1/* 7 */:$i > $o]:(~(?[X15:$i]:((Z1 @ X15))))))&![X16:($i > $o) > $o]:(((X14 @ X16)=>(X14 @ (^[Z1/* 5 */:$i > $o]:(?[X17:$i]:(((Z1 @ X17)&(X16 @ (^[Z2/* 8 */:$i]:((~(((Z2)=(X17)))&(Z1 @ Z2)))))))))))))=>(X14 @ Z0)))))!=(^[Z0/* 6 */:($i > $o) > $o]:(![X18:(($i > $o) > $o) > $o]:((((X18 @ (^[Z1/* 7 */:$i > $o]:(~(?[X19:$i]:((Z1 @ X19))))))&![X20:($i > $o) > $o]:(((X18 @ X20)=>(X18 @ (^[Z1/* 5 */:$i > $o]:(?[X21:$i]:(((Z1 @ X21)&(X20 @ (^[Z2/* 8 */:$i]:((~(((Z2)=(X21)))&(Z1 @ Z2)))))))))))))=>(X18 @ Z0)))))), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.20/0.48  thf(c_0_8, negated_conjecture, ($false), inference(cn,[status(thm)],[c_0_7]), ['proof']).
% 0.20/0.48  # SZS output end CNFRefutation
% 0.20/0.48  # Parsed axioms                        : 5
% 0.20/0.48  # Removed by relevancy pruning/SinE    : 2
% 0.20/0.48  # Initial clauses                      : 1
% 0.20/0.48  # Removed in clause preprocessing      : 0
% 0.20/0.48  # Initial clauses in saturation        : 1
% 0.20/0.48  # Processed clauses                    : 1
% 0.20/0.48  # ...of these trivial                  : 0
% 0.20/0.48  # ...subsumed                          : 0
% 0.20/0.48  # ...remaining for further processing  : 0
% 0.20/0.48  # Other redundant clauses eliminated   : 0
% 0.20/0.48  # Clauses deleted for lack of memory   : 0
% 0.20/0.48  # Backward-subsumed                    : 0
% 0.20/0.48  # Backward-rewritten                   : 0
% 0.20/0.48  # Generated clauses                    : 0
% 0.20/0.48  # ...of the previous two non-redundant : 0
% 0.20/0.48  # ...aggressively subsumed             : 0
% 0.20/0.48  # Contextual simplify-reflections      : 0
% 0.20/0.48  # Paramodulations                      : 0
% 0.20/0.48  # Factorizations                       : 0
% 0.20/0.48  # NegExts                              : 0
% 0.20/0.48  # Equation resolutions                 : 0
% 0.20/0.48  # Disequality decompositions           : 0
% 0.20/0.48  # Total rewrite steps                  : 0
% 0.20/0.48  # ...of those cached                   : 0
% 0.20/0.48  # Propositional unsat checks           : 0
% 0.20/0.48  #    Propositional check models        : 0
% 0.20/0.48  #    Propositional check unsatisfiable : 0
% 0.20/0.48  #    Propositional clauses             : 0
% 0.20/0.48  #    Propositional clauses after purity: 0
% 0.20/0.48  #    Propositional unsat core size     : 0
% 0.20/0.48  #    Propositional preprocessing time  : 0.000
% 0.20/0.48  #    Propositional encoding time       : 0.000
% 0.20/0.48  #    Propositional solver time         : 0.000
% 0.20/0.48  #    Success case prop preproc time    : 0.000
% 0.20/0.48  #    Success case prop encoding time   : 0.000
% 0.20/0.48  #    Success case prop solver time     : 0.000
% 0.20/0.48  # Current number of processed clauses  : 0
% 0.20/0.48  #    Positive orientable unit clauses  : 0
% 0.20/0.48  #    Positive unorientable unit clauses: 0
% 0.20/0.48  #    Negative unit clauses             : 0
% 0.20/0.48  #    Non-unit-clauses                  : 0
% 0.20/0.48  # Current number of unprocessed clauses: 0
% 0.20/0.48  # ...number of literals in the above   : 0
% 0.20/0.48  # Current number of archived formulas  : 0
% 0.20/0.48  # Current number of archived clauses   : 0
% 0.20/0.48  # Clause-clause subsumption calls (NU) : 0
% 0.20/0.48  # Rec. Clause-clause subsumption calls : 0
% 0.20/0.48  # Non-unit clause-clause subsumptions  : 0
% 0.20/0.48  # Unit Clause-clause subsumption calls : 0
% 0.20/0.48  # Rewrite failures with RHS unbound    : 0
% 0.20/0.48  # BW rewrite match attempts            : 0
% 0.20/0.48  # BW rewrite match successes           : 0
% 0.20/0.48  # Condensation attempts                : 1
% 0.20/0.48  # Condensation successes               : 0
% 0.20/0.48  # Termbank termtop insertions          : 637
% 0.20/0.48  # Search garbage collected termcells   : 135
% 0.20/0.48  
% 0.20/0.48  # -------------------------------------------------
% 0.20/0.48  # User time                : 0.003 s
% 0.20/0.48  # System time              : 0.001 s
% 0.20/0.48  # Total time               : 0.004 s
% 0.20/0.48  # Maximum resident set size: 1760 pages
% 0.20/0.48  
% 0.20/0.48  # -------------------------------------------------
% 0.20/0.48  # User time                : 0.005 s
% 0.20/0.48  # System time              : 0.002 s
% 0.20/0.48  # Total time               : 0.007 s
% 0.20/0.48  # Maximum resident set size: 1740 pages
% 0.20/0.48  % E---3.1 exiting
% 0.20/0.48  % E exiting
%------------------------------------------------------------------------------