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