TSTP Solution File: SEV231^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV231^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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 04:08:02 EDT 2024
% Result : Theorem 0.19s 0.48s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEV231^5 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 18:29:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running higher-order theorem proving
% 0.19/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.19/0.48 # Version: 3.1.0-ho
% 0.19/0.48 # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.19/0.48 # Starting post_as_ho10 with 300s (1) cores
% 0.19/0.48 # Starting new_bool_9 with 300s (1) cores
% 0.19/0.48 # Starting sh5l with 300s (1) cores
% 0.19/0.48 # ehoh_best_nonlift_nonlambdatoforall with pid 17872 completed with status 0
% 0.19/0.48 # Result found by ehoh_best_nonlift_nonlambdatoforall
% 0.19/0.48 # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.19/0.48 # No SInE strategy applied
% 0.19/0.48 # Search class: HUUPF-FFSF00-DSSFFFNN
% 0.19/0.48 # partial match(1): HUUPF-FFSF00-SSSFFFNN
% 0.19/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.48 # Starting new_ho_10 with 811s (1) cores
% 0.19/0.48 # Starting ehoh_best_nonlift_nonlambdatoforall with 151s (1) cores
% 0.19/0.48 # Starting new_bool_1 with 136s (1) cores
% 0.19/0.48 # Starting new_bool_2 with 136s (1) cores
% 0.19/0.48 # Starting new_bool_9 with 136s (1) cores
% 0.19/0.48 # new_bool_9 with pid 17883 completed with status 0
% 0.19/0.48 # Result found by new_bool_9
% 0.19/0.48 # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.19/0.48 # No SInE strategy applied
% 0.19/0.48 # Search class: HUUPF-FFSF00-DSSFFFNN
% 0.19/0.48 # partial match(1): HUUPF-FFSF00-SSSFFFNN
% 0.19/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.48 # Starting new_ho_10 with 811s (1) cores
% 0.19/0.48 # Starting ehoh_best_nonlift_nonlambdatoforall with 151s (1) cores
% 0.19/0.48 # Starting new_bool_1 with 136s (1) cores
% 0.19/0.48 # Starting new_bool_2 with 136s (1) cores
% 0.19/0.48 # Starting new_bool_9 with 136s (1) cores
% 0.19/0.48 # Preprocessing time : 0.001 s
% 0.19/0.48 # Presaturation interreduction done
% 0.19/0.48
% 0.19/0.48 # Proof found!
% 0.19/0.48 # SZS status Theorem
% 0.19/0.48 # SZS output start CNFRefutation
% 0.19/0.48 thf(decl_sort1, type, a: $tType).
% 0.19/0.48 thf(decl_22, type, y: a > $o).
% 0.19/0.48 thf(decl_23, type, x: a > $o).
% 0.19/0.48 thf(decl_24, type, esk1_0: a).
% 0.19/0.48 thf(decl_25, type, epred1_0: a > $o).
% 0.19/0.48 thf(cX5201_pme, conjecture, ((^[X1:a]:(((x @ X1)&(y @ X1))))=(^[X1:a]:(![X2:a > $o]:(((((X2)=(x))|((X2)=(y)))=>(X2 @ X1)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cX5201_pme)).
% 0.19/0.48 thf(c_0_1, negated_conjecture, ((^[Z0/* 8 */:a]:(((x @ Z0)&(y @ Z0))))!=(^[Z0/* 6 */:a]:(![X2:a > $o]:(((((X2)=(x))|((X2)=(y)))=>X2 @ Z0))))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cX5201_pme])])])).
% 0.19/0.48 thf(c_0_2, negated_conjecture, ((^[Z0/* 8 */:a]:(((x @ Z0)&(y @ Z0))))!=(^[Z0/* 6 */:a]:(![X2:a > $o]:(((((X2)=(x))|((X2)=(y)))=>X2 @ Z0))))), inference(fof_nnf,[status(thm)],[c_0_1])).
% 0.19/0.48 thf(c_0_3, negated_conjecture, ((^[Z0/* 8 */:a]:(((x @ Z0)&(y @ Z0))))!=(^[Z0/* 6 */:a]:(![X17:a > $o]:(((((X17)=(x))|((X17)=(y)))=>(X17 @ Z0)))))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.19/0.48 thf(c_0_4, negated_conjecture, (![X18:a > $o]:(((((X18)=(x))|((X18)=(y)))=>(X18 @ esk1_0)))<~>((x @ esk1_0)&(y @ esk1_0))), inference(neg_ext,[status(thm)],[c_0_3])).
% 0.19/0.48 thf(c_0_5, negated_conjecture, (x @ esk1_0), inference(er,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_4])])).
% 0.19/0.48 thf(c_0_6, negated_conjecture, (y @ esk1_0), inference(er,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_4])])).
% 0.19/0.48 thf(c_0_7, negated_conjecture, (((y)=(epred1_0))|((x)=(epred1_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_4]), c_0_5]), c_0_6])])).
% 0.19/0.48 thf(c_0_8, negated_conjecture, ![X6:a]:((((y @ X6)<=>(epred1_0 @ X6))|((x)=(epred1_0)))), inference(arg_cong,[status(thm)],[c_0_7])).
% 0.19/0.48 thf(c_0_9, negated_conjecture, ![X1:a]:((((x)=(epred1_0))|(epred1_0 @ X1)|~((y @ X1)))), inference(dynamic_cnf,[status(thm)],[c_0_8])).
% 0.19/0.48 thf(c_0_10, negated_conjecture, ~((epred1_0 @ esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_4]), c_0_5]), c_0_6])])).
% 0.19/0.48 thf(c_0_11, negated_conjecture, ((x)=(epred1_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9, c_0_6]), c_0_10])).
% 0.19/0.48 thf(c_0_12, negated_conjecture, ![X13:a]:(((x @ X13)<=>(epred1_0 @ X13))), inference(arg_cong,[status(thm)],[c_0_11])).
% 0.19/0.48 thf(c_0_13, negated_conjecture, ![X1:a]:(((epred1_0 @ X1)|~((x @ X1)))), inference(dynamic_cnf,[status(thm)],[c_0_12])).
% 0.19/0.48 thf(c_0_14, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_5]), c_0_10]), ['proof']).
% 0.19/0.48 # SZS output end CNFRefutation
% 0.19/0.48 # Parsed axioms : 4
% 0.19/0.48 # Removed by relevancy pruning/SinE : 0
% 0.19/0.48 # Initial clauses : 4
% 0.19/0.48 # Removed in clause preprocessing : 3
% 0.19/0.48 # Initial clauses in saturation : 1
% 0.19/0.48 # Processed clauses : 20
% 0.19/0.48 # ...of these trivial : 2
% 0.19/0.48 # ...subsumed : 1
% 0.19/0.48 # ...remaining for further processing : 17
% 0.19/0.48 # Other redundant clauses eliminated : 4
% 0.19/0.48 # Clauses deleted for lack of memory : 0
% 0.19/0.48 # Backward-subsumed : 1
% 0.19/0.48 # Backward-rewritten : 4
% 0.19/0.48 # Generated clauses : 31
% 0.19/0.48 # ...of the previous two non-redundant : 24
% 0.19/0.48 # ...aggressively subsumed : 0
% 0.19/0.48 # Contextual simplify-reflections : 0
% 0.19/0.48 # Paramodulations : 5
% 0.19/0.48 # Factorizations : 0
% 0.19/0.48 # NegExts : 1
% 0.19/0.48 # Equation resolutions : 4
% 0.19/0.48 # Disequality decompositions : 0
% 0.19/0.48 # Total rewrite steps : 12
% 0.19/0.48 # ...of those cached : 8
% 0.19/0.48 # Propositional unsat checks : 0
% 0.19/0.48 # Propositional check models : 0
% 0.19/0.48 # Propositional check unsatisfiable : 0
% 0.19/0.48 # Propositional clauses : 0
% 0.19/0.48 # Propositional clauses after purity: 0
% 0.19/0.48 # Propositional unsat core size : 0
% 0.19/0.48 # Propositional preprocessing time : 0.000
% 0.19/0.48 # Propositional encoding time : 0.000
% 0.19/0.48 # Propositional solver time : 0.000
% 0.19/0.48 # Success case prop preproc time : 0.000
% 0.19/0.48 # Success case prop encoding time : 0.000
% 0.19/0.48 # Success case prop solver time : 0.000
% 0.19/0.48 # Current number of processed clauses : 7
% 0.19/0.48 # Positive orientable unit clauses : 4
% 0.19/0.48 # Positive unorientable unit clauses: 0
% 0.19/0.48 # Negative unit clauses : 2
% 0.19/0.48 # Non-unit-clauses : 1
% 0.19/0.48 # Current number of unprocessed clauses: 6
% 0.19/0.48 # ...number of literals in the above : 15
% 0.19/0.48 # Current number of archived formulas : 0
% 0.19/0.48 # Current number of archived clauses : 10
% 0.19/0.48 # Clause-clause subsumption calls (NU) : 9
% 0.19/0.48 # Rec. Clause-clause subsumption calls : 6
% 0.19/0.48 # Non-unit clause-clause subsumptions : 0
% 0.19/0.48 # Unit Clause-clause subsumption calls : 3
% 0.19/0.48 # Rewrite failures with RHS unbound : 0
% 0.19/0.48 # BW rewrite match attempts : 2
% 0.19/0.48 # BW rewrite match successes : 2
% 0.19/0.48 # Condensation attempts : 0
% 0.19/0.48 # Condensation successes : 0
% 0.19/0.48 # Termbank termtop insertions : 1385
% 0.19/0.48 # Search garbage collected termcells : 13
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.005 s
% 0.19/0.48 # System time : 0.001 s
% 0.19/0.48 # Total time : 0.006 s
% 0.19/0.48 # Maximum resident set size: 1712 pages
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.015 s
% 0.19/0.48 # System time : 0.007 s
% 0.19/0.48 # Total time : 0.022 s
% 0.19/0.48 # Maximum resident set size: 1720 pages
% 0.19/0.48 % E---3.1 exiting
% 0.19/0.48 % E exiting
%------------------------------------------------------------------------------