TSTP Solution File: SEV121^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV121^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 : Tue May 21 04:07:48 EDT 2024
% Result : Theorem 0.12s 0.40s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : SEV121^5 : TPTP v8.2.0. Released v4.0.0.
% 0.00/0.09 % Command : run_E %s %d THM
% 0.08/0.27 % Computer : n032.cluster.edu
% 0.08/0.27 % Model : x86_64 x86_64
% 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27 % Memory : 8042.1875MB
% 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.27 % CPULimit : 300
% 0.08/0.27 % WCLimit : 300
% 0.08/0.27 % DateTime : Sun May 19 18:26:37 EDT 2024
% 0.08/0.28 % CPUTime :
% 0.12/0.39 Running higher-order theorem proving
% 0.12/0.39 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.12/0.40 # Version: 3.1.0-ho
% 0.12/0.40 # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.12/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.40 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.12/0.40 # Starting post_as_ho10 with 300s (1) cores
% 0.12/0.40 # Starting new_bool_9 with 300s (1) cores
% 0.12/0.40 # Starting sh5l with 300s (1) cores
% 0.12/0.40 # ehoh_best_nonlift_nonlambdatoforall with pid 6325 completed with status 0
% 0.12/0.40 # Result found by ehoh_best_nonlift_nonlambdatoforall
% 0.12/0.40 # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.12/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.40 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.12/0.40 # No SInE strategy applied
% 0.12/0.40 # Search class: HUUPF-FFSF00-DSSFFFNN
% 0.12/0.40 # partial match(1): HUUPF-FFSF00-SSSFFFNN
% 0.12/0.40 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.40 # Starting new_ho_10 with 811s (1) cores
% 0.12/0.40 # Starting ehoh_best_nonlift_nonlambdatoforall with 151s (1) cores
% 0.12/0.40 # Starting new_bool_1 with 136s (1) cores
% 0.12/0.40 # Starting new_bool_2 with 136s (1) cores
% 0.12/0.40 # Starting new_bool_9 with 136s (1) cores
% 0.12/0.40 # new_ho_10 with pid 6330 completed with status 9
% 0.12/0.40 # Starting sh5l with 130s (1) cores
% 0.12/0.40 # ehoh_best_nonlift_nonlambdatoforall with pid 6332 completed with status 0
% 0.12/0.40 # Result found by ehoh_best_nonlift_nonlambdatoforall
% 0.12/0.40 # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.12/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.40 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.12/0.40 # No SInE strategy applied
% 0.12/0.40 # Search class: HUUPF-FFSF00-DSSFFFNN
% 0.12/0.40 # partial match(1): HUUPF-FFSF00-SSSFFFNN
% 0.12/0.40 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.40 # Starting new_ho_10 with 811s (1) cores
% 0.12/0.40 # Starting ehoh_best_nonlift_nonlambdatoforall with 151s (1) cores
% 0.12/0.40 # Preprocessing time : 0.001 s
% 0.12/0.40 # Presaturation interreduction done
% 0.12/0.40
% 0.12/0.40 # Proof found!
% 0.12/0.40 # SZS status Theorem
% 0.12/0.40 # SZS output start CNFRefutation
% 0.12/0.40 thf(decl_22, type, esk1_0: $i).
% 0.12/0.40 thf(decl_23, type, esk2_0: $i).
% 0.12/0.40 thf(decl_24, type, epred1_0: $i > $i > $o).
% 0.12/0.40 thf(decl_25, type, esk3_1: ($i > $i > $o) > $i).
% 0.12/0.40 thf(cTHM47C_pme, conjecture, ((^[X1:$i, X2:$i]:(((X1)=(X2))))=(^[X3:$i, X4:$i]:(![X5:$i > $i > $o]:((![X6:$i]:((X5 @ X6 @ X6))=>(X5 @ X3 @ X4)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cTHM47C_pme)).
% 0.12/0.40 thf(c_0_1, negated_conjecture, (($eq)!=(^[Z0/* 19 */:$i, Z1:$i]:(![X5:$i > $i > $o]:((![X6:$i]:(X5 @ X6 @ X6)=>X5 @ Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM47C_pme])])])])).
% 0.12/0.40 thf(c_0_2, negated_conjecture, (($eq)!=(^[Z0/* 19 */:$i, Z1:$i]:(![X5:$i > $i > $o]:((![X6:$i]:(X5 @ X6 @ X6)=>X5 @ Z0 @ Z1))))), inference(fof_nnf,[status(thm)],[c_0_1])).
% 0.12/0.40 thf(c_0_3, negated_conjecture, (($eq)!=(^[Z0/* 19 */:$i, Z1:$i]:(![X13:$i > $i > $o]:((![X14:$i]:((X13 @ X14 @ X14))=>(X13 @ Z0 @ Z1)))))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.12/0.40 thf(c_0_4, negated_conjecture, (![X15:$i > $i > $o]:((![X16:$i]:((X15 @ X16 @ X16))=>(X15 @ esk1_0 @ esk2_0)))<~>((esk1_0)=(esk2_0))), inference(neg_ext,[status(thm)],[c_0_3])).
% 0.12/0.40 thf(c_0_5, negated_conjecture, ![X5:$i > $i > $o]:((((esk1_0)=(esk2_0))|(X5 @ esk1_0 @ esk2_0)|~((X5 @ (esk3_1 @ X5) @ (esk3_1 @ X5))))), inference(dynamic_cnf,[status(thm)],[c_0_4])).
% 0.12/0.40 thf(c_0_6, negated_conjecture, (((esk1_0)!=(esk2_0))|~((epred1_0 @ esk1_0 @ esk2_0))), inference(dynamic_cnf,[status(thm)],[c_0_4])).
% 0.12/0.40 thf(c_0_7, negated_conjecture, ((esk1_0)=(esk2_0)), inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]), c_0_5])).
% 0.12/0.40 thf(c_0_8, negated_conjecture, ![X1:$i]:(((epred1_0 @ X1 @ X1)|((esk1_0)!=(esk2_0)))), inference(dynamic_cnf,[status(thm)],[c_0_4])).
% 0.12/0.40 thf(c_0_9, negated_conjecture, ~((epred1_0 @ esk2_0 @ esk2_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6, c_0_7]), c_0_7])])).
% 0.12/0.40 thf(c_0_10, negated_conjecture, ![X1:$i]:((epred1_0 @ X1 @ X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8, c_0_7])])).
% 0.12/0.40 thf(c_0_11, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9, c_0_10])]), ['proof']).
% 0.12/0.40 # SZS output end CNFRefutation
% 0.12/0.40 # Parsed axioms : 1
% 0.12/0.40 # Removed by relevancy pruning/SinE : 0
% 0.12/0.40 # Initial clauses : 1
% 0.12/0.40 # Removed in clause preprocessing : 0
% 0.12/0.40 # Initial clauses in saturation : 1
% 0.12/0.40 # Processed clauses : 11
% 0.12/0.40 # ...of these trivial : 1
% 0.12/0.40 # ...subsumed : 0
% 0.12/0.40 # ...remaining for further processing : 10
% 0.12/0.40 # Other redundant clauses eliminated : 0
% 0.12/0.40 # Clauses deleted for lack of memory : 0
% 0.12/0.40 # Backward-subsumed : 0
% 0.12/0.40 # Backward-rewritten : 5
% 0.12/0.40 # Generated clauses : 15
% 0.12/0.40 # ...of the previous two non-redundant : 13
% 0.12/0.40 # ...aggressively subsumed : 0
% 0.12/0.40 # Contextual simplify-reflections : 0
% 0.12/0.40 # Paramodulations : 1
% 0.12/0.40 # Factorizations : 0
% 0.12/0.40 # NegExts : 3
% 0.12/0.40 # Equation resolutions : 0
% 0.12/0.40 # Disequality decompositions : 0
% 0.12/0.40 # Total rewrite steps : 8
% 0.12/0.40 # ...of those cached : 6
% 0.12/0.40 # Propositional unsat checks : 0
% 0.12/0.40 # Propositional check models : 0
% 0.12/0.40 # Propositional check unsatisfiable : 0
% 0.12/0.40 # Propositional clauses : 0
% 0.12/0.40 # Propositional clauses after purity: 0
% 0.12/0.40 # Propositional unsat core size : 0
% 0.12/0.40 # Propositional preprocessing time : 0.000
% 0.12/0.40 # Propositional encoding time : 0.000
% 0.12/0.40 # Propositional solver time : 0.000
% 0.12/0.40 # Success case prop preproc time : 0.000
% 0.12/0.40 # Success case prop encoding time : 0.000
% 0.12/0.40 # Success case prop solver time : 0.000
% 0.12/0.40 # Current number of processed clauses : 3
% 0.12/0.40 # Positive orientable unit clauses : 2
% 0.12/0.40 # Positive unorientable unit clauses: 0
% 0.12/0.40 # Negative unit clauses : 1
% 0.12/0.40 # Non-unit-clauses : 0
% 0.12/0.40 # Current number of unprocessed clauses: 4
% 0.12/0.40 # ...number of literals in the above : 6
% 0.12/0.40 # Current number of archived formulas : 0
% 0.12/0.40 # Current number of archived clauses : 7
% 0.12/0.40 # Clause-clause subsumption calls (NU) : 0
% 0.12/0.40 # Rec. Clause-clause subsumption calls : 0
% 0.12/0.40 # Non-unit clause-clause subsumptions : 0
% 0.12/0.40 # Unit Clause-clause subsumption calls : 2
% 0.12/0.40 # Rewrite failures with RHS unbound : 0
% 0.12/0.40 # BW rewrite match attempts : 2
% 0.12/0.40 # BW rewrite match successes : 2
% 0.12/0.40 # Condensation attempts : 0
% 0.12/0.40 # Condensation successes : 0
% 0.12/0.40 # Termbank termtop insertions : 567
% 0.12/0.40 # Search garbage collected termcells : 25
% 0.12/0.40
% 0.12/0.40 # -------------------------------------------------
% 0.12/0.40 # User time : 0.004 s
% 0.12/0.40 # System time : 0.004 s
% 0.12/0.40 # Total time : 0.007 s
% 0.12/0.40 # Maximum resident set size: 1708 pages
% 0.12/0.40
% 0.12/0.40 # -------------------------------------------------
% 0.12/0.40 # User time : 0.011 s
% 0.12/0.40 # System time : 0.007 s
% 0.12/0.40 # Total time : 0.018 s
% 0.12/0.40 # Maximum resident set size: 1704 pages
% 0.12/0.40 % E---3.1 exiting
% 0.12/0.40 % E exiting
%------------------------------------------------------------------------------