TSTP Solution File: SEV116^5 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : SEV116^5 : TPTP v8.2.0. Bugfixed v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:53:34 EDT 2024
% Result : Theorem 0.22s 0.53s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEV116^5 : TPTP v8.2.0. Bugfixed v5.2.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n019.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 : Fri Jun 21 19:12:09 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.22/0.50 Running higher-order theorem proving
% 0.22/0.50 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/tmp/tmp.J65haNljTY/E---3.1_21016.p
% 0.22/0.53 # Version: 3.2.0-ho
% 0.22/0.53 # partial match(1): HSSSSMSSSLSNHHN
% 0.22/0.53 # Preprocessing class: HSSSSMSSSLSCHHN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.22/0.53 # Starting sh5l with 300s (1) cores
% 0.22/0.53 # Starting full_lambda_10 with 300s (1) cores
% 0.22/0.53 # Starting full_lambda_6 with 300s (1) cores
% 0.22/0.53 # full_lambda_10 with pid 21096 completed with status 0
% 0.22/0.53 # Result found by full_lambda_10
% 0.22/0.53 # partial match(1): HSSSSMSSSLSNHHN
% 0.22/0.53 # Preprocessing class: HSSSSMSSSLSCHHN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.22/0.53 # Starting sh5l with 300s (1) cores
% 0.22/0.53 # Starting full_lambda_10 with 300s (1) cores
% 0.22/0.53 # SinE strategy is GSinE(CountFormulas,hypos,5,,5,20000,3.0,true)
% 0.22/0.53 # Search class: HHUNF-FFSS00-DHHFMSBN
% 0.22/0.53 # partial match(3): HHUNF-FFSF00-SHSFMSBN
% 0.22/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.53 # Starting ho_unfolding_3 with 163s (1) cores
% 0.22/0.53 # ho_unfolding_3 with pid 21098 completed with status 9
% 0.22/0.53 # Starting full_lambda_10 with 31s (1) cores
% 0.22/0.53 # full_lambda_10 with pid 21111 completed with status 0
% 0.22/0.53 # Result found by full_lambda_10
% 0.22/0.53 # partial match(1): HSSSSMSSSLSNHHN
% 0.22/0.53 # Preprocessing class: HSSSSMSSSLSCHHN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.22/0.53 # Starting sh5l with 300s (1) cores
% 0.22/0.53 # Starting full_lambda_10 with 300s (1) cores
% 0.22/0.53 # SinE strategy is GSinE(CountFormulas,hypos,5,,5,20000,3.0,true)
% 0.22/0.53 # Search class: HHUNF-FFSS00-DHHFMSBN
% 0.22/0.53 # partial match(3): HHUNF-FFSF00-SHSFMSBN
% 0.22/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.53 # Starting ho_unfolding_3 with 163s (1) cores
% 0.22/0.53 # ho_unfolding_3 with pid 21098 completed with status 9
% 0.22/0.53 # Starting full_lambda_10 with 31s (1) cores
% 0.22/0.53 # Preprocessing time : 0.001 s
% 0.22/0.53 # Presaturation interreduction done
% 0.22/0.53
% 0.22/0.53 # Proof found!
% 0.22/0.53 # SZS status Theorem
% 0.22/0.53 # SZS output start CNFRefutation
% 0.22/0.53 thf(decl_22, type, cS: ($i > $i > $o) > $o).
% 0.22/0.53 thf(decl_23, type, x: $i).
% 0.22/0.53 thf(decl_24, type, y: $i).
% 0.22/0.53 thf(decl_25, type, cSTRANGE_HO_ABBR: (($i > $i > $o) > $o) > $i > $i > $o).
% 0.22/0.53 thf(decl_26, type, epred1_0: $i > $i > $o).
% 0.22/0.53 thf(decl_27, type, epred2_0: $i > $i > $o).
% 0.22/0.53 thf(cSTRANGE_HO_ABBR_def, axiom, ((cSTRANGE_HO_ABBR)=(^[X1:($i > $i > $o) > $o, X2:$i, X3:$i]:(![X4:$i > $i > $o]:((((X1 @ X4)&(X4 @ X2 @ X3))=>(X4 @ X3 @ X2)))))), file('/export/starexec/sandbox2/tmp/tmp.J65haNljTY/E---3.1_21016.p', cSTRANGE_HO_ABBR_def)).
% 0.22/0.53 thf(cSTRANGE_HO_EXAMPLE, conjecture, (((cS @ (cSTRANGE_HO_ABBR @ cS))&(cSTRANGE_HO_ABBR @ cS @ x @ y))=>(cSTRANGE_HO_ABBR @ cS @ y @ x)), file('/export/starexec/sandbox2/tmp/tmp.J65haNljTY/E---3.1_21016.p', cSTRANGE_HO_EXAMPLE)).
% 0.22/0.53 thf(c_0_2, plain, ((cSTRANGE_HO_ABBR)=(^[Z0/* 19 */:($i > $i > $o) > $o, Z1:$i, Z2:$i]:(![X4:$i > $i > $o]:((((Z0 @ X4)&(X4 @ Z1 @ Z2))=>(X4 @ Z2 @ Z1)))))), inference(fof_simplification,[status(thm)],[cSTRANGE_HO_ABBR_def])).
% 0.22/0.53 thf(c_0_3, negated_conjecture, ~((((cS @ (^[Z0/* 19 */:$i, Z1:$i]:(![X5:$i > $i > $o]:((((cS @ X5)&X5 @ Z0 @ Z1)=>X5 @ Z1 @ Z0)))))&![X6:$i > $i > $o]:((((cS @ X6)&(X6 @ x @ y))=>(X6 @ y @ x))))=>![X7:$i > $i > $o]:((((cS @ X7)&(X7 @ y @ x))=>(X7 @ x @ y))))), inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[cSTRANGE_HO_EXAMPLE]), c_0_2])).
% 0.22/0.53 thf(c_0_4, negated_conjecture, ![X8:$i > $i > $o]:((((cS @ (^[Z0/* 19 */:$i, Z1:$i]:(![X5:$i > $i > $o]:((((cS @ X5)&X5 @ Z0 @ Z1)=>X5 @ Z1 @ Z0)))))&(~(cS @ X8)|~(X8 @ x @ y)|(X8 @ y @ x)))&(((cS @ epred1_0)&(epred1_0 @ y @ x))&~(epred1_0 @ x @ y)))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])])).
% 0.22/0.53 thf(c_0_5, negated_conjecture, ![X4:$i > $i > $o]:(((X4 @ y @ x)|~((cS @ X4))|~((X4 @ x @ y)))), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.22/0.53 thf(c_0_6, negated_conjecture, (cS @ (^[Z0/* 19 */:$i, Z1:$i]:(![X14:$i > $i > $o]:((((cS @ X14)&(X14 @ Z0 @ Z1))=>(X14 @ Z1 @ Z0)))))), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.22/0.53 thf(c_0_7, negated_conjecture, (![X15:$i > $i > $o]:((((cS @ X15)&(X15 @ y @ x))=>(X15 @ x @ y)))|~(![X16:$i > $i > $o]:((((cS @ X16)&(X16 @ x @ y))=>(X16 @ y @ x))))), inference(spm,[status(thm)],[c_0_5, c_0_6])).
% 0.22/0.53 thf(c_0_8, negated_conjecture, ![X4:$i > $i > $o]:(((X4 @ x @ y)|(cS @ epred2_0)|~((X4 @ y @ x))|~((cS @ X4)))), inference(dynamic_cnf,[status(thm)],[c_0_7])).
% 0.22/0.53 thf(c_0_9, negated_conjecture, (cS @ epred1_0), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.22/0.53 thf(c_0_10, negated_conjecture, (epred1_0 @ y @ x), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.22/0.53 thf(c_0_11, negated_conjecture, ~((epred1_0 @ x @ y)), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.22/0.53 thf(c_0_12, negated_conjecture, ![X4:$i > $i > $o]:(((X4 @ x @ y)|~((epred2_0 @ y @ x))|~((X4 @ y @ x))|~((cS @ X4)))), inference(dynamic_cnf,[status(thm)],[c_0_7])).
% 0.22/0.53 thf(c_0_13, negated_conjecture, ![X4:$i > $i > $o]:(((epred2_0 @ x @ y)|(X4 @ x @ y)|~((X4 @ y @ x))|~((cS @ X4)))), inference(dynamic_cnf,[status(thm)],[c_0_7])).
% 0.22/0.53 thf(c_0_14, negated_conjecture, (cS @ epred2_0), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8, c_0_9]), c_0_10])]), c_0_11])).
% 0.22/0.53 thf(c_0_15, negated_conjecture, ~((epred2_0 @ y @ x)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_9]), c_0_10])]), c_0_11])).
% 0.22/0.53 thf(c_0_16, negated_conjecture, (epred2_0 @ x @ y), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_9]), c_0_10])]), c_0_11])).
% 0.22/0.53 thf(c_0_17, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_5, c_0_14]), c_0_15]), c_0_16])]), ['proof']).
% 0.22/0.53 # SZS output end CNFRefutation
% 0.22/0.53 # Parsed axioms : 6
% 0.22/0.53 # Removed by relevancy pruning/SinE : 4
% 0.22/0.53 # Initial clauses : 5
% 0.22/0.53 # Removed in clause preprocessing : 0
% 0.22/0.53 # Initial clauses in saturation : 5
% 0.22/0.53 # Processed clauses : 18
% 0.22/0.53 # ...of these trivial : 0
% 0.22/0.53 # ...subsumed : 0
% 0.22/0.53 # ...remaining for further processing : 17
% 0.22/0.53 # Other redundant clauses eliminated : 0
% 0.22/0.53 # Clauses deleted for lack of memory : 0
% 0.22/0.53 # Backward-subsumed : 1
% 0.22/0.53 # Backward-rewritten : 2
% 0.22/0.53 # Generated clauses : 13
% 0.22/0.53 # ...of the previous two non-redundant : 12
% 0.22/0.53 # ...aggressively subsumed : 0
% 0.22/0.53 # Contextual simplify-reflections : 0
% 0.22/0.53 # Paramodulations : 10
% 0.22/0.53 # Factorizations : 0
% 0.22/0.53 # NegExts : 0
% 0.22/0.53 # Equation resolutions : 0
% 0.22/0.53 # Disequality decompositions : 0
% 0.22/0.53 # Total rewrite steps : 7
% 0.22/0.53 # ...of those cached : 4
% 0.22/0.53 # Propositional unsat checks : 0
% 0.22/0.53 # Propositional check models : 0
% 0.22/0.53 # Propositional check unsatisfiable : 0
% 0.22/0.53 # Propositional clauses : 0
% 0.22/0.53 # Propositional clauses after purity: 0
% 0.22/0.53 # Propositional unsat core size : 0
% 0.22/0.53 # Propositional preprocessing time : 0.000
% 0.22/0.53 # Propositional encoding time : 0.000
% 0.22/0.53 # Propositional solver time : 0.000
% 0.22/0.53 # Success case prop preproc time : 0.000
% 0.22/0.53 # Success case prop encoding time : 0.000
% 0.22/0.53 # Success case prop solver time : 0.000
% 0.22/0.53 # Current number of processed clauses : 8
% 0.22/0.53 # Positive orientable unit clauses : 5
% 0.22/0.53 # Positive unorientable unit clauses: 0
% 0.22/0.53 # Negative unit clauses : 2
% 0.22/0.53 # Non-unit-clauses : 1
% 0.22/0.53 # Current number of unprocessed clauses: 1
% 0.22/0.53 # ...number of literals in the above : 2
% 0.22/0.53 # Current number of archived formulas : 0
% 0.22/0.53 # Current number of archived clauses : 9
% 0.22/0.53 # Clause-clause subsumption calls (NU) : 10
% 0.22/0.53 # Rec. Clause-clause subsumption calls : 5
% 0.22/0.53 # Non-unit clause-clause subsumptions : 0
% 0.22/0.53 # Unit Clause-clause subsumption calls : 3
% 0.22/0.53 # Rewrite failures with RHS unbound : 0
% 0.22/0.53 # BW rewrite match attempts : 2
% 0.22/0.53 # BW rewrite match successes : 2
% 0.22/0.53 # Condensation attempts : 18
% 0.22/0.53 # Condensation successes : 0
% 0.22/0.53 # Termbank termtop insertions : 1634
% 0.22/0.53 # Search garbage collected termcells : 167
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.022 s
% 0.22/0.53 # System time : 0.002 s
% 0.22/0.53 # Total time : 0.024 s
% 0.22/0.53 # Maximum resident set size: 1904 pages
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.023 s
% 0.22/0.53 # System time : 0.004 s
% 0.22/0.53 # Total time : 0.027 s
% 0.22/0.53 # Maximum resident set size: 1728 pages
% 0.22/0.53 % E---3.1 exiting
% 0.22/0.54 % E exiting
%------------------------------------------------------------------------------