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