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