TSTP Solution File: ITP214^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP214^1 : TPTP v8.2.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 May 20 22:16:57 EDT 2024
% Result : Theorem 5.39s 2.49s
% Output : CNFRefutation 5.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 17
% Syntax : Number of formulae : 23 ( 9 unt; 14 typ; 0 def)
% Number of atoms : 9 ( 2 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 75 ( 3 ~; 0 |; 0 &; 72 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Number of types : 6 ( 5 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 9 usr; 6 con; 0-3 aty)
% Number of variables : 0 ( 0 ^ 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
produc3658429121746597890et_nat: $tType ).
thf(decl_sort2,type,
assn: $tType ).
thf(decl_sort3,type,
heap_e7401611519738050253t_unit: $tType ).
thf(decl_sort4,type,
set_nat: $tType ).
thf(decl_sort5,type,
b: $tType ).
thf(decl_43,type,
rep_assn: assn > produc3658429121746597890et_nat > $o ).
thf(decl_578,type,
hoare_new_addrs: heap_e7401611519738050253t_unit > set_nat > heap_e7401611519738050253t_unit > set_nat ).
thf(decl_1252,type,
produc7507926704131184380et_nat: heap_e7401611519738050253t_unit > set_nat > produc3658429121746597890et_nat ).
thf(decl_1664,type,
q: b > assn ).
thf(decl_1666,type,
as: set_nat ).
thf(decl_1669,type,
h: heap_e7401611519738050253t_unit ).
thf(decl_1670,type,
h2: heap_e7401611519738050253t_unit ).
thf(decl_1671,type,
h3: heap_e7401611519738050253t_unit ).
thf(decl_1673,type,
rg: b ).
thf(conj_0,conjecture,
rep_assn @ ( q @ rg ) @ ( produc7507926704131184380et_nat @ h @ ( hoare_new_addrs @ h3 @ as @ h ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
thf(fact_3_POST__G,axiom,
rep_assn @ ( q @ rg ) @ ( produc7507926704131184380et_nat @ h @ ( hoare_new_addrs @ h2 @ ( hoare_new_addrs @ h3 @ as @ h2 ) @ h ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_3_POST__G) ).
thf(fact_0__092_060open_062new__addrs_Ah_H_A_Inew__addrs_Ah_Aas_Ah_H_J_Ah_H_H_A_061_Anew__addrs_Ah_Aas_Ah_H_H_092_060close_062,axiom,
( ( hoare_new_addrs @ h2 @ ( hoare_new_addrs @ h3 @ as @ h2 ) @ h )
= ( hoare_new_addrs @ h3 @ as @ h ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0__092_060open_062new__addrs_Ah_H_A_Inew__addrs_Ah_Aas_Ah_H_J_Ah_H_H_A_061_Anew__addrs_Ah_Aas_Ah_H_H_092_060close_062) ).
thf(c_0_3,negated_conjecture,
~ ( rep_assn @ ( q @ rg ) @ ( produc7507926704131184380et_nat @ h @ ( hoare_new_addrs @ h3 @ as @ h ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
thf(c_0_4,negated_conjecture,
~ ( rep_assn @ ( q @ rg ) @ ( produc7507926704131184380et_nat @ h @ ( hoare_new_addrs @ h3 @ as @ h ) ) ),
inference(fof_nnf,[status(thm)],[c_0_3]) ).
thf(c_0_5,plain,
rep_assn @ ( q @ rg ) @ ( produc7507926704131184380et_nat @ h @ ( hoare_new_addrs @ h2 @ ( hoare_new_addrs @ h3 @ as @ h2 ) @ h ) ),
inference(split_conjunct,[status(thm)],[fact_3_POST__G]) ).
thf(c_0_6,plain,
( ( hoare_new_addrs @ h2 @ ( hoare_new_addrs @ h3 @ as @ h2 ) @ h )
= ( hoare_new_addrs @ h3 @ as @ h ) ),
inference(split_conjunct,[status(thm)],[fact_0__092_060open_062new__addrs_Ah_H_A_Inew__addrs_Ah_Aas_Ah_H_J_Ah_H_H_A_061_Anew__addrs_Ah_Aas_Ah_H_H_092_060close_062]) ).
thf(c_0_7,negated_conjecture,
~ ( rep_assn @ ( q @ rg ) @ ( produc7507926704131184380et_nat @ h @ ( hoare_new_addrs @ h3 @ as @ h ) ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_8,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6]),c_0_7]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : ITP214^1 : TPTP v8.2.0. Released v8.1.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n006.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sat May 18 18:39:08 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.18/0.46 Running higher-order theorem proving
% 0.18/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
% 5.39/2.49 # Version: 3.1.0-ho
% 5.39/2.49 # partial match(2): HMLMSMSMSSLCHFA
% 5.39/2.49 # Preprocessing class: HMLLSMLMSSLCHFA.
% 5.39/2.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.39/2.49 # Starting new_ho_10 with 1500s (5) cores
% 5.39/2.49 # Starting sh5l with 300s (1) cores
% 5.39/2.49 # Starting new_bool_1 with 300s (1) cores
% 5.39/2.49 # Starting new_bool_2 with 300s (1) cores
% 5.39/2.49 # new_bool_1 with pid 26556 completed with status 0
% 5.39/2.49 # Result found by new_bool_1
% 5.39/2.49 # partial match(2): HMLMSMSMSSLCHFA
% 5.39/2.49 # Preprocessing class: HMLLSMLMSSLCHFA.
% 5.39/2.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.39/2.49 # Starting new_ho_10 with 1500s (5) cores
% 5.39/2.49 # Starting sh5l with 300s (1) cores
% 5.39/2.49 # Starting new_bool_1 with 300s (1) cores
% 5.39/2.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.39/2.49 # Search class: HGHSM-SMLM32-DHFFFSBN
% 5.39/2.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 5.39/2.49 # Starting new_ho_10 with 181s (1) cores
% 5.39/2.49 # new_ho_10 with pid 26558 completed with status 0
% 5.39/2.49 # Result found by new_ho_10
% 5.39/2.49 # partial match(2): HMLMSMSMSSLCHFA
% 5.39/2.49 # Preprocessing class: HMLLSMLMSSLCHFA.
% 5.39/2.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.39/2.49 # Starting new_ho_10 with 1500s (5) cores
% 5.39/2.49 # Starting sh5l with 300s (1) cores
% 5.39/2.49 # Starting new_bool_1 with 300s (1) cores
% 5.39/2.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.39/2.49 # Search class: HGHSM-SMLM32-DHFFFSBN
% 5.39/2.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 5.39/2.49 # Starting new_ho_10 with 181s (1) cores
% 5.39/2.49 # Preprocessing time : 0.090 s
% 5.39/2.49 # Presaturation interreduction done
% 5.39/2.49
% 5.39/2.49 # Proof found!
% 5.39/2.49 # SZS status Theorem
% 5.39/2.49 # SZS output start CNFRefutation
% See solution above
% 5.39/2.49 # Parsed axioms : 12112
% 5.39/2.49 # Removed by relevancy pruning/SinE : 10054
% 5.39/2.49 # Initial clauses : 3801
% 5.39/2.49 # Removed in clause preprocessing : 174
% 5.39/2.49 # Initial clauses in saturation : 3627
% 5.39/2.49 # Processed clauses : 183
% 5.39/2.49 # ...of these trivial : 19
% 5.39/2.49 # ...subsumed : 57
% 5.39/2.49 # ...remaining for further processing : 106
% 5.39/2.49 # Other redundant clauses eliminated : 43
% 5.39/2.49 # Clauses deleted for lack of memory : 0
% 5.39/2.49 # Backward-subsumed : 3
% 5.39/2.49 # Backward-rewritten : 6
% 5.39/2.49 # Generated clauses : 43
% 5.39/2.49 # ...of the previous two non-redundant : 44
% 5.39/2.50 # ...aggressively subsumed : 0
% 5.39/2.50 # Contextual simplify-reflections : 0
% 5.39/2.50 # Paramodulations : 0
% 5.39/2.50 # Factorizations : 0
% 5.39/2.50 # NegExts : 0
% 5.39/2.50 # Equation resolutions : 43
% 5.39/2.50 # Disequality decompositions : 0
% 5.39/2.50 # Total rewrite steps : 32
% 5.39/2.50 # ...of those cached : 12
% 5.39/2.50 # Propositional unsat checks : 0
% 5.39/2.50 # Propositional check models : 0
% 5.39/2.50 # Propositional check unsatisfiable : 0
% 5.39/2.50 # Propositional clauses : 0
% 5.39/2.50 # Propositional clauses after purity: 0
% 5.39/2.50 # Propositional unsat core size : 0
% 5.39/2.50 # Propositional preprocessing time : 0.000
% 5.39/2.50 # Propositional encoding time : 0.000
% 5.39/2.50 # Propositional solver time : 0.000
% 5.39/2.50 # Success case prop preproc time : 0.000
% 5.39/2.50 # Success case prop encoding time : 0.000
% 5.39/2.50 # Success case prop solver time : 0.000
% 5.39/2.50 # Current number of processed clauses : 54
% 5.39/2.50 # Positive orientable unit clauses : 27
% 5.39/2.50 # Positive unorientable unit clauses: 0
% 5.39/2.50 # Negative unit clauses : 25
% 5.39/2.50 # Non-unit-clauses : 2
% 5.39/2.50 # Current number of unprocessed clauses: 3488
% 5.39/2.50 # ...number of literals in the above : 10097
% 5.39/2.50 # Current number of archived formulas : 0
% 5.39/2.50 # Current number of archived clauses : 9
% 5.39/2.50 # Clause-clause subsumption calls (NU) : 81
% 5.39/2.50 # Rec. Clause-clause subsumption calls : 65
% 5.39/2.50 # Non-unit clause-clause subsumptions : 0
% 5.39/2.50 # Unit Clause-clause subsumption calls : 100
% 5.39/2.50 # Rewrite failures with RHS unbound : 0
% 5.39/2.50 # BW rewrite match attempts : 28
% 5.39/2.50 # BW rewrite match successes : 6
% 5.39/2.50 # Condensation attempts : 183
% 5.39/2.50 # Condensation successes : 0
% 5.39/2.50 # Termbank termtop insertions : 464329
% 5.39/2.50 # Search garbage collected termcells : 182193
% 5.39/2.50
% 5.39/2.50 # -------------------------------------------------
% 5.39/2.50 # User time : 0.968 s
% 5.39/2.50 # System time : 0.060 s
% 5.39/2.50 # Total time : 1.028 s
% 5.39/2.50 # Maximum resident set size: 43712 pages
% 5.39/2.50
% 5.39/2.50 # -------------------------------------------------
% 5.39/2.50 # User time : 1.926 s
% 5.39/2.50 # System time : 0.083 s
% 5.39/2.50 # Total time : 2.010 s
% 5.39/2.50 # Maximum resident set size: 30492 pages
% 5.39/2.50 % E---3.1 exiting
% 5.39/2.50 % E exiting
%------------------------------------------------------------------------------