%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : GEO219+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 : n010.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:22:28 EDT 2023 % Result : Theorem 8.69s 1.88s % Output : Proof 12.50s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : GEO219+1 : TPTP v8.1.2. Released v3.3.0. % 0.12/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n010.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 22:58:18 EDT 2023 % 0.13/0.34 % CPUTime : % 0.19/0.61 ________ _____ % 0.19/0.61 ___ __ \_________(_)________________________________ % 0.19/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.61 % 0.19/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.61 (2023-06-19) % 0.19/0.61 % 0.19/0.61 (c) Philipp Rümmer, 2009-2023 % 0.19/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.61 Amanda Stjerna. % 0.19/0.61 Free software under BSD-3-Clause. % 0.19/0.61 % 0.19/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.61 % 0.19/0.61 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.19/0.63 Running up to 7 provers in parallel. % 0.62/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.62/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.62/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.62/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.62/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.62/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.62/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.68/1.04 Prover 4: Preprocessing ... % 2.68/1.04 Prover 1: Preprocessing ... % 2.84/1.08 Prover 2: Preprocessing ... % 2.84/1.08 Prover 0: Preprocessing ... % 2.84/1.08 Prover 6: Preprocessing ... % 2.84/1.08 Prover 5: Preprocessing ... % 2.84/1.08 Prover 3: Preprocessing ... % 4.50/1.30 Prover 5: Proving ... % 4.50/1.30 Prover 2: Proving ... % 4.50/1.31 Prover 6: Constructing countermodel ... % 4.89/1.33 Prover 3: Constructing countermodel ... % 4.89/1.33 Prover 1: Constructing countermodel ... % 6.35/1.54 Prover 4: Constructing countermodel ... % 6.55/1.56 Prover 0: Proving ... % 6.55/1.56 Prover 3: gave up % 6.55/1.57 Prover 6: gave up % 6.55/1.58 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 6.55/1.59 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 6.55/1.61 Prover 1: gave up % 6.55/1.61 Prover 9: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1423531889 % 6.55/1.62 Prover 7: Preprocessing ... % 6.55/1.62 Prover 8: Preprocessing ... % 7.10/1.65 Prover 9: Preprocessing ... % 7.10/1.67 Prover 7: Warning: ignoring some quantifiers % 7.44/1.69 Prover 8: Warning: ignoring some quantifiers % 7.44/1.69 Prover 7: Constructing countermodel ... % 7.44/1.70 Prover 8: Constructing countermodel ... % 7.44/1.73 Prover 7: gave up % 7.44/1.73 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 7.99/1.75 Prover 10: Preprocessing ... % 8.20/1.81 Prover 9: Constructing countermodel ... % 8.20/1.82 Prover 10: Warning: ignoring some quantifiers % 8.20/1.82 Prover 10: Constructing countermodel ... % 8.20/1.85 Prover 10: gave up % 8.20/1.85 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 8.69/1.87 Prover 0: proved (1239ms) % 8.69/1.88 % 8.69/1.88 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 8.69/1.88 % 8.69/1.88 Prover 9: stopped % 8.69/1.88 Prover 5: stopped % 8.69/1.89 Prover 2: stopped % 8.69/1.89 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 8.69/1.89 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 8.69/1.89 Prover 11: Preprocessing ... % 8.69/1.89 Prover 19: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=-1780594085 % 8.69/1.90 Prover 8: gave up % 8.69/1.90 Prover 13: Preprocessing ... % 9.15/1.91 Prover 16: Preprocessing ... % 9.15/1.93 Prover 19: Preprocessing ... % 9.15/1.94 Prover 16: Warning: ignoring some quantifiers % 9.15/1.96 Prover 16: Constructing countermodel ... % 9.15/1.97 Prover 13: Warning: ignoring some quantifiers % 9.71/1.98 Prover 13: Constructing countermodel ... % 9.71/1.99 Prover 16: gave up % 9.71/2.00 Prover 13: gave up % 9.71/2.01 Prover 19: Warning: ignoring some quantifiers % 9.71/2.02 Prover 19: Constructing countermodel ... % 9.71/2.06 Prover 11: Constructing countermodel ... % 10.74/2.13 Prover 19: gave up % 11.68/2.34 Prover 11: Found proof (size 69) % 11.68/2.34 Prover 11: proved (494ms) % 11.68/2.34 Prover 4: stopped % 11.68/2.35 % 11.68/2.35 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 11.68/2.35 % 11.68/2.35 % SZS output start Proof for theBenchmark % 11.68/2.36 Assumptions after simplification: % 11.68/2.36 --------------------------------- % 11.68/2.36 % 11.68/2.36 (ax6) % 12.20/2.38 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : ! [v4: int] : (v4 = % 12.20/2.38 0 | v3 = 0 | ~ (convergent_lines(v1, v2) = v4) | ~ (convergent_lines(v0, % 12.20/2.38 v2) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v5: int] : ( ~ (v5 = % 12.20/2.38 0) & convergent_lines(v0, v1) = v5)) & ! [v0: $i] : ! [v1: $i] : ! % 12.20/2.38 [v2: $i] : ! [v3: int] : (v3 = 0 | ~ (convergent_lines(v1, v2) = v3) | ~ % 12.20/2.38 (convergent_lines(v0, v1) = 0) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 12.20/2.39 convergent_lines(v0, v2) = 0) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! % 12.20/2.39 [v3: int] : (v3 = 0 | ~ (convergent_lines(v0, v2) = v3) | ~ % 12.20/2.39 (convergent_lines(v0, v1) = 0) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 12.20/2.39 convergent_lines(v1, v2) = 0) % 12.20/2.39 % 12.20/2.39 (coipo1) % 12.20/2.39 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ % 12.20/2.39 (unorthogonal_lines(v0, v1) = v2) | ~ $i(v1) | ~ $i(v0) | % 12.20/2.39 convergent_lines(v0, v1) = 0) & ! [v0: $i] : ! [v1: $i] : ! [v2: int] : % 12.20/2.39 (v2 = 0 | ~ (convergent_lines(v0, v1) = v2) | ~ $i(v1) | ~ $i(v0) | % 12.20/2.39 unorthogonal_lines(v0, v1) = 0) % 12.20/2.39 % 12.20/2.39 (con) % 12.29/2.39 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: int] : ? [v4: int] : ( ~ % 12.29/2.39 (v4 = 0) & ~ (v3 = 0) & unorthogonal_lines(v1, v2) = 0 & % 12.29/2.39 unorthogonal_lines(v0, v1) = v3 & convergent_lines(v0, v2) = v4 & $i(v2) & % 12.29/2.39 $i(v1) & $i(v0)) % 12.29/2.39 % 12.29/2.39 (cotno1) % 12.29/2.41 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: any] : ! [v4: any] : ( ~ % 12.29/2.41 (unorthogonal_lines(v0, v2) = v4) | ~ (unorthogonal_lines(v0, v1) = v3) | % 12.29/2.41 ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v5: int] : ? [v6: int] : ? [v7: % 12.29/2.41 int] : ? [v8: int] : ((v6 = 0 & v4 = 0 & convergent_lines(v0, v2) = 0) | % 12.29/2.41 (v5 = 0 & v3 = 0 & convergent_lines(v0, v1) = 0) | ( ~ (v8 = 0) & % 12.29/2.41 unorthogonal_lines(v1, v2) = v8) | ( ~ (v7 = 0) & convergent_lines(v1, % 12.29/2.41 v2) = v7))) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: any] : % 12.29/2.41 ! [v4: any] : ( ~ (unorthogonal_lines(v0, v2) = v4) | ~ % 12.29/2.41 (convergent_lines(v0, v1) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? % 12.29/2.41 [v5: int] : ? [v6: int] : ? [v7: int] : ? [v8: int] : ((v6 = 0 & v4 = 0 & % 12.29/2.41 convergent_lines(v0, v2) = 0) | (v5 = 0 & v3 = 0 & % 12.29/2.41 unorthogonal_lines(v0, v1) = 0) | ( ~ (v8 = 0) & unorthogonal_lines(v1, % 12.29/2.41 v2) = v8) | ( ~ (v7 = 0) & convergent_lines(v1, v2) = v7))) & ! [v0: % 12.29/2.41 $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: any] : ! [v4: any] : ( ~ % 12.29/2.41 (unorthogonal_lines(v0, v1) = v3) | ~ (convergent_lines(v0, v2) = v4) | ~ % 12.29/2.41 $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v5: int] : ? [v6: int] : ? [v7: int] % 12.29/2.41 : ? [v8: int] : ((v6 = 0 & v4 = 0 & unorthogonal_lines(v0, v2) = 0) | (v5 = % 12.29/2.41 0 & v3 = 0 & convergent_lines(v0, v1) = 0) | ( ~ (v8 = 0) & % 12.29/2.41 unorthogonal_lines(v1, v2) = v8) | ( ~ (v7 = 0) & convergent_lines(v1, % 12.29/2.41 v2) = v7))) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: any] : % 12.29/2.41 ! [v4: any] : ( ~ (convergent_lines(v0, v2) = v4) | ~ (convergent_lines(v0, % 12.29/2.41 v1) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v5: int] : ? [v6: % 12.29/2.41 int] : ? [v7: int] : ? [v8: int] : ((v6 = 0 & v4 = 0 & % 12.29/2.41 unorthogonal_lines(v0, v2) = 0) | (v5 = 0 & v3 = 0 & % 12.29/2.41 unorthogonal_lines(v0, v1) = 0) | ( ~ (v8 = 0) & unorthogonal_lines(v1, % 12.29/2.41 v2) = v8) | ( ~ (v7 = 0) & convergent_lines(v1, v2) = v7))) & ! [v0: % 12.29/2.41 $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: any] : ( ~ (unorthogonal_lines(v1, % 12.29/2.41 v2) = 0) | ~ (unorthogonal_lines(v0, v2) = v3) | ~ $i(v2) | ~ $i(v1) % 12.29/2.41 | ~ $i(v0) | ? [v4: int] : ? [v5: int] : ? [v6: int] : ? [v7: int] : % 12.29/2.41 ((v6 = 0 & v3 = 0 & convergent_lines(v0, v2) = 0) | (v5 = 0 & v4 = 0 & % 12.29/2.41 unorthogonal_lines(v0, v1) = 0 & convergent_lines(v0, v1) = 0) | ( ~ (v7 % 12.29/2.41 = 0) & convergent_lines(v1, v2) = v7))) & ! [v0: $i] : ! [v1: $i] : % 12.29/2.41 ! [v2: $i] : ! [v3: any] : ( ~ (unorthogonal_lines(v1, v2) = 0) | ~ % 12.29/2.41 (unorthogonal_lines(v0, v1) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? % 12.29/2.41 [v4: int] : ? [v5: int] : ? [v6: int] : ? [v7: int] : ((v6 = 0 & v5 = 0 & % 12.29/2.41 unorthogonal_lines(v0, v2) = 0 & convergent_lines(v0, v2) = 0) | (v4 = 0 % 12.29/2.41 & v3 = 0 & convergent_lines(v0, v1) = 0) | ( ~ (v7 = 0) & % 12.29/2.41 convergent_lines(v1, v2) = v7))) & ! [v0: $i] : ! [v1: $i] : ! [v2: % 12.29/2.41 $i] : ! [v3: any] : ( ~ (unorthogonal_lines(v1, v2) = 0) | ~ % 12.29/2.41 (convergent_lines(v0, v2) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? % 12.29/2.41 [v4: int] : ? [v5: int] : ? [v6: int] : ? [v7: int] : ((v6 = 0 & v3 = 0 & % 12.29/2.41 unorthogonal_lines(v0, v2) = 0) | (v5 = 0 & v4 = 0 & % 12.29/2.41 unorthogonal_lines(v0, v1) = 0 & convergent_lines(v0, v1) = 0) | ( ~ (v7 % 12.29/2.41 = 0) & convergent_lines(v1, v2) = v7))) & ! [v0: $i] : ! [v1: $i] : % 12.29/2.41 ! [v2: $i] : ! [v3: any] : ( ~ (unorthogonal_lines(v1, v2) = 0) | ~ % 12.29/2.41 (convergent_lines(v0, v1) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? % 12.29/2.41 [v4: int] : ? [v5: int] : ? [v6: int] : ? [v7: int] : ((v6 = 0 & v5 = 0 & % 12.29/2.41 unorthogonal_lines(v0, v2) = 0 & convergent_lines(v0, v2) = 0) | (v4 = 0 % 12.29/2.41 & v3 = 0 & unorthogonal_lines(v0, v1) = 0) | ( ~ (v7 = 0) & % 12.29/2.41 convergent_lines(v1, v2) = v7))) & ! [v0: $i] : ! [v1: $i] : ! [v2: % 12.29/2.41 $i] : ! [v3: any] : ( ~ (unorthogonal_lines(v0, v2) = v3) | ~ % 12.29/2.41 (convergent_lines(v1, v2) = 0) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v4: % 12.29/2.41 int] : ? [v5: int] : ? [v6: int] : ? [v7: int] : ((v6 = 0 & v3 = 0 & % 12.29/2.41 convergent_lines(v0, v2) = 0) | (v5 = 0 & v4 = 0 & % 12.29/2.41 unorthogonal_lines(v0, v1) = 0 & convergent_lines(v0, v1) = 0) | ( ~ (v7 % 12.29/2.42 = 0) & unorthogonal_lines(v1, v2) = v7))) & ! [v0: $i] : ! [v1: $i] % 12.29/2.42 : ! [v2: $i] : ! [v3: any] : ( ~ (unorthogonal_lines(v0, v1) = v3) | ~ % 12.29/2.42 (convergent_lines(v1, v2) = 0) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v4: % 12.29/2.42 int] : ? [v5: int] : ? [v6: int] : ? [v7: int] : ((v6 = 0 & v5 = 0 & % 12.29/2.42 unorthogonal_lines(v0, v2) = 0 & convergent_lines(v0, v2) = 0) | (v4 = 0 % 12.29/2.42 & v3 = 0 & convergent_lines(v0, v1) = 0) | ( ~ (v7 = 0) & % 12.29/2.42 unorthogonal_lines(v1, v2) = v7))) & ! [v0: $i] : ! [v1: $i] : ! [v2: % 12.29/2.42 $i] : ! [v3: any] : ( ~ (convergent_lines(v1, v2) = 0) | ~ % 12.29/2.42 (convergent_lines(v0, v2) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? % 12.29/2.42 [v4: int] : ? [v5: int] : ? [v6: int] : ? [v7: int] : ((v6 = 0 & v3 = 0 & % 12.29/2.42 unorthogonal_lines(v0, v2) = 0) | (v5 = 0 & v4 = 0 & % 12.29/2.42 unorthogonal_lines(v0, v1) = 0 & convergent_lines(v0, v1) = 0) | ( ~ (v7 % 12.29/2.42 = 0) & unorthogonal_lines(v1, v2) = v7))) & ! [v0: $i] : ! [v1: $i] % 12.29/2.42 : ! [v2: $i] : ! [v3: any] : ( ~ (convergent_lines(v1, v2) = 0) | ~ % 12.29/2.42 (convergent_lines(v0, v1) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? % 12.29/2.42 [v4: int] : ? [v5: int] : ? [v6: int] : ? [v7: int] : ((v6 = 0 & v5 = 0 & % 12.29/2.42 unorthogonal_lines(v0, v2) = 0 & convergent_lines(v0, v2) = 0) | (v4 = 0 % 12.29/2.42 & v3 = 0 & unorthogonal_lines(v0, v1) = 0) | ( ~ (v7 = 0) & % 12.29/2.42 unorthogonal_lines(v1, v2) = v7))) % 12.29/2.42 % 12.29/2.42 (function-axioms) % 12.29/2.42 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 12.29/2.42 [v3: $i] : (v1 = v0 | ~ (unorthogonal_lines(v3, v2) = v1) | ~ % 12.29/2.42 (unorthogonal_lines(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] % 12.29/2.42 : ! [v3: $i] : (v1 = v0 | ~ (intersection_point(v3, v2) = v1) | ~ % 12.29/2.42 (intersection_point(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] % 12.29/2.42 : ! [v3: $i] : (v1 = v0 | ~ (line_connecting(v3, v2) = v1) | ~ % 12.29/2.42 (line_connecting(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 12.29/2.42 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 12.29/2.42 (apart_point_and_line(v3, v2) = v1) | ~ (apart_point_and_line(v3, v2) = % 12.29/2.42 v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 12.29/2.42 $i] : ! [v3: $i] : (v1 = v0 | ~ (convergent_lines(v3, v2) = v1) | ~ % 12.29/2.42 (convergent_lines(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 12.29/2.42 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 12.29/2.42 (distinct_lines(v3, v2) = v1) | ~ (distinct_lines(v3, v2) = v0)) & ! [v0: % 12.29/2.42 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 12.29/2.42 : (v1 = v0 | ~ (distinct_points(v3, v2) = v1) | ~ (distinct_points(v3, v2) = % 12.29/2.42 v0)) % 12.29/2.42 % 12.29/2.42 Further assumptions not needed in the proof: % 12.29/2.42 -------------------------------------------- % 12.29/2.42 apart1, apart2, apart3, apart4, apart5, ceq1, ceq2, ceq3, ci1, ci2, ci3, ci4, % 12.29/2.42 couo1, cu1 % 12.29/2.42 % 12.29/2.42 Those formulas are unsatisfiable: % 12.29/2.42 --------------------------------- % 12.29/2.42 % 12.29/2.42 Begin of proof % 12.29/2.42 | % 12.29/2.42 | ALPHA: (ax6) implies: % 12.29/2.43 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ % 12.29/2.43 | (convergent_lines(v0, v2) = v3) | ~ (convergent_lines(v0, v1) = 0) | % 12.29/2.43 | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | convergent_lines(v1, v2) = 0) % 12.29/2.43 | % 12.29/2.43 | ALPHA: (coipo1) implies: % 12.29/2.43 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ % 12.29/2.43 | (unorthogonal_lines(v0, v1) = v2) | ~ $i(v1) | ~ $i(v0) | % 12.29/2.43 | convergent_lines(v0, v1) = 0) % 12.29/2.43 | % 12.29/2.43 | ALPHA: (cotno1) implies: % 12.29/2.43 | (3) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: any] : ( ~ % 12.29/2.43 | (unorthogonal_lines(v1, v2) = 0) | ~ (convergent_lines(v0, v2) = v3) % 12.29/2.43 | | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v4: int] : ? [v5: int] : % 12.29/2.43 | ? [v6: int] : ? [v7: int] : ((v6 = 0 & v3 = 0 & % 12.29/2.43 | unorthogonal_lines(v0, v2) = 0) | (v5 = 0 & v4 = 0 & % 12.29/2.43 | unorthogonal_lines(v0, v1) = 0 & convergent_lines(v0, v1) = 0) | % 12.29/2.43 | ( ~ (v7 = 0) & convergent_lines(v1, v2) = v7))) % 12.29/2.43 | (4) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: any] : ( ~ % 12.29/2.43 | (unorthogonal_lines(v1, v2) = 0) | ~ (unorthogonal_lines(v0, v1) = % 12.29/2.43 | v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v4: int] : ? [v5: % 12.29/2.43 | int] : ? [v6: int] : ? [v7: int] : ((v6 = 0 & v5 = 0 & % 12.29/2.43 | unorthogonal_lines(v0, v2) = 0 & convergent_lines(v0, v2) = 0) | % 12.29/2.43 | (v4 = 0 & v3 = 0 & convergent_lines(v0, v1) = 0) | ( ~ (v7 = 0) & % 12.29/2.43 | convergent_lines(v1, v2) = v7))) % 12.29/2.44 | (5) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: any] : ! [v4: any] : % 12.29/2.44 | ( ~ (unorthogonal_lines(v0, v1) = v3) | ~ (convergent_lines(v0, v2) = % 12.29/2.44 | v4) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v5: int] : ? [v6: % 12.29/2.44 | int] : ? [v7: int] : ? [v8: int] : ((v6 = 0 & v4 = 0 & % 12.29/2.44 | unorthogonal_lines(v0, v2) = 0) | (v5 = 0 & v3 = 0 & % 12.29/2.44 | convergent_lines(v0, v1) = 0) | ( ~ (v8 = 0) & % 12.29/2.44 | unorthogonal_lines(v1, v2) = v8) | ( ~ (v7 = 0) & % 12.29/2.44 | convergent_lines(v1, v2) = v7))) % 12.29/2.44 | % 12.29/2.44 | ALPHA: (function-axioms) implies: % 12.29/2.44 | (6) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 12.29/2.44 | ! [v3: $i] : (v1 = v0 | ~ (convergent_lines(v3, v2) = v1) | ~ % 12.29/2.44 | (convergent_lines(v3, v2) = v0)) % 12.29/2.44 | (7) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 12.29/2.44 | ! [v3: $i] : (v1 = v0 | ~ (unorthogonal_lines(v3, v2) = v1) | ~ % 12.29/2.44 | (unorthogonal_lines(v3, v2) = v0)) % 12.29/2.44 | % 12.29/2.44 | DELTA: instantiating (con) with fresh symbols all_20_0, all_20_1, all_20_2, % 12.29/2.44 | all_20_3, all_20_4 gives: % 12.29/2.44 | (8) ~ (all_20_0 = 0) & ~ (all_20_1 = 0) & unorthogonal_lines(all_20_3, % 12.29/2.44 | all_20_2) = 0 & unorthogonal_lines(all_20_4, all_20_3) = all_20_1 & % 12.29/2.44 | convergent_lines(all_20_4, all_20_2) = all_20_0 & $i(all_20_2) & % 12.29/2.44 | $i(all_20_3) & $i(all_20_4) % 12.29/2.44 | % 12.29/2.44 | ALPHA: (8) implies: % 12.29/2.44 | (9) ~ (all_20_1 = 0) % 12.29/2.44 | (10) ~ (all_20_0 = 0) % 12.29/2.44 | (11) $i(all_20_4) % 12.29/2.44 | (12) $i(all_20_3) % 12.29/2.44 | (13) $i(all_20_2) % 12.29/2.44 | (14) convergent_lines(all_20_4, all_20_2) = all_20_0 % 12.29/2.44 | (15) unorthogonal_lines(all_20_4, all_20_3) = all_20_1 % 12.29/2.44 | (16) unorthogonal_lines(all_20_3, all_20_2) = 0 % 12.29/2.44 | % 12.29/2.44 | GROUND_INST: instantiating (5) with all_20_4, all_20_3, all_20_2, all_20_1, % 12.29/2.44 | all_20_0, simplifying with (11), (12), (13), (14), (15) gives: % 12.29/2.44 | (17) ? [v0: int] : ? [v1: int] : ? [v2: int] : ? [v3: int] : ((v1 = 0 & % 12.29/2.44 | all_20_0 = 0 & unorthogonal_lines(all_20_4, all_20_2) = 0) | (v0 = % 12.29/2.44 | 0 & all_20_1 = 0 & convergent_lines(all_20_4, all_20_3) = 0) | ( ~ % 12.29/2.44 | (v3 = 0) & unorthogonal_lines(all_20_3, all_20_2) = v3) | ( ~ (v2 % 12.29/2.44 | = 0) & convergent_lines(all_20_3, all_20_2) = v2)) % 12.29/2.44 | % 12.29/2.44 | GROUND_INST: instantiating (2) with all_20_4, all_20_3, all_20_1, simplifying % 12.29/2.44 | with (11), (12), (15) gives: % 12.29/2.44 | (18) all_20_1 = 0 | convergent_lines(all_20_4, all_20_3) = 0 % 12.29/2.44 | % 12.29/2.44 | GROUND_INST: instantiating (4) with all_20_4, all_20_3, all_20_2, all_20_1, % 12.29/2.44 | simplifying with (11), (12), (13), (15), (16) gives: % 12.29/2.45 | (19) ? [v0: int] : ? [v1: int] : ? [v2: int] : ? [v3: int] : ((v2 = 0 & % 12.29/2.45 | v1 = 0 & unorthogonal_lines(all_20_4, all_20_2) = 0 & % 12.29/2.45 | convergent_lines(all_20_4, all_20_2) = 0) | (v0 = 0 & all_20_1 = 0 % 12.29/2.45 | & convergent_lines(all_20_4, all_20_3) = 0) | ( ~ (v3 = 0) & % 12.29/2.45 | convergent_lines(all_20_3, all_20_2) = v3)) % 12.29/2.45 | % 12.29/2.45 | GROUND_INST: instantiating (3) with all_20_4, all_20_3, all_20_2, all_20_0, % 12.29/2.45 | simplifying with (11), (12), (13), (14), (16) gives: % 12.29/2.45 | (20) ? [v0: int] : ? [v1: int] : ? [v2: int] : ? [v3: int] : ((v2 = 0 & % 12.29/2.45 | all_20_0 = 0 & unorthogonal_lines(all_20_4, all_20_2) = 0) | (v1 = % 12.29/2.45 | 0 & v0 = 0 & unorthogonal_lines(all_20_4, all_20_3) = 0 & % 12.29/2.45 | convergent_lines(all_20_4, all_20_3) = 0) | ( ~ (v3 = 0) & % 12.29/2.45 | convergent_lines(all_20_3, all_20_2) = v3)) % 12.29/2.45 | % 12.29/2.45 | DELTA: instantiating (20) with fresh symbols all_29_0, all_29_1, all_29_2, % 12.29/2.45 | all_29_3 gives: % 12.29/2.45 | (21) (all_29_1 = 0 & all_20_0 = 0 & unorthogonal_lines(all_20_4, all_20_2) % 12.29/2.45 | = 0) | (all_29_2 = 0 & all_29_3 = 0 & unorthogonal_lines(all_20_4, % 12.29/2.45 | all_20_3) = 0 & convergent_lines(all_20_4, all_20_3) = 0) | ( ~ % 12.29/2.45 | (all_29_0 = 0) & convergent_lines(all_20_3, all_20_2) = all_29_0) % 12.29/2.45 | % 12.29/2.45 | DELTA: instantiating (19) with fresh symbols all_30_0, all_30_1, all_30_2, % 12.29/2.45 | all_30_3 gives: % 12.29/2.45 | (22) (all_30_1 = 0 & all_30_2 = 0 & unorthogonal_lines(all_20_4, all_20_2) % 12.29/2.45 | = 0 & convergent_lines(all_20_4, all_20_2) = 0) | (all_30_3 = 0 & % 12.29/2.45 | all_20_1 = 0 & convergent_lines(all_20_4, all_20_3) = 0) | ( ~ % 12.29/2.45 | (all_30_0 = 0) & convergent_lines(all_20_3, all_20_2) = all_30_0) % 12.29/2.45 | % 12.29/2.45 | DELTA: instantiating (17) with fresh symbols all_31_0, all_31_1, all_31_2, % 12.29/2.45 | all_31_3 gives: % 12.29/2.45 | (23) (all_31_2 = 0 & all_20_0 = 0 & unorthogonal_lines(all_20_4, all_20_2) % 12.29/2.45 | = 0) | (all_31_3 = 0 & all_20_1 = 0 & convergent_lines(all_20_4, % 12.29/2.45 | all_20_3) = 0) | ( ~ (all_31_0 = 0) & unorthogonal_lines(all_20_3, % 12.29/2.45 | all_20_2) = all_31_0) | ( ~ (all_31_1 = 0) & % 12.29/2.45 | convergent_lines(all_20_3, all_20_2) = all_31_1) % 12.29/2.45 | % 12.29/2.45 | BETA: splitting (18) gives: % 12.29/2.45 | % 12.29/2.45 | Case 1: % 12.29/2.45 | | % 12.29/2.45 | | (24) convergent_lines(all_20_4, all_20_3) = 0 % 12.29/2.45 | | % 12.29/2.45 | | BETA: splitting (21) gives: % 12.29/2.45 | | % 12.29/2.45 | | Case 1: % 12.29/2.45 | | | % 12.29/2.45 | | | (25) all_29_1 = 0 & all_20_0 = 0 & unorthogonal_lines(all_20_4, % 12.29/2.45 | | | all_20_2) = 0 % 12.29/2.45 | | | % 12.29/2.45 | | | ALPHA: (25) implies: % 12.29/2.45 | | | (26) all_20_0 = 0 % 12.29/2.45 | | | % 12.29/2.45 | | | REDUCE: (10), (26) imply: % 12.29/2.45 | | | (27) $false % 12.29/2.45 | | | % 12.29/2.45 | | | CLOSE: (27) is inconsistent. % 12.29/2.45 | | | % 12.29/2.45 | | Case 2: % 12.29/2.45 | | | % 12.29/2.45 | | | (28) (all_29_2 = 0 & all_29_3 = 0 & unorthogonal_lines(all_20_4, % 12.29/2.45 | | | all_20_3) = 0 & convergent_lines(all_20_4, all_20_3) = 0) | ( % 12.29/2.45 | | | ~ (all_29_0 = 0) & convergent_lines(all_20_3, all_20_2) = % 12.29/2.45 | | | all_29_0) % 12.29/2.45 | | | % 12.29/2.45 | | | BETA: splitting (28) gives: % 12.29/2.45 | | | % 12.29/2.45 | | | Case 1: % 12.29/2.45 | | | | % 12.29/2.45 | | | | (29) all_29_2 = 0 & all_29_3 = 0 & unorthogonal_lines(all_20_4, % 12.29/2.45 | | | | all_20_3) = 0 & convergent_lines(all_20_4, all_20_3) = 0 % 12.29/2.45 | | | | % 12.29/2.45 | | | | ALPHA: (29) implies: % 12.29/2.46 | | | | (30) unorthogonal_lines(all_20_4, all_20_3) = 0 % 12.29/2.46 | | | | % 12.29/2.46 | | | | GROUND_INST: instantiating (7) with all_20_1, 0, all_20_3, all_20_4, % 12.29/2.46 | | | | simplifying with (15), (30) gives: % 12.29/2.46 | | | | (31) all_20_1 = 0 % 12.29/2.46 | | | | % 12.29/2.46 | | | | REDUCE: (9), (31) imply: % 12.29/2.46 | | | | (32) $false % 12.29/2.46 | | | | % 12.29/2.46 | | | | CLOSE: (32) is inconsistent. % 12.29/2.46 | | | | % 12.29/2.46 | | | Case 2: % 12.29/2.46 | | | | % 12.29/2.46 | | | | (33) ~ (all_29_0 = 0) & convergent_lines(all_20_3, all_20_2) = % 12.29/2.46 | | | | all_29_0 % 12.29/2.46 | | | | % 12.29/2.46 | | | | ALPHA: (33) implies: % 12.29/2.46 | | | | (34) ~ (all_29_0 = 0) % 12.29/2.46 | | | | (35) convergent_lines(all_20_3, all_20_2) = all_29_0 % 12.29/2.46 | | | | % 12.29/2.46 | | | | BETA: splitting (23) gives: % 12.29/2.46 | | | | % 12.29/2.46 | | | | Case 1: % 12.29/2.46 | | | | | % 12.29/2.46 | | | | | (36) (all_31_2 = 0 & all_20_0 = 0 & unorthogonal_lines(all_20_4, % 12.29/2.46 | | | | | all_20_2) = 0) | (all_31_3 = 0 & all_20_1 = 0 & % 12.29/2.46 | | | | | convergent_lines(all_20_4, all_20_3) = 0) % 12.29/2.46 | | | | | % 12.29/2.46 | | | | | BETA: splitting (36) gives: % 12.29/2.46 | | | | | % 12.29/2.46 | | | | | Case 1: % 12.29/2.46 | | | | | | % 12.29/2.46 | | | | | | (37) all_31_2 = 0 & all_20_0 = 0 & unorthogonal_lines(all_20_4, % 12.29/2.46 | | | | | | all_20_2) = 0 % 12.29/2.46 | | | | | | % 12.29/2.46 | | | | | | ALPHA: (37) implies: % 12.29/2.46 | | | | | | (38) all_20_0 = 0 % 12.29/2.46 | | | | | | % 12.29/2.46 | | | | | | REDUCE: (10), (38) imply: % 12.29/2.46 | | | | | | (39) $false % 12.29/2.46 | | | | | | % 12.29/2.46 | | | | | | CLOSE: (39) is inconsistent. % 12.29/2.46 | | | | | | % 12.29/2.46 | | | | | Case 2: % 12.29/2.46 | | | | | | % 12.29/2.46 | | | | | | (40) all_31_3 = 0 & all_20_1 = 0 & convergent_lines(all_20_4, % 12.29/2.46 | | | | | | all_20_3) = 0 % 12.29/2.46 | | | | | | % 12.29/2.46 | | | | | | ALPHA: (40) implies: % 12.29/2.46 | | | | | | (41) all_20_1 = 0 % 12.29/2.46 | | | | | | % 12.29/2.46 | | | | | | REDUCE: (9), (41) imply: % 12.29/2.46 | | | | | | (42) $false % 12.29/2.46 | | | | | | % 12.29/2.46 | | | | | | CLOSE: (42) is inconsistent. % 12.29/2.46 | | | | | | % 12.29/2.46 | | | | | End of split % 12.29/2.46 | | | | | % 12.29/2.46 | | | | Case 2: % 12.29/2.46 | | | | | % 12.29/2.46 | | | | | (43) ( ~ (all_31_0 = 0) & unorthogonal_lines(all_20_3, all_20_2) = % 12.29/2.46 | | | | | all_31_0) | ( ~ (all_31_1 = 0) & convergent_lines(all_20_3, % 12.29/2.46 | | | | | all_20_2) = all_31_1) % 12.29/2.46 | | | | | % 12.29/2.46 | | | | | BETA: splitting (43) gives: % 12.29/2.46 | | | | | % 12.29/2.46 | | | | | Case 1: % 12.29/2.46 | | | | | | % 12.29/2.46 | | | | | | (44) ~ (all_31_0 = 0) & unorthogonal_lines(all_20_3, all_20_2) = % 12.29/2.46 | | | | | | all_31_0 % 12.29/2.46 | | | | | | % 12.29/2.46 | | | | | | ALPHA: (44) implies: % 12.29/2.46 | | | | | | (45) ~ (all_31_0 = 0) % 12.29/2.46 | | | | | | (46) unorthogonal_lines(all_20_3, all_20_2) = all_31_0 % 12.29/2.46 | | | | | | % 12.29/2.46 | | | | | | GROUND_INST: instantiating (7) with 0, all_31_0, all_20_2, all_20_3, % 12.29/2.46 | | | | | | simplifying with (16), (46) gives: % 12.29/2.46 | | | | | | (47) all_31_0 = 0 % 12.29/2.46 | | | | | | % 12.29/2.46 | | | | | | REDUCE: (45), (47) imply: % 12.29/2.46 | | | | | | (48) $false % 12.29/2.46 | | | | | | % 12.29/2.46 | | | | | | CLOSE: (48) is inconsistent. % 12.29/2.46 | | | | | | % 12.29/2.46 | | | | | Case 2: % 12.29/2.46 | | | | | | % 12.29/2.46 | | | | | | (49) ~ (all_31_1 = 0) & convergent_lines(all_20_3, all_20_2) = % 12.29/2.46 | | | | | | all_31_1 % 12.29/2.46 | | | | | | % 12.29/2.46 | | | | | | ALPHA: (49) implies: % 12.29/2.46 | | | | | | (50) convergent_lines(all_20_3, all_20_2) = all_31_1 % 12.29/2.46 | | | | | | % 12.29/2.46 | | | | | | BETA: splitting (22) gives: % 12.29/2.46 | | | | | | % 12.29/2.46 | | | | | | Case 1: % 12.29/2.46 | | | | | | | % 12.29/2.46 | | | | | | | (51) all_30_1 = 0 & all_30_2 = 0 & unorthogonal_lines(all_20_4, % 12.29/2.46 | | | | | | | all_20_2) = 0 & convergent_lines(all_20_4, all_20_2) = 0 % 12.29/2.46 | | | | | | | % 12.29/2.46 | | | | | | | ALPHA: (51) implies: % 12.29/2.46 | | | | | | | (52) convergent_lines(all_20_4, all_20_2) = 0 % 12.29/2.46 | | | | | | | % 12.29/2.46 | | | | | | | GROUND_INST: instantiating (6) with all_20_0, 0, all_20_2, % 12.29/2.46 | | | | | | | all_20_4, simplifying with (14), (52) gives: % 12.29/2.46 | | | | | | | (53) all_20_0 = 0 % 12.29/2.47 | | | | | | | % 12.29/2.47 | | | | | | | REDUCE: (10), (53) imply: % 12.29/2.47 | | | | | | | (54) $false % 12.29/2.47 | | | | | | | % 12.29/2.47 | | | | | | | CLOSE: (54) is inconsistent. % 12.29/2.47 | | | | | | | % 12.29/2.47 | | | | | | Case 2: % 12.29/2.47 | | | | | | | % 12.29/2.47 | | | | | | | (55) (all_30_3 = 0 & all_20_1 = 0 & convergent_lines(all_20_4, % 12.29/2.47 | | | | | | | all_20_3) = 0) | ( ~ (all_30_0 = 0) & % 12.29/2.47 | | | | | | | convergent_lines(all_20_3, all_20_2) = all_30_0) % 12.29/2.47 | | | | | | | % 12.29/2.47 | | | | | | | BETA: splitting (55) gives: % 12.29/2.47 | | | | | | | % 12.29/2.47 | | | | | | | Case 1: % 12.29/2.47 | | | | | | | | % 12.29/2.47 | | | | | | | | (56) all_30_3 = 0 & all_20_1 = 0 & convergent_lines(all_20_4, % 12.29/2.47 | | | | | | | | all_20_3) = 0 % 12.29/2.47 | | | | | | | | % 12.29/2.47 | | | | | | | | ALPHA: (56) implies: % 12.29/2.47 | | | | | | | | (57) all_20_1 = 0 % 12.29/2.47 | | | | | | | | % 12.29/2.47 | | | | | | | | REDUCE: (9), (57) imply: % 12.29/2.47 | | | | | | | | (58) $false % 12.29/2.47 | | | | | | | | % 12.29/2.47 | | | | | | | | CLOSE: (58) is inconsistent. % 12.29/2.47 | | | | | | | | % 12.29/2.47 | | | | | | | Case 2: % 12.29/2.47 | | | | | | | | % 12.29/2.47 | | | | | | | | (59) ~ (all_30_0 = 0) & convergent_lines(all_20_3, all_20_2) % 12.29/2.47 | | | | | | | | = all_30_0 % 12.29/2.47 | | | | | | | | % 12.29/2.47 | | | | | | | | ALPHA: (59) implies: % 12.29/2.47 | | | | | | | | (60) convergent_lines(all_20_3, all_20_2) = all_30_0 % 12.29/2.47 | | | | | | | | % 12.50/2.47 | | | | | | | | GROUND_INST: instantiating (1) with all_20_4, all_20_3, % 12.50/2.47 | | | | | | | | all_20_2, all_20_0, simplifying with (11), (12), % 12.50/2.47 | | | | | | | | (13), (14), (24) gives: % 12.50/2.47 | | | | | | | | (61) all_20_0 = 0 | convergent_lines(all_20_3, all_20_2) = 0 % 12.50/2.47 | | | | | | | | % 12.50/2.47 | | | | | | | | BETA: splitting (61) gives: % 12.50/2.47 | | | | | | | | % 12.50/2.47 | | | | | | | | Case 1: % 12.50/2.47 | | | | | | | | | % 12.50/2.47 | | | | | | | | | (62) convergent_lines(all_20_3, all_20_2) = 0 % 12.50/2.47 | | | | | | | | | % 12.50/2.47 | | | | | | | | | GROUND_INST: instantiating (6) with all_29_0, all_30_0, % 12.50/2.47 | | | | | | | | | all_20_2, all_20_3, simplifying with (35), (60) % 12.50/2.47 | | | | | | | | | gives: % 12.50/2.47 | | | | | | | | | (63) all_30_0 = all_29_0 % 12.50/2.47 | | | | | | | | | % 12.50/2.47 | | | | | | | | | GROUND_INST: instantiating (6) with all_30_0, all_31_1, % 12.50/2.47 | | | | | | | | | all_20_2, all_20_3, simplifying with (50), (60) % 12.50/2.47 | | | | | | | | | gives: % 12.50/2.47 | | | | | | | | | (64) all_31_1 = all_30_0 % 12.50/2.47 | | | | | | | | | % 12.50/2.47 | | | | | | | | | GROUND_INST: instantiating (6) with 0, all_31_1, all_20_2, % 12.50/2.47 | | | | | | | | | all_20_3, simplifying with (50), (62) gives: % 12.50/2.47 | | | | | | | | | (65) all_31_1 = 0 % 12.50/2.47 | | | | | | | | | % 12.50/2.47 | | | | | | | | | COMBINE_EQS: (64), (65) imply: % 12.50/2.47 | | | | | | | | | (66) all_30_0 = 0 % 12.50/2.47 | | | | | | | | | % 12.50/2.47 | | | | | | | | | SIMP: (66) implies: % 12.50/2.47 | | | | | | | | | (67) all_30_0 = 0 % 12.50/2.47 | | | | | | | | | % 12.50/2.47 | | | | | | | | | COMBINE_EQS: (63), (67) imply: % 12.50/2.47 | | | | | | | | | (68) all_29_0 = 0 % 12.50/2.47 | | | | | | | | | % 12.50/2.47 | | | | | | | | | REDUCE: (34), (68) imply: % 12.50/2.47 | | | | | | | | | (69) $false % 12.50/2.47 | | | | | | | | | % 12.50/2.47 | | | | | | | | | CLOSE: (69) is inconsistent. % 12.50/2.47 | | | | | | | | | % 12.50/2.47 | | | | | | | | Case 2: % 12.50/2.47 | | | | | | | | | % 12.50/2.47 | | | | | | | | | (70) all_20_0 = 0 % 12.50/2.47 | | | | | | | | | % 12.50/2.47 | | | | | | | | | REDUCE: (10), (70) imply: % 12.50/2.47 | | | | | | | | | (71) $false % 12.50/2.47 | | | | | | | | | % 12.50/2.47 | | | | | | | | | CLOSE: (71) is inconsistent. % 12.50/2.47 | | | | | | | | | % 12.50/2.47 | | | | | | | | End of split % 12.50/2.47 | | | | | | | | % 12.50/2.47 | | | | | | | End of split % 12.50/2.47 | | | | | | | % 12.50/2.47 | | | | | | End of split % 12.50/2.47 | | | | | | % 12.50/2.47 | | | | | End of split % 12.50/2.47 | | | | | % 12.50/2.47 | | | | End of split % 12.50/2.47 | | | | % 12.50/2.47 | | | End of split % 12.50/2.47 | | | % 12.50/2.47 | | End of split % 12.50/2.47 | | % 12.50/2.47 | Case 2: % 12.50/2.47 | | % 12.50/2.47 | | (72) all_20_1 = 0 % 12.50/2.47 | | % 12.50/2.47 | | REDUCE: (9), (72) imply: % 12.50/2.47 | | (73) $false % 12.50/2.47 | | % 12.50/2.47 | | CLOSE: (73) is inconsistent. % 12.50/2.47 | | % 12.50/2.47 | End of split % 12.50/2.47 | % 12.50/2.47 End of proof % 12.50/2.47 % SZS output end Proof for theBenchmark % 12.50/2.47 % 12.50/2.47 1863ms %------------------------------------------------------------------------------