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