%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : GEO258+3 : TPTP v8.1.2. Released v4.0.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n004.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:49 EDT 2023 % Result : Theorem 8.61s 1.94s % Output : Proof 11.73s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : GEO258+3 : TPTP v8.1.2. Released v4.0.0. % 0.13/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.35 % Computer : n004.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 300 % 0.14/0.35 % DateTime : Tue Aug 29 23:01:07 EDT 2023 % 0.14/0.35 % CPUTime : % 0.20/0.62 ________ _____ % 0.20/0.62 ___ __ \_________(_)________________________________ % 0.20/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.62 % 0.20/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.62 (2023-06-19) % 0.20/0.62 % 0.20/0.62 (c) Philipp Rümmer, 2009-2023 % 0.20/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.62 Amanda Stjerna. % 0.20/0.62 Free software under BSD-3-Clause. % 0.20/0.62 % 0.20/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.62 % 0.20/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.63 Running up to 7 provers in parallel. % 0.20/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.40/1.17 Prover 4: Preprocessing ... % 3.40/1.18 Prover 1: Preprocessing ... % 3.40/1.21 Prover 3: Preprocessing ... % 3.40/1.21 Prover 2: Preprocessing ... % 3.40/1.21 Prover 0: Preprocessing ... % 3.40/1.21 Prover 5: Preprocessing ... % 3.40/1.21 Prover 6: Preprocessing ... % 7.22/1.69 Prover 5: Proving ... % 8.10/1.78 Prover 2: Proving ... % 8.10/1.81 Prover 6: Constructing countermodel ... % 8.10/1.81 Prover 1: Constructing countermodel ... % 8.61/1.88 Prover 3: Constructing countermodel ... % 8.61/1.94 Prover 6: proved (1295ms) % 8.61/1.94 % 8.61/1.94 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 8.61/1.94 % 8.61/1.95 Prover 2: stopped % 8.61/1.95 Prover 5: stopped % 8.61/1.96 Prover 3: stopped % 9.30/1.99 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 9.30/1.99 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 9.30/1.99 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 9.30/2.00 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 9.86/2.05 Prover 1: Found proof (size 39) % 9.86/2.05 Prover 1: proved (1406ms) % 9.86/2.07 Prover 8: Preprocessing ... % 9.86/2.07 Prover 10: Preprocessing ... % 9.86/2.09 Prover 11: Preprocessing ... % 9.86/2.10 Prover 7: Preprocessing ... % 10.49/2.12 Prover 4: Constructing countermodel ... % 10.49/2.12 Prover 10: stopped % 10.49/2.15 Prover 7: stopped % 10.49/2.17 Prover 4: stopped % 10.97/2.20 Prover 0: Proving ... % 10.97/2.21 Prover 11: stopped % 10.97/2.21 Prover 8: Warning: ignoring some quantifiers % 10.97/2.21 Prover 0: stopped % 10.97/2.22 Prover 8: Constructing countermodel ... % 10.97/2.23 Prover 8: stopped % 10.97/2.23 % 10.97/2.23 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 10.97/2.23 % 10.97/2.24 % SZS output start Proof for theBenchmark % 10.97/2.25 Assumptions after simplification: % 10.97/2.25 --------------------------------- % 10.97/2.25 % 10.97/2.25 (a9_defns) % 11.48/2.29 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: int] : (v4 = 0 % 11.48/2.29 | ~ (between_on_line(v0, v1, v2, v3) = v4) | ~ $i(v3) | ~ $i(v2) | ~ % 11.48/2.29 $i(v1) | ~ $i(v0) | ? [v5: any] : ? [v6: any] : ? [v7: any] : ? [v8: % 11.48/2.29 any] : (before_on_line(v0, v3, v2) = v7 & before_on_line(v0, v2, v3) = v6 % 11.48/2.29 & before_on_line(v0, v2, v1) = v8 & before_on_line(v0, v1, v2) = v5 & ( ~ % 11.48/2.29 (v8 = 0) | ~ (v7 = 0)) & ( ~ (v6 = 0) | ~ (v5 = 0)))) & ! [v0: $i] : % 11.48/2.29 ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ (between_on_line(v0, v1, v2, v3) % 11.48/2.29 = 0) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v4: any] : ? % 11.48/2.29 [v5: any] : ? [v6: any] : ? [v7: any] : (before_on_line(v0, v3, v2) = v6 & % 11.48/2.29 before_on_line(v0, v2, v3) = v5 & before_on_line(v0, v2, v1) = v7 & % 11.48/2.29 before_on_line(v0, v1, v2) = v4 & ((v7 = 0 & v6 = 0) | (v5 = 0 & v4 = % 11.48/2.29 0)))) % 11.48/2.29 % 11.48/2.29 (con) % 11.48/2.29 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: int] : ( ~ (v4 % 11.48/2.29 = 0) & between_on_line(v0, v3, v2, v1) = v4 & between_on_line(v0, v1, v2, % 11.48/2.29 v3) = 0 & $i(v3) & $i(v2) & $i(v1) & $i(v0)) % 11.48/2.29 % 11.48/2.29 (function-axioms) % 11.48/2.30 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 11.48/2.30 [v3: $i] : ! [v4: $i] : ! [v5: $i] : (v1 = v0 | ~ (between_on_line(v5, v4, % 11.48/2.30 v3, v2) = v1) | ~ (between_on_line(v5, v4, v3, v2) = v0)) & ! [v0: % 11.48/2.30 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 11.48/2.30 : ! [v4: $i] : (v1 = v0 | ~ (before_on_line(v4, v3, v2) = v1) | ~ % 11.48/2.30 (before_on_line(v4, v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 11.48/2.30 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ % 11.48/2.30 (divides_points(v4, v3, v2) = v1) | ~ (divides_points(v4, v3, v2) = v0)) & % 11.48/2.30 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 11.48/2.30 (parallel_through_point(v3, v2) = v1) | ~ (parallel_through_point(v3, v2) = % 11.48/2.30 v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | % 11.48/2.30 ~ (intersection_point(v3, v2) = v1) | ~ (intersection_point(v3, v2) = v0)) % 11.48/2.30 & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 11.48/2.30 [v3: $i] : (v1 = v0 | ~ (distinct_lines(v3, v2) = v1) | ~ % 11.48/2.30 (distinct_lines(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : % 11.48/2.30 ! [v3: $i] : (v1 = v0 | ~ (line_connecting(v3, v2) = v1) | ~ % 11.48/2.30 (line_connecting(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 11.48/2.30 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 11.48/2.30 (distinct_points(v3, v2) = v1) | ~ (distinct_points(v3, v2) = v0)) & ! % 11.48/2.30 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 11.48/2.30 $i] : (v1 = v0 | ~ (incident_point_and_line(v3, v2) = v1) | ~ % 11.48/2.30 (incident_point_and_line(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! % 11.48/2.30 [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 11.48/2.30 (convergent_lines(v3, v2) = v1) | ~ (convergent_lines(v3, v2) = v0)) & ! % 11.48/2.30 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 11.48/2.30 $i] : (v1 = v0 | ~ (apart_point_and_line(v3, v2) = v1) | ~ % 11.48/2.30 (apart_point_and_line(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 11.48/2.30 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 11.48/2.30 (equally_directed_opposite_lines(v3, v2) = v1) | ~ % 11.48/2.30 (equally_directed_opposite_lines(v3, v2) = v0)) & ! [v0: MultipleValueBool] % 11.48/2.30 : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 11.48/2.30 (equally_directed_lines(v3, v2) = v1) | ~ (equally_directed_lines(v3, v2) = % 11.48/2.30 v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 11.48/2.30 $i] : ! [v3: $i] : (v1 = v0 | ~ (left_convergent_lines(v3, v2) = v1) | ~ % 11.48/2.30 (left_convergent_lines(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 11.48/2.30 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 11.48/2.30 (right_convergent_lines(v3, v2) = v1) | ~ (right_convergent_lines(v3, v2) = % 11.48/2.30 v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 11.48/2.30 $i] : ! [v3: $i] : (v1 = v0 | ~ (left_apart_point(v3, v2) = v1) | ~ % 11.48/2.30 (left_apart_point(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 11.48/2.30 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 11.48/2.30 (right_apart_point(v3, v2) = v1) | ~ (right_apart_point(v3, v2) = v0)) & ! % 11.48/2.30 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 11.48/2.30 $i] : (v1 = v0 | ~ (unequally_directed_lines(v3, v2) = v1) | ~ % 11.48/2.30 (unequally_directed_lines(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! % 11.48/2.30 [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 11.48/2.30 (unequally_directed_opposite_lines(v3, v2) = v1) | ~ % 11.48/2.30 (unequally_directed_opposite_lines(v3, v2) = v0)) & ! [v0: % 11.48/2.30 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 11.48/2.30 ~ (point(v2) = v1) | ~ (point(v2) = v0)) & ! [v0: MultipleValueBool] : ! % 11.48/2.30 [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (line(v2) = v1) | ~ % 11.48/2.30 (line(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ % 11.48/2.30 (reverse_line(v2) = v1) | ~ (reverse_line(v2) = v0)) % 11.48/2.30 % 11.48/2.30 Further assumptions not needed in the proof: % 11.48/2.30 -------------------------------------------- % 11.48/2.30 a1_defns, a2_defns, a3_defns, a4_defns, a5_defns, a6_defns, a7_defns, a8_defns, % 11.48/2.30 ax10_basics, ax10_cons_objs, ax11_basics, ax1_basics, ax1_cons_objs, ax1_subs, % 11.48/2.30 ax1_uniq_cons, ax2_basics, ax2_cons_objs, ax2_subs, ax2_uniq_cons, ax3_basics, % 11.48/2.30 ax3_cons_objs, ax3_subs, ax4_basics, ax4_cons_objs, ax4_defns, ax5_basics, % 11.48/2.30 ax5_cons_objs, ax6_basics, ax6_cons_objs, ax7_basics, ax7_cons_objs, ax8_basics, % 11.48/2.30 ax8_cons_objs, ax9_basics, ax9_cons_objs % 11.48/2.30 % 11.48/2.30 Those formulas are unsatisfiable: % 11.48/2.30 --------------------------------- % 11.48/2.30 % 11.48/2.30 Begin of proof % 11.48/2.30 | % 11.48/2.30 | ALPHA: (a9_defns) implies: % 11.48/2.30 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ % 11.48/2.30 | (between_on_line(v0, v1, v2, v3) = 0) | ~ $i(v3) | ~ $i(v2) | ~ % 11.48/2.30 | $i(v1) | ~ $i(v0) | ? [v4: any] : ? [v5: any] : ? [v6: any] : ? % 11.48/2.30 | [v7: any] : (before_on_line(v0, v3, v2) = v6 & before_on_line(v0, v2, % 11.48/2.30 | v3) = v5 & before_on_line(v0, v2, v1) = v7 & before_on_line(v0, % 11.48/2.30 | v1, v2) = v4 & ((v7 = 0 & v6 = 0) | (v5 = 0 & v4 = 0)))) % 11.48/2.31 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: int] : % 11.48/2.31 | (v4 = 0 | ~ (between_on_line(v0, v1, v2, v3) = v4) | ~ $i(v3) | ~ % 11.48/2.31 | $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v5: any] : ? [v6: any] : ? % 11.48/2.31 | [v7: any] : ? [v8: any] : (before_on_line(v0, v3, v2) = v7 & % 11.48/2.31 | before_on_line(v0, v2, v3) = v6 & before_on_line(v0, v2, v1) = v8 & % 11.48/2.31 | before_on_line(v0, v1, v2) = v5 & ( ~ (v8 = 0) | ~ (v7 = 0)) & ( ~ % 11.48/2.31 | (v6 = 0) | ~ (v5 = 0)))) % 11.48/2.31 | % 11.48/2.31 | ALPHA: (function-axioms) implies: % 11.48/2.31 | (3) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 11.48/2.31 | ! [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (before_on_line(v4, v3, v2) = % 11.48/2.31 | v1) | ~ (before_on_line(v4, v3, v2) = v0)) % 11.48/2.31 | % 11.48/2.31 | DELTA: instantiating (con) with fresh symbols all_39_0, all_39_1, all_39_2, % 11.48/2.31 | all_39_3, all_39_4 gives: % 11.48/2.31 | (4) ~ (all_39_0 = 0) & between_on_line(all_39_4, all_39_1, all_39_2, % 11.48/2.31 | all_39_3) = all_39_0 & between_on_line(all_39_4, all_39_3, all_39_2, % 11.48/2.31 | all_39_1) = 0 & $i(all_39_1) & $i(all_39_2) & $i(all_39_3) & % 11.48/2.31 | $i(all_39_4) % 11.48/2.31 | % 11.48/2.31 | ALPHA: (4) implies: % 11.48/2.31 | (5) ~ (all_39_0 = 0) % 11.48/2.31 | (6) $i(all_39_4) % 11.48/2.31 | (7) $i(all_39_3) % 11.48/2.31 | (8) $i(all_39_2) % 11.48/2.31 | (9) $i(all_39_1) % 11.48/2.31 | (10) between_on_line(all_39_4, all_39_3, all_39_2, all_39_1) = 0 % 11.48/2.31 | (11) between_on_line(all_39_4, all_39_1, all_39_2, all_39_3) = all_39_0 % 11.48/2.31 | % 11.64/2.31 | GROUND_INST: instantiating (1) with all_39_4, all_39_3, all_39_2, all_39_1, % 11.64/2.31 | simplifying with (6), (7), (8), (9), (10) gives: % 11.64/2.31 | (12) ? [v0: any] : ? [v1: any] : ? [v2: any] : ? [v3: any] : % 11.64/2.31 | (before_on_line(all_39_4, all_39_1, all_39_2) = v2 & % 11.64/2.31 | before_on_line(all_39_4, all_39_2, all_39_1) = v1 & % 11.64/2.31 | before_on_line(all_39_4, all_39_2, all_39_3) = v3 & % 11.64/2.31 | before_on_line(all_39_4, all_39_3, all_39_2) = v0 & ((v3 = 0 & v2 = % 11.64/2.31 | 0) | (v1 = 0 & v0 = 0))) % 11.64/2.31 | % 11.64/2.31 | GROUND_INST: instantiating (2) with all_39_4, all_39_1, all_39_2, all_39_3, % 11.64/2.31 | all_39_0, simplifying with (6), (7), (8), (9), (11) gives: % 11.64/2.31 | (13) all_39_0 = 0 | ? [v0: any] : ? [v1: any] : ? [v2: any] : ? [v3: % 11.64/2.31 | any] : (before_on_line(all_39_4, all_39_1, all_39_2) = v0 & % 11.64/2.31 | before_on_line(all_39_4, all_39_2, all_39_1) = v3 & % 11.64/2.31 | before_on_line(all_39_4, all_39_2, all_39_3) = v1 & % 11.64/2.31 | before_on_line(all_39_4, all_39_3, all_39_2) = v2 & ( ~ (v3 = 0) | % 11.64/2.31 | ~ (v2 = 0)) & ( ~ (v1 = 0) | ~ (v0 = 0))) % 11.64/2.31 | % 11.64/2.31 | DELTA: instantiating (12) with fresh symbols all_46_0, all_46_1, all_46_2, % 11.64/2.31 | all_46_3 gives: % 11.64/2.31 | (14) before_on_line(all_39_4, all_39_1, all_39_2) = all_46_1 & % 11.64/2.31 | before_on_line(all_39_4, all_39_2, all_39_1) = all_46_2 & % 11.64/2.31 | before_on_line(all_39_4, all_39_2, all_39_3) = all_46_0 & % 11.64/2.31 | before_on_line(all_39_4, all_39_3, all_39_2) = all_46_3 & ((all_46_0 = % 11.64/2.31 | 0 & all_46_1 = 0) | (all_46_2 = 0 & all_46_3 = 0)) % 11.64/2.31 | % 11.64/2.31 | ALPHA: (14) implies: % 11.64/2.31 | (15) before_on_line(all_39_4, all_39_3, all_39_2) = all_46_3 % 11.64/2.31 | (16) before_on_line(all_39_4, all_39_2, all_39_3) = all_46_0 % 11.64/2.31 | (17) before_on_line(all_39_4, all_39_2, all_39_1) = all_46_2 % 11.64/2.31 | (18) before_on_line(all_39_4, all_39_1, all_39_2) = all_46_1 % 11.64/2.32 | (19) (all_46_0 = 0 & all_46_1 = 0) | (all_46_2 = 0 & all_46_3 = 0) % 11.64/2.32 | % 11.64/2.32 | BETA: splitting (19) gives: % 11.64/2.32 | % 11.64/2.32 | Case 1: % 11.64/2.32 | | % 11.64/2.32 | | (20) all_46_0 = 0 & all_46_1 = 0 % 11.64/2.32 | | % 11.64/2.32 | | ALPHA: (20) implies: % 11.64/2.32 | | (21) all_46_1 = 0 % 11.64/2.32 | | (22) all_46_0 = 0 % 11.64/2.32 | | % 11.64/2.32 | | REDUCE: (18), (21) imply: % 11.64/2.32 | | (23) before_on_line(all_39_4, all_39_1, all_39_2) = 0 % 11.64/2.32 | | % 11.64/2.32 | | REDUCE: (16), (22) imply: % 11.64/2.32 | | (24) before_on_line(all_39_4, all_39_2, all_39_3) = 0 % 11.64/2.32 | | % 11.64/2.32 | | BETA: splitting (13) gives: % 11.64/2.32 | | % 11.64/2.32 | | Case 1: % 11.64/2.32 | | | % 11.64/2.32 | | | (25) all_39_0 = 0 % 11.64/2.32 | | | % 11.64/2.32 | | | REDUCE: (5), (25) imply: % 11.64/2.32 | | | (26) $false % 11.64/2.32 | | | % 11.64/2.32 | | | CLOSE: (26) is inconsistent. % 11.64/2.32 | | | % 11.64/2.32 | | Case 2: % 11.64/2.32 | | | % 11.64/2.32 | | | (27) ? [v0: any] : ? [v1: any] : ? [v2: any] : ? [v3: any] : % 11.64/2.32 | | | (before_on_line(all_39_4, all_39_1, all_39_2) = v0 & % 11.64/2.32 | | | before_on_line(all_39_4, all_39_2, all_39_1) = v3 & % 11.64/2.32 | | | before_on_line(all_39_4, all_39_2, all_39_3) = v1 & % 11.64/2.32 | | | before_on_line(all_39_4, all_39_3, all_39_2) = v2 & ( ~ (v3 = 0) % 11.64/2.32 | | | | ~ (v2 = 0)) & ( ~ (v1 = 0) | ~ (v0 = 0))) % 11.64/2.32 | | | % 11.64/2.32 | | | DELTA: instantiating (27) with fresh symbols all_59_0, all_59_1, all_59_2, % 11.64/2.32 | | | all_59_3 gives: % 11.64/2.32 | | | (28) before_on_line(all_39_4, all_39_1, all_39_2) = all_59_3 & % 11.64/2.32 | | | before_on_line(all_39_4, all_39_2, all_39_1) = all_59_0 & % 11.64/2.32 | | | before_on_line(all_39_4, all_39_2, all_39_3) = all_59_2 & % 11.64/2.32 | | | before_on_line(all_39_4, all_39_3, all_39_2) = all_59_1 & ( ~ % 11.64/2.32 | | | (all_59_0 = 0) | ~ (all_59_1 = 0)) & ( ~ (all_59_2 = 0) | ~ % 11.64/2.32 | | | (all_59_3 = 0)) % 11.64/2.32 | | | % 11.64/2.32 | | | ALPHA: (28) implies: % 11.64/2.32 | | | (29) before_on_line(all_39_4, all_39_2, all_39_3) = all_59_2 % 11.64/2.32 | | | (30) before_on_line(all_39_4, all_39_1, all_39_2) = all_59_3 % 11.64/2.32 | | | (31) ~ (all_59_2 = 0) | ~ (all_59_3 = 0) % 11.64/2.32 | | | % 11.64/2.32 | | | GROUND_INST: instantiating (3) with 0, all_59_2, all_39_3, all_39_2, % 11.64/2.32 | | | all_39_4, simplifying with (24), (29) gives: % 11.64/2.32 | | | (32) all_59_2 = 0 % 11.64/2.32 | | | % 11.64/2.32 | | | GROUND_INST: instantiating (3) with 0, all_59_3, all_39_2, all_39_1, % 11.64/2.32 | | | all_39_4, simplifying with (23), (30) gives: % 11.64/2.32 | | | (33) all_59_3 = 0 % 11.64/2.32 | | | % 11.64/2.32 | | | BETA: splitting (31) gives: % 11.64/2.32 | | | % 11.64/2.32 | | | Case 1: % 11.64/2.32 | | | | % 11.64/2.32 | | | | (34) ~ (all_59_2 = 0) % 11.64/2.32 | | | | % 11.64/2.32 | | | | REDUCE: (32), (34) imply: % 11.64/2.32 | | | | (35) $false % 11.64/2.32 | | | | % 11.64/2.32 | | | | CLOSE: (35) is inconsistent. % 11.64/2.32 | | | | % 11.64/2.32 | | | Case 2: % 11.64/2.32 | | | | % 11.64/2.32 | | | | (36) ~ (all_59_3 = 0) % 11.64/2.32 | | | | % 11.64/2.32 | | | | REDUCE: (33), (36) imply: % 11.64/2.32 | | | | (37) $false % 11.64/2.32 | | | | % 11.64/2.32 | | | | CLOSE: (37) is inconsistent. % 11.64/2.32 | | | | % 11.64/2.32 | | | End of split % 11.64/2.32 | | | % 11.64/2.32 | | End of split % 11.64/2.32 | | % 11.64/2.32 | Case 2: % 11.64/2.32 | | % 11.64/2.32 | | (38) all_46_2 = 0 & all_46_3 = 0 % 11.64/2.32 | | % 11.64/2.32 | | ALPHA: (38) implies: % 11.64/2.32 | | (39) all_46_3 = 0 % 11.64/2.32 | | (40) all_46_2 = 0 % 11.64/2.32 | | % 11.64/2.32 | | REDUCE: (17), (40) imply: % 11.64/2.32 | | (41) before_on_line(all_39_4, all_39_2, all_39_1) = 0 % 11.64/2.32 | | % 11.64/2.32 | | REDUCE: (15), (39) imply: % 11.64/2.32 | | (42) before_on_line(all_39_4, all_39_3, all_39_2) = 0 % 11.64/2.32 | | % 11.64/2.32 | | BETA: splitting (13) gives: % 11.64/2.32 | | % 11.64/2.32 | | Case 1: % 11.64/2.32 | | | % 11.64/2.32 | | | (43) all_39_0 = 0 % 11.64/2.32 | | | % 11.64/2.32 | | | REDUCE: (5), (43) imply: % 11.64/2.32 | | | (44) $false % 11.64/2.32 | | | % 11.64/2.32 | | | CLOSE: (44) is inconsistent. % 11.64/2.32 | | | % 11.64/2.32 | | Case 2: % 11.64/2.32 | | | % 11.64/2.33 | | | (45) ? [v0: any] : ? [v1: any] : ? [v2: any] : ? [v3: any] : % 11.64/2.33 | | | (before_on_line(all_39_4, all_39_1, all_39_2) = v0 & % 11.64/2.33 | | | before_on_line(all_39_4, all_39_2, all_39_1) = v3 & % 11.64/2.33 | | | before_on_line(all_39_4, all_39_2, all_39_3) = v1 & % 11.64/2.33 | | | before_on_line(all_39_4, all_39_3, all_39_2) = v2 & ( ~ (v3 = 0) % 11.64/2.33 | | | | ~ (v2 = 0)) & ( ~ (v1 = 0) | ~ (v0 = 0))) % 11.64/2.33 | | | % 11.64/2.33 | | | DELTA: instantiating (45) with fresh symbols all_59_0, all_59_1, all_59_2, % 11.64/2.33 | | | all_59_3 gives: % 11.64/2.33 | | | (46) before_on_line(all_39_4, all_39_1, all_39_2) = all_59_3 & % 11.64/2.33 | | | before_on_line(all_39_4, all_39_2, all_39_1) = all_59_0 & % 11.64/2.33 | | | before_on_line(all_39_4, all_39_2, all_39_3) = all_59_2 & % 11.64/2.33 | | | before_on_line(all_39_4, all_39_3, all_39_2) = all_59_1 & ( ~ % 11.64/2.33 | | | (all_59_0 = 0) | ~ (all_59_1 = 0)) & ( ~ (all_59_2 = 0) | ~ % 11.64/2.33 | | | (all_59_3 = 0)) % 11.64/2.33 | | | % 11.64/2.33 | | | ALPHA: (46) implies: % 11.64/2.33 | | | (47) before_on_line(all_39_4, all_39_3, all_39_2) = all_59_1 % 11.64/2.33 | | | (48) before_on_line(all_39_4, all_39_2, all_39_1) = all_59_0 % 11.64/2.33 | | | (49) ~ (all_59_0 = 0) | ~ (all_59_1 = 0) % 11.64/2.33 | | | % 11.73/2.33 | | | GROUND_INST: instantiating (3) with 0, all_59_1, all_39_2, all_39_3, % 11.73/2.33 | | | all_39_4, simplifying with (42), (47) gives: % 11.73/2.33 | | | (50) all_59_1 = 0 % 11.73/2.33 | | | % 11.73/2.33 | | | GROUND_INST: instantiating (3) with 0, all_59_0, all_39_1, all_39_2, % 11.73/2.33 | | | all_39_4, simplifying with (41), (48) gives: % 11.73/2.33 | | | (51) all_59_0 = 0 % 11.73/2.33 | | | % 11.73/2.33 | | | BETA: splitting (49) gives: % 11.73/2.33 | | | % 11.73/2.33 | | | Case 1: % 11.73/2.33 | | | | % 11.73/2.33 | | | | (52) ~ (all_59_0 = 0) % 11.73/2.33 | | | | % 11.73/2.33 | | | | REDUCE: (51), (52) imply: % 11.73/2.33 | | | | (53) $false % 11.73/2.33 | | | | % 11.73/2.33 | | | | CLOSE: (53) is inconsistent. % 11.73/2.33 | | | | % 11.73/2.33 | | | Case 2: % 11.73/2.33 | | | | % 11.73/2.33 | | | | (54) ~ (all_59_1 = 0) % 11.73/2.33 | | | | % 11.73/2.33 | | | | REDUCE: (50), (54) imply: % 11.73/2.33 | | | | (55) $false % 11.73/2.33 | | | | % 11.73/2.33 | | | | CLOSE: (55) is inconsistent. % 11.73/2.33 | | | | % 11.73/2.33 | | | End of split % 11.73/2.33 | | | % 11.73/2.33 | | End of split % 11.73/2.33 | | % 11.73/2.33 | End of split % 11.73/2.33 | % 11.73/2.33 End of proof % 11.73/2.33 % SZS output end Proof for theBenchmark % 11.73/2.33 % 11.73/2.33 1708ms %------------------------------------------------------------------------------