TSTP Solution File: SWW470^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWW470^1 : TPTP v8.2.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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 06:42:50 EDT 2024
% Result : Theorem 0.16s 0.44s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SWW470^1 : TPTP v8.2.0. Released v5.3.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n013.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Sat May 18 19:44:37 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.16/0.43 Running higher-order theorem proving
% 0.16/0.43 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/benchmark/theBenchmark.p
% 0.16/0.44 # Version: 3.1.0-ho
% 0.16/0.44 # Preprocessing class: HSLSSMSSSSLCHSA.
% 0.16/0.44 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting sh2 with 1200s (4) cores
% 0.16/0.44 # Starting full_lambda_3 with 300s (1) cores
% 0.16/0.44 # Starting ehoh_best7_lambda with 300s (1) cores
% 0.16/0.44 # Starting post_as_ho9 with 300s (1) cores
% 0.16/0.44 # Starting almost_fo_4 with 300s (1) cores
% 0.16/0.44 # full_lambda_3 with pid 32257 completed with status 0
% 0.16/0.44 # Result found by full_lambda_3
% 0.16/0.44 # Preprocessing class: HSLSSMSSSSLCHSA.
% 0.16/0.44 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting sh2 with 1200s (4) cores
% 0.16/0.44 # Starting full_lambda_3 with 300s (1) cores
% 0.16/0.44 # SinE strategy is GSinE(CountTerms,hypos,1.5,,2,20000,1.0)
% 0.16/0.44 # Search class: HGUSM-FFMF33-DHSFFSBN
% 0.16/0.44 # partial match(3): HGUSM-FFMF32-SHSFMSBN
% 0.16/0.44 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44 # Starting new_ho_10 with 55s (1) cores
% 0.16/0.44 # new_ho_10 with pid 32261 completed with status 0
% 0.16/0.44 # Result found by new_ho_10
% 0.16/0.44 # Preprocessing class: HSLSSMSSSSLCHSA.
% 0.16/0.44 # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting sh2 with 1200s (4) cores
% 0.16/0.44 # Starting full_lambda_3 with 300s (1) cores
% 0.16/0.44 # SinE strategy is GSinE(CountTerms,hypos,1.5,,2,20000,1.0)
% 0.16/0.44 # Search class: HGUSM-FFMF33-DHSFFSBN
% 0.16/0.44 # partial match(3): HGUSM-FFMF32-SHSFMSBN
% 0.16/0.44 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44 # Starting new_ho_10 with 55s (1) cores
% 0.16/0.44 # Preprocessing time : 0.002 s
% 0.16/0.44 # Presaturation interreduction done
% 0.16/0.44
% 0.16/0.44 # Proof found!
% 0.16/0.44 # SZS status Theorem
% 0.16/0.44 # SZS output start CNFRefutation
% 0.16/0.44 thf(decl_sort1, type, com: $tType).
% 0.16/0.44 thf(decl_sort2, type, hoare_669141180iple_a: $tType).
% 0.16/0.44 thf(decl_sort3, type, x_a: $tType).
% 0.16/0.44 thf(decl_sort4, type, state: $tType).
% 0.16/0.44 thf(decl_32, type, hoare_2128652938rivs_a: (hoare_669141180iple_a > $o) > (hoare_669141180iple_a > $o) > $o).
% 0.16/0.44 thf(decl_33, type, hoare_1295064928iple_a: (x_a > state > $o) > com > (x_a > state > $o) > hoare_669141180iple_a).
% 0.16/0.44 thf(decl_34, type, bot_bo280939947le_a_o: hoare_669141180iple_a > $o).
% 0.16/0.44 thf(decl_37, type, insert175534902iple_a: hoare_669141180iple_a > (hoare_669141180iple_a > $o) > hoare_669141180iple_a > $o).
% 0.16/0.44 thf(decl_41, type, g: hoare_669141180iple_a > $o).
% 0.16/0.44 thf(decl_42, type, p: x_a > state > $o).
% 0.16/0.44 thf(decl_43, type, b: state > $o).
% 0.16/0.44 thf(decl_44, type, c: com).
% 0.16/0.44 thf(conj_0, conjecture, (hoare_2128652938rivs_a @ g @ (insert175534902iple_a @ (hoare_1295064928iple_a @ (^[X19:x_a, X20:state]:(~($true))) @ c @ (^[X19:x_a, X20:state]:(((p @ X19 @ X20)&~((b @ X20)))))) @ bot_bo280939947le_a_o)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_0)).
% 0.16/0.44 thf(fact_4_constant, axiom, ![X14:hoare_669141180iple_a > $o, X15:x_a > state > $o, X16:com, X17:x_a > state > $o, X18:$o]:((((X18)=>(hoare_2128652938rivs_a @ X14 @ (insert175534902iple_a @ (hoare_1295064928iple_a @ X15 @ X16 @ X17) @ bot_bo280939947le_a_o)))=>(hoare_2128652938rivs_a @ X14 @ (insert175534902iple_a @ (hoare_1295064928iple_a @ (^[X19:x_a, X20:state]:(((X15 @ X19 @ X20)&(X18)))) @ X16 @ X17) @ bot_bo280939947le_a_o)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_4_constant)).
% 0.16/0.44 thf(c_0_2, negated_conjecture, ~(hoare_2128652938rivs_a @ g @ (insert175534902iple_a @ (hoare_1295064928iple_a @ (^[Z0/* 19 */:x_a, Z1:state]:(~($true))) @ c @ (^[Z0/* 19 */:x_a, Z1:state]:(((p @ Z0 @ Z1)&~((b @ Z1)))))) @ bot_bo280939947le_a_o)), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])])).
% 0.16/0.44 thf(c_0_3, plain, ![X14:hoare_669141180iple_a > $o, X15:x_a > state > $o, X16:com, X17:x_a > state > $o, X18:$o]:((((X18)=>(hoare_2128652938rivs_a @ X14 @ (insert175534902iple_a @ (hoare_1295064928iple_a @ X15 @ X16 @ X17) @ bot_bo280939947le_a_o)))=>(hoare_2128652938rivs_a @ X14 @ (insert175534902iple_a @ (hoare_1295064928iple_a @ (^[Z0/* 19 */:x_a, Z1:state]:((X15 @ Z0 @ Z1&(X18)))) @ X16 @ X17) @ bot_bo280939947le_a_o)))), inference(fof_simplification,[status(thm)],[fact_4_constant])).
% 0.16/0.44 thf(c_0_4, negated_conjecture, ~(hoare_2128652938rivs_a @ g @ (insert175534902iple_a @ (hoare_1295064928iple_a @ (^[Z0/* 19 */:x_a, Z1:state]:(~($true))) @ c @ (^[Z0/* 19 */:x_a, Z1:state]:(((p @ Z0 @ Z1)&~((b @ Z1)))))) @ bot_bo280939947le_a_o)), inference(fof_nnf,[status(thm)],[c_0_2])).
% 0.16/0.44 thf(c_0_5, plain, ![X329:hoare_669141180iple_a > $o, X330:x_a > state > $o, X331:com, X332:x_a > state > $o, X333:$o]:((((X333)|(hoare_2128652938rivs_a @ X329 @ (insert175534902iple_a @ (hoare_1295064928iple_a @ (^[Z0/* 19 */:x_a, Z1:state]:((X330 @ Z0 @ Z1&(X333)))) @ X331 @ X332) @ bot_bo280939947le_a_o)))&(~(hoare_2128652938rivs_a @ X329 @ (insert175534902iple_a @ (hoare_1295064928iple_a @ X330 @ X331 @ X332) @ bot_bo280939947le_a_o))|(hoare_2128652938rivs_a @ X329 @ (insert175534902iple_a @ (hoare_1295064928iple_a @ (^[Z0/* 19 */:x_a, Z1:state]:((X330 @ Z0 @ Z1&(X333)))) @ X331 @ X332) @ bot_bo280939947le_a_o))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])).
% 0.16/0.44 thf(c_0_6, negated_conjecture, ~((hoare_2128652938rivs_a @ g @ (insert175534902iple_a @ (hoare_1295064928iple_a @ (^[Z0/* 19 */:x_a, Z1:state]:(~(($true)))) @ c @ (^[Z0/* 19 */:x_a, Z1:state]:(((p @ Z0 @ Z1)&~((b @ Z1)))))) @ bot_bo280939947le_a_o))), inference(split_conjunct,[status(thm)],[c_0_4])).
% 0.16/0.44 thf(c_0_7, plain, ![X3:com, X2:x_a > state > $o, X1:hoare_669141180iple_a > $o, X4:x_a > state > $o]:((hoare_2128652938rivs_a @ X1 @ (insert175534902iple_a @ (hoare_1295064928iple_a @ (^[Z0/* 19 */:x_a, Z1:state]:(((X2 @ Z0 @ Z1)&~($true)))) @ X3 @ X4) @ bot_bo280939947le_a_o))), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_5])])])).
% 0.16/0.44 thf(c_0_8, negated_conjecture, ~((hoare_2128652938rivs_a @ g @ (insert175534902iple_a @ (hoare_1295064928iple_a @ (^[Z0/* 19 */:x_a, Z1:state]:(~($true))) @ c @ (^[Z0/* 19 */:x_a, Z1:state]:(((p @ Z0 @ Z1)&~((b @ Z1)))))) @ bot_bo280939947le_a_o))), inference(cn,[status(thm)],[c_0_6])).
% 0.16/0.44 thf(c_0_9, plain, ![X3:com, X1:hoare_669141180iple_a > $o, X2:x_a > state > $o]:((hoare_2128652938rivs_a @ X1 @ (insert175534902iple_a @ (hoare_1295064928iple_a @ (^[Z0/* 19 */:x_a, Z1:state]:(~($true))) @ X3 @ X2) @ bot_bo280939947le_a_o))), inference(cn,[status(thm)],[c_0_7])).
% 0.16/0.44 thf(c_0_10, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8, c_0_9])]), ['proof']).
% 0.16/0.44 # SZS output end CNFRefutation
% 0.16/0.44 # Parsed axioms : 125
% 0.16/0.44 # Removed by relevancy pruning/SinE : 106
% 0.16/0.44 # Initial clauses : 37
% 0.16/0.44 # Removed in clause preprocessing : 2
% 0.16/0.44 # Initial clauses in saturation : 35
% 0.16/0.44 # Processed clauses : 24
% 0.16/0.44 # ...of these trivial : 0
% 0.16/0.44 # ...subsumed : 4
% 0.16/0.44 # ...remaining for further processing : 20
% 0.16/0.44 # Other redundant clauses eliminated : 3
% 0.16/0.44 # Clauses deleted for lack of memory : 0
% 0.16/0.44 # Backward-subsumed : 0
% 0.16/0.44 # Backward-rewritten : 1
% 0.16/0.44 # Generated clauses : 2
% 0.16/0.44 # ...of the previous two non-redundant : 2
% 0.16/0.44 # ...aggressively subsumed : 0
% 0.16/0.44 # Contextual simplify-reflections : 0
% 0.16/0.44 # Paramodulations : 0
% 0.16/0.44 # Factorizations : 0
% 0.16/0.44 # NegExts : 0
% 0.16/0.44 # Equation resolutions : 3
% 0.16/0.44 # Disequality decompositions : 0
% 0.16/0.44 # Total rewrite steps : 1
% 0.16/0.44 # ...of those cached : 0
% 0.16/0.44 # Propositional unsat checks : 0
% 0.16/0.44 # Propositional check models : 0
% 0.16/0.44 # Propositional check unsatisfiable : 0
% 0.16/0.44 # Propositional clauses : 0
% 0.16/0.44 # Propositional clauses after purity: 0
% 0.16/0.44 # Propositional unsat core size : 0
% 0.16/0.44 # Propositional preprocessing time : 0.000
% 0.16/0.44 # Propositional encoding time : 0.000
% 0.16/0.44 # Propositional solver time : 0.000
% 0.16/0.44 # Success case prop preproc time : 0.000
% 0.16/0.44 # Success case prop encoding time : 0.000
% 0.16/0.44 # Success case prop solver time : 0.000
% 0.16/0.44 # Current number of processed clauses : 17
% 0.16/0.44 # Positive orientable unit clauses : 5
% 0.16/0.44 # Positive unorientable unit clauses: 1
% 0.16/0.44 # Negative unit clauses : 1
% 0.16/0.44 # Non-unit-clauses : 10
% 0.16/0.44 # Current number of unprocessed clauses: 13
% 0.16/0.44 # ...number of literals in the above : 37
% 0.16/0.44 # Current number of archived formulas : 0
% 0.16/0.44 # Current number of archived clauses : 1
% 0.16/0.44 # Clause-clause subsumption calls (NU) : 36
% 0.16/0.44 # Rec. Clause-clause subsumption calls : 36
% 0.16/0.44 # Non-unit clause-clause subsumptions : 2
% 0.16/0.44 # Unit Clause-clause subsumption calls : 2
% 0.16/0.44 # Rewrite failures with RHS unbound : 0
% 0.16/0.44 # BW rewrite match attempts : 9
% 0.16/0.44 # BW rewrite match successes : 3
% 0.16/0.44 # Condensation attempts : 24
% 0.16/0.44 # Condensation successes : 0
% 0.16/0.44 # Termbank termtop insertions : 4856
% 0.16/0.44 # Search garbage collected termcells : 1898
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.005 s
% 0.16/0.44 # System time : 0.003 s
% 0.16/0.44 # Total time : 0.008 s
% 0.16/0.44 # Maximum resident set size: 2304 pages
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.010 s
% 0.16/0.44 # System time : 0.005 s
% 0.16/0.44 # Total time : 0.015 s
% 0.16/0.44 # Maximum resident set size: 2040 pages
% 0.16/0.44 % E---3.1 exiting
% 0.16/0.44 % E exiting
%------------------------------------------------------------------------------