%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SET027+1 : TPTP v8.1.2. Bugfixed v5.4.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n002.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 15:23:15 EDT 2023 % Result : Theorem 19.25s 3.53s % Output : Proof 29.97s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.11 % Problem : SET027+1 : TPTP v8.1.2. Bugfixed v5.4.0. % 0.06/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.11/0.33 % Computer : n002.cluster.edu % 0.11/0.33 % Model : x86_64 x86_64 % 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.33 % Memory : 8042.1875MB % 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.33 % CPULimit : 300 % 0.11/0.33 % WCLimit : 300 % 0.11/0.33 % DateTime : Sat Aug 26 14:00:03 EDT 2023 % 0.11/0.33 % CPUTime : % 0.60/0.61 ________ _____ % 0.60/0.61 ___ __ \_________(_)________________________________ % 0.60/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.60/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.60/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.60/0.61 % 0.60/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.60/0.61 (2023-06-19) % 0.60/0.61 % 0.60/0.61 (c) Philipp Rümmer, 2009-2023 % 0.60/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.60/0.61 Amanda Stjerna. % 0.60/0.61 Free software under BSD-3-Clause. % 0.60/0.61 % 0.60/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.60/0.61 % 0.60/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.60/0.63 Running up to 7 provers in parallel. % 0.60/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.60/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.60/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.60/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.60/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.60/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 0.60/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 3.74/1.30 Prover 4: Preprocessing ... % 3.74/1.31 Prover 1: Preprocessing ... % 3.74/1.36 Prover 2: Preprocessing ... % 3.74/1.36 Prover 3: Preprocessing ... % 3.74/1.36 Prover 0: Preprocessing ... % 3.74/1.36 Prover 5: Preprocessing ... % 3.74/1.38 Prover 6: Preprocessing ... % 11.06/2.37 Prover 1: Warning: ignoring some quantifiers % 11.83/2.44 Prover 4: Warning: ignoring some quantifiers % 11.83/2.45 Prover 5: Proving ... % 11.83/2.45 Prover 6: Proving ... % 11.83/2.47 Prover 1: Constructing countermodel ... % 11.83/2.48 Prover 3: Warning: ignoring some quantifiers % 12.51/2.52 Prover 3: Constructing countermodel ... % 12.51/2.58 Prover 4: Constructing countermodel ... % 13.20/2.60 Prover 2: Proving ... % 13.20/2.67 Prover 0: Proving ... % 19.25/3.52 Prover 0: proved (2883ms) % 19.25/3.52 % 19.25/3.53 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 19.25/3.53 % 19.25/3.53 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 19.25/3.53 Prover 5: stopped % 19.25/3.53 Prover 6: stopped % 19.25/3.53 Prover 2: stopped % 19.25/3.53 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 19.25/3.53 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 19.25/3.54 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 19.25/3.56 Prover 3: stopped % 19.25/3.57 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 20.65/3.67 Prover 10: Preprocessing ... % 20.65/3.68 Prover 8: Preprocessing ... % 20.65/3.68 Prover 7: Preprocessing ... % 20.65/3.70 Prover 11: Preprocessing ... % 21.44/3.73 Prover 13: Preprocessing ... % 23.80/4.08 Prover 10: Warning: ignoring some quantifiers % 24.59/4.12 Prover 10: Constructing countermodel ... % 24.59/4.16 Prover 7: Warning: ignoring some quantifiers % 24.59/4.18 Prover 8: Warning: ignoring some quantifiers % 25.35/4.21 Prover 8: Constructing countermodel ... % 25.35/4.22 Prover 7: Constructing countermodel ... % 25.35/4.23 Prover 13: Warning: ignoring some quantifiers % 25.35/4.26 Prover 13: Constructing countermodel ... % 25.35/4.27 Prover 11: Warning: ignoring some quantifiers % 25.35/4.30 Prover 11: Constructing countermodel ... % 28.23/4.64 Prover 10: gave up % 28.23/4.64 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 28.59/4.69 Prover 4: Found proof (size 22) % 28.59/4.69 Prover 4: proved (4050ms) % 28.59/4.69 Prover 11: stopped % 28.59/4.69 Prover 13: stopped % 28.59/4.69 Prover 7: stopped % 28.59/4.69 Prover 1: stopped % 28.59/4.69 Prover 8: stopped % 28.59/4.70 Prover 16: Preprocessing ... % 29.21/4.78 Prover 16: stopped % 29.21/4.78 % 29.21/4.78 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 29.21/4.78 % 29.21/4.79 % SZS output start Proof for theBenchmark % 29.21/4.79 Assumptions after simplification: % 29.21/4.79 --------------------------------- % 29.21/4.79 % 29.21/4.79 (subclass_defn) % 29.47/4.83 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ % 29.47/4.83 (subclass(v0, v1) = 0) | ~ (member(v2, v1) = v3) | ~ $i(v2) | ~ $i(v1) | % 29.47/4.83 ~ $i(v0) | ? [v4: int] : ( ~ (v4 = 0) & member(v2, v0) = v4)) & ! [v0: $i] % 29.47/4.83 : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (subclass(v0, v1) = v2) | ~ % 29.47/4.83 $i(v1) | ~ $i(v0) | ? [v3: $i] : ? [v4: int] : ( ~ (v4 = 0) & member(v3, % 29.47/4.84 v1) = v4 & member(v3, v0) = 0 & $i(v3))) & ! [v0: $i] : ! [v1: $i] : % 29.47/4.84 ! [v2: $i] : ( ~ (subclass(v0, v1) = 0) | ~ (member(v2, v0) = 0) | ~ $i(v2) % 29.47/4.84 | ~ $i(v1) | ~ $i(v0) | member(v2, v1) = 0) % 29.47/4.84 % 29.47/4.84 (transitivity) % 29.47/4.84 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: int] : ( ~ (v3 = 0) & % 29.47/4.84 subclass(v1, v2) = 0 & subclass(v0, v2) = v3 & subclass(v0, v1) = 0 & $i(v2) % 29.47/4.84 & $i(v1) & $i(v0)) % 29.47/4.84 % 29.47/4.84 (function-axioms) % 29.73/4.86 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0 % 29.73/4.86 | ~ (restrict(v4, v3, v2) = v1) | ~ (restrict(v4, v3, v2) = v0)) & ! [v0: % 29.73/4.86 $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (apply(v3, v2) % 29.73/4.86 = v1) | ~ (apply(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 29.73/4.86 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (disjoint(v3, % 29.73/4.86 v2) = v1) | ~ (disjoint(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! % 29.73/4.86 [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (compose(v3, v2) = v1) | ~ % 29.73/4.86 (compose(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: % 29.73/4.86 $i] : (v1 = v0 | ~ (image(v3, v2) = v1) | ~ (image(v3, v2) = v0)) & ! % 29.73/4.86 [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (union(v3, % 29.73/4.86 v2) = v1) | ~ (union(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! % 29.73/4.86 [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (intersection(v3, v2) = v1) | ~ % 29.73/4.86 (intersection(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! % 29.73/4.86 [v3: $i] : (v1 = v0 | ~ (cross_product(v3, v2) = v1) | ~ (cross_product(v3, % 29.73/4.87 v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 % 29.73/4.87 = v0 | ~ (ordered_pair(v3, v2) = v1) | ~ (ordered_pair(v3, v2) = v0)) & ! % 29.73/4.87 [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 29.73/4.87 (unordered_pair(v3, v2) = v1) | ~ (unordered_pair(v3, v2) = v0)) & ! [v0: % 29.73/4.87 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 29.73/4.87 : (v1 = v0 | ~ (subclass(v3, v2) = v1) | ~ (subclass(v3, v2) = v0)) & ! % 29.73/4.87 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 29.73/4.87 $i] : (v1 = v0 | ~ (member(v3, v2) = v1) | ~ (member(v3, v2) = v0)) & ! % 29.73/4.87 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 % 29.73/4.87 | ~ (function(v2) = v1) | ~ (function(v2) = v0)) & ! [v0: $i] : ! [v1: % 29.73/4.87 $i] : ! [v2: $i] : (v1 = v0 | ~ (power_class(v2) = v1) | ~ % 29.73/4.87 (power_class(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 % 29.73/4.87 | ~ (sum_class(v2) = v1) | ~ (sum_class(v2) = v0)) & ! [v0: % 29.73/4.87 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 29.73/4.87 ~ (inductive(v2) = v1) | ~ (inductive(v2) = v0)) & ! [v0: $i] : ! [v1: % 29.73/4.87 $i] : ! [v2: $i] : (v1 = v0 | ~ (range_of(v2) = v1) | ~ (range_of(v2) = % 29.73/4.87 v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ % 29.73/4.87 (inverse(v2) = v1) | ~ (inverse(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! % 29.73/4.87 [v2: $i] : (v1 = v0 | ~ (successor(v2) = v1) | ~ (successor(v2) = v0)) & ! % 29.73/4.87 [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (flip(v2) = v1) | ~ % 29.73/4.87 (flip(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ % 29.73/4.87 (rotate(v2) = v1) | ~ (rotate(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! % 29.73/4.87 [v2: $i] : (v1 = v0 | ~ (domain_of(v2) = v1) | ~ (domain_of(v2) = v0)) & ! % 29.73/4.87 [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (complement(v2) = v1) | % 29.73/4.87 ~ (complement(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = % 29.73/4.87 v0 | ~ (first(v2) = v1) | ~ (first(v2) = v0)) & ! [v0: $i] : ! [v1: $i] % 29.73/4.87 : ! [v2: $i] : (v1 = v0 | ~ (second(v2) = v1) | ~ (second(v2) = v0)) & ! % 29.73/4.87 [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (singleton(v2) = v1) | ~ % 29.73/4.87 (singleton(v2) = v0)) % 29.73/4.87 % 29.73/4.87 Further assumptions not needed in the proof: % 29.73/4.87 -------------------------------------------- % 29.73/4.87 apply_defn, choice, class_elements_are_sets, complement, compose_defn1, % 29.73/4.87 compose_defn2, cross_product, cross_product_defn, disjoint_defn, domain_of, % 29.73/4.87 element_relation, element_relation_defn, extensionality, first_second, flip, % 29.73/4.87 flip_defn, function_defn, identity_relation, image_defn, inductive_defn, % 29.73/4.87 infinity, intersection, inverse_defn, null_class_defn, ordered_pair_defn, % 29.73/4.87 power_class, power_class_defn, range_of_defn, regularity, replacement, % 29.73/4.87 restrict_defn, rotate, rotate_defn, singleton_set_defn, successor_defn, % 29.73/4.87 successor_relation_defn1, successor_relation_defn2, sum_class, sum_class_defn, % 29.73/4.87 union_defn, unordered_pair, unordered_pair_defn % 29.73/4.87 % 29.73/4.87 Those formulas are unsatisfiable: % 29.73/4.87 --------------------------------- % 29.73/4.87 % 29.73/4.87 Begin of proof % 29.73/4.87 | % 29.73/4.87 | ALPHA: (subclass_defn) implies: % 29.73/4.87 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (subclass(v0, v1) = 0) | % 29.73/4.87 | ~ (member(v2, v0) = 0) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 29.73/4.87 | member(v2, v1) = 0) % 29.73/4.88 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (subclass(v0, % 29.73/4.88 | v1) = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : ? [v4: int] : % 29.73/4.88 | ( ~ (v4 = 0) & member(v3, v1) = v4 & member(v3, v0) = 0 & $i(v3))) % 29.73/4.88 | (3) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ % 29.73/4.88 | (subclass(v0, v1) = 0) | ~ (member(v2, v1) = v3) | ~ $i(v2) | ~ % 29.73/4.88 | $i(v1) | ~ $i(v0) | ? [v4: int] : ( ~ (v4 = 0) & member(v2, v0) = % 29.73/4.88 | v4)) % 29.73/4.88 | % 29.73/4.88 | ALPHA: (function-axioms) implies: % 29.73/4.88 | (4) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 29.73/4.88 | ! [v3: $i] : (v1 = v0 | ~ (member(v3, v2) = v1) | ~ (member(v3, v2) % 29.73/4.88 | = v0)) % 29.73/4.88 | % 29.73/4.88 | DELTA: instantiating (transitivity) with fresh symbols all_47_0, all_47_1, % 29.73/4.88 | all_47_2, all_47_3 gives: % 29.73/4.88 | (5) ~ (all_47_0 = 0) & subclass(all_47_2, all_47_1) = 0 & % 29.73/4.88 | subclass(all_47_3, all_47_1) = all_47_0 & subclass(all_47_3, all_47_2) % 29.73/4.88 | = 0 & $i(all_47_1) & $i(all_47_2) & $i(all_47_3) % 29.73/4.88 | % 29.73/4.88 | ALPHA: (5) implies: % 29.73/4.88 | (6) ~ (all_47_0 = 0) % 29.73/4.88 | (7) $i(all_47_3) % 29.73/4.88 | (8) $i(all_47_2) % 29.73/4.88 | (9) $i(all_47_1) % 29.73/4.88 | (10) subclass(all_47_3, all_47_2) = 0 % 29.73/4.88 | (11) subclass(all_47_3, all_47_1) = all_47_0 % 29.73/4.88 | (12) subclass(all_47_2, all_47_1) = 0 % 29.73/4.88 | % 29.73/4.89 | GROUND_INST: instantiating (2) with all_47_3, all_47_1, all_47_0, simplifying % 29.73/4.89 | with (7), (9), (11) gives: % 29.73/4.89 | (13) all_47_0 = 0 | ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & member(v0, % 29.73/4.89 | all_47_1) = v1 & member(v0, all_47_3) = 0 & $i(v0)) % 29.73/4.89 | % 29.73/4.89 | BETA: splitting (13) gives: % 29.73/4.89 | % 29.73/4.89 | Case 1: % 29.73/4.89 | | % 29.73/4.89 | | (14) all_47_0 = 0 % 29.73/4.89 | | % 29.73/4.89 | | REDUCE: (6), (14) imply: % 29.73/4.89 | | (15) $false % 29.73/4.89 | | % 29.73/4.89 | | CLOSE: (15) is inconsistent. % 29.73/4.89 | | % 29.73/4.89 | Case 2: % 29.73/4.89 | | % 29.73/4.89 | | (16) ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & member(v0, all_47_1) = % 29.73/4.89 | | v1 & member(v0, all_47_3) = 0 & $i(v0)) % 29.73/4.89 | | % 29.73/4.89 | | DELTA: instantiating (16) with fresh symbols all_125_0, all_125_1 gives: % 29.73/4.89 | | (17) ~ (all_125_0 = 0) & member(all_125_1, all_47_1) = all_125_0 & % 29.73/4.89 | | member(all_125_1, all_47_3) = 0 & $i(all_125_1) % 29.73/4.89 | | % 29.73/4.89 | | ALPHA: (17) implies: % 29.73/4.89 | | (18) ~ (all_125_0 = 0) % 29.73/4.89 | | (19) $i(all_125_1) % 29.73/4.89 | | (20) member(all_125_1, all_47_3) = 0 % 29.73/4.89 | | (21) member(all_125_1, all_47_1) = all_125_0 % 29.73/4.89 | | % 29.73/4.89 | | GROUND_INST: instantiating (1) with all_47_3, all_47_2, all_125_1, % 29.73/4.89 | | simplifying with (7), (8), (10), (19), (20) gives: % 29.73/4.89 | | (22) member(all_125_1, all_47_2) = 0 % 29.73/4.89 | | % 29.73/4.90 | | GROUND_INST: instantiating (3) with all_47_2, all_47_1, all_125_1, % 29.73/4.90 | | all_125_0, simplifying with (8), (9), (12), (19), (21) gives: % 29.73/4.90 | | (23) all_125_0 = 0 | ? [v0: int] : ( ~ (v0 = 0) & member(all_125_1, % 29.73/4.90 | | all_47_2) = v0) % 29.73/4.90 | | % 29.73/4.90 | | BETA: splitting (23) gives: % 29.73/4.90 | | % 29.73/4.90 | | Case 1: % 29.73/4.90 | | | % 29.73/4.90 | | | (24) all_125_0 = 0 % 29.73/4.90 | | | % 29.73/4.90 | | | REDUCE: (18), (24) imply: % 29.73/4.90 | | | (25) $false % 29.73/4.90 | | | % 29.73/4.90 | | | CLOSE: (25) is inconsistent. % 29.73/4.90 | | | % 29.73/4.90 | | Case 2: % 29.73/4.90 | | | % 29.73/4.90 | | | (26) ? [v0: int] : ( ~ (v0 = 0) & member(all_125_1, all_47_2) = v0) % 29.73/4.90 | | | % 29.73/4.90 | | | DELTA: instantiating (26) with fresh symbol all_283_0 gives: % 29.97/4.90 | | | (27) ~ (all_283_0 = 0) & member(all_125_1, all_47_2) = all_283_0 % 29.97/4.90 | | | % 29.97/4.90 | | | ALPHA: (27) implies: % 29.97/4.90 | | | (28) ~ (all_283_0 = 0) % 29.97/4.90 | | | (29) member(all_125_1, all_47_2) = all_283_0 % 29.97/4.90 | | | % 29.97/4.90 | | | GROUND_INST: instantiating (4) with 0, all_283_0, all_47_2, all_125_1, % 29.97/4.90 | | | simplifying with (22), (29) gives: % 29.97/4.90 | | | (30) all_283_0 = 0 % 29.97/4.90 | | | % 29.97/4.90 | | | REDUCE: (28), (30) imply: % 29.97/4.90 | | | (31) $false % 29.97/4.90 | | | % 29.97/4.90 | | | CLOSE: (31) is inconsistent. % 29.97/4.90 | | | % 29.97/4.90 | | End of split % 29.97/4.90 | | % 29.97/4.90 | End of split % 29.97/4.90 | % 29.97/4.90 End of proof % 29.97/4.90 % SZS output end Proof for theBenchmark % 29.97/4.90 % 29.97/4.90 4289ms %------------------------------------------------------------------------------