%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWV411+1 : TPTP v8.1.2. Released v3.3.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n007.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 22:56:14 EDT 2023 % Result : Theorem 8.06s 1.77s % Output : Proof 10.54s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : SWV411+1 : TPTP v8.1.2. Released v3.3.0. % 0.04/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n007.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 : Tue Aug 29 09:10:58 EDT 2023 % 0.13/0.34 % CPUTime : % 0.56/0.61 ________ _____ % 0.56/0.61 ___ __ \_________(_)________________________________ % 0.56/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.56/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.56/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.56/0.61 % 0.56/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.56/0.61 (2023-06-19) % 0.56/0.61 % 0.56/0.61 (c) Philipp Rümmer, 2009-2023 % 0.56/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.56/0.61 Amanda Stjerna. % 0.56/0.61 Free software under BSD-3-Clause. % 0.56/0.61 % 0.56/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.56/0.61 % 0.56/0.61 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.56/0.62 Running up to 7 provers in parallel. % 0.71/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.71/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.71/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.71/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.71/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.71/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.71/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.90/1.07 Prover 4: Preprocessing ... % 2.90/1.07 Prover 1: Preprocessing ... % 2.90/1.11 Prover 6: Preprocessing ... % 2.90/1.11 Prover 0: Preprocessing ... % 2.90/1.11 Prover 2: Preprocessing ... % 2.90/1.11 Prover 5: Preprocessing ... % 2.90/1.13 Prover 3: Preprocessing ... % 5.71/1.48 Prover 3: Constructing countermodel ... % 5.71/1.49 Prover 1: Constructing countermodel ... % 6.00/1.49 Prover 5: Proving ... % 6.00/1.49 Prover 6: Proving ... % 6.00/1.51 Prover 4: Constructing countermodel ... % 6.00/1.52 Prover 0: Proving ... % 6.00/1.53 Prover 2: Proving ... % 6.89/1.67 Prover 4: gave up % 6.89/1.67 Prover 3: gave up % 7.31/1.68 Prover 1: gave up % 7.31/1.69 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 7.31/1.69 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 7.31/1.70 Prover 9: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1423531889 % 7.31/1.73 Prover 9: Preprocessing ... % 7.31/1.74 Prover 8: Preprocessing ... % 7.31/1.75 Prover 7: Preprocessing ... % 7.31/1.76 Prover 2: proved (1130ms) % 8.06/1.77 % 8.06/1.77 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 8.06/1.77 % 8.06/1.77 Prover 0: stopped % 8.06/1.77 Prover 5: stopped % 8.06/1.77 Prover 6: stopped % 8.06/1.77 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 8.06/1.77 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 8.06/1.77 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 8.06/1.78 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 8.23/1.82 Prover 11: Preprocessing ... % 8.23/1.82 Prover 10: Preprocessing ... % 8.49/1.83 Prover 16: Preprocessing ... % 8.53/1.83 Prover 13: Preprocessing ... % 8.53/1.86 Prover 8: Warning: ignoring some quantifiers % 8.53/1.89 Prover 7: Warning: ignoring some quantifiers % 8.53/1.89 Prover 8: Constructing countermodel ... % 8.53/1.90 Prover 7: Constructing countermodel ... % 9.02/1.92 Prover 16: Warning: ignoring some quantifiers % 9.02/1.94 Prover 16: Constructing countermodel ... % 9.02/1.94 Prover 10: Warning: ignoring some quantifiers % 9.02/1.96 Prover 10: Constructing countermodel ... % 9.02/1.96 Prover 13: Warning: ignoring some quantifiers % 9.55/1.99 Prover 9: Constructing countermodel ... % 9.55/1.99 Prover 9: stopped % 9.55/1.99 Prover 19: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=-1780594085 % 9.55/2.00 Prover 13: Constructing countermodel ... % 9.55/2.03 Prover 19: Preprocessing ... % 9.55/2.03 Prover 8: gave up % 9.55/2.03 Prover 11: Constructing countermodel ... % 9.55/2.04 Prover 7: Found proof (size 21) % 9.55/2.04 Prover 7: proved (368ms) % 9.55/2.04 Prover 13: stopped % 9.55/2.04 Prover 16: stopped % 9.55/2.04 Prover 10: stopped % 9.55/2.05 Prover 11: stopped % 10.32/2.12 Prover 19: Warning: ignoring some quantifiers % 10.48/2.13 Prover 19: Constructing countermodel ... % 10.54/2.14 Prover 19: stopped % 10.54/2.14 % 10.54/2.14 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 10.54/2.14 % 10.54/2.15 % SZS output start Proof for theBenchmark % 10.54/2.15 Assumptions after simplification: % 10.54/2.15 --------------------------------- % 10.54/2.15 % 10.54/2.15 (ax21) % 10.54/2.18 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 10.54/2.18 $i] : (v2 = v1 | ~ (pair(v1, v3) = v4) | ~ (insert_slb(v0, v4) = v5) | ~ % 10.54/2.18 $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ contains_slb(v5, v2) | % 10.54/2.18 contains_slb(v0, v2)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: % 10.54/2.18 $i] : ! [v4: $i] : ! [v5: $i] : ( ~ (pair(v1, v3) = v4) | ~ % 10.54/2.18 (insert_slb(v0, v4) = v5) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 10.54/2.18 ~ contains_slb(v0, v2) | contains_slb(v5, v2)) & ! [v0: $i] : ! [v1: $i] : % 10.54/2.18 ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ( ~ (pair(v1, v2) = v3) | ~ % 10.54/2.18 (insert_slb(v0, v3) = v4) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 10.54/2.18 contains_slb(v4, v1)) % 10.54/2.18 % 10.54/2.18 (ax23) % 10.54/2.19 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 10.54/2.19 $i] : ! [v6: $i] : (v4 = v3 | ~ (pair(v1, v3) = v5) | ~ (insert_slb(v0, % 10.54/2.19 v5) = v6) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 10.54/2.19 ~ pair_in_list(v6, v2, v4) | pair_in_list(v0, v2, v4)) & ! [v0: $i] : ! % 10.54/2.19 [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: $i] : ! [v6: $i] % 10.54/2.19 : (v2 = v1 | ~ (pair(v1, v3) = v5) | ~ (insert_slb(v0, v5) = v6) | ~ $i(v4) % 10.54/2.19 | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ pair_in_list(v6, v2, % 10.54/2.19 v4) | pair_in_list(v0, v2, v4)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] % 10.54/2.19 : ! [v3: $i] : ! [v4: $i] : ! [v5: $i] : ! [v6: $i] : ( ~ (pair(v1, v3) = % 10.54/2.19 v5) | ~ (insert_slb(v0, v5) = v6) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | % 10.54/2.19 ~ $i(v1) | ~ $i(v0) | ~ pair_in_list(v0, v2, v4) | pair_in_list(v6, v2, % 10.54/2.19 v4)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] % 10.54/2.19 : ( ~ (pair(v1, v2) = v3) | ~ (insert_slb(v0, v3) = v4) | ~ $i(v2) | ~ % 10.54/2.19 $i(v1) | ~ $i(v0) | pair_in_list(v4, v1, v2)) % 10.54/2.19 % 10.54/2.19 (l47_co) % 10.54/2.19 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5: % 10.54/2.19 $i] : (pair(v2, v3) = v4 & insert_slb(v0, v4) = v5 & $i(v5) & $i(v4) & % 10.54/2.19 $i(v3) & $i(v2) & $i(v1) & $i(v0) & contains_slb(v5, v1) & ! [v6: $i] : ( ~ % 10.54/2.19 $i(v6) | ~ pair_in_list(v5, v1, v6)) & ! [v6: $i] : ( ~ $i(v6) | ~ % 10.54/2.19 contains_slb(v0, v6) | ? [v7: $i] : ($i(v7) & pair_in_list(v0, v6, v7)))) % 10.54/2.19 % 10.54/2.19 Further assumptions not needed in the proof: % 10.54/2.19 -------------------------------------------- % 10.54/2.19 ax18, ax19, ax20, ax22, ax24, ax25, ax26, ax27, ax28, ax29, ax30, % 10.54/2.19 bottom_smallest, reflexivity, stricly_smaller_definition, totality, transitivity % 10.54/2.19 % 10.54/2.19 Those formulas are unsatisfiable: % 10.54/2.19 --------------------------------- % 10.54/2.19 % 10.54/2.19 Begin of proof % 10.54/2.19 | % 10.54/2.19 | ALPHA: (ax21) implies: % 10.54/2.19 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : % 10.54/2.19 | ! [v5: $i] : (v2 = v1 | ~ (pair(v1, v3) = v4) | ~ (insert_slb(v0, v4) % 10.54/2.19 | = v5) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 10.54/2.19 | contains_slb(v5, v2) | contains_slb(v0, v2)) % 10.54/2.19 | % 10.54/2.19 | ALPHA: (ax23) implies: % 10.54/2.19 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ( % 10.54/2.19 | ~ (pair(v1, v2) = v3) | ~ (insert_slb(v0, v3) = v4) | ~ $i(v2) | ~ % 10.54/2.19 | $i(v1) | ~ $i(v0) | pair_in_list(v4, v1, v2)) % 10.54/2.19 | (3) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : % 10.54/2.19 | ! [v5: $i] : ! [v6: $i] : ( ~ (pair(v1, v3) = v5) | ~ (insert_slb(v0, % 10.54/2.19 | v5) = v6) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ % 10.54/2.19 | $i(v0) | ~ pair_in_list(v0, v2, v4) | pair_in_list(v6, v2, v4)) % 10.54/2.19 | % 10.54/2.20 | DELTA: instantiating (l47_co) with fresh symbols all_21_0, all_21_1, all_21_2, % 10.54/2.20 | all_21_3, all_21_4, all_21_5 gives: % 10.54/2.20 | (4) pair(all_21_3, all_21_2) = all_21_1 & insert_slb(all_21_5, all_21_1) = % 10.54/2.20 | all_21_0 & $i(all_21_0) & $i(all_21_1) & $i(all_21_2) & $i(all_21_3) & % 10.54/2.20 | $i(all_21_4) & $i(all_21_5) & contains_slb(all_21_0, all_21_4) & ! % 10.54/2.20 | [v0: $i] : ( ~ $i(v0) | ~ pair_in_list(all_21_0, all_21_4, v0)) & ! % 10.54/2.20 | [v0: $i] : ( ~ $i(v0) | ~ contains_slb(all_21_5, v0) | ? [v1: $i] : % 10.54/2.20 | ($i(v1) & pair_in_list(all_21_5, v0, v1))) % 10.54/2.20 | % 10.54/2.20 | ALPHA: (4) implies: % 10.54/2.20 | (5) contains_slb(all_21_0, all_21_4) % 10.54/2.20 | (6) $i(all_21_5) % 10.54/2.20 | (7) $i(all_21_4) % 10.54/2.20 | (8) $i(all_21_3) % 10.54/2.20 | (9) $i(all_21_2) % 10.54/2.20 | (10) insert_slb(all_21_5, all_21_1) = all_21_0 % 10.54/2.20 | (11) pair(all_21_3, all_21_2) = all_21_1 % 10.54/2.20 | (12) ! [v0: $i] : ( ~ $i(v0) | ~ contains_slb(all_21_5, v0) | ? [v1: $i] % 10.54/2.20 | : ($i(v1) & pair_in_list(all_21_5, v0, v1))) % 10.54/2.20 | (13) ! [v0: $i] : ( ~ $i(v0) | ~ pair_in_list(all_21_0, all_21_4, v0)) % 10.54/2.20 | % 10.54/2.20 | GROUND_INST: instantiating (12) with all_21_4, simplifying with (7) gives: % 10.54/2.20 | (14) ~ contains_slb(all_21_5, all_21_4) | ? [v0: $i] : ($i(v0) & % 10.54/2.20 | pair_in_list(all_21_5, all_21_4, v0)) % 10.54/2.20 | % 10.54/2.20 | GROUND_INST: instantiating (1) with all_21_5, all_21_3, all_21_4, all_21_2, % 10.54/2.20 | all_21_1, all_21_0, simplifying with (5), (6), (7), (8), (9), % 10.54/2.20 | (10), (11) gives: % 10.54/2.20 | (15) all_21_3 = all_21_4 | contains_slb(all_21_5, all_21_4) % 10.54/2.20 | % 10.54/2.20 | GROUND_INST: instantiating (2) with all_21_5, all_21_3, all_21_2, all_21_1, % 10.54/2.20 | all_21_0, simplifying with (6), (8), (9), (10), (11) gives: % 10.54/2.20 | (16) pair_in_list(all_21_0, all_21_3, all_21_2) % 10.54/2.20 | % 10.54/2.20 | GROUND_INST: instantiating (13) with all_21_2, simplifying with (9) gives: % 10.54/2.20 | (17) ~ pair_in_list(all_21_0, all_21_4, all_21_2) % 10.54/2.20 | % 10.54/2.20 | PRED_UNIFY: (16), (17) imply: % 10.54/2.20 | (18) ~ (all_21_3 = all_21_4) % 10.54/2.20 | % 10.54/2.20 | BETA: splitting (15) gives: % 10.54/2.20 | % 10.54/2.20 | Case 1: % 10.54/2.20 | | % 10.54/2.20 | | (19) contains_slb(all_21_5, all_21_4) % 10.54/2.20 | | % 10.54/2.20 | | BETA: splitting (14) gives: % 10.54/2.20 | | % 10.54/2.20 | | Case 1: % 10.54/2.20 | | | % 10.54/2.20 | | | (20) ~ contains_slb(all_21_5, all_21_4) % 10.54/2.20 | | | % 10.54/2.20 | | | PRED_UNIFY: (19), (20) imply: % 10.54/2.20 | | | (21) $false % 10.54/2.20 | | | % 10.54/2.20 | | | CLOSE: (21) is inconsistent. % 10.54/2.20 | | | % 10.54/2.21 | | Case 2: % 10.54/2.21 | | | % 10.54/2.21 | | | (22) ? [v0: $i] : ($i(v0) & pair_in_list(all_21_5, all_21_4, v0)) % 10.54/2.21 | | | % 10.54/2.21 | | | DELTA: instantiating (22) with fresh symbol all_52_0 gives: % 10.54/2.21 | | | (23) $i(all_52_0) & pair_in_list(all_21_5, all_21_4, all_52_0) % 10.54/2.21 | | | % 10.54/2.21 | | | ALPHA: (23) implies: % 10.54/2.21 | | | (24) pair_in_list(all_21_5, all_21_4, all_52_0) % 10.54/2.21 | | | (25) $i(all_52_0) % 10.54/2.21 | | | % 10.54/2.21 | | | GROUND_INST: instantiating (3) with all_21_5, all_21_3, all_21_4, % 10.54/2.21 | | | all_21_2, all_52_0, all_21_1, all_21_0, simplifying with (6), % 10.54/2.21 | | | (7), (8), (9), (10), (11), (24), (25) gives: % 10.54/2.21 | | | (26) pair_in_list(all_21_0, all_21_4, all_52_0) % 10.54/2.21 | | | % 10.54/2.21 | | | GROUND_INST: instantiating (13) with all_52_0, simplifying with (25) % 10.54/2.21 | | | gives: % 10.54/2.21 | | | (27) ~ pair_in_list(all_21_0, all_21_4, all_52_0) % 10.54/2.21 | | | % 10.54/2.21 | | | PRED_UNIFY: (26), (27) imply: % 10.54/2.21 | | | (28) $false % 10.54/2.21 | | | % 10.54/2.21 | | | CLOSE: (28) is inconsistent. % 10.54/2.21 | | | % 10.54/2.21 | | End of split % 10.54/2.21 | | % 10.54/2.21 | Case 2: % 10.54/2.21 | | % 10.54/2.21 | | (29) all_21_3 = all_21_4 % 10.54/2.21 | | % 10.54/2.21 | | REDUCE: (18), (29) imply: % 10.54/2.21 | | (30) $false % 10.54/2.21 | | % 10.54/2.21 | | CLOSE: (30) is inconsistent. % 10.54/2.21 | | % 10.54/2.21 | End of split % 10.54/2.21 | % 10.54/2.21 End of proof % 10.54/2.21 % SZS output end Proof for theBenchmark % 10.54/2.21 % 10.54/2.21 1596ms %------------------------------------------------------------------------------