%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : GEO173+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 : n009.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 : Wed Aug 30 23:21:50 EDT 2023 % Result : Theorem 5.00s 1.32s % Output : Proof 6.78s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.05/0.09 % Problem : GEO173+1 : TPTP v8.1.2. Released v3.3.0. % 0.05/0.10 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.10/0.29 % Computer : n009.cluster.edu % 0.10/0.29 % Model : x86_64 x86_64 % 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.29 % Memory : 8042.1875MB % 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64 % 0.10/0.29 % CPULimit : 300 % 0.10/0.29 % WCLimit : 300 % 0.10/0.29 % DateTime : Tue Aug 29 20:53:50 EDT 2023 % 0.10/0.29 % CPUTime : % 0.14/0.51 ________ _____ % 0.14/0.51 ___ __ \_________(_)________________________________ % 0.14/0.51 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.14/0.51 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.14/0.51 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.14/0.51 % 0.14/0.51 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.14/0.51 (2023-06-19) % 0.14/0.51 % 0.14/0.51 (c) Philipp Rümmer, 2009-2023 % 0.14/0.51 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.14/0.51 Amanda Stjerna. % 0.14/0.51 Free software under BSD-3-Clause. % 0.14/0.51 % 0.14/0.51 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.14/0.51 % 0.14/0.51 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.14/0.52 Running up to 7 provers in parallel. % 0.14/0.53 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.14/0.53 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.14/0.53 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.14/0.53 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.14/0.53 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.14/0.53 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.14/0.53 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.49/0.93 Prover 4: Preprocessing ... % 2.49/0.94 Prover 1: Preprocessing ... % 2.83/0.97 Prover 5: Preprocessing ... % 2.83/0.97 Prover 0: Preprocessing ... % 2.83/0.97 Prover 6: Preprocessing ... % 2.83/0.97 Prover 3: Preprocessing ... % 2.83/0.97 Prover 2: Preprocessing ... % 4.30/1.18 Prover 2: Proving ... % 4.30/1.19 Prover 5: Proving ... % 4.30/1.22 Prover 3: Constructing countermodel ... % 4.30/1.22 Prover 1: Constructing countermodel ... % 4.30/1.22 Prover 6: Constructing countermodel ... % 5.00/1.32 Prover 5: proved (790ms) % 5.00/1.32 % 5.00/1.32 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.00/1.32 % 5.51/1.33 Prover 3: stopped % 5.51/1.33 Prover 6: stopped % 5.51/1.33 Prover 2: stopped % 5.51/1.33 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.51/1.33 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 5.51/1.33 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 5.51/1.34 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 5.51/1.35 Prover 4: Constructing countermodel ... % 5.51/1.36 Prover 0: Proving ... % 5.51/1.37 Prover 0: stopped % 5.82/1.39 Prover 10: Preprocessing ... % 5.82/1.39 Prover 8: Preprocessing ... % 5.82/1.39 Prover 7: Preprocessing ... % 5.82/1.39 Prover 11: Preprocessing ... % 5.82/1.39 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 5.82/1.41 Prover 13: Preprocessing ... % 5.82/1.42 Prover 10: Warning: ignoring some quantifiers % 5.82/1.42 Prover 7: Warning: ignoring some quantifiers % 5.82/1.43 Prover 10: Constructing countermodel ... % 5.82/1.43 Prover 1: Found proof (size 32) % 5.82/1.43 Prover 1: proved (908ms) % 5.82/1.44 Prover 7: Constructing countermodel ... % 5.82/1.44 Prover 4: stopped % 6.33/1.44 Prover 10: stopped % 6.33/1.44 Prover 7: stopped % 6.33/1.44 Prover 11: stopped % 6.33/1.45 Prover 8: Warning: ignoring some quantifiers % 6.33/1.45 Prover 13: Warning: ignoring some quantifiers % 6.33/1.46 Prover 8: Constructing countermodel ... % 6.33/1.46 Prover 13: Constructing countermodel ... % 6.33/1.46 Prover 8: stopped % 6.48/1.46 Prover 13: stopped % 6.48/1.46 % 6.48/1.46 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.48/1.46 % 6.48/1.47 % SZS output start Proof for theBenchmark % 6.48/1.47 Assumptions after simplification: % 6.48/1.47 --------------------------------- % 6.48/1.47 % 6.48/1.47 (ci1) % 6.48/1.50 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (line_connecting(v0, v1) = v2) | % 6.48/1.50 ~ (apart_point_and_line(v0, v2) = 0) | ~ $i(v1) | ~ $i(v0) | ? [v3: int] % 6.48/1.50 : ( ~ (v3 = 0) & distinct_points(v0, v1) = v3)) % 6.48/1.50 % 6.48/1.50 (ci2) % 6.48/1.50 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (line_connecting(v0, v1) = v2) | % 6.48/1.50 ~ (apart_point_and_line(v1, v2) = 0) | ~ $i(v1) | ~ $i(v0) | ? [v3: int] % 6.48/1.50 : ( ~ (v3 = 0) & distinct_points(v0, v1) = v3)) % 6.48/1.50 % 6.48/1.50 (con) % 6.48/1.51 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5: % 6.48/1.51 int] : ? [v6: int] : ( ~ (v6 = 0) & ~ (v5 = 0) & line_connecting(v0, v1) = % 6.48/1.51 v4 & apart_point_and_line(v1, v2) = v6 & apart_point_and_line(v0, v2) = v5 & % 6.48/1.51 convergent_lines(v2, v3) = 0 & distinct_lines(v2, v4) = 0 & % 6.48/1.51 distinct_points(v0, v1) = 0 & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0)) % 6.48/1.51 % 6.48/1.51 (cu1) % 6.48/1.51 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ % 6.48/1.51 (distinct_lines(v2, v3) = 0) | ~ (distinct_points(v0, v1) = 0) | ~ $i(v3) % 6.48/1.51 | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v4: any] : ? [v5: any] : ? [v6: % 6.48/1.51 any] : ? [v7: any] : (apart_point_and_line(v1, v3) = v7 & % 6.48/1.51 apart_point_and_line(v1, v2) = v6 & apart_point_and_line(v0, v3) = v5 & % 6.48/1.51 apart_point_and_line(v0, v2) = v4 & (v7 = 0 | v6 = 0 | v5 = 0 | v4 = 0))) % 6.48/1.51 % 6.48/1.51 (function-axioms) % 6.48/1.51 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 6.48/1.51 (intersection_point(v3, v2) = v1) | ~ (intersection_point(v3, v2) = v0)) & % 6.48/1.51 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 6.48/1.51 (line_connecting(v3, v2) = v1) | ~ (line_connecting(v3, v2) = v0)) & ! % 6.48/1.51 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 6.48/1.51 $i] : (v1 = v0 | ~ (apart_point_and_line(v3, v2) = v1) | ~ % 6.48/1.51 (apart_point_and_line(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 6.48/1.51 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 6.48/1.51 (convergent_lines(v3, v2) = v1) | ~ (convergent_lines(v3, v2) = v0)) & ! % 6.48/1.51 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 6.48/1.51 $i] : (v1 = v0 | ~ (distinct_lines(v3, v2) = v1) | ~ (distinct_lines(v3, % 6.48/1.51 v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : % 6.48/1.52 ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (distinct_points(v3, v2) = v1) | ~ % 6.48/1.52 (distinct_points(v3, v2) = v0)) % 6.48/1.52 % 6.48/1.52 Further assumptions not needed in the proof: % 6.48/1.52 -------------------------------------------- % 6.48/1.52 apart1, apart2, apart3, apart4, apart5, ax6, ceq1, ceq2, ceq3, ci3, ci4 % 6.48/1.52 % 6.48/1.52 Those formulas are unsatisfiable: % 6.48/1.52 --------------------------------- % 6.48/1.52 % 6.48/1.52 Begin of proof % 6.48/1.52 | % 6.48/1.52 | ALPHA: (function-axioms) implies: % 6.48/1.52 | (1) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 6.48/1.52 | ! [v3: $i] : (v1 = v0 | ~ (distinct_points(v3, v2) = v1) | ~ % 6.48/1.52 | (distinct_points(v3, v2) = v0)) % 6.48/1.52 | (2) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 6.48/1.52 | ! [v3: $i] : (v1 = v0 | ~ (apart_point_and_line(v3, v2) = v1) | ~ % 6.48/1.52 | (apart_point_and_line(v3, v2) = v0)) % 6.48/1.52 | % 6.48/1.52 | DELTA: instantiating (con) with fresh symbols all_17_0, all_17_1, all_17_2, % 6.48/1.52 | all_17_3, all_17_4, all_17_5, all_17_6 gives: % 6.78/1.52 | (3) ~ (all_17_0 = 0) & ~ (all_17_1 = 0) & line_connecting(all_17_6, % 6.78/1.52 | all_17_5) = all_17_2 & apart_point_and_line(all_17_5, all_17_4) = % 6.78/1.52 | all_17_0 & apart_point_and_line(all_17_6, all_17_4) = all_17_1 & % 6.78/1.52 | convergent_lines(all_17_4, all_17_3) = 0 & distinct_lines(all_17_4, % 6.78/1.52 | all_17_2) = 0 & distinct_points(all_17_6, all_17_5) = 0 & % 6.78/1.52 | $i(all_17_2) & $i(all_17_3) & $i(all_17_4) & $i(all_17_5) & % 6.78/1.52 | $i(all_17_6) % 6.78/1.52 | % 6.78/1.52 | ALPHA: (3) implies: % 6.78/1.52 | (4) ~ (all_17_1 = 0) % 6.78/1.52 | (5) ~ (all_17_0 = 0) % 6.78/1.52 | (6) $i(all_17_6) % 6.78/1.52 | (7) $i(all_17_5) % 6.78/1.52 | (8) $i(all_17_4) % 6.78/1.52 | (9) $i(all_17_2) % 6.78/1.52 | (10) distinct_points(all_17_6, all_17_5) = 0 % 6.78/1.53 | (11) distinct_lines(all_17_4, all_17_2) = 0 % 6.78/1.53 | (12) apart_point_and_line(all_17_6, all_17_4) = all_17_1 % 6.78/1.53 | (13) apart_point_and_line(all_17_5, all_17_4) = all_17_0 % 6.78/1.53 | (14) line_connecting(all_17_6, all_17_5) = all_17_2 % 6.78/1.53 | % 6.78/1.53 | GROUND_INST: instantiating (cu1) with all_17_6, all_17_5, all_17_4, all_17_2, % 6.78/1.53 | simplifying with (6), (7), (8), (9), (10), (11) gives: % 6.78/1.53 | (15) ? [v0: any] : ? [v1: any] : ? [v2: any] : ? [v3: any] : % 6.78/1.53 | (apart_point_and_line(all_17_5, all_17_2) = v3 & % 6.78/1.53 | apart_point_and_line(all_17_5, all_17_4) = v2 & % 6.78/1.53 | apart_point_and_line(all_17_6, all_17_2) = v1 & % 6.78/1.53 | apart_point_and_line(all_17_6, all_17_4) = v0 & (v3 = 0 | v2 = 0 | % 6.78/1.53 | v1 = 0 | v0 = 0)) % 6.78/1.53 | % 6.78/1.53 | DELTA: instantiating (15) with fresh symbols all_24_0, all_24_1, all_24_2, % 6.78/1.53 | all_24_3 gives: % 6.78/1.53 | (16) apart_point_and_line(all_17_5, all_17_2) = all_24_0 & % 6.78/1.53 | apart_point_and_line(all_17_5, all_17_4) = all_24_1 & % 6.78/1.53 | apart_point_and_line(all_17_6, all_17_2) = all_24_2 & % 6.78/1.53 | apart_point_and_line(all_17_6, all_17_4) = all_24_3 & (all_24_0 = 0 | % 6.78/1.53 | all_24_1 = 0 | all_24_2 = 0 | all_24_3 = 0) % 6.78/1.53 | % 6.78/1.53 | ALPHA: (16) implies: % 6.78/1.53 | (17) apart_point_and_line(all_17_6, all_17_4) = all_24_3 % 6.78/1.53 | (18) apart_point_and_line(all_17_6, all_17_2) = all_24_2 % 6.78/1.53 | (19) apart_point_and_line(all_17_5, all_17_4) = all_24_1 % 6.78/1.53 | (20) apart_point_and_line(all_17_5, all_17_2) = all_24_0 % 6.78/1.53 | (21) all_24_0 = 0 | all_24_1 = 0 | all_24_2 = 0 | all_24_3 = 0 % 6.78/1.53 | % 6.78/1.53 | GROUND_INST: instantiating (2) with all_17_1, all_24_3, all_17_4, all_17_6, % 6.78/1.53 | simplifying with (12), (17) gives: % 6.78/1.53 | (22) all_24_3 = all_17_1 % 6.78/1.53 | % 6.78/1.53 | GROUND_INST: instantiating (2) with all_17_0, all_24_1, all_17_4, all_17_5, % 6.78/1.53 | simplifying with (13), (19) gives: % 6.78/1.53 | (23) all_24_1 = all_17_0 % 6.78/1.53 | % 6.78/1.53 | BETA: splitting (21) gives: % 6.78/1.53 | % 6.78/1.53 | Case 1: % 6.78/1.53 | | % 6.78/1.53 | | (24) all_24_0 = 0 % 6.78/1.53 | | % 6.78/1.53 | | REDUCE: (20), (24) imply: % 6.78/1.53 | | (25) apart_point_and_line(all_17_5, all_17_2) = 0 % 6.78/1.53 | | % 6.78/1.54 | | GROUND_INST: instantiating (ci2) with all_17_6, all_17_5, all_17_2, % 6.78/1.54 | | simplifying with (6), (7), (14), (25) gives: % 6.78/1.54 | | (26) ? [v0: int] : ( ~ (v0 = 0) & distinct_points(all_17_6, all_17_5) = % 6.78/1.54 | | v0) % 6.78/1.54 | | % 6.78/1.54 | | DELTA: instantiating (26) with fresh symbol all_42_0 gives: % 6.78/1.54 | | (27) ~ (all_42_0 = 0) & distinct_points(all_17_6, all_17_5) = all_42_0 % 6.78/1.54 | | % 6.78/1.54 | | ALPHA: (27) implies: % 6.78/1.54 | | (28) ~ (all_42_0 = 0) % 6.78/1.54 | | (29) distinct_points(all_17_6, all_17_5) = all_42_0 % 6.78/1.54 | | % 6.78/1.54 | | GROUND_INST: instantiating (1) with 0, all_42_0, all_17_5, all_17_6, % 6.78/1.54 | | simplifying with (10), (29) gives: % 6.78/1.54 | | (30) all_42_0 = 0 % 6.78/1.54 | | % 6.78/1.54 | | REDUCE: (28), (30) imply: % 6.78/1.54 | | (31) $false % 6.78/1.54 | | % 6.78/1.54 | | CLOSE: (31) is inconsistent. % 6.78/1.54 | | % 6.78/1.54 | Case 2: % 6.78/1.54 | | % 6.78/1.54 | | (32) all_24_1 = 0 | all_24_2 = 0 | all_24_3 = 0 % 6.78/1.54 | | % 6.78/1.54 | | BETA: splitting (32) gives: % 6.78/1.54 | | % 6.78/1.54 | | Case 1: % 6.78/1.54 | | | % 6.78/1.54 | | | (33) all_24_1 = 0 % 6.78/1.54 | | | % 6.78/1.54 | | | COMBINE_EQS: (23), (33) imply: % 6.78/1.54 | | | (34) all_17_0 = 0 % 6.78/1.54 | | | % 6.78/1.54 | | | REDUCE: (5), (34) imply: % 6.78/1.54 | | | (35) $false % 6.78/1.54 | | | % 6.78/1.54 | | | CLOSE: (35) is inconsistent. % 6.78/1.54 | | | % 6.78/1.54 | | Case 2: % 6.78/1.54 | | | % 6.78/1.54 | | | (36) all_24_2 = 0 | all_24_3 = 0 % 6.78/1.54 | | | % 6.78/1.54 | | | BETA: splitting (36) gives: % 6.78/1.54 | | | % 6.78/1.54 | | | Case 1: % 6.78/1.54 | | | | % 6.78/1.54 | | | | (37) all_24_2 = 0 % 6.78/1.54 | | | | % 6.78/1.54 | | | | REDUCE: (18), (37) imply: % 6.78/1.54 | | | | (38) apart_point_and_line(all_17_6, all_17_2) = 0 % 6.78/1.54 | | | | % 6.78/1.54 | | | | GROUND_INST: instantiating (ci1) with all_17_6, all_17_5, all_17_2, % 6.78/1.54 | | | | simplifying with (6), (7), (14), (38) gives: % 6.78/1.54 | | | | (39) ? [v0: int] : ( ~ (v0 = 0) & distinct_points(all_17_6, % 6.78/1.54 | | | | all_17_5) = v0) % 6.78/1.54 | | | | % 6.78/1.54 | | | | DELTA: instantiating (39) with fresh symbol all_50_0 gives: % 6.78/1.54 | | | | (40) ~ (all_50_0 = 0) & distinct_points(all_17_6, all_17_5) = % 6.78/1.54 | | | | all_50_0 % 6.78/1.54 | | | | % 6.78/1.54 | | | | ALPHA: (40) implies: % 6.78/1.54 | | | | (41) ~ (all_50_0 = 0) % 6.78/1.54 | | | | (42) distinct_points(all_17_6, all_17_5) = all_50_0 % 6.78/1.54 | | | | % 6.78/1.54 | | | | GROUND_INST: instantiating (1) with 0, all_50_0, all_17_5, all_17_6, % 6.78/1.54 | | | | simplifying with (10), (42) gives: % 6.78/1.54 | | | | (43) all_50_0 = 0 % 6.78/1.54 | | | | % 6.78/1.54 | | | | REDUCE: (41), (43) imply: % 6.78/1.54 | | | | (44) $false % 6.78/1.54 | | | | % 6.78/1.54 | | | | CLOSE: (44) is inconsistent. % 6.78/1.54 | | | | % 6.78/1.54 | | | Case 2: % 6.78/1.54 | | | | % 6.78/1.54 | | | | (45) all_24_3 = 0 % 6.78/1.54 | | | | % 6.78/1.54 | | | | COMBINE_EQS: (22), (45) imply: % 6.78/1.55 | | | | (46) all_17_1 = 0 % 6.78/1.55 | | | | % 6.78/1.55 | | | | SIMP: (46) implies: % 6.78/1.55 | | | | (47) all_17_1 = 0 % 6.78/1.55 | | | | % 6.78/1.55 | | | | REDUCE: (4), (47) imply: % 6.78/1.55 | | | | (48) $false % 6.78/1.55 | | | | % 6.78/1.55 | | | | CLOSE: (48) is inconsistent. % 6.78/1.55 | | | | % 6.78/1.55 | | | End of split % 6.78/1.55 | | | % 6.78/1.55 | | End of split % 6.78/1.55 | | % 6.78/1.55 | End of split % 6.78/1.55 | % 6.78/1.55 End of proof % 6.78/1.55 % SZS output end Proof for theBenchmark % 6.78/1.55 % 6.78/1.55 1038ms %------------------------------------------------------------------------------