TSTP Solution File: SEV428^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEV428^1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:22 EDT 2024
% Result : Theorem 0.21s 0.49s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEV428^1 : TPTP v8.2.0. Released v5.2.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n020.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:38:23 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.21/0.48 Running higher-order theorem proving
% 0.21/0.48 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.21/0.49 # Version: 3.1.0-ho
% 0.21/0.49 # partial match(1): HSSSSMSSSLSNHHA
% 0.21/0.49 # Preprocessing class: HSSSSMSSSLSCHHA.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.49 # Starting sh3l with 300s (1) cores
% 0.21/0.49 # Starting lpo6_lambda_fix with 300s (1) cores
% 0.21/0.49 # Starting full_lambda_8 with 300s (1) cores
% 0.21/0.49 # new_ho_10_cnf2 with pid 15860 completed with status 0
% 0.21/0.49 # Result found by new_ho_10_cnf2
% 0.21/0.49 # partial match(1): HSSSSMSSSLSNHHA
% 0.21/0.49 # Preprocessing class: HSSSSMSSSLSCHHA.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.49 # No SInE strategy applied
% 0.21/0.49 # Search class: HHHNF-FFSF11-SHHFMMBC
% 0.21/0.49 # partial match(2): HHHNF-FFSF11-SHSSMMBC
% 0.21/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.49 # Starting new_ho_10 with 675s (1) cores
% 0.21/0.49 # Starting new_ho_10_cnf2 with 151s (1) cores
% 0.21/0.49 # Starting new_bool_1 with 169s (1) cores
% 0.21/0.49 # Starting new_bool_2 with 169s (1) cores
% 0.21/0.49 # Starting new_bool_9 with 169s (1) cores
% 0.21/0.49 # new_ho_10 with pid 15865 completed with status 0
% 0.21/0.49 # Result found by new_ho_10
% 0.21/0.49 # partial match(1): HSSSSMSSSLSNHHA
% 0.21/0.49 # Preprocessing class: HSSSSMSSSLSCHHA.
% 0.21/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 # Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.49 # No SInE strategy applied
% 0.21/0.49 # Search class: HHHNF-FFSF11-SHHFMMBC
% 0.21/0.49 # partial match(2): HHHNF-FFSF11-SHSSMMBC
% 0.21/0.49 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.49 # Starting new_ho_10 with 675s (1) cores
% 0.21/0.49 # Preprocessing time : 0.001 s
% 0.21/0.49 # Presaturation interreduction done
% 0.21/0.49
% 0.21/0.49 # Proof found!
% 0.21/0.49 # SZS status Theorem
% 0.21/0.49 # SZS output start CNFRefutation
% 0.21/0.49 thf(decl_22, type, eps: ($i > $o) > $i).
% 0.21/0.49 thf(decl_23, type, epsio: (($i > $o) > $o) > $i > $o).
% 0.21/0.49 thf(decl_24, type, setunion: (($i > $o) > $o) > $i > $o).
% 0.21/0.49 thf(decl_25, type, choosenonempty: (($i > $o) > $o) > $i > $o).
% 0.21/0.49 thf(decl_26, type, c: ($i > $o) > $o).
% 0.21/0.49 thf(decl_27, type, a: $i).
% 0.21/0.49 thf(decl_28, type, epred1_0: $i > $o).
% 0.21/0.49 thf(decl_29, type, epred2_0: ($i > $o) > $o).
% 0.21/0.49 thf(setuniond, axiom, ((setunion)=(^[X5:($i > $o) > $o, X2:$i]:(?[X6:$i > $o]:(((X5 @ X6)&(X6 @ X2)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', setuniond)).
% 0.21/0.49 thf(choosenonemptyd, axiom, ((choosenonempty)=(^[X5:($i > $o) > $o]:(epsio @ (^[X6:$i > $o]:(((X5 @ X6)&(X6 @ (eps @ X6)))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', choosenonemptyd)).
% 0.21/0.49 thf(ca, axiom, (setunion @ c @ a), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', ca)).
% 0.21/0.49 thf(conj, conjecture, ((c @ (choosenonempty @ c))&?[X2:$i]:((choosenonempty @ c @ X2))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj)).
% 0.21/0.49 thf(choiceax, axiom, ![X1:$i > $o]:((?[X2:$i]:((X1 @ X2))=>(X1 @ (eps @ X1)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', choiceax)).
% 0.21/0.49 thf(choiceaxio, axiom, ![X3:($i > $o) > $o]:((?[X4:$i > $o]:((X3 @ X4))=>(X3 @ (epsio @ X3)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', choiceaxio)).
% 0.21/0.49 thf(c_0_6, plain, ((setunion)=(^[Z0/* 19 */:($i > $o) > $o, Z1:$i]:(?[X6:$i > $o]:(((Z0 @ X6)&(X6 @ Z1)))))), inference(fof_simplification,[status(thm)],[setuniond])).
% 0.21/0.49 thf(c_0_7, plain, ((choosenonempty)=(^[Z0/* 23 */:($i > $o) > $o]:(epsio @ (^[Z1/* 8 */:$i > $o]:(((Z0 @ Z1)&(Z1 @ (eps @ Z1)))))))), inference(fof_simplification,[status(thm)],[choosenonemptyd])).
% 0.21/0.49 thf(c_0_8, plain, ?[X12:$i > $o]:(((c @ X12)&(X12 @ a))), inference(apply_def,[status(thm)],[ca, c_0_6])).
% 0.21/0.49 thf(c_0_9, negated_conjecture, ~(((c @ (epsio @ (^[Z0/* 8 */:$i > $o]:(((c @ Z0)&Z0 @ (eps @ Z0))))))&?[X2:$i]:((epsio @ (^[Z0/* 8 */:$i > $o]:(((c @ Z0)&Z0 @ (eps @ Z0)))) @ X2)))), inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[conj]), c_0_7])).
% 0.21/0.49 thf(c_0_10, plain, ![X13:$i > $o, X14:$i]:((~(X13 @ X14)|(X13 @ (eps @ X13)))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[choiceax])])])])).
% 0.21/0.49 thf(c_0_11, plain, ((c @ epred1_0)&(epred1_0 @ a)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])).
% 0.21/0.49 thf(c_0_12, negated_conjecture, ![X18:$i]:((~(c @ (epsio @ (^[Z0/* 8 */:$i > $o]:(((c @ Z0)&Z0 @ (eps @ Z0))))))|~(epsio @ (^[Z0/* 8 */:$i > $o]:(((c @ Z0)&Z0 @ (eps @ Z0)))) @ X18))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])).
% 0.21/0.49 thf(c_0_13, plain, ![X19:$i > $o]:(((epred2_0 @ X19)<=>((c @ X19)&(X19 @ (eps @ X19))))), introduced(definition)).
% 0.21/0.49 thf(c_0_14, plain, ![X21:$i > $o]:(((((c @ X21)|~(epred2_0 @ X21))&((X21 @ (eps @ X21))|~(epred2_0 @ X21)))&(~(c @ X21)|~(X21 @ (eps @ X21))|(epred2_0 @ X21)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])])).
% 0.21/0.49 thf(c_0_15, plain, ![X1:$i > $o, X2:$i]:(((X1 @ (eps @ X1))|~((X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_10])).
% 0.21/0.49 thf(c_0_16, plain, (epred1_0 @ a), inference(split_conjunct,[status(thm)],[c_0_11])).
% 0.21/0.49 thf(c_0_17, negated_conjecture, ![X2:$i]:((~((((c @ (epsio @ epred2_0)))=(($true))))|~((((epsio @ epred2_0 @ X2))=(($true)))))), inference(lift_lambdas,[status(thm)],[inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_12]), c_0_13]), c_0_13])).
% 0.21/0.49 thf(c_0_18, plain, ![X15:($i > $o) > $o, X16:$i > $o]:((~(X15 @ X16)|(X15 @ (epsio @ X15)))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[choiceaxio])])])])).
% 0.21/0.49 thf(c_0_19, plain, ![X1:$i > $o]:(((epred2_0 @ X1)|~((c @ X1))|~((X1 @ (eps @ X1))))), inference(split_conjunct,[status(thm)],[c_0_14])).
% 0.21/0.49 thf(c_0_20, plain, (epred1_0 @ (eps @ epred1_0)), inference(spm,[status(thm)],[c_0_15, c_0_16])).
% 0.21/0.49 thf(c_0_21, plain, (c @ epred1_0), inference(split_conjunct,[status(thm)],[c_0_11])).
% 0.21/0.49 thf(c_0_22, negated_conjecture, ![X2:$i]:((~((c @ (epsio @ epred2_0)))|~((epsio @ epred2_0 @ X2)))), inference(cn,[status(thm)],[c_0_17])).
% 0.21/0.49 thf(c_0_23, plain, ![X1:$i > $o]:(((X1 @ (eps @ X1))|~((epred2_0 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_14])).
% 0.21/0.49 thf(c_0_24, plain, ![X1:$i > $o]:(((c @ X1)|~((epred2_0 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_14])).
% 0.21/0.49 thf(c_0_25, plain, ![X3:($i > $o) > $o, X1:$i > $o]:(((X3 @ (epsio @ X3))|~((X3 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_18])).
% 0.21/0.49 thf(c_0_26, plain, (epred2_0 @ epred1_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_20]), c_0_21])])).
% 0.21/0.49 thf(c_0_27, negated_conjecture, ~((epred2_0 @ (epsio @ epred2_0))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_23]), c_0_24])).
% 0.21/0.49 thf(c_0_28, plain, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_26]), c_0_27]), ['proof']).
% 0.21/0.49 # SZS output end CNFRefutation
% 0.21/0.49 # Parsed axioms : 12
% 0.21/0.49 # Removed by relevancy pruning/SinE : 0
% 0.21/0.49 # Initial clauses : 14
% 0.21/0.49 # Removed in clause preprocessing : 6
% 0.21/0.49 # Initial clauses in saturation : 8
% 0.21/0.49 # Processed clauses : 22
% 0.21/0.49 # ...of these trivial : 1
% 0.21/0.49 # ...subsumed : 1
% 0.21/0.49 # ...remaining for further processing : 20
% 0.21/0.49 # Other redundant clauses eliminated : 0
% 0.21/0.49 # Clauses deleted for lack of memory : 0
% 0.21/0.49 # Backward-subsumed : 0
% 0.21/0.49 # Backward-rewritten : 0
% 0.21/0.49 # Generated clauses : 10
% 0.21/0.49 # ...of the previous two non-redundant : 6
% 0.21/0.49 # ...aggressively subsumed : 0
% 0.21/0.49 # Contextual simplify-reflections : 1
% 0.21/0.49 # Paramodulations : 10
% 0.21/0.49 # Factorizations : 0
% 0.21/0.49 # NegExts : 0
% 0.21/0.49 # Equation resolutions : 0
% 0.21/0.49 # Disequality decompositions : 0
% 0.21/0.49 # Total rewrite steps : 4
% 0.21/0.49 # ...of those cached : 1
% 0.21/0.49 # Propositional unsat checks : 0
% 0.21/0.49 # Propositional check models : 0
% 0.21/0.49 # Propositional check unsatisfiable : 0
% 0.21/0.49 # Propositional clauses : 0
% 0.21/0.49 # Propositional clauses after purity: 0
% 0.21/0.49 # Propositional unsat core size : 0
% 0.21/0.49 # Propositional preprocessing time : 0.000
% 0.21/0.49 # Propositional encoding time : 0.000
% 0.21/0.49 # Propositional solver time : 0.000
% 0.21/0.49 # Success case prop preproc time : 0.000
% 0.21/0.49 # Success case prop encoding time : 0.000
% 0.21/0.49 # Success case prop solver time : 0.000
% 0.21/0.49 # Current number of processed clauses : 12
% 0.21/0.49 # Positive orientable unit clauses : 5
% 0.21/0.49 # Positive unorientable unit clauses: 0
% 0.21/0.49 # Negative unit clauses : 1
% 0.21/0.49 # Non-unit-clauses : 6
% 0.21/0.49 # Current number of unprocessed clauses: 0
% 0.21/0.49 # ...number of literals in the above : 0
% 0.21/0.49 # Current number of archived formulas : 0
% 0.21/0.49 # Current number of archived clauses : 8
% 0.21/0.49 # Clause-clause subsumption calls (NU) : 6
% 0.21/0.49 # Rec. Clause-clause subsumption calls : 6
% 0.21/0.49 # Non-unit clause-clause subsumptions : 2
% 0.21/0.49 # Unit Clause-clause subsumption calls : 1
% 0.21/0.49 # Rewrite failures with RHS unbound : 0
% 0.21/0.49 # BW rewrite match attempts : 0
% 0.21/0.49 # BW rewrite match successes : 0
% 0.21/0.49 # Condensation attempts : 22
% 0.21/0.49 # Condensation successes : 0
% 0.21/0.49 # Termbank termtop insertions : 978
% 0.21/0.49 # Search garbage collected termcells : 169
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.004 s
% 0.21/0.49 # System time : 0.002 s
% 0.21/0.49 # Total time : 0.006 s
% 0.21/0.49 # Maximum resident set size: 1856 pages
% 0.21/0.49
% 0.21/0.49 # -------------------------------------------------
% 0.21/0.49 # User time : 0.010 s
% 0.21/0.49 # System time : 0.005 s
% 0.21/0.49 # Total time : 0.016 s
% 0.21/0.49 # Maximum resident set size: 1736 pages
% 0.21/0.49 % E---3.1 exiting
% 0.21/0.49 % E exiting
%------------------------------------------------------------------------------