%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : PUZ149_13 : TPTP v8.2.0. Released v8.2.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n021.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 : Thu Aug 31 13:23:18 EDT 2023 % Result : Theorem 5.32s 1.50s % Output : Proof 6.94s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : PUZ149_13 : TPTP v8.2.0. Released v8.2.0. % 0.00/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.36 % Computer : n021.cluster.edu % 0.14/0.36 % Model : x86_64 x86_64 % 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.36 % Memory : 8042.1875MB % 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.36 % CPULimit : 300 % 0.14/0.36 % WCLimit : 300 % 0.14/0.36 % DateTime : Sat Aug 26 22:37:42 EDT 2023 % 0.14/0.36 % CPUTime : % 0.21/0.62 ________ _____ % 0.21/0.62 ___ __ \_________(_)________________________________ % 0.21/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.62 % 0.21/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.62 (2023-06-19) % 0.21/0.62 % 0.21/0.62 (c) Philipp Rümmer, 2009-2023 % 0.21/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.62 Amanda Stjerna. % 0.21/0.62 Free software under BSD-3-Clause. % 0.21/0.62 % 0.21/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.62 % 0.21/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.21/0.63 Running up to 7 provers in parallel. % 0.21/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.62/1.04 Prover 1: Preprocessing ... % 2.62/1.05 Prover 4: Preprocessing ... % 2.83/1.07 Prover 0: Preprocessing ... % 2.83/1.07 Prover 6: Preprocessing ... % 2.83/1.07 Prover 5: Preprocessing ... % 2.83/1.07 Prover 3: Preprocessing ... % 2.83/1.07 Prover 2: Preprocessing ... % 3.61/1.20 Prover 5: Constructing countermodel ... % 3.61/1.21 Prover 2: Constructing countermodel ... % 4.12/1.24 Prover 6: Proving ... % 4.12/1.25 Prover 3: Constructing countermodel ... % 4.12/1.25 Prover 1: Constructing countermodel ... % 4.34/1.27 Prover 0: Proving ... % 4.34/1.28 Prover 4: Constructing countermodel ... % 5.32/1.50 Prover 3: proved (857ms) % 5.32/1.50 % 5.32/1.50 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.32/1.50 % 5.32/1.50 Prover 2: proved (859ms) % 5.32/1.50 % 5.32/1.50 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.32/1.50 % 5.32/1.50 Prover 5: stopped % 5.32/1.51 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.32/1.51 Prover 6: stopped % 5.32/1.51 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 5.32/1.51 Prover 0: stopped % 5.32/1.51 Prover 1: Found proof (size 34) % 5.32/1.51 Prover 1: proved (865ms) % 5.32/1.51 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 5.32/1.51 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 5.32/1.51 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 5.32/1.53 Prover 4: stopped % 6.14/1.54 Prover 7: Preprocessing ... % 6.14/1.55 Prover 13: Preprocessing ... % 6.14/1.55 Prover 11: Preprocessing ... % 6.14/1.56 Prover 8: Preprocessing ... % 6.14/1.56 Prover 10: Preprocessing ... % 6.44/1.58 Prover 11: stopped % 6.44/1.59 Prover 7: Constructing countermodel ... % 6.44/1.59 Prover 13: Constructing countermodel ... % 6.44/1.59 Prover 7: stopped % 6.44/1.59 Prover 10: Constructing countermodel ... % 6.44/1.59 Prover 13: stopped % 6.44/1.60 Prover 10: stopped % 6.44/1.62 Prover 8: Warning: ignoring some quantifiers % 6.44/1.62 Prover 8: Constructing countermodel ... % 6.44/1.63 Prover 8: stopped % 6.44/1.63 % 6.44/1.63 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.44/1.63 % 6.44/1.63 % SZS output start Proof for theBenchmark % 6.44/1.63 Assumptions after simplification: % 6.44/1.63 --------------------------------- % 6.44/1.63 % 6.44/1.63 (make_c_acid) % 6.82/1.66 $ki_index(#idx(make_c)) & $ki_world($ki_local_world) & ? [v0: $ki_world] : % 6.82/1.66 ($ki_accessible(#idx(make_c), $ki_local_world, v0) = 0 & acid(v0) = 0 & % 6.82/1.66 $ki_world(v0)) % 6.82/1.66 % 6.82/1.66 (pour_a_acid) % 6.82/1.66 $ki_index(#idx(pour_a)) & $ki_world($ki_local_world) & ! [v0: $ki_world] : ( % 6.82/1.66 ~ ($ki_accessible(#idx(pour_a), $ki_local_world, v0) = 0) | ~ $ki_world(v0) % 6.82/1.66 | ? [v1: int] : ( ~ (v1 = 0) & acid(v0) = v1)) % 6.82/1.66 % 6.82/1.66 (pour_ab_make_axiom_2) % 6.94/1.66 $ki_index(#idx(pour_a)) & $ki_index(#idx(pour_b)) & $ki_index(#idx(make_c)) & % 6.94/1.66 $ki_world($ki_local_world) & ( ? [v0: $ki_world] : % 6.94/1.66 ($ki_accessible(#idx(pour_a), $ki_local_world, v0) = 0 & $ki_world(v0) & ? % 6.94/1.66 [v1: $ki_world] : ($ki_accessible(#idx(pour_b), v0, v1) = 0 & acid(v1) = 0 % 6.94/1.66 & $ki_world(v1))) | ! [v0: $ki_world] : ( ~ % 6.94/1.66 ($ki_accessible(#idx(make_c), $ki_local_world, v0) = 0) | ~ $ki_world(v0) % 6.94/1.66 | ? [v1: int] : ( ~ (v1 = 0) & acid(v0) = v1))) % 6.94/1.66 % 6.94/1.67 (verify) % 6.94/1.67 $ki_index(#idx(pour_a)) & $ki_index(#idx(pour_b)) & $ki_world($ki_local_world) % 6.94/1.67 & ( ! [v0: $ki_world] : ( ~ ($ki_accessible(#idx(pour_a), $ki_local_world, v0) % 6.94/1.67 = 0) | ~ $ki_world(v0) | acid(v0) = 0) | ! [v0: $ki_world] : ( ~ % 6.94/1.67 ($ki_accessible(#idx(pour_a), $ki_local_world, v0) = 0) | ~ $ki_world(v0) % 6.94/1.67 | ! [v1: $ki_world] : ( ~ ($ki_accessible(#idx(pour_b), v0, v1) = 0) | ~ % 6.94/1.67 $ki_world(v1) | ? [v2: int] : ( ~ (v2 = 0) & acid(v1) = v2)))) % 6.94/1.67 % 6.94/1.67 (function-axioms) % 6.94/1.67 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $ki_world] : % 6.94/1.67 ! [v3: $ki_world] : ! [v4: $ki_index] : (v1 = v0 | ~ ($ki_accessible(v4, % 6.94/1.67 v3, v2) = v1) | ~ ($ki_accessible(v4, v3, v2) = v0)) & ! [v0: % 6.94/1.67 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $ki_world] : (v1 = % 6.94/1.67 v0 | ~ (acid(v2) = v1) | ~ (acid(v2) = v0)) % 6.94/1.67 % 6.94/1.67 Further assumptions not needed in the proof: % 6.94/1.67 -------------------------------------------- % 6.94/1.67 pour_ab_make_axiom_1, pour_ba_make_axiom_1, pour_ba_make_axiom_2 % 6.94/1.67 % 6.94/1.67 Those formulas are unsatisfiable: % 6.94/1.67 --------------------------------- % 6.94/1.67 % 6.94/1.67 Begin of proof % 6.94/1.67 | % 6.94/1.67 | ALPHA: (pour_ab_make_axiom_2) implies: % 6.94/1.67 | (1) ? [v0: $ki_world] : ($ki_accessible(#idx(pour_a), $ki_local_world, v0) % 6.94/1.67 | = 0 & $ki_world(v0) & ? [v1: $ki_world] : % 6.94/1.67 | ($ki_accessible(#idx(pour_b), v0, v1) = 0 & acid(v1) = 0 & % 6.94/1.67 | $ki_world(v1))) | ! [v0: $ki_world] : ( ~ % 6.94/1.67 | ($ki_accessible(#idx(make_c), $ki_local_world, v0) = 0) | ~ % 6.94/1.67 | $ki_world(v0) | ? [v1: int] : ( ~ (v1 = 0) & acid(v0) = v1)) % 6.94/1.67 | % 6.94/1.67 | ALPHA: (pour_a_acid) implies: % 6.94/1.68 | (2) ! [v0: $ki_world] : ( ~ ($ki_accessible(#idx(pour_a), $ki_local_world, % 6.94/1.68 | v0) = 0) | ~ $ki_world(v0) | ? [v1: int] : ( ~ (v1 = 0) & % 6.94/1.68 | acid(v0) = v1)) % 6.94/1.68 | % 6.94/1.68 | ALPHA: (make_c_acid) implies: % 6.94/1.68 | (3) ? [v0: $ki_world] : ($ki_accessible(#idx(make_c), $ki_local_world, v0) % 6.94/1.68 | = 0 & acid(v0) = 0 & $ki_world(v0)) % 6.94/1.68 | % 6.94/1.68 | ALPHA: (verify) implies: % 6.94/1.68 | (4) ! [v0: $ki_world] : ( ~ ($ki_accessible(#idx(pour_a), $ki_local_world, % 6.94/1.68 | v0) = 0) | ~ $ki_world(v0) | acid(v0) = 0) | ! [v0: $ki_world] % 6.94/1.68 | : ( ~ ($ki_accessible(#idx(pour_a), $ki_local_world, v0) = 0) | ~ % 6.94/1.68 | $ki_world(v0) | ! [v1: $ki_world] : ( ~ % 6.94/1.68 | ($ki_accessible(#idx(pour_b), v0, v1) = 0) | ~ $ki_world(v1) | ? % 6.94/1.68 | [v2: int] : ( ~ (v2 = 0) & acid(v1) = v2))) % 6.94/1.68 | % 6.94/1.68 | ALPHA: (function-axioms) implies: % 6.94/1.68 | (5) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 6.94/1.68 | $ki_world] : (v1 = v0 | ~ (acid(v2) = v1) | ~ (acid(v2) = v0)) % 6.94/1.68 | % 6.94/1.68 | DELTA: instantiating (3) with fresh symbol all_9_0 gives: % 6.94/1.68 | (6) $ki_accessible(#idx(make_c), $ki_local_world, all_9_0) = 0 & % 6.94/1.68 | acid(all_9_0) = 0 & $ki_world(all_9_0) % 6.94/1.68 | % 6.94/1.68 | ALPHA: (6) implies: % 6.94/1.68 | (7) $ki_world(all_9_0) % 6.94/1.68 | (8) acid(all_9_0) = 0 % 6.94/1.68 | (9) $ki_accessible(#idx(make_c), $ki_local_world, all_9_0) = 0 % 6.94/1.68 | % 6.94/1.68 | BETA: splitting (1) gives: % 6.94/1.68 | % 6.94/1.68 | Case 1: % 6.94/1.68 | | % 6.94/1.68 | | (10) ? [v0: $ki_world] : ($ki_accessible(#idx(pour_a), $ki_local_world, % 6.94/1.68 | | v0) = 0 & $ki_world(v0) & ? [v1: $ki_world] : % 6.94/1.68 | | ($ki_accessible(#idx(pour_b), v0, v1) = 0 & acid(v1) = 0 & % 6.94/1.68 | | $ki_world(v1))) % 6.94/1.68 | | % 6.94/1.68 | | DELTA: instantiating (10) with fresh symbol all_17_0 gives: % 6.94/1.69 | | (11) $ki_accessible(#idx(pour_a), $ki_local_world, all_17_0) = 0 & % 6.94/1.69 | | $ki_world(all_17_0) & ? [v0: $ki_world] : % 6.94/1.69 | | ($ki_accessible(#idx(pour_b), all_17_0, v0) = 0 & acid(v0) = 0 & % 6.94/1.69 | | $ki_world(v0)) % 6.94/1.69 | | % 6.94/1.69 | | ALPHA: (11) implies: % 6.94/1.69 | | (12) $ki_world(all_17_0) % 6.94/1.69 | | (13) $ki_accessible(#idx(pour_a), $ki_local_world, all_17_0) = 0 % 6.94/1.69 | | (14) ? [v0: $ki_world] : ($ki_accessible(#idx(pour_b), all_17_0, v0) = 0 % 6.94/1.69 | | & acid(v0) = 0 & $ki_world(v0)) % 6.94/1.69 | | % 6.94/1.69 | | DELTA: instantiating (14) with fresh symbol all_19_0 gives: % 6.94/1.69 | | (15) $ki_accessible(#idx(pour_b), all_17_0, all_19_0) = 0 & % 6.94/1.69 | | acid(all_19_0) = 0 & $ki_world(all_19_0) % 6.94/1.69 | | % 6.94/1.69 | | ALPHA: (15) implies: % 6.94/1.69 | | (16) $ki_world(all_19_0) % 6.94/1.69 | | (17) acid(all_19_0) = 0 % 6.94/1.69 | | (18) $ki_accessible(#idx(pour_b), all_17_0, all_19_0) = 0 % 6.94/1.69 | | % 6.94/1.69 | | GROUND_INST: instantiating (2) with all_17_0, simplifying with (12), (13) % 6.94/1.69 | | gives: % 6.94/1.69 | | (19) ? [v0: int] : ( ~ (v0 = 0) & acid(all_17_0) = v0) % 6.94/1.69 | | % 6.94/1.69 | | DELTA: instantiating (19) with fresh symbol all_26_0 gives: % 6.94/1.69 | | (20) ~ (all_26_0 = 0) & acid(all_17_0) = all_26_0 % 6.94/1.69 | | % 6.94/1.69 | | ALPHA: (20) implies: % 6.94/1.69 | | (21) ~ (all_26_0 = 0) % 6.94/1.69 | | (22) acid(all_17_0) = all_26_0 % 6.94/1.69 | | % 6.94/1.69 | | BETA: splitting (4) gives: % 6.94/1.69 | | % 6.94/1.69 | | Case 1: % 6.94/1.69 | | | % 6.94/1.69 | | | (23) ! [v0: $ki_world] : ( ~ ($ki_accessible(#idx(pour_a), % 6.94/1.69 | | | $ki_local_world, v0) = 0) | ~ $ki_world(v0) | acid(v0) = 0) % 6.94/1.69 | | | % 6.94/1.69 | | | GROUND_INST: instantiating (23) with all_17_0, simplifying with (12), (13) % 6.94/1.69 | | | gives: % 6.94/1.69 | | | (24) acid(all_17_0) = 0 % 6.94/1.69 | | | % 6.94/1.69 | | | GROUND_INST: instantiating (5) with all_26_0, 0, all_17_0, simplifying % 6.94/1.69 | | | with (22), (24) gives: % 6.94/1.69 | | | (25) all_26_0 = 0 % 6.94/1.69 | | | % 6.94/1.69 | | | REDUCE: (21), (25) imply: % 6.94/1.69 | | | (26) $false % 6.94/1.70 | | | % 6.94/1.70 | | | CLOSE: (26) is inconsistent. % 6.94/1.70 | | | % 6.94/1.70 | | Case 2: % 6.94/1.70 | | | % 6.94/1.70 | | | (27) ! [v0: $ki_world] : ( ~ ($ki_accessible(#idx(pour_a), % 6.94/1.70 | | | $ki_local_world, v0) = 0) | ~ $ki_world(v0) | ! [v1: % 6.94/1.70 | | | $ki_world] : ( ~ ($ki_accessible(#idx(pour_b), v0, v1) = 0) | % 6.94/1.70 | | | ~ $ki_world(v1) | ? [v2: int] : ( ~ (v2 = 0) & acid(v1) = % 6.94/1.70 | | | v2))) % 6.94/1.70 | | | % 6.94/1.70 | | | GROUND_INST: instantiating (27) with all_17_0, simplifying with (12), (13) % 6.94/1.70 | | | gives: % 6.94/1.70 | | | (28) ! [v0: $ki_world] : ( ~ ($ki_accessible(#idx(pour_b), all_17_0, % 6.94/1.70 | | | v0) = 0) | ~ $ki_world(v0) | ? [v1: int] : ( ~ (v1 = 0) & % 6.94/1.70 | | | acid(v0) = v1)) % 6.94/1.70 | | | % 6.94/1.70 | | | GROUND_INST: instantiating (28) with all_19_0, simplifying with (16), (18) % 6.94/1.70 | | | gives: % 6.94/1.70 | | | (29) ? [v0: int] : ( ~ (v0 = 0) & acid(all_19_0) = v0) % 6.94/1.70 | | | % 6.94/1.70 | | | DELTA: instantiating (29) with fresh symbol all_50_0 gives: % 6.94/1.70 | | | (30) ~ (all_50_0 = 0) & acid(all_19_0) = all_50_0 % 6.94/1.70 | | | % 6.94/1.70 | | | ALPHA: (30) implies: % 6.94/1.70 | | | (31) ~ (all_50_0 = 0) % 6.94/1.70 | | | (32) acid(all_19_0) = all_50_0 % 6.94/1.70 | | | % 6.94/1.70 | | | GROUND_INST: instantiating (5) with 0, all_50_0, all_19_0, simplifying % 6.94/1.70 | | | with (17), (32) gives: % 6.94/1.70 | | | (33) all_50_0 = 0 % 6.94/1.70 | | | % 6.94/1.70 | | | REDUCE: (31), (33) imply: % 6.94/1.70 | | | (34) $false % 6.94/1.70 | | | % 6.94/1.70 | | | CLOSE: (34) is inconsistent. % 6.94/1.70 | | | % 6.94/1.70 | | End of split % 6.94/1.70 | | % 6.94/1.70 | Case 2: % 6.94/1.70 | | % 6.94/1.70 | | (35) ! [v0: $ki_world] : ( ~ ($ki_accessible(#idx(make_c), % 6.94/1.70 | | $ki_local_world, v0) = 0) | ~ $ki_world(v0) | ? [v1: int] : % 6.94/1.70 | | ( ~ (v1 = 0) & acid(v0) = v1)) % 6.94/1.70 | | % 6.94/1.70 | | GROUND_INST: instantiating (35) with all_9_0, simplifying with (7), (9) % 6.94/1.70 | | gives: % 6.94/1.70 | | (36) ? [v0: int] : ( ~ (v0 = 0) & acid(all_9_0) = v0) % 6.94/1.70 | | % 6.94/1.70 | | DELTA: instantiating (36) with fresh symbol all_18_0 gives: % 6.94/1.70 | | (37) ~ (all_18_0 = 0) & acid(all_9_0) = all_18_0 % 6.94/1.70 | | % 6.94/1.70 | | ALPHA: (37) implies: % 6.94/1.70 | | (38) ~ (all_18_0 = 0) % 6.94/1.70 | | (39) acid(all_9_0) = all_18_0 % 6.94/1.70 | | % 6.94/1.70 | | GROUND_INST: instantiating (5) with 0, all_18_0, all_9_0, simplifying with % 6.94/1.70 | | (8), (39) gives: % 6.94/1.70 | | (40) all_18_0 = 0 % 6.94/1.70 | | % 6.94/1.70 | | REDUCE: (38), (40) imply: % 6.94/1.70 | | (41) $false % 6.94/1.70 | | % 6.94/1.70 | | CLOSE: (41) is inconsistent. % 6.94/1.70 | | % 6.94/1.70 | End of split % 6.94/1.70 | % 6.94/1.70 End of proof % 6.94/1.70 % SZS output end Proof for theBenchmark % 6.94/1.70 % 6.94/1.70 1085ms %------------------------------------------------------------------------------