TSTP Solution File: SET596^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET596^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:28 EDT 2024
% Result : Theorem 0.23s 0.51s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SET596^5 : TPTP v8.2.0. Released v4.0.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n013.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon May 20 12:23:23 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.23/0.50 Running higher-order theorem proving
% 0.23/0.50 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.23/0.51 # Version: 3.1.0-ho
% 0.23/0.51 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.23/0.51 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.51 # Starting post_as_ho12 with 300s (1) cores
% 0.23/0.51 # Starting new_bool_9 with 300s (1) cores
% 0.23/0.51 # Starting post_as_ho1 with 300s (1) cores
% 0.23/0.51 # Starting post_as_ho4 with 300s (1) cores
% 0.23/0.51 # Starting post_as_ho2 with 300s (1) cores
% 0.23/0.51 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.23/0.51 # Starting full_lambda_10 with 300s (1) cores
% 0.23/0.51 # Starting new_ho_8 with 300s (1) cores
% 0.23/0.51 # new_bool_9 with pid 27478 completed with status 0
% 0.23/0.51 # Result found by new_bool_9
% 0.23/0.51 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.23/0.51 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.51 # Starting post_as_ho12 with 300s (1) cores
% 0.23/0.51 # Starting new_bool_9 with 300s (1) cores
% 0.23/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.23/0.51 # Search class: HHUSF-FFSF00-MSSFFFNN
% 0.23/0.51 # partial match(1): HHUSF-FFSF00-SSSFFFNN
% 0.23/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.51 # Starting new_ho_10 with 181s (1) cores
% 0.23/0.51 # new_ho_10 with pid 27485 completed with status 0
% 0.23/0.51 # Result found by new_ho_10
% 0.23/0.51 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.23/0.51 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.51 # Starting post_as_ho12 with 300s (1) cores
% 0.23/0.51 # Starting new_bool_9 with 300s (1) cores
% 0.23/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.23/0.51 # Search class: HHUSF-FFSF00-MSSFFFNN
% 0.23/0.51 # partial match(1): HHUSF-FFSF00-SSSFFFNN
% 0.23/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.51 # Starting new_ho_10 with 181s (1) cores
% 0.23/0.51 # Preprocessing time : 0.001 s
% 0.23/0.51 # Presaturation interreduction done
% 0.23/0.51
% 0.23/0.51 # Proof found!
% 0.23/0.51 # SZS status Theorem
% 0.23/0.51 # SZS output start CNFRefutation
% 0.23/0.51 thf(decl_sort1, type, a: $tType).
% 0.23/0.51 thf(decl_22, type, epred1_0: a > $o).
% 0.23/0.51 thf(decl_23, type, epred2_0: a > $o).
% 0.23/0.51 thf(decl_24, type, epred3_0: a > $o).
% 0.23/0.51 thf(decl_25, type, esk1_0: a).
% 0.23/0.51 thf(cBOOL_PROP_55_pme, conjecture, ![X1:a > $o, X2:a > $o, X3:a > $o]:(((![X4:a]:(((X1 @ X4)=>(X2 @ X4)))&((^[X4:a]:(((X2 @ X4)&(X3 @ X4))))=(^[X4:a]:(~($true)))))=>((^[X4:a]:(((X1 @ X4)&(X3 @ X4))))=(^[X4:a]:(~($true)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cBOOL_PROP_55_pme)).
% 0.23/0.51 thf(c_0_1, negated_conjecture, ~(![X1:a > $o, X2:a > $o, X3:a > $o]:(((![X4:a]:(((X1 @ X4)=>(X2 @ X4)))&((^[Z0/* 8 */:a]:((X2 @ Z0&X3 @ Z0)))=(^[Z0/* 7 */:a]:(~($true)))))=>((^[Z0/* 8 */:a]:((X1 @ Z0&X3 @ Z0)))=(^[Z0/* 7 */:a]:(~($true))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cBOOL_PROP_55_pme])])).
% 0.23/0.51 thf(c_0_2, negated_conjecture, ![X12:a]:((((~(epred1_0 @ X12)|(epred2_0 @ X12))&((^[Z0/* 8 */:a]:((epred2_0 @ Z0&epred3_0 @ Z0)))=(^[Z0/* 7 */:a]:(~($true)))))&((^[Z0/* 8 */:a]:((epred1_0 @ Z0&epred3_0 @ Z0)))!=(^[Z0/* 7 */:a]:(~($true)))))), 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.23/0.51 thf(c_0_3, negated_conjecture, ((^[Z0/* 8 */:a]:(((epred1_0 @ Z0)&(epred3_0 @ Z0))))!=(^[Z0/* 7 */:a]:(~(($true))))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.23/0.51 thf(c_0_4, negated_conjecture, ((^[Z0/* 8 */:a]:(((epred2_0 @ Z0)&(epred3_0 @ Z0))))=(^[Z0/* 7 */:a]:(~(($true))))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.23/0.51 thf(c_0_5, negated_conjecture, ((^[Z0/* 8 */:a]:(((epred1_0 @ Z0)&(epred3_0 @ Z0))))!=(^[Z0/* 4 */:a]:(~($true)))), inference(cn,[status(thm)],[c_0_3])).
% 0.23/0.51 thf(c_0_6, negated_conjecture, ((^[Z0/* 8 */:a]:(((epred2_0 @ Z0)&(epred3_0 @ Z0))))=(^[Z0/* 4 */:a]:(~($true)))), inference(cn,[status(thm)],[c_0_4])).
% 0.23/0.51 thf(c_0_7, negated_conjecture, ((epred1_0 @ esk1_0)&(epred3_0 @ esk1_0)), inference(neg_ext,[status(thm)],[c_0_5])).
% 0.23/0.51 thf(c_0_8, negated_conjecture, ![X13:a]:(~(((epred2_0 @ X13)&(epred3_0 @ X13)))), inference(arg_cong,[status(thm)],[c_0_6])).
% 0.23/0.51 thf(c_0_9, negated_conjecture, ![X4:a]:(((epred2_0 @ X4)|~((epred1_0 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.23/0.51 thf(c_0_10, negated_conjecture, (epred1_0 @ esk1_0), inference(dynamic_cnf,[status(thm)],[c_0_7])).
% 0.23/0.51 thf(c_0_11, negated_conjecture, ![X4:a]:((~((epred2_0 @ X4))|~((epred3_0 @ X4)))), inference(dynamic_cnf,[status(thm)],[c_0_8])).
% 0.23/0.51 thf(c_0_12, negated_conjecture, (epred2_0 @ esk1_0), inference(spm,[status(thm)],[c_0_9, c_0_10])).
% 0.23/0.51 thf(c_0_13, negated_conjecture, (epred3_0 @ esk1_0), inference(dynamic_cnf,[status(thm)],[c_0_7])).
% 0.23/0.51 thf(c_0_14, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11, c_0_12]), c_0_13])]), ['proof']).
% 0.23/0.51 # SZS output end CNFRefutation
% 0.23/0.51 # Parsed axioms : 2
% 0.23/0.51 # Removed by relevancy pruning/SinE : 1
% 0.23/0.51 # Initial clauses : 3
% 0.23/0.51 # Removed in clause preprocessing : 0
% 0.23/0.51 # Initial clauses in saturation : 3
% 0.23/0.51 # Processed clauses : 12
% 0.23/0.51 # ...of these trivial : 0
% 0.23/0.51 # ...subsumed : 0
% 0.23/0.51 # ...remaining for further processing : 12
% 0.23/0.51 # Other redundant clauses eliminated : 0
% 0.23/0.51 # Clauses deleted for lack of memory : 0
% 0.23/0.51 # Backward-subsumed : 0
% 0.23/0.51 # Backward-rewritten : 0
% 0.23/0.51 # Generated clauses : 7
% 0.23/0.51 # ...of the previous two non-redundant : 6
% 0.23/0.51 # ...aggressively subsumed : 0
% 0.23/0.51 # Contextual simplify-reflections : 0
% 0.23/0.51 # Paramodulations : 2
% 0.23/0.51 # Factorizations : 0
% 0.23/0.51 # NegExts : 1
% 0.23/0.51 # Equation resolutions : 0
% 0.23/0.51 # Disequality decompositions : 0
% 0.23/0.51 # Total rewrite steps : 1
% 0.23/0.51 # ...of those cached : 0
% 0.23/0.51 # Propositional unsat checks : 0
% 0.23/0.51 # Propositional check models : 0
% 0.23/0.51 # Propositional check unsatisfiable : 0
% 0.23/0.51 # Propositional clauses : 0
% 0.23/0.51 # Propositional clauses after purity: 0
% 0.23/0.51 # Propositional unsat core size : 0
% 0.23/0.51 # Propositional preprocessing time : 0.000
% 0.23/0.51 # Propositional encoding time : 0.000
% 0.23/0.51 # Propositional solver time : 0.000
% 0.23/0.51 # Success case prop preproc time : 0.000
% 0.23/0.51 # Success case prop encoding time : 0.000
% 0.23/0.51 # Success case prop solver time : 0.000
% 0.23/0.51 # Current number of processed clauses : 7
% 0.23/0.51 # Positive orientable unit clauses : 4
% 0.23/0.51 # Positive unorientable unit clauses: 0
% 0.23/0.51 # Negative unit clauses : 1
% 0.23/0.51 # Non-unit-clauses : 2
% 0.23/0.51 # Current number of unprocessed clauses: 0
% 0.23/0.51 # ...number of literals in the above : 0
% 0.23/0.51 # Current number of archived formulas : 0
% 0.23/0.51 # Current number of archived clauses : 5
% 0.23/0.51 # Clause-clause subsumption calls (NU) : 0
% 0.23/0.51 # Rec. Clause-clause subsumption calls : 0
% 0.23/0.51 # Non-unit clause-clause subsumptions : 0
% 0.23/0.51 # Unit Clause-clause subsumption calls : 0
% 0.23/0.51 # Rewrite failures with RHS unbound : 0
% 0.23/0.51 # BW rewrite match attempts : 0
% 0.23/0.51 # BW rewrite match successes : 0
% 0.23/0.51 # Condensation attempts : 12
% 0.23/0.51 # Condensation successes : 0
% 0.23/0.51 # Termbank termtop insertions : 486
% 0.23/0.51 # Search garbage collected termcells : 122
% 0.23/0.51
% 0.23/0.51 # -------------------------------------------------
% 0.23/0.51 # User time : 0.004 s
% 0.23/0.51 # System time : 0.000 s
% 0.23/0.51 # Total time : 0.004 s
% 0.23/0.51 # Maximum resident set size: 1852 pages
% 0.23/0.51
% 0.23/0.51 # -------------------------------------------------
% 0.23/0.51 # User time : 0.004 s
% 0.23/0.51 # System time : 0.004 s
% 0.23/0.51 # Total time : 0.007 s
% 0.23/0.51 # Maximum resident set size: 1712 pages
% 0.23/0.51 % E---3.1 exiting
% 0.23/0.51 % E exiting
%------------------------------------------------------------------------------