%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : GEO262+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 : 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 : Wed Aug 30 23:22:51 EDT 2023 % Result : Theorem 20.22s 3.41s % Output : Proof 24.67s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : GEO262+3 : TPTP v8.1.2. Released v4.0.0. % 0.03/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.33 % Computer : n007.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 300 % 0.13/0.33 % DateTime : Tue Aug 29 21:15:59 EDT 2023 % 0.13/0.33 % CPUTime : % 0.58/0.58 ________ _____ % 0.58/0.58 ___ __ \_________(_)________________________________ % 0.58/0.58 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.58/0.58 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.58/0.58 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.58/0.58 % 0.58/0.58 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.58/0.58 (2023-06-19) % 0.58/0.58 % 0.58/0.58 (c) Philipp Rümmer, 2009-2023 % 0.58/0.58 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.58/0.58 Amanda Stjerna. % 0.58/0.58 Free software under BSD-3-Clause. % 0.58/0.58 % 0.58/0.58 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.58/0.58 % 0.58/0.58 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.58/0.59 Running up to 7 provers in parallel. % 0.58/0.60 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.58/0.60 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.58/0.60 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.58/0.60 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.58/0.60 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.58/0.60 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 0.58/0.60 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 3.68/1.19 Prover 4: Preprocessing ... % 3.68/1.19 Prover 1: Preprocessing ... % 3.68/1.23 Prover 5: Preprocessing ... % 3.68/1.23 Prover 6: Preprocessing ... % 3.68/1.23 Prover 2: Preprocessing ... % 3.68/1.23 Prover 3: Preprocessing ... % 3.68/1.23 Prover 0: Preprocessing ... % 7.40/1.67 Prover 5: Proving ... % 8.02/1.78 Prover 2: Proving ... % 8.24/1.79 Prover 3: Constructing countermodel ... % 8.24/1.80 Prover 6: Constructing countermodel ... % 8.24/1.81 Prover 1: Constructing countermodel ... % 9.60/2.02 Prover 3: gave up % 9.60/2.02 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 10.36/2.08 Prover 6: gave up % 10.36/2.08 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 10.36/2.11 Prover 7: Preprocessing ... % 10.36/2.11 Prover 1: gave up % 10.75/2.13 Prover 8: Preprocessing ... % 10.75/2.13 Prover 9: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1423531889 % 10.96/2.18 Prover 4: Constructing countermodel ... % 10.96/2.19 Prover 9: Preprocessing ... % 11.53/2.26 Prover 7: Warning: ignoring some quantifiers % 11.93/2.28 Prover 0: Proving ... % 11.93/2.28 Prover 7: Constructing countermodel ... % 12.48/2.36 Prover 8: Warning: ignoring some quantifiers % 12.63/2.39 Prover 8: Constructing countermodel ... % 13.86/2.57 Prover 8: gave up % 13.86/2.57 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 14.23/2.62 Prover 10: Preprocessing ... % 14.75/2.66 Prover 7: gave up % 14.90/2.68 Prover 9: Constructing countermodel ... % 14.90/2.68 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 14.90/2.71 Prover 10: Warning: ignoring some quantifiers % 14.90/2.72 Prover 10: Constructing countermodel ... % 14.90/2.72 Prover 11: Preprocessing ... % 16.22/2.87 Prover 10: gave up % 16.22/2.87 Prover 12: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=2024365391 % 16.49/2.92 Prover 12: Preprocessing ... % 17.51/3.05 Prover 12: Proving ... % 17.83/3.07 Prover 11: Constructing countermodel ... % 20.22/3.41 Prover 2: proved (2808ms) % 20.22/3.41 % 20.22/3.41 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 20.22/3.41 % 20.22/3.42 Prover 12: stopped % 20.22/3.42 Prover 0: stopped % 20.22/3.42 Prover 5: stopped % 20.22/3.43 Prover 9: stopped % 20.22/3.43 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 20.22/3.43 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 20.22/3.44 Prover 19: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=-1780594085 % 20.75/3.46 Prover 13: Preprocessing ... % 20.75/3.46 Prover 16: Preprocessing ... % 21.09/3.49 Prover 19: Preprocessing ... % 21.09/3.53 Prover 16: Warning: ignoring some quantifiers % 21.09/3.54 Prover 13: Warning: ignoring some quantifiers % 21.09/3.54 Prover 16: Constructing countermodel ... % 21.54/3.54 Prover 13: Constructing countermodel ... % 21.68/3.59 Prover 19: Warning: ignoring some quantifiers % 21.68/3.60 Prover 19: Constructing countermodel ... % 24.52/3.93 Prover 13: Found proof (size 32) % 24.52/3.93 Prover 13: proved (508ms) % 24.52/3.93 Prover 4: stopped % 24.52/3.95 Prover 16: stopped % 24.52/3.95 Prover 19: stopped % 24.52/3.95 Prover 11: stopped % 24.52/3.95 % 24.52/3.95 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 24.52/3.95 % 24.52/3.95 % SZS output start Proof for theBenchmark % 24.67/3.96 Assumptions after simplification: % 24.67/3.96 --------------------------------- % 24.67/3.96 % 24.67/3.96 (a1_defns) % 24.67/3.98 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (reverse_line(v1) = v2) | ~ % 24.67/3.98 $i(v1) | ~ $i(v0) | ~ unequally_directed_lines(v0, v2) | % 24.67/3.98 unequally_directed_opposite_lines(v0, v1)) & ! [v0: $i] : ! [v1: $i] : ! % 24.67/3.98 [v2: $i] : ( ~ (reverse_line(v1) = v2) | ~ $i(v1) | ~ $i(v0) | ~ % 24.67/3.98 unequally_directed_opposite_lines(v0, v1) | unequally_directed_lines(v0, % 24.67/3.98 v2)) % 24.67/3.98 % 24.67/3.98 (a7_defns) % 24.67/3.98 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ convergent_lines(v0, % 24.67/3.98 v1) | unequally_directed_lines(v0, v1)) & ! [v0: $i] : ! [v1: $i] : ( ~ % 24.67/3.98 $i(v1) | ~ $i(v0) | ~ convergent_lines(v0, v1) | % 24.67/3.98 unequally_directed_opposite_lines(v0, v1)) & ! [v0: $i] : ! [v1: $i] : ( ~ % 24.67/3.98 $i(v1) | ~ $i(v0) | ~ unequally_directed_lines(v0, v1) | ~ % 24.67/3.98 unequally_directed_opposite_lines(v0, v1) | convergent_lines(v0, v1)) % 24.67/3.98 % 24.67/3.98 (ax11_basics) % 24.67/3.98 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (reverse_line(v1) = v2) | ~ % 24.67/3.98 $i(v1) | ~ $i(v0) | ~ left_convergent_lines(v0, v2)) & ! [v0: $i] : ! % 24.67/3.98 [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ left_convergent_lines(v0, v1)) % 24.67/3.98 % 24.67/3.98 (ax6_cons_objs) % 24.67/3.99 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (intersection_point(v0, v1) = % 24.67/3.99 v2) | ~ $i(v1) | ~ $i(v0) | ~ apart_point_and_line(v2, v1) | ~ % 24.67/3.99 unequally_directed_lines(v0, v1) | ? [v3: $i] : (reverse_line(v1) = v3 & % 24.67/3.99 $i(v3) & ~ unequally_directed_lines(v0, v3))) & ! [v0: $i] : ! [v1: $i] % 24.67/3.99 : ! [v2: $i] : ( ~ (intersection_point(v0, v1) = v2) | ~ $i(v1) | ~ $i(v0) % 24.67/3.99 | ~ apart_point_and_line(v2, v0) | ~ unequally_directed_lines(v0, v1) | ? % 24.67/3.99 [v3: $i] : (reverse_line(v1) = v3 & $i(v3) & ~ unequally_directed_lines(v0, % 24.67/3.99 v3))) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ % 24.67/3.99 unequally_directed_lines(v0, v1) | ? [v2: $i] : ? [v3: $i] : % 24.67/3.99 (intersection_point(v0, v1) = v3 & reverse_line(v1) = v2 & $i(v3) & $i(v2) & % 24.67/3.99 ( ~ unequally_directed_lines(v0, v2) | ( ~ apart_point_and_line(v3, v1) & % 24.67/3.99 ~ apart_point_and_line(v3, v0))))) % 24.67/3.99 % 24.67/3.99 (ax9_basics) % 24.67/3.99 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (reverse_line(v1) = v2) | ~ % 24.67/3.99 $i(v1) | ~ $i(v0) | ~ unequally_directed_lines(v0, v2) | ~ % 24.67/3.99 unequally_directed_lines(v0, v1) | left_convergent_lines(v0, v2) | % 24.67/3.99 left_convergent_lines(v0, v1)) % 24.67/3.99 % 24.67/3.99 (con) % 24.67/3.99 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5: % 24.67/3.99 $i] : ? [v6: $i] : ? [v7: $i] : ? [v8: $i] : ? [v9: $i] : % 24.67/3.99 (parallel_through_point(v2, v5) = v8 & parallel_through_point(v2, v3) = v6 & % 24.67/3.99 intersection_point(v1, v8) = v9 & intersection_point(v1, v6) = v7 & $i(v9) & % 24.67/3.99 $i(v8) & $i(v7) & $i(v6) & $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) & % 24.67/3.99 $i(v0) & between_on_line(v0, v3, v4, v5) & incident_point_and_line(v4, v2) & % 24.67/3.99 incident_point_and_line(v4, v1) & convergent_lines(v1, v2) & % 24.67/3.99 convergent_lines(v0, v2) & convergent_lines(v0, v1) & ~ between_on_line(v1, % 24.67/3.99 v7, v4, v9)) % 24.67/3.99 % 24.67/3.99 (function-axioms) % 24.67/3.99 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 24.67/3.99 (parallel_through_point(v3, v2) = v1) | ~ (parallel_through_point(v3, v2) = % 24.67/3.99 v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | % 24.67/3.99 ~ (intersection_point(v3, v2) = v1) | ~ (intersection_point(v3, v2) = v0)) % 24.67/3.99 & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 24.67/3.99 (line_connecting(v3, v2) = v1) | ~ (line_connecting(v3, v2) = v0)) & ! % 24.67/3.99 [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (reverse_line(v2) = v1) | % 24.67/3.99 ~ (reverse_line(v2) = v0)) % 24.67/3.99 % 24.67/3.99 Further assumptions not needed in the proof: % 24.67/3.99 -------------------------------------------- % 24.67/3.99 a2_defns, a3_defns, a4_defns, a5_defns, a6_defns, a8_defns, a9_defns, % 24.67/3.99 ax10_basics, ax10_cons_objs, ax1_basics, ax1_cons_objs, ax1_subs, ax1_uniq_cons, % 24.67/3.99 ax2_basics, ax2_cons_objs, ax2_subs, ax2_uniq_cons, ax3_basics, ax3_cons_objs, % 24.67/3.99 ax3_subs, ax4_basics, ax4_cons_objs, ax4_defns, ax5_basics, ax5_cons_objs, % 24.67/3.99 ax6_basics, ax7_basics, ax7_cons_objs, ax8_basics, ax8_cons_objs, ax9_cons_objs % 24.67/3.99 % 24.67/3.99 Those formulas are unsatisfiable: % 24.67/3.99 --------------------------------- % 24.67/3.99 % 24.67/3.99 Begin of proof % 24.67/3.99 | % 24.67/3.99 | ALPHA: (a1_defns) implies: % 24.67/3.99 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (reverse_line(v1) = v2) | % 24.67/3.99 | ~ $i(v1) | ~ $i(v0) | ~ unequally_directed_opposite_lines(v0, v1) % 24.67/3.99 | | unequally_directed_lines(v0, v2)) % 24.67/3.99 | % 24.67/3.99 | ALPHA: (a7_defns) implies: % 24.67/4.00 | (2) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ % 24.67/4.00 | convergent_lines(v0, v1) | unequally_directed_opposite_lines(v0, v1)) % 24.67/4.00 | (3) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ % 24.67/4.00 | convergent_lines(v0, v1) | unequally_directed_lines(v0, v1)) % 24.67/4.00 | % 24.67/4.00 | ALPHA: (ax11_basics) implies: % 24.67/4.00 | (4) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ % 24.67/4.00 | left_convergent_lines(v0, v1)) % 24.67/4.00 | % 24.67/4.00 | ALPHA: (ax6_cons_objs) implies: % 24.67/4.00 | (5) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ % 24.67/4.00 | unequally_directed_lines(v0, v1) | ? [v2: $i] : ? [v3: $i] : % 24.67/4.00 | (intersection_point(v0, v1) = v3 & reverse_line(v1) = v2 & $i(v3) & % 24.67/4.00 | $i(v2) & ( ~ unequally_directed_lines(v0, v2) | ( ~ % 24.67/4.00 | apart_point_and_line(v3, v1) & ~ apart_point_and_line(v3, % 24.67/4.00 | v0))))) % 24.67/4.00 | % 24.67/4.00 | ALPHA: (function-axioms) implies: % 24.67/4.00 | (6) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ % 24.67/4.00 | (reverse_line(v2) = v1) | ~ (reverse_line(v2) = v0)) % 24.67/4.00 | % 24.67/4.00 | DELTA: instantiating (con) with fresh symbols all_49_0, all_49_1, all_49_2, % 24.67/4.00 | all_49_3, all_49_4, all_49_5, all_49_6, all_49_7, all_49_8, all_49_9 % 24.67/4.00 | gives: % 24.67/4.00 | (7) parallel_through_point(all_49_7, all_49_4) = all_49_1 & % 24.67/4.00 | parallel_through_point(all_49_7, all_49_6) = all_49_3 & % 24.67/4.00 | intersection_point(all_49_8, all_49_1) = all_49_0 & % 24.67/4.00 | intersection_point(all_49_8, all_49_3) = all_49_2 & $i(all_49_0) & % 24.67/4.00 | $i(all_49_1) & $i(all_49_2) & $i(all_49_3) & $i(all_49_4) & % 24.67/4.00 | $i(all_49_5) & $i(all_49_6) & $i(all_49_7) & $i(all_49_8) & % 24.67/4.00 | $i(all_49_9) & between_on_line(all_49_9, all_49_6, all_49_5, all_49_4) % 24.67/4.00 | & incident_point_and_line(all_49_5, all_49_7) & % 24.67/4.00 | incident_point_and_line(all_49_5, all_49_8) & % 24.67/4.00 | convergent_lines(all_49_8, all_49_7) & convergent_lines(all_49_9, % 24.67/4.00 | all_49_7) & convergent_lines(all_49_9, all_49_8) & ~ % 24.67/4.00 | between_on_line(all_49_8, all_49_2, all_49_5, all_49_0) % 24.67/4.00 | % 24.67/4.00 | ALPHA: (7) implies: % 24.67/4.00 | (8) convergent_lines(all_49_9, all_49_7) % 24.67/4.00 | (9) convergent_lines(all_49_8, all_49_7) % 24.67/4.00 | (10) $i(all_49_9) % 24.67/4.00 | (11) $i(all_49_8) % 24.67/4.00 | (12) $i(all_49_7) % 24.67/4.00 | % 24.67/4.00 | GROUND_INST: instantiating (3) with all_49_9, all_49_7, simplifying with (8), % 24.67/4.00 | (10), (12) gives: % 24.67/4.00 | (13) unequally_directed_lines(all_49_9, all_49_7) % 24.67/4.00 | % 24.67/4.00 | GROUND_INST: instantiating (3) with all_49_8, all_49_7, simplifying with (9), % 24.67/4.00 | (11), (12) gives: % 24.67/4.00 | (14) unequally_directed_lines(all_49_8, all_49_7) % 24.67/4.00 | % 24.67/4.00 | GROUND_INST: instantiating (2) with all_49_8, all_49_7, simplifying with (9), % 24.67/4.00 | (11), (12) gives: % 24.67/4.00 | (15) unequally_directed_opposite_lines(all_49_8, all_49_7) % 24.67/4.00 | % 24.67/4.00 | GROUND_INST: instantiating (5) with all_49_9, all_49_7, simplifying with (10), % 24.67/4.00 | (12), (13) gives: % 24.67/4.00 | (16) ? [v0: $i] : ? [v1: $i] : (intersection_point(all_49_9, all_49_7) = % 24.67/4.00 | v1 & reverse_line(all_49_7) = v0 & $i(v1) & $i(v0) & ( ~ % 24.67/4.00 | unequally_directed_lines(all_49_9, v0) | ( ~ % 24.67/4.00 | apart_point_and_line(v1, all_49_7) & ~ apart_point_and_line(v1, % 24.67/4.00 | all_49_9)))) % 24.67/4.00 | % 24.67/4.00 | GROUND_INST: instantiating (5) with all_49_8, all_49_7, simplifying with (11), % 24.67/4.00 | (12), (14) gives: % 24.67/4.00 | (17) ? [v0: $i] : ? [v1: $i] : (intersection_point(all_49_8, all_49_7) = % 24.67/4.00 | v1 & reverse_line(all_49_7) = v0 & $i(v1) & $i(v0) & ( ~ % 24.67/4.00 | unequally_directed_lines(all_49_8, v0) | ( ~ % 24.67/4.00 | apart_point_and_line(v1, all_49_7) & ~ apart_point_and_line(v1, % 24.67/4.00 | all_49_8)))) % 24.67/4.00 | % 24.67/4.00 | DELTA: instantiating (17) with fresh symbols all_62_0, all_62_1 gives: % 24.67/4.01 | (18) intersection_point(all_49_8, all_49_7) = all_62_0 & % 24.67/4.01 | reverse_line(all_49_7) = all_62_1 & $i(all_62_0) & $i(all_62_1) & ( ~ % 24.67/4.01 | unequally_directed_lines(all_49_8, all_62_1) | ( ~ % 24.67/4.01 | apart_point_and_line(all_62_0, all_49_7) & ~ % 24.67/4.01 | apart_point_and_line(all_62_0, all_49_8))) % 24.67/4.01 | % 24.67/4.01 | ALPHA: (18) implies: % 24.67/4.01 | (19) reverse_line(all_49_7) = all_62_1 % 24.67/4.01 | (20) ~ unequally_directed_lines(all_49_8, all_62_1) | ( ~ % 24.67/4.01 | apart_point_and_line(all_62_0, all_49_7) & ~ % 24.67/4.01 | apart_point_and_line(all_62_0, all_49_8)) % 24.67/4.01 | % 24.67/4.01 | DELTA: instantiating (16) with fresh symbols all_64_0, all_64_1 gives: % 24.67/4.01 | (21) intersection_point(all_49_9, all_49_7) = all_64_0 & % 24.67/4.01 | reverse_line(all_49_7) = all_64_1 & $i(all_64_0) & $i(all_64_1) & ( ~ % 24.67/4.01 | unequally_directed_lines(all_49_9, all_64_1) | ( ~ % 24.67/4.01 | apart_point_and_line(all_64_0, all_49_7) & ~ % 24.67/4.01 | apart_point_and_line(all_64_0, all_49_9))) % 24.67/4.01 | % 24.67/4.01 | ALPHA: (21) implies: % 24.67/4.01 | (22) $i(all_64_1) % 24.67/4.01 | (23) reverse_line(all_49_7) = all_64_1 % 24.67/4.01 | % 24.67/4.01 | GROUND_INST: instantiating (6) with all_62_1, all_64_1, all_49_7, simplifying % 24.67/4.01 | with (19), (23) gives: % 24.67/4.01 | (24) all_64_1 = all_62_1 % 24.67/4.01 | % 24.67/4.01 | REDUCE: (22), (24) imply: % 24.67/4.01 | (25) $i(all_62_1) % 24.67/4.01 | % 24.67/4.01 | GROUND_INST: instantiating (1) with all_49_8, all_49_7, all_62_1, simplifying % 24.67/4.01 | with (11), (12), (15), (19) gives: % 24.67/4.01 | (26) unequally_directed_lines(all_49_8, all_62_1) % 24.67/4.01 | % 24.67/4.01 | BETA: splitting (20) gives: % 24.67/4.01 | % 24.67/4.01 | Case 1: % 24.67/4.01 | | % 24.67/4.01 | | (27) ~ unequally_directed_lines(all_49_8, all_62_1) % 24.67/4.01 | | % 24.67/4.01 | | PRED_UNIFY: (26), (27) imply: % 24.67/4.01 | | (28) $false % 24.67/4.01 | | % 24.67/4.01 | | CLOSE: (28) is inconsistent. % 24.67/4.01 | | % 24.67/4.01 | Case 2: % 24.67/4.01 | | % 24.67/4.01 | | % 24.67/4.01 | | GROUND_INST: instantiating (ax9_basics) with all_49_8, all_49_7, all_62_1, % 24.67/4.01 | | simplifying with (11), (12), (14), (19), (26) gives: % 24.67/4.01 | | (29) left_convergent_lines(all_49_8, all_62_1) | % 24.67/4.01 | | left_convergent_lines(all_49_8, all_49_7) % 24.67/4.01 | | % 24.67/4.01 | | BETA: splitting (29) gives: % 24.67/4.01 | | % 24.67/4.01 | | Case 1: % 24.67/4.01 | | | % 24.67/4.01 | | | (30) left_convergent_lines(all_49_8, all_62_1) % 24.67/4.01 | | | % 24.67/4.01 | | | GROUND_INST: instantiating (4) with all_49_8, all_62_1, simplifying with % 24.67/4.01 | | | (11), (25), (30) gives: % 24.67/4.01 | | | (31) $false % 24.67/4.01 | | | % 24.67/4.01 | | | CLOSE: (31) is inconsistent. % 24.67/4.01 | | | % 24.67/4.01 | | Case 2: % 24.67/4.01 | | | % 24.67/4.01 | | | (32) left_convergent_lines(all_49_8, all_49_7) % 24.67/4.01 | | | % 24.67/4.01 | | | GROUND_INST: instantiating (4) with all_49_8, all_49_7, simplifying with % 24.67/4.01 | | | (11), (12), (32) gives: % 24.67/4.01 | | | (33) $false % 24.67/4.01 | | | % 24.67/4.01 | | | CLOSE: (33) is inconsistent. % 24.67/4.01 | | | % 24.67/4.01 | | End of split % 24.67/4.01 | | % 24.67/4.01 | End of split % 24.67/4.01 | % 24.67/4.01 End of proof % 24.67/4.01 % SZS output end Proof for theBenchmark % 24.67/4.01 % 24.67/4.01 3430ms %------------------------------------------------------------------------------