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

View Problem - Process Solution

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

% Computer : n014.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 02:54:56 EDT 2024

% Result   : Theorem 0.15s 0.42s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.09  % Problem    : SET614^5 : TPTP v8.2.0. Released v4.0.0.
% 0.04/0.10  % Command    : run_E %s %d THM
% 0.09/0.30  % Computer : n014.cluster.edu
% 0.09/0.30  % Model    : x86_64 x86_64
% 0.09/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30  % Memory   : 8042.1875MB
% 0.09/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30  % CPULimit   : 300
% 0.09/0.30  % WCLimit    : 300
% 0.09/0.30  % DateTime   : Mon May 20 13:16:38 EDT 2024
% 0.09/0.30  % CPUTime    : 
% 0.15/0.41  Running higher-order theorem proving
% 0.15/0.41  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.15/0.42  # Version: 3.1.0-ho
% 0.15/0.42  # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.15/0.42  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42  # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.15/0.42  # Starting post_as_ho10 with 300s (1) cores
% 0.15/0.42  # Starting new_bool_9 with 300s (1) cores
% 0.15/0.42  # Starting sh5l with 300s (1) cores
% 0.15/0.42  # new_bool_9 with pid 13979 completed with status 0
% 0.15/0.42  # Result found by new_bool_9
% 0.15/0.42  # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.15/0.42  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42  # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.15/0.42  # Starting post_as_ho10 with 300s (1) cores
% 0.15/0.42  # Starting new_bool_9 with 300s (1) cores
% 0.15/0.42  # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.15/0.42  # Search class: HUUPF-FFSF00-MSSFFFNN
% 0.15/0.42  # partial match(1): HUUPF-FFSF00-SSSFFFNN
% 0.15/0.42  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42  # Starting new_ho_10 with 181s (1) cores
% 0.15/0.42  # new_ho_10 with pid 13982 completed with status 0
% 0.15/0.42  # Result found by new_ho_10
% 0.15/0.42  # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.15/0.42  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42  # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.15/0.42  # Starting post_as_ho10 with 300s (1) cores
% 0.15/0.42  # Starting new_bool_9 with 300s (1) cores
% 0.15/0.42  # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.15/0.42  # Search class: HUUPF-FFSF00-MSSFFFNN
% 0.15/0.42  # partial match(1): HUUPF-FFSF00-SSSFFFNN
% 0.15/0.42  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42  # Starting new_ho_10 with 181s (1) cores
% 0.15/0.42  # Preprocessing time       : 0.001 s
% 0.15/0.42  # Presaturation interreduction done
% 0.15/0.42  
% 0.15/0.42  # Proof found!
% 0.15/0.42  # SZS status Theorem
% 0.15/0.42  # SZS output start CNFRefutation
% 0.15/0.42  thf(decl_sort1, type, a: $tType).
% 0.15/0.42  thf(decl_22, type, epred1_0: a > $o).
% 0.15/0.42  thf(decl_23, type, epred2_0: a > $o).
% 0.15/0.42  thf(decl_24, type, epred3_0: a > $o).
% 0.15/0.42  thf(decl_25, type, esk1_0: a).
% 0.15/0.42  thf(cBOOL_PROP_88_pme, conjecture, ![X1:a > $o, X2:a > $o, X3:a > $o]:(((^[X4:a]:((((X1 @ X4)&~((X2 @ X4)))&~((X3 @ X4)))))=(^[X4:a]:(((X1 @ X4)&~(((X2 @ X4)|(X3 @ X4)))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cBOOL_PROP_88_pme)).
% 0.15/0.42  thf(c_0_1, negated_conjecture, ~(![X1:a > $o, X2:a > $o, X3:a > $o]:(((^[Z0/* 8 */:a]:(((X1 @ Z0&~(X2 @ Z0))&~(X3 @ Z0))))=(^[Z0/* 8 */:a]:((X1 @ Z0&~((X2 @ Z0|X3 @ Z0)))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cBOOL_PROP_88_pme])])).
% 0.15/0.42  thf(c_0_2, negated_conjecture, ((^[Z0/* 8 */:a]:(((epred1_0 @ Z0&~(epred2_0 @ Z0))&~(epred3_0 @ Z0))))!=(^[Z0/* 8 */:a]:((epred1_0 @ Z0&~((epred2_0 @ Z0|epred3_0 @ Z0)))))), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])).
% 0.15/0.42  thf(c_0_3, negated_conjecture, ((^[Z0/* 8 */:a]:((((epred1_0 @ Z0)&~((epred2_0 @ Z0)))&~((epred3_0 @ Z0)))))!=(^[Z0/* 8 */:a]:(((epred1_0 @ Z0)&~(((epred2_0 @ Z0)|(epred3_0 @ Z0))))))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.15/0.42  thf(c_0_4, negated_conjecture, (((epred1_0 @ esk1_0)&~(((epred2_0 @ esk1_0)|(epred3_0 @ esk1_0))))<~>(((epred1_0 @ esk1_0)&~((epred2_0 @ esk1_0)))&~((epred3_0 @ esk1_0)))), inference(neg_ext,[status(thm)],[c_0_3])).
% 0.15/0.42  thf(c_0_5, negated_conjecture, (epred1_0 @ esk1_0), inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_4])])).
% 0.15/0.42  thf(c_0_6, negated_conjecture, ~((epred2_0 @ esk1_0)), inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_4])])).
% 0.15/0.42  thf(c_0_7, negated_conjecture, ~((epred3_0 @ esk1_0)), inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_4])])).
% 0.15/0.42  thf(c_0_8, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_4])]), c_0_5])]), c_0_6]), c_0_7]), ['proof']).
% 0.15/0.42  # SZS output end CNFRefutation
% 0.15/0.42  # Parsed axioms                        : 2
% 0.15/0.42  # Removed by relevancy pruning/SinE    : 1
% 0.15/0.42  # Initial clauses                      : 1
% 0.15/0.42  # Removed in clause preprocessing      : 0
% 0.15/0.42  # Initial clauses in saturation        : 1
% 0.15/0.42  # Processed clauses                    : 13
% 0.15/0.42  # ...of these trivial                  : 4
% 0.15/0.42  # ...subsumed                          : 2
% 0.15/0.42  # ...remaining for further processing  : 6
% 0.15/0.42  # Other redundant clauses eliminated   : 0
% 0.15/0.42  # Clauses deleted for lack of memory   : 0
% 0.15/0.42  # Backward-subsumed                    : 0
% 0.15/0.42  # Backward-rewritten                   : 0
% 0.15/0.42  # Generated clauses                    : 11
% 0.15/0.42  # ...of the previous two non-redundant : 11
% 0.15/0.42  # ...aggressively subsumed             : 0
% 0.15/0.42  # Contextual simplify-reflections      : 0
% 0.15/0.42  # Paramodulations                      : 0
% 0.15/0.42  # Factorizations                       : 0
% 0.15/0.42  # NegExts                              : 1
% 0.15/0.42  # Equation resolutions                 : 0
% 0.15/0.42  # Disequality decompositions           : 0
% 0.15/0.42  # Total rewrite steps                  : 5
% 0.15/0.42  # ...of those cached                   : 4
% 0.15/0.42  # Propositional unsat checks           : 0
% 0.15/0.42  #    Propositional check models        : 0
% 0.15/0.42  #    Propositional check unsatisfiable : 0
% 0.15/0.42  #    Propositional clauses             : 0
% 0.15/0.42  #    Propositional clauses after purity: 0
% 0.15/0.42  #    Propositional unsat core size     : 0
% 0.15/0.42  #    Propositional preprocessing time  : 0.000
% 0.15/0.42  #    Propositional encoding time       : 0.000
% 0.15/0.42  #    Propositional solver time         : 0.000
% 0.15/0.42  #    Success case prop preproc time    : 0.000
% 0.15/0.42  #    Success case prop encoding time   : 0.000
% 0.15/0.42  #    Success case prop solver time     : 0.000
% 0.15/0.42  # Current number of processed clauses  : 4
% 0.15/0.42  #    Positive orientable unit clauses  : 1
% 0.15/0.42  #    Positive unorientable unit clauses: 0
% 0.15/0.42  #    Negative unit clauses             : 3
% 0.15/0.42  #    Non-unit-clauses                  : 0
% 0.15/0.42  # Current number of unprocessed clauses: 0
% 0.15/0.42  # ...number of literals in the above   : 0
% 0.15/0.42  # Current number of archived formulas  : 0
% 0.15/0.42  # Current number of archived clauses   : 2
% 0.15/0.42  # Clause-clause subsumption calls (NU) : 0
% 0.15/0.42  # Rec. Clause-clause subsumption calls : 0
% 0.15/0.42  # Non-unit clause-clause subsumptions  : 0
% 0.15/0.42  # Unit Clause-clause subsumption calls : 2
% 0.15/0.42  # Rewrite failures with RHS unbound    : 0
% 0.15/0.42  # BW rewrite match attempts            : 0
% 0.15/0.42  # BW rewrite match successes           : 0
% 0.15/0.42  # Condensation attempts                : 13
% 0.15/0.42  # Condensation successes               : 0
% 0.15/0.42  # Termbank termtop insertions          : 595
% 0.15/0.42  # Search garbage collected termcells   : 67
% 0.15/0.42  
% 0.15/0.42  # -------------------------------------------------
% 0.15/0.42  # User time                : 0.001 s
% 0.15/0.42  # System time              : 0.002 s
% 0.15/0.42  # Total time               : 0.003 s
% 0.15/0.42  # Maximum resident set size: 1812 pages
% 0.15/0.42  
% 0.15/0.42  # -------------------------------------------------
% 0.15/0.42  # User time                : 0.001 s
% 0.15/0.42  # System time              : 0.004 s
% 0.15/0.42  # Total time               : 0.005 s
% 0.15/0.42  # Maximum resident set size: 1724 pages
% 0.15/0.42  % E---3.1 exiting
% 0.15/0.42  % E exiting
%------------------------------------------------------------------------------