%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SET589+3 : TPTP v8.1.2. Released v2.2.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n023.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:25:26 EDT 2023 % Result : Theorem 4.78s 1.37s % Output : Proof 6.23s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SET589+3 : TPTP v8.1.2. Released v2.2.0. % 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n023.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 : Sat Aug 26 12:35:56 EDT 2023 % 0.13/0.34 % CPUTime : % 0.63/0.61 ________ _____ % 0.63/0.61 ___ __ \_________(_)________________________________ % 0.63/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.63/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.63/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.63/0.61 % 0.63/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.63/0.61 (2023-06-19) % 0.63/0.61 % 0.63/0.61 (c) Philipp Rümmer, 2009-2023 % 0.63/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.63/0.61 Amanda Stjerna. % 0.63/0.61 Free software under BSD-3-Clause. % 0.63/0.61 % 0.63/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.63/0.61 % 0.63/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.68/0.62 Running up to 7 provers in parallel. % 0.73/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.73/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.73/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.73/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.73/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.73/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.73/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.03/0.96 Prover 1: Preprocessing ... % 2.03/0.96 Prover 4: Preprocessing ... % 2.03/1.00 Prover 6: Preprocessing ... % 2.03/1.00 Prover 3: Preprocessing ... % 2.03/1.00 Prover 0: Preprocessing ... % 2.03/1.00 Prover 2: Preprocessing ... % 2.03/1.01 Prover 5: Preprocessing ... % 3.62/1.20 Prover 6: Proving ... % 3.62/1.20 Prover 5: Proving ... % 3.81/1.20 Prover 3: Constructing countermodel ... % 3.81/1.20 Prover 0: Proving ... % 3.81/1.20 Prover 1: Constructing countermodel ... % 3.81/1.20 Prover 2: Proving ... % 3.81/1.20 Prover 4: Constructing countermodel ... % 4.78/1.37 Prover 0: proved (739ms) % 4.78/1.37 % 4.78/1.37 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.78/1.37 % 4.78/1.38 Prover 3: stopped % 4.78/1.38 Prover 6: stopped % 4.78/1.38 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 4.78/1.38 Prover 5: stopped % 4.78/1.38 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 4.78/1.38 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 4.78/1.38 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 4.78/1.38 Prover 2: stopped % 4.78/1.38 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 5.24/1.40 Prover 7: Preprocessing ... % 5.24/1.41 Prover 13: Preprocessing ... % 5.24/1.41 Prover 8: Preprocessing ... % 5.24/1.41 Prover 10: Preprocessing ... % 5.24/1.41 Prover 11: Preprocessing ... % 5.24/1.44 Prover 1: Found proof (size 32) % 5.24/1.46 Prover 1: proved (814ms) % 5.24/1.46 Prover 10: Warning: ignoring some quantifiers % 5.24/1.46 Prover 7: Warning: ignoring some quantifiers % 5.24/1.46 Prover 4: Found proof (size 37) % 5.24/1.46 Prover 4: proved (824ms) % 5.24/1.46 Prover 7: Constructing countermodel ... % 5.24/1.46 Prover 7: stopped % 5.71/1.46 Prover 13: Warning: ignoring some quantifiers % 5.71/1.47 Prover 10: Constructing countermodel ... % 5.71/1.47 Prover 10: stopped % 5.71/1.47 Prover 13: Constructing countermodel ... % 5.71/1.47 Prover 8: Warning: ignoring some quantifiers % 5.71/1.48 Prover 13: stopped % 5.71/1.48 Prover 8: Constructing countermodel ... % 5.71/1.48 Prover 11: Constructing countermodel ... % 5.71/1.48 Prover 8: stopped % 5.71/1.48 Prover 11: stopped % 5.71/1.48 % 5.71/1.48 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.71/1.48 % 5.71/1.49 % SZS output start Proof for theBenchmark % 5.71/1.49 Assumptions after simplification: % 5.71/1.49 --------------------------------- % 5.71/1.49 % 5.71/1.50 (difference_defn) % 5.71/1.52 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: int] : (v4 = 0 % 5.71/1.52 | ~ (member(v2, v3) = v4) | ~ (difference(v0, v1) = v3) | ~ $i(v2) | ~ % 5.71/1.52 $i(v1) | ~ $i(v0) | ? [v5: any] : ? [v6: any] : (member(v2, v1) = v6 & % 5.71/1.52 member(v2, v0) = v5 & ( ~ (v5 = 0) | v6 = 0))) & ! [v0: $i] : ! [v1: $i] % 5.71/1.52 : ! [v2: $i] : ! [v3: $i] : ( ~ (member(v2, v3) = 0) | ~ (difference(v0, % 5.71/1.52 v1) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v4: int] : ( ~ (v4 = % 5.71/1.52 0) & member(v2, v1) = v4 & member(v2, v0) = 0)) % 5.71/1.52 % 5.71/1.52 (prove_th48) % 5.71/1.53 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5: % 5.71/1.53 $i] : ? [v6: int] : ( ~ (v6 = 0) & difference(v1, v2) = v5 & difference(v0, % 5.71/1.53 v3) = v4 & subset(v4, v5) = v6 & subset(v2, v3) = 0 & subset(v0, v1) = 0 & % 5.71/1.53 $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0)) % 5.71/1.53 % 5.71/1.53 (subset_defn) % 5.71/1.53 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (subset(v0, v1) = v2) % 5.71/1.53 | ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : ? [v4: int] : ( ~ (v4 = 0) & % 5.71/1.53 member(v3, v1) = v4 & member(v3, v0) = 0 & $i(v3))) & ! [v0: $i] : ! % 5.71/1.53 [v1: $i] : ( ~ (subset(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0) | ! [v2: $i] : ( % 5.71/1.53 ~ (member(v2, v0) = 0) | ~ $i(v2) | member(v2, v1) = 0)) % 5.71/1.53 % 5.71/1.53 (function-axioms) % 5.71/1.53 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 5.71/1.53 [v3: $i] : (v1 = v0 | ~ (member(v3, v2) = v1) | ~ (member(v3, v2) = v0)) & % 5.71/1.53 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 5.71/1.53 (difference(v3, v2) = v1) | ~ (difference(v3, v2) = v0)) & ! [v0: % 5.71/1.53 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 5.71/1.53 : (v1 = v0 | ~ (subset(v3, v2) = v1) | ~ (subset(v3, v2) = v0)) % 5.71/1.53 % 5.71/1.53 Further assumptions not needed in the proof: % 5.71/1.53 -------------------------------------------- % 5.71/1.53 difference_subset1, difference_subset2, reflexivity_of_subset, % 5.71/1.53 transitivity_of_subset % 5.71/1.53 % 5.71/1.53 Those formulas are unsatisfiable: % 5.71/1.53 --------------------------------- % 5.71/1.53 % 5.71/1.53 Begin of proof % 5.71/1.53 | % 5.71/1.53 | ALPHA: (difference_defn) implies: % 5.71/1.54 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ (member(v2, % 5.71/1.54 | v3) = 0) | ~ (difference(v0, v1) = v3) | ~ $i(v2) | ~ $i(v1) | % 5.71/1.54 | ~ $i(v0) | ? [v4: int] : ( ~ (v4 = 0) & member(v2, v1) = v4 & % 5.71/1.54 | member(v2, v0) = 0)) % 5.71/1.54 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: int] : % 5.71/1.54 | (v4 = 0 | ~ (member(v2, v3) = v4) | ~ (difference(v0, v1) = v3) | ~ % 5.71/1.54 | $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v5: any] : ? [v6: any] : % 5.71/1.54 | (member(v2, v1) = v6 & member(v2, v0) = v5 & ( ~ (v5 = 0) | v6 = 0))) % 5.71/1.54 | % 5.71/1.54 | ALPHA: (subset_defn) implies: % 5.71/1.54 | (3) ! [v0: $i] : ! [v1: $i] : ( ~ (subset(v0, v1) = 0) | ~ $i(v1) | ~ % 5.71/1.54 | $i(v0) | ! [v2: $i] : ( ~ (member(v2, v0) = 0) | ~ $i(v2) | % 5.71/1.54 | member(v2, v1) = 0)) % 5.71/1.54 | (4) ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (subset(v0, v1) % 5.71/1.54 | = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : ? [v4: int] : ( ~ % 5.71/1.54 | (v4 = 0) & member(v3, v1) = v4 & member(v3, v0) = 0 & $i(v3))) % 5.71/1.54 | % 5.71/1.54 | ALPHA: (function-axioms) implies: % 5.71/1.54 | (5) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 5.71/1.54 | ! [v3: $i] : (v1 = v0 | ~ (member(v3, v2) = v1) | ~ (member(v3, v2) % 5.71/1.54 | = v0)) % 5.71/1.54 | % 5.71/1.54 | DELTA: instantiating (prove_th48) with fresh symbols all_9_0, all_9_1, % 5.71/1.54 | all_9_2, all_9_3, all_9_4, all_9_5, all_9_6 gives: % 5.71/1.55 | (6) ~ (all_9_0 = 0) & difference(all_9_5, all_9_4) = all_9_1 & % 5.71/1.55 | difference(all_9_6, all_9_3) = all_9_2 & subset(all_9_2, all_9_1) = % 5.71/1.55 | all_9_0 & subset(all_9_4, all_9_3) = 0 & subset(all_9_6, all_9_5) = 0 & % 5.71/1.55 | $i(all_9_1) & $i(all_9_2) & $i(all_9_3) & $i(all_9_4) & $i(all_9_5) & % 5.71/1.55 | $i(all_9_6) % 5.71/1.55 | % 5.71/1.55 | ALPHA: (6) implies: % 5.71/1.55 | (7) ~ (all_9_0 = 0) % 5.71/1.55 | (8) $i(all_9_6) % 5.71/1.55 | (9) $i(all_9_5) % 5.71/1.55 | (10) $i(all_9_4) % 5.71/1.55 | (11) $i(all_9_3) % 5.71/1.55 | (12) $i(all_9_2) % 5.71/1.55 | (13) $i(all_9_1) % 5.71/1.55 | (14) subset(all_9_6, all_9_5) = 0 % 5.71/1.55 | (15) subset(all_9_4, all_9_3) = 0 % 5.71/1.55 | (16) subset(all_9_2, all_9_1) = all_9_0 % 5.71/1.55 | (17) difference(all_9_6, all_9_3) = all_9_2 % 5.71/1.55 | (18) difference(all_9_5, all_9_4) = all_9_1 % 5.71/1.55 | % 5.71/1.55 | GROUND_INST: instantiating (3) with all_9_6, all_9_5, simplifying with (8), % 5.71/1.55 | (9), (14) gives: % 5.71/1.55 | (19) ! [v0: $i] : ( ~ (member(v0, all_9_6) = 0) | ~ $i(v0) | member(v0, % 5.71/1.55 | all_9_5) = 0) % 5.71/1.55 | % 5.71/1.55 | GROUND_INST: instantiating (3) with all_9_4, all_9_3, simplifying with (10), % 5.71/1.55 | (11), (15) gives: % 5.71/1.55 | (20) ! [v0: $i] : ( ~ (member(v0, all_9_4) = 0) | ~ $i(v0) | member(v0, % 5.71/1.55 | all_9_3) = 0) % 5.71/1.55 | % 5.71/1.55 | GROUND_INST: instantiating (4) with all_9_2, all_9_1, all_9_0, simplifying % 5.71/1.55 | with (12), (13), (16) gives: % 5.71/1.55 | (21) all_9_0 = 0 | ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & member(v0, % 5.71/1.55 | all_9_1) = v1 & member(v0, all_9_2) = 0 & $i(v0)) % 5.71/1.55 | % 5.71/1.55 | BETA: splitting (21) gives: % 5.71/1.55 | % 5.71/1.55 | Case 1: % 5.71/1.55 | | % 5.71/1.55 | | (22) all_9_0 = 0 % 5.71/1.55 | | % 5.71/1.55 | | REDUCE: (7), (22) imply: % 5.71/1.55 | | (23) $false % 5.71/1.56 | | % 5.71/1.56 | | CLOSE: (23) is inconsistent. % 5.71/1.56 | | % 5.71/1.56 | Case 2: % 5.71/1.56 | | % 5.71/1.56 | | (24) ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & member(v0, all_9_1) = v1 % 5.71/1.56 | | & member(v0, all_9_2) = 0 & $i(v0)) % 5.71/1.56 | | % 5.71/1.56 | | DELTA: instantiating (24) with fresh symbols all_21_0, all_21_1 gives: % 5.71/1.56 | | (25) ~ (all_21_0 = 0) & member(all_21_1, all_9_1) = all_21_0 & % 5.71/1.56 | | member(all_21_1, all_9_2) = 0 & $i(all_21_1) % 5.71/1.56 | | % 5.71/1.56 | | ALPHA: (25) implies: % 5.71/1.56 | | (26) ~ (all_21_0 = 0) % 5.71/1.56 | | (27) $i(all_21_1) % 5.71/1.56 | | (28) member(all_21_1, all_9_2) = 0 % 5.71/1.56 | | (29) member(all_21_1, all_9_1) = all_21_0 % 5.71/1.56 | | % 5.71/1.56 | | GROUND_INST: instantiating (1) with all_9_6, all_9_3, all_21_1, all_9_2, % 5.71/1.56 | | simplifying with (8), (11), (17), (27), (28) gives: % 5.71/1.56 | | (30) ? [v0: int] : ( ~ (v0 = 0) & member(all_21_1, all_9_3) = v0 & % 5.71/1.56 | | member(all_21_1, all_9_6) = 0) % 5.71/1.56 | | % 5.71/1.56 | | GROUND_INST: instantiating (2) with all_9_5, all_9_4, all_21_1, all_9_1, % 5.71/1.56 | | all_21_0, simplifying with (9), (10), (18), (27), (29) gives: % 5.71/1.56 | | (31) all_21_0 = 0 | ? [v0: any] : ? [v1: any] : (member(all_21_1, % 5.71/1.56 | | all_9_4) = v1 & member(all_21_1, all_9_5) = v0 & ( ~ (v0 = 0) | % 5.71/1.56 | | v1 = 0)) % 5.71/1.56 | | % 5.71/1.56 | | DELTA: instantiating (30) with fresh symbol all_28_0 gives: % 5.71/1.56 | | (32) ~ (all_28_0 = 0) & member(all_21_1, all_9_3) = all_28_0 & % 5.71/1.56 | | member(all_21_1, all_9_6) = 0 % 5.71/1.56 | | % 5.71/1.56 | | ALPHA: (32) implies: % 6.23/1.56 | | (33) ~ (all_28_0 = 0) % 6.23/1.56 | | (34) member(all_21_1, all_9_6) = 0 % 6.23/1.56 | | (35) member(all_21_1, all_9_3) = all_28_0 % 6.23/1.56 | | % 6.23/1.56 | | BETA: splitting (31) gives: % 6.23/1.56 | | % 6.23/1.56 | | Case 1: % 6.23/1.56 | | | % 6.23/1.56 | | | (36) all_21_0 = 0 % 6.23/1.56 | | | % 6.23/1.56 | | | REDUCE: (26), (36) imply: % 6.23/1.56 | | | (37) $false % 6.23/1.56 | | | % 6.23/1.56 | | | CLOSE: (37) is inconsistent. % 6.23/1.56 | | | % 6.23/1.56 | | Case 2: % 6.23/1.56 | | | % 6.23/1.56 | | | (38) ? [v0: any] : ? [v1: any] : (member(all_21_1, all_9_4) = v1 & % 6.23/1.56 | | | member(all_21_1, all_9_5) = v0 & ( ~ (v0 = 0) | v1 = 0)) % 6.23/1.56 | | | % 6.23/1.56 | | | DELTA: instantiating (38) with fresh symbols all_34_0, all_34_1 gives: % 6.23/1.56 | | | (39) member(all_21_1, all_9_4) = all_34_0 & member(all_21_1, all_9_5) = % 6.23/1.56 | | | all_34_1 & ( ~ (all_34_1 = 0) | all_34_0 = 0) % 6.23/1.56 | | | % 6.23/1.56 | | | ALPHA: (39) implies: % 6.23/1.56 | | | (40) member(all_21_1, all_9_5) = all_34_1 % 6.23/1.56 | | | (41) member(all_21_1, all_9_4) = all_34_0 % 6.23/1.57 | | | (42) ~ (all_34_1 = 0) | all_34_0 = 0 % 6.23/1.57 | | | % 6.23/1.57 | | | GROUND_INST: instantiating (19) with all_21_1, simplifying with (27), (34) % 6.23/1.57 | | | gives: % 6.23/1.57 | | | (43) member(all_21_1, all_9_5) = 0 % 6.23/1.57 | | | % 6.23/1.57 | | | GROUND_INST: instantiating (5) with all_34_1, 0, all_9_5, all_21_1, % 6.23/1.57 | | | simplifying with (40), (43) gives: % 6.23/1.57 | | | (44) all_34_1 = 0 % 6.23/1.57 | | | % 6.23/1.57 | | | BETA: splitting (42) gives: % 6.23/1.57 | | | % 6.23/1.57 | | | Case 1: % 6.23/1.57 | | | | % 6.23/1.57 | | | | (45) ~ (all_34_1 = 0) % 6.23/1.57 | | | | % 6.23/1.57 | | | | REDUCE: (44), (45) imply: % 6.23/1.57 | | | | (46) $false % 6.23/1.57 | | | | % 6.23/1.57 | | | | CLOSE: (46) is inconsistent. % 6.23/1.57 | | | | % 6.23/1.57 | | | Case 2: % 6.23/1.57 | | | | % 6.23/1.57 | | | | (47) all_34_0 = 0 % 6.23/1.57 | | | | % 6.23/1.57 | | | | REDUCE: (41), (47) imply: % 6.23/1.57 | | | | (48) member(all_21_1, all_9_4) = 0 % 6.23/1.57 | | | | % 6.23/1.57 | | | | GROUND_INST: instantiating (20) with all_21_1, simplifying with (27), % 6.23/1.57 | | | | (48) gives: % 6.23/1.57 | | | | (49) member(all_21_1, all_9_3) = 0 % 6.23/1.57 | | | | % 6.23/1.57 | | | | GROUND_INST: instantiating (5) with all_28_0, 0, all_9_3, all_21_1, % 6.23/1.57 | | | | simplifying with (35), (49) gives: % 6.23/1.57 | | | | (50) all_28_0 = 0 % 6.23/1.57 | | | | % 6.23/1.57 | | | | REDUCE: (33), (50) imply: % 6.23/1.57 | | | | (51) $false % 6.23/1.57 | | | | % 6.23/1.57 | | | | CLOSE: (51) is inconsistent. % 6.23/1.57 | | | | % 6.23/1.57 | | | End of split % 6.23/1.57 | | | % 6.23/1.57 | | End of split % 6.23/1.57 | | % 6.23/1.57 | End of split % 6.23/1.57 | % 6.23/1.57 End of proof % 6.23/1.57 % SZS output end Proof for theBenchmark % 6.23/1.57 % 6.23/1.57 960ms %------------------------------------------------------------------------------