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

View Problem - Process Solution

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

% Computer : n021.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:05 EDT 2024

% Result   : Theorem 0.22s 0.50s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : SEV256^5 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n021.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Sun May 19 18:41:53 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.22/0.49  Running higher-order theorem proving
% 0.22/0.49  Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.22/0.50  # Version: 3.1.0-ho
% 0.22/0.50  # Preprocessing class: HSSSSMSSSSMNHHA.
% 0.22/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50  # Starting post_as_ho5 with 1500s (5) cores
% 0.22/0.50  # Starting sh2lt with 300s (1) cores
% 0.22/0.50  # Starting ehoh_best8_lambda with 300s (1) cores
% 0.22/0.50  # Starting post_as_ho10 with 300s (1) cores
% 0.22/0.50  # post_as_ho5 with pid 8371 completed with status 0
% 0.22/0.50  # Result found by post_as_ho5
% 0.22/0.50  # Preprocessing class: HSSSSMSSSSMNHHA.
% 0.22/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50  # Starting post_as_ho5 with 1500s (5) cores
% 0.22/0.50  # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.22/0.50  # Search class: HGUNF-FFSF00-MHHFFSBN
% 0.22/0.50  # partial match(1): HGUNF-FFSF00-SHHFFSBN
% 0.22/0.50  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.50  # Starting ho_unfolding_3 with 675s (1) cores
% 0.22/0.50  # Starting post_as_ho5 with 151s (1) cores
% 0.22/0.50  # Starting ehoh_best2_full_lfho with 169s (1) cores
% 0.22/0.50  # Starting lpo8_s with 169s (1) cores
% 0.22/0.50  # Starting lpo9_lambda_fix with 169s (1) cores
% 0.22/0.50  # ehoh_best2_full_lfho with pid 8377 completed with status 0
% 0.22/0.50  # Result found by ehoh_best2_full_lfho
% 0.22/0.50  # Preprocessing class: HSSSSMSSSSMNHHA.
% 0.22/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50  # Starting post_as_ho5 with 1500s (5) cores
% 0.22/0.50  # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 0.22/0.50  # Search class: HGUNF-FFSF00-MHHFFSBN
% 0.22/0.50  # partial match(1): HGUNF-FFSF00-SHHFFSBN
% 0.22/0.50  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.50  # Starting ho_unfolding_3 with 675s (1) cores
% 0.22/0.50  # Starting post_as_ho5 with 151s (1) cores
% 0.22/0.50  # Starting ehoh_best2_full_lfho with 169s (1) cores
% 0.22/0.50  # Preprocessing time       : 0.001 s
% 0.22/0.50  
% 0.22/0.50  # Proof found!
% 0.22/0.50  # SZS status Theorem
% 0.22/0.50  # SZS output start CNFRefutation
% 0.22/0.50  thf(decl_sort1, type, a: $tType).
% 0.22/0.50  thf(decl_22, type, cOPEN: (a > $o) > $o).
% 0.22/0.50  thf(decl_23, type, epred1_1: ((a > $o) > $o) > a > $o).
% 0.22/0.50  thf(cTHM625A_pme, conjecture, (![X1:(a > $o) > $o]:((![X2:a > $o]:(((X1 @ X2)=>(cOPEN @ X2)))=>(cOPEN @ (^[X3:a]:(?[X4:a > $o]:(((X1 @ X4)&(X4 @ X3))))))))=>(cOPEN @ (^[X5:a]:(~($true))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', cTHM625A_pme)).
% 0.22/0.50  thf(c_0_1, negated_conjecture, ~((![X1:(a > $o) > $o]:((![X2:a > $o]:(((X1 @ X2)=>(cOPEN @ X2)))=>(cOPEN @ (^[Z0/* 5 */:a]:(?[X4:a > $o]:((X1 @ X4&X4 @ Z0)))))))=>(cOPEN @ (^[Z0/* 7 */:a]:(~($true)))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM625A_pme])])).
% 0.22/0.50  thf(c_0_2, negated_conjecture, ![X8:(a > $o) > $o]:(((((X8 @ (epred1_1 @ X8))|(cOPEN @ (^[Z0/* 5 */:a]:(?[X4:a > $o]:((X8 @ X4&X4 @ Z0))))))&(~(cOPEN @ (epred1_1 @ X8))|(cOPEN @ (^[Z0/* 5 */:a]:(?[X4:a > $o]:((X8 @ X4&X4 @ Z0)))))))&~(cOPEN @ (^[Z0/* 7 */:a]:(~($true)))))), 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.22/0.50  thf(c_0_3, negated_conjecture, ~((cOPEN @ (^[Z0/* 7 */:a]:(~(($true)))))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.22/0.50  thf(c_0_4, negated_conjecture, ![X1:(a > $o) > $o]:(((X1 @ (epred1_1 @ X1))|(cOPEN @ (^[Z0/* 5 */:a]:(?[X17:a > $o]:(((X1 @ X17)&(X17 @ Z0)))))))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.22/0.50  thf(c_0_5, negated_conjecture, ~((cOPEN @ (^[Z0/* 4 */:a]:(~($true))))), inference(cn,[status(thm)],[c_0_3])).
% 0.22/0.50  thf(c_0_6, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(primitive_enumeration,[status(thm)],[c_0_4])]), c_0_5]), ['proof']).
% 0.22/0.50  # SZS output end CNFRefutation
% 0.22/0.50  # Parsed axioms                        : 3
% 0.22/0.50  # Removed by relevancy pruning/SinE    : 2
% 0.22/0.50  # Initial clauses                      : 3
% 0.22/0.50  # Removed in clause preprocessing      : 0
% 0.22/0.50  # Initial clauses in saturation        : 3
% 0.22/0.50  # Processed clauses                    : 3
% 0.22/0.50  # ...of these trivial                  : 0
% 0.22/0.50  # ...subsumed                          : 0
% 0.22/0.50  # ...remaining for further processing  : 3
% 0.22/0.50  # Other redundant clauses eliminated   : 0
% 0.22/0.50  # Clauses deleted for lack of memory   : 0
% 0.22/0.50  # Backward-subsumed                    : 0
% 0.22/0.50  # Backward-rewritten                   : 0
% 0.22/0.50  # Generated clauses                    : 12
% 0.22/0.50  # ...of the previous two non-redundant : 10
% 0.22/0.50  # ...aggressively subsumed             : 0
% 0.22/0.50  # Contextual simplify-reflections      : 0
% 0.22/0.50  # Paramodulations                      : 0
% 0.22/0.50  # Factorizations                       : 0
% 0.22/0.50  # NegExts                              : 0
% 0.22/0.50  # Equation resolutions                 : 0
% 0.22/0.50  # Disequality decompositions           : 0
% 0.22/0.50  # Total rewrite steps                  : 0
% 0.22/0.50  # ...of those cached                   : 0
% 0.22/0.50  # Propositional unsat checks           : 0
% 0.22/0.50  #    Propositional check models        : 0
% 0.22/0.50  #    Propositional check unsatisfiable : 0
% 0.22/0.50  #    Propositional clauses             : 0
% 0.22/0.50  #    Propositional clauses after purity: 0
% 0.22/0.50  #    Propositional unsat core size     : 0
% 0.22/0.50  #    Propositional preprocessing time  : 0.000
% 0.22/0.50  #    Propositional encoding time       : 0.000
% 0.22/0.50  #    Propositional solver time         : 0.000
% 0.22/0.50  #    Success case prop preproc time    : 0.000
% 0.22/0.50  #    Success case prop encoding time   : 0.000
% 0.22/0.50  #    Success case prop solver time     : 0.000
% 0.22/0.50  # Current number of processed clauses  : 3
% 0.22/0.50  #    Positive orientable unit clauses  : 0
% 0.22/0.50  #    Positive unorientable unit clauses: 0
% 0.22/0.50  #    Negative unit clauses             : 1
% 0.22/0.50  #    Non-unit-clauses                  : 2
% 0.22/0.50  # Current number of unprocessed clauses: 3
% 0.22/0.50  # ...number of literals in the above   : 8
% 0.22/0.50  # Current number of archived formulas  : 0
% 0.22/0.50  # Current number of archived clauses   : 0
% 0.22/0.50  # Clause-clause subsumption calls (NU) : 0
% 0.22/0.50  # Rec. Clause-clause subsumption calls : 0
% 0.22/0.50  # Non-unit clause-clause subsumptions  : 0
% 0.22/0.50  # Unit Clause-clause subsumption calls : 0
% 0.22/0.50  # Rewrite failures with RHS unbound    : 0
% 0.22/0.50  # BW rewrite match attempts            : 0
% 0.22/0.50  # BW rewrite match successes           : 0
% 0.22/0.50  # Condensation attempts                : 0
% 0.22/0.50  # Condensation successes               : 0
% 0.22/0.50  # Termbank termtop insertions          : 1220
% 0.22/0.50  # Search garbage collected termcells   : 109
% 0.22/0.50  
% 0.22/0.50  # -------------------------------------------------
% 0.22/0.50  # User time                : 0.003 s
% 0.22/0.50  # System time              : 0.001 s
% 0.22/0.50  # Total time               : 0.005 s
% 0.22/0.50  # Maximum resident set size: 1848 pages
% 0.22/0.50  
% 0.22/0.50  # -------------------------------------------------
% 0.22/0.50  # User time                : 0.012 s
% 0.22/0.50  # System time              : 0.007 s
% 0.22/0.50  # Total time               : 0.019 s
% 0.22/0.50  # Maximum resident set size: 1716 pages
% 0.22/0.50  % E---3.1 exiting
% 0.22/0.50  % E exiting
%------------------------------------------------------------------------------