%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : GEO263+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 : n028.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.59s 3.54s % Output : Proof 25.42s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : GEO263+3 : TPTP v8.1.2. Released v4.0.0. % 0.12/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n028.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 20:59:11 EDT 2023 % 0.13/0.34 % 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 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 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 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 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 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.27/1.16 Prover 1: Preprocessing ... % 3.27/1.16 Prover 4: Preprocessing ... % 3.27/1.20 Prover 0: Preprocessing ... % 3.27/1.20 Prover 2: Preprocessing ... % 3.27/1.20 Prover 6: Preprocessing ... % 3.27/1.21 Prover 5: Preprocessing ... % 3.27/1.21 Prover 3: Preprocessing ... % 7.49/1.75 Prover 5: Proving ... % 7.49/1.76 Prover 2: Proving ... % 7.86/1.78 Prover 6: Constructing countermodel ... % 7.86/1.79 Prover 3: Constructing countermodel ... % 7.86/1.83 Prover 1: Constructing countermodel ... % 9.60/2.03 Prover 3: gave up % 9.60/2.04 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 9.60/2.06 Prover 6: gave up % 9.60/2.06 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 9.60/2.10 Prover 1: gave up % 9.60/2.10 Prover 9: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1423531889 % 10.32/2.13 Prover 7: Preprocessing ... % 10.32/2.16 Prover 9: Preprocessing ... % 10.32/2.16 Prover 8: Preprocessing ... % 11.52/2.29 Prover 7: Warning: ignoring some quantifiers % 11.73/2.31 Prover 7: Constructing countermodel ... % 11.91/2.32 Prover 4: Constructing countermodel ... % 11.91/2.39 Prover 8: Warning: ignoring some quantifiers % 11.91/2.42 Prover 8: Constructing countermodel ... % 12.65/2.43 Prover 0: Proving ... % 14.22/2.65 Prover 8: gave up % 14.22/2.65 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 14.81/2.71 Prover 10: Preprocessing ... % 14.81/2.76 Prover 9: Constructing countermodel ... % 15.32/2.83 Prover 10: Warning: ignoring some quantifiers % 15.32/2.84 Prover 7: gave up % 15.32/2.86 Prover 10: Constructing countermodel ... % 15.32/2.86 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 16.27/2.90 Prover 11: Preprocessing ... % 17.13/3.03 Prover 10: gave up % 17.13/3.04 Prover 12: Options: -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=2024365391 % 17.67/3.08 Prover 12: Preprocessing ... % 19.00/3.27 Prover 12: Proving ... % 19.19/3.31 Prover 11: Constructing countermodel ... % 20.59/3.54 Prover 2: proved (2895ms) % 20.59/3.54 % 20.59/3.54 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 20.59/3.54 % 20.59/3.55 Prover 0: stopped % 20.59/3.55 Prover 12: stopped % 20.59/3.55 Prover 9: stopped % 20.59/3.55 Prover 5: stopped % 20.59/3.55 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 20.59/3.55 Prover 19: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=-1780594085 % 20.59/3.55 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 21.50/3.59 Prover 13: Preprocessing ... % 21.50/3.59 Prover 16: Preprocessing ... % 21.50/3.60 Prover 19: Preprocessing ... % 21.93/3.65 Prover 16: Warning: ignoring some quantifiers % 21.93/3.66 Prover 16: Constructing countermodel ... % 21.93/3.66 Prover 13: Warning: ignoring some quantifiers % 21.93/3.66 Prover 13: Constructing countermodel ... % 21.93/3.73 Prover 19: Warning: ignoring some quantifiers % 21.93/3.73 Prover 19: Constructing countermodel ... % 24.57/4.05 Prover 13: Found proof (size 32) % 24.57/4.05 Prover 13: proved (504ms) % 24.57/4.05 Prover 19: stopped % 24.57/4.05 Prover 4: stopped % 24.57/4.06 Prover 16: stopped % 24.57/4.06 Prover 11: stopped % 24.57/4.06 % 24.57/4.06 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 24.57/4.06 % 24.57/4.06 % SZS output start Proof for theBenchmark % 24.57/4.07 Assumptions after simplification: % 24.57/4.07 --------------------------------- % 24.57/4.07 % 24.57/4.07 (a1_defns) % 25.23/4.09 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (reverse_line(v1) = v2) | ~ % 25.23/4.09 $i(v1) | ~ $i(v0) | ~ unequally_directed_lines(v0, v2) | % 25.23/4.09 unequally_directed_opposite_lines(v0, v1)) & ! [v0: $i] : ! [v1: $i] : ! % 25.23/4.09 [v2: $i] : ( ~ (reverse_line(v1) = v2) | ~ $i(v1) | ~ $i(v0) | ~ % 25.23/4.09 unequally_directed_opposite_lines(v0, v1) | unequally_directed_lines(v0, % 25.23/4.09 v2)) % 25.23/4.09 % 25.23/4.09 (a7_defns) % 25.29/4.09 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ convergent_lines(v0, % 25.29/4.09 v1) | unequally_directed_lines(v0, v1)) & ! [v0: $i] : ! [v1: $i] : ( ~ % 25.29/4.09 $i(v1) | ~ $i(v0) | ~ convergent_lines(v0, v1) | % 25.29/4.09 unequally_directed_opposite_lines(v0, v1)) & ! [v0: $i] : ! [v1: $i] : ( ~ % 25.29/4.09 $i(v1) | ~ $i(v0) | ~ unequally_directed_lines(v0, v1) | ~ % 25.29/4.09 unequally_directed_opposite_lines(v0, v1) | convergent_lines(v0, v1)) % 25.29/4.09 % 25.29/4.09 (ax11_basics) % 25.29/4.09 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (reverse_line(v1) = v2) | ~ % 25.29/4.09 $i(v1) | ~ $i(v0) | ~ left_convergent_lines(v0, v2)) & ! [v0: $i] : ! % 25.29/4.09 [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ left_convergent_lines(v0, v1)) % 25.29/4.09 % 25.29/4.09 (ax6_cons_objs) % 25.29/4.10 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (intersection_point(v0, v1) = % 25.29/4.10 v2) | ~ $i(v1) | ~ $i(v0) | ~ apart_point_and_line(v2, v1) | ~ % 25.29/4.10 unequally_directed_lines(v0, v1) | ? [v3: $i] : (reverse_line(v1) = v3 & % 25.29/4.10 $i(v3) & ~ unequally_directed_lines(v0, v3))) & ! [v0: $i] : ! [v1: $i] % 25.29/4.10 : ! [v2: $i] : ( ~ (intersection_point(v0, v1) = v2) | ~ $i(v1) | ~ $i(v0) % 25.29/4.10 | ~ apart_point_and_line(v2, v0) | ~ unequally_directed_lines(v0, v1) | ? % 25.29/4.10 [v3: $i] : (reverse_line(v1) = v3 & $i(v3) & ~ unequally_directed_lines(v0, % 25.29/4.10 v3))) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ % 25.29/4.10 unequally_directed_lines(v0, v1) | ? [v2: $i] : ? [v3: $i] : % 25.29/4.10 (intersection_point(v0, v1) = v3 & reverse_line(v1) = v2 & $i(v3) & $i(v2) & % 25.29/4.10 ( ~ unequally_directed_lines(v0, v2) | ( ~ apart_point_and_line(v3, v1) & % 25.29/4.10 ~ apart_point_and_line(v3, v0))))) % 25.29/4.10 % 25.29/4.10 (ax9_basics) % 25.29/4.10 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (reverse_line(v1) = v2) | ~ % 25.29/4.10 $i(v1) | ~ $i(v0) | ~ unequally_directed_lines(v0, v2) | ~ % 25.29/4.10 unequally_directed_lines(v0, v1) | left_convergent_lines(v0, v2) | % 25.29/4.10 left_convergent_lines(v0, v1)) % 25.29/4.10 % 25.29/4.10 (con) % 25.29/4.10 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5: % 25.29/4.10 $i] : ? [v6: $i] : ? [v7: $i] : ? [v8: $i] : ? [v9: $i] : ? [v10: $i] : % 25.29/4.10 ? [v11: $i] : (parallel_through_point(v2, v5) = v10 & % 25.29/4.10 parallel_through_point(v2, v4) = v8 & parallel_through_point(v2, v3) = v6 & % 25.29/4.10 intersection_point(v1, v10) = v11 & intersection_point(v1, v8) = v9 & % 25.29/4.10 intersection_point(v1, v6) = v7 & $i(v11) & $i(v10) & $i(v9) & $i(v8) & % 25.29/4.10 $i(v7) & $i(v6) & $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0) & % 25.29/4.10 between_on_line(v0, v3, v4, v5) & convergent_lines(v1, v2) & % 25.29/4.10 convergent_lines(v0, v2) & convergent_lines(v0, v1) & ~ between_on_line(v1, % 25.29/4.10 v7, v9, v11)) % 25.29/4.10 % 25.29/4.10 (function-axioms) % 25.29/4.10 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 25.29/4.10 (parallel_through_point(v3, v2) = v1) | ~ (parallel_through_point(v3, v2) = % 25.29/4.10 v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | % 25.29/4.10 ~ (intersection_point(v3, v2) = v1) | ~ (intersection_point(v3, v2) = v0)) % 25.29/4.10 & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 25.29/4.10 (line_connecting(v3, v2) = v1) | ~ (line_connecting(v3, v2) = v0)) & ! % 25.29/4.10 [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (reverse_line(v2) = v1) | % 25.29/4.10 ~ (reverse_line(v2) = v0)) % 25.29/4.10 % 25.29/4.10 Further assumptions not needed in the proof: % 25.29/4.10 -------------------------------------------- % 25.29/4.10 a2_defns, a3_defns, a4_defns, a5_defns, a6_defns, a8_defns, a9_defns, % 25.29/4.10 ax10_basics, ax10_cons_objs, ax1_basics, ax1_cons_objs, ax1_subs, ax1_uniq_cons, % 25.29/4.10 ax2_basics, ax2_cons_objs, ax2_subs, ax2_uniq_cons, ax3_basics, ax3_cons_objs, % 25.29/4.10 ax3_subs, ax4_basics, ax4_cons_objs, ax4_defns, ax5_basics, ax5_cons_objs, % 25.29/4.10 ax6_basics, ax7_basics, ax7_cons_objs, ax8_basics, ax8_cons_objs, ax9_cons_objs % 25.29/4.10 % 25.29/4.10 Those formulas are unsatisfiable: % 25.29/4.10 --------------------------------- % 25.29/4.10 % 25.29/4.10 Begin of proof % 25.29/4.10 | % 25.29/4.10 | ALPHA: (a1_defns) implies: % 25.29/4.11 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (reverse_line(v1) = v2) | % 25.29/4.11 | ~ $i(v1) | ~ $i(v0) | ~ unequally_directed_opposite_lines(v0, v1) % 25.29/4.11 | | unequally_directed_lines(v0, v2)) % 25.29/4.11 | % 25.29/4.11 | ALPHA: (a7_defns) implies: % 25.29/4.11 | (2) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ % 25.29/4.11 | convergent_lines(v0, v1) | unequally_directed_opposite_lines(v0, v1)) % 25.29/4.11 | (3) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ % 25.29/4.11 | convergent_lines(v0, v1) | unequally_directed_lines(v0, v1)) % 25.29/4.11 | % 25.29/4.11 | ALPHA: (ax11_basics) implies: % 25.29/4.11 | (4) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ % 25.29/4.11 | left_convergent_lines(v0, v1)) % 25.29/4.11 | % 25.29/4.11 | ALPHA: (ax6_cons_objs) implies: % 25.29/4.11 | (5) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ % 25.29/4.11 | unequally_directed_lines(v0, v1) | ? [v2: $i] : ? [v3: $i] : % 25.29/4.11 | (intersection_point(v0, v1) = v3 & reverse_line(v1) = v2 & $i(v3) & % 25.29/4.11 | $i(v2) & ( ~ unequally_directed_lines(v0, v2) | ( ~ % 25.29/4.11 | apart_point_and_line(v3, v1) & ~ apart_point_and_line(v3, % 25.29/4.11 | v0))))) % 25.29/4.11 | % 25.29/4.11 | ALPHA: (function-axioms) implies: % 25.38/4.11 | (6) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ % 25.38/4.11 | (reverse_line(v2) = v1) | ~ (reverse_line(v2) = v0)) % 25.38/4.11 | % 25.38/4.11 | DELTA: instantiating (con) with fresh symbols all_49_0, all_49_1, all_49_2, % 25.38/4.11 | all_49_3, all_49_4, all_49_5, all_49_6, all_49_7, all_49_8, all_49_9, % 25.38/4.11 | all_49_10, all_49_11 gives: % 25.38/4.11 | (7) parallel_through_point(all_49_9, all_49_6) = all_49_1 & % 25.38/4.11 | parallel_through_point(all_49_9, all_49_7) = all_49_3 & % 25.38/4.11 | parallel_through_point(all_49_9, all_49_8) = all_49_5 & % 25.38/4.11 | intersection_point(all_49_10, all_49_1) = all_49_0 & % 25.38/4.11 | intersection_point(all_49_10, all_49_3) = all_49_2 & % 25.38/4.11 | intersection_point(all_49_10, all_49_5) = all_49_4 & $i(all_49_0) & % 25.38/4.11 | $i(all_49_1) & $i(all_49_2) & $i(all_49_3) & $i(all_49_4) & % 25.38/4.11 | $i(all_49_5) & $i(all_49_6) & $i(all_49_7) & $i(all_49_8) & % 25.38/4.11 | $i(all_49_9) & $i(all_49_10) & $i(all_49_11) & % 25.38/4.11 | between_on_line(all_49_11, all_49_8, all_49_7, all_49_6) & % 25.38/4.11 | convergent_lines(all_49_10, all_49_9) & convergent_lines(all_49_11, % 25.38/4.11 | all_49_9) & convergent_lines(all_49_11, all_49_10) & ~ % 25.38/4.11 | between_on_line(all_49_10, all_49_4, all_49_2, all_49_0) % 25.38/4.11 | % 25.38/4.11 | ALPHA: (7) implies: % 25.38/4.11 | (8) convergent_lines(all_49_11, all_49_9) % 25.38/4.11 | (9) convergent_lines(all_49_10, all_49_9) % 25.38/4.11 | (10) $i(all_49_11) % 25.38/4.11 | (11) $i(all_49_10) % 25.38/4.11 | (12) $i(all_49_9) % 25.38/4.11 | % 25.38/4.11 | GROUND_INST: instantiating (3) with all_49_11, all_49_9, simplifying with (8), % 25.38/4.11 | (10), (12) gives: % 25.38/4.11 | (13) unequally_directed_lines(all_49_11, all_49_9) % 25.38/4.11 | % 25.38/4.11 | GROUND_INST: instantiating (3) with all_49_10, all_49_9, simplifying with (9), % 25.38/4.11 | (11), (12) gives: % 25.38/4.11 | (14) unequally_directed_lines(all_49_10, all_49_9) % 25.38/4.11 | % 25.38/4.11 | GROUND_INST: instantiating (2) with all_49_10, all_49_9, simplifying with (9), % 25.38/4.11 | (11), (12) gives: % 25.38/4.11 | (15) unequally_directed_opposite_lines(all_49_10, all_49_9) % 25.38/4.11 | % 25.38/4.11 | GROUND_INST: instantiating (5) with all_49_11, all_49_9, simplifying with % 25.38/4.11 | (10), (12), (13) gives: % 25.38/4.12 | (16) ? [v0: $i] : ? [v1: $i] : (intersection_point(all_49_11, all_49_9) = % 25.38/4.12 | v1 & reverse_line(all_49_9) = v0 & $i(v1) & $i(v0) & ( ~ % 25.38/4.12 | unequally_directed_lines(all_49_11, v0) | ( ~ % 25.38/4.12 | apart_point_and_line(v1, all_49_9) & ~ apart_point_and_line(v1, % 25.38/4.12 | all_49_11)))) % 25.38/4.12 | % 25.42/4.12 | GROUND_INST: instantiating (5) with all_49_10, all_49_9, simplifying with % 25.42/4.12 | (11), (12), (14) gives: % 25.42/4.12 | (17) ? [v0: $i] : ? [v1: $i] : (intersection_point(all_49_10, all_49_9) = % 25.42/4.12 | v1 & reverse_line(all_49_9) = v0 & $i(v1) & $i(v0) & ( ~ % 25.42/4.12 | unequally_directed_lines(all_49_10, v0) | ( ~ % 25.42/4.12 | apart_point_and_line(v1, all_49_9) & ~ apart_point_and_line(v1, % 25.42/4.12 | all_49_10)))) % 25.42/4.12 | % 25.42/4.12 | DELTA: instantiating (17) with fresh symbols all_62_0, all_62_1 gives: % 25.42/4.12 | (18) intersection_point(all_49_10, all_49_9) = all_62_0 & % 25.42/4.12 | reverse_line(all_49_9) = all_62_1 & $i(all_62_0) & $i(all_62_1) & ( ~ % 25.42/4.12 | unequally_directed_lines(all_49_10, all_62_1) | ( ~ % 25.42/4.12 | apart_point_and_line(all_62_0, all_49_9) & ~ % 25.42/4.12 | apart_point_and_line(all_62_0, all_49_10))) % 25.42/4.12 | % 25.42/4.12 | ALPHA: (18) implies: % 25.42/4.12 | (19) reverse_line(all_49_9) = all_62_1 % 25.42/4.12 | (20) ~ unequally_directed_lines(all_49_10, all_62_1) | ( ~ % 25.42/4.12 | apart_point_and_line(all_62_0, all_49_9) & ~ % 25.42/4.12 | apart_point_and_line(all_62_0, all_49_10)) % 25.42/4.12 | % 25.42/4.12 | DELTA: instantiating (16) with fresh symbols all_64_0, all_64_1 gives: % 25.42/4.12 | (21) intersection_point(all_49_11, all_49_9) = all_64_0 & % 25.42/4.12 | reverse_line(all_49_9) = all_64_1 & $i(all_64_0) & $i(all_64_1) & ( ~ % 25.42/4.12 | unequally_directed_lines(all_49_11, all_64_1) | ( ~ % 25.42/4.12 | apart_point_and_line(all_64_0, all_49_9) & ~ % 25.42/4.12 | apart_point_and_line(all_64_0, all_49_11))) % 25.42/4.12 | % 25.42/4.12 | ALPHA: (21) implies: % 25.42/4.12 | (22) $i(all_64_1) % 25.42/4.12 | (23) reverse_line(all_49_9) = all_64_1 % 25.42/4.12 | % 25.42/4.12 | GROUND_INST: instantiating (6) with all_62_1, all_64_1, all_49_9, simplifying % 25.42/4.12 | with (19), (23) gives: % 25.42/4.12 | (24) all_64_1 = all_62_1 % 25.42/4.12 | % 25.42/4.12 | REDUCE: (22), (24) imply: % 25.42/4.12 | (25) $i(all_62_1) % 25.42/4.12 | % 25.42/4.12 | GROUND_INST: instantiating (1) with all_49_10, all_49_9, all_62_1, simplifying % 25.42/4.12 | with (11), (12), (15), (19) gives: % 25.42/4.12 | (26) unequally_directed_lines(all_49_10, all_62_1) % 25.42/4.12 | % 25.42/4.12 | BETA: splitting (20) gives: % 25.42/4.12 | % 25.42/4.12 | Case 1: % 25.42/4.12 | | % 25.42/4.12 | | (27) ~ unequally_directed_lines(all_49_10, all_62_1) % 25.42/4.12 | | % 25.42/4.12 | | PRED_UNIFY: (26), (27) imply: % 25.42/4.12 | | (28) $false % 25.42/4.12 | | % 25.42/4.12 | | CLOSE: (28) is inconsistent. % 25.42/4.12 | | % 25.42/4.12 | Case 2: % 25.42/4.12 | | % 25.42/4.12 | | % 25.42/4.12 | | GROUND_INST: instantiating (ax9_basics) with all_49_10, all_49_9, all_62_1, % 25.42/4.12 | | simplifying with (11), (12), (14), (19), (26) gives: % 25.42/4.12 | | (29) left_convergent_lines(all_49_10, all_62_1) | % 25.42/4.12 | | left_convergent_lines(all_49_10, all_49_9) % 25.42/4.12 | | % 25.42/4.12 | | BETA: splitting (29) gives: % 25.42/4.12 | | % 25.42/4.12 | | Case 1: % 25.42/4.12 | | | % 25.42/4.12 | | | (30) left_convergent_lines(all_49_10, all_62_1) % 25.42/4.12 | | | % 25.42/4.12 | | | GROUND_INST: instantiating (4) with all_49_10, all_62_1, simplifying with % 25.42/4.12 | | | (11), (25), (30) gives: % 25.42/4.12 | | | (31) $false % 25.42/4.12 | | | % 25.42/4.12 | | | CLOSE: (31) is inconsistent. % 25.42/4.12 | | | % 25.42/4.12 | | Case 2: % 25.42/4.12 | | | % 25.42/4.12 | | | (32) left_convergent_lines(all_49_10, all_49_9) % 25.42/4.12 | | | % 25.42/4.12 | | | GROUND_INST: instantiating (4) with all_49_10, all_49_9, simplifying with % 25.42/4.12 | | | (11), (12), (32) gives: % 25.42/4.12 | | | (33) $false % 25.42/4.12 | | | % 25.42/4.12 | | | CLOSE: (33) is inconsistent. % 25.42/4.12 | | | % 25.42/4.12 | | End of split % 25.42/4.12 | | % 25.42/4.12 | End of split % 25.42/4.12 | % 25.42/4.12 End of proof % 25.42/4.12 % SZS output end Proof for theBenchmark % 25.42/4.13 % 25.42/4.13 3503ms %------------------------------------------------------------------------------