TSTP Solution File: GEO261+3 by Princess---230619

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : GEO261+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 : n015.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:50 EDT 2023

% Result   : Theorem 14.95s 2.79s
% Output   : Proof 18.47s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : GEO261+3 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34  % Computer : n015.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 : Wed Aug 30 00:22:56 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.19/0.64  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.19/0.64  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.19/0.64  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.19/0.64  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.19/0.64  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.19/0.64  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.19/0.64  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 3.44/1.15  Prover 4: Preprocessing ...
% 3.44/1.15  Prover 1: Preprocessing ...
% 3.44/1.19  Prover 5: Preprocessing ...
% 3.44/1.19  Prover 2: Preprocessing ...
% 3.44/1.19  Prover 0: Preprocessing ...
% 3.44/1.19  Prover 3: Preprocessing ...
% 3.44/1.19  Prover 6: Preprocessing ...
% 6.83/1.65  Prover 5: Proving ...
% 7.22/1.70  Prover 2: Proving ...
% 7.22/1.71  Prover 6: Constructing countermodel ...
% 7.98/1.79  Prover 3: Constructing countermodel ...
% 7.98/1.80  Prover 1: Constructing countermodel ...
% 9.46/1.98  Prover 6: gave up
% 9.46/1.98  Prover 3: gave up
% 9.46/1.99  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 9.46/1.99  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 9.46/2.02  Prover 1: gave up
% 9.46/2.03  Prover 9: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1423531889
% 10.04/2.06  Prover 8: Preprocessing ...
% 10.23/2.07  Prover 7: Preprocessing ...
% 10.23/2.09  Prover 4: Constructing countermodel ...
% 10.23/2.11  Prover 9: Preprocessing ...
% 10.23/2.15  Prover 7: Warning: ignoring some quantifiers
% 10.23/2.19  Prover 7: Constructing countermodel ...
% 10.80/2.27  Prover 0: Proving ...
% 11.81/2.30  Prover 8: Warning: ignoring some quantifiers
% 11.81/2.32  Prover 8: Constructing countermodel ...
% 12.43/2.40  Prover 7: gave up
% 12.65/2.41  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 12.81/2.44  Prover 10: Preprocessing ...
% 12.81/2.50  Prover 8: gave up
% 12.81/2.51  Prover 10: Warning: ignoring some quantifiers
% 12.81/2.51  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 13.56/2.53  Prover 10: Constructing countermodel ...
% 13.56/2.57  Prover 11: Preprocessing ...
% 13.56/2.57  Prover 9: Constructing countermodel ...
% 14.11/2.66  Prover 10: gave up
% 14.11/2.66  Prover 12: Options:  -triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=2024365391
% 14.95/2.70  Prover 12: Preprocessing ...
% 14.95/2.79  Prover 2: proved (2155ms)
% 14.95/2.79  
% 14.95/2.79  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 14.95/2.79  
% 14.95/2.79  Prover 9: stopped
% 14.95/2.79  Prover 5: stopped
% 14.95/2.80  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 14.95/2.80  Prover 16: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683
% 14.95/2.80  Prover 0: stopped
% 14.95/2.80  Prover 19: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=-1780594085
% 14.95/2.82  Prover 12: stopped
% 15.26/2.83  Prover 13: Preprocessing ...
% 15.26/2.84  Prover 16: Preprocessing ...
% 15.26/2.85  Prover 19: Preprocessing ...
% 15.26/2.90  Prover 16: Warning: ignoring some quantifiers
% 15.26/2.91  Prover 13: Warning: ignoring some quantifiers
% 15.26/2.92  Prover 13: Constructing countermodel ...
% 15.26/2.92  Prover 16: Constructing countermodel ...
% 16.59/2.96  Prover 11: Constructing countermodel ...
% 17.12/3.00  Prover 19: Warning: ignoring some quantifiers
% 17.12/3.01  Prover 19: Constructing countermodel ...
% 17.66/3.14  Prover 13: Found proof (size 24)
% 17.66/3.14  Prover 13: proved (349ms)
% 17.66/3.14  Prover 11: stopped
% 17.66/3.14  Prover 19: stopped
% 17.66/3.14  Prover 4: stopped
% 17.66/3.14  Prover 16: stopped
% 17.66/3.14  
% 17.66/3.14  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 17.66/3.14  
% 17.66/3.15  % SZS output start Proof for theBenchmark
% 17.66/3.15  Assumptions after simplification:
% 17.66/3.15  ---------------------------------
% 17.66/3.15  
% 17.66/3.15    (a1_defns)
% 18.34/3.17     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : ( ~ (reverse_line(v1) = v2) |  ~
% 18.34/3.17      $i(v1) |  ~ $i(v0) |  ~ unequally_directed_lines(v0, v2) |
% 18.34/3.17      unequally_directed_opposite_lines(v0, v1)) &  ! [v0: $i] :  ! [v1: $i] :  !
% 18.34/3.17    [v2: $i] : ( ~ (reverse_line(v1) = v2) |  ~ $i(v1) |  ~ $i(v0) |  ~
% 18.34/3.17      unequally_directed_opposite_lines(v0, v1) | unequally_directed_lines(v0,
% 18.34/3.17        v2))
% 18.34/3.17  
% 18.34/3.17    (a7_defns)
% 18.34/3.17     ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~ convergent_lines(v0,
% 18.34/3.17        v1) | unequally_directed_lines(v0, v1)) &  ! [v0: $i] :  ! [v1: $i] : ( ~
% 18.34/3.17      $i(v1) |  ~ $i(v0) |  ~ convergent_lines(v0, v1) |
% 18.34/3.17      unequally_directed_opposite_lines(v0, v1)) &  ! [v0: $i] :  ! [v1: $i] : ( ~
% 18.34/3.17      $i(v1) |  ~ $i(v0) |  ~ unequally_directed_lines(v0, v1) |  ~
% 18.34/3.17      unequally_directed_opposite_lines(v0, v1) | convergent_lines(v0, v1))
% 18.34/3.17  
% 18.34/3.17    (ax11_basics)
% 18.34/3.18     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : ( ~ (reverse_line(v1) = v2) |  ~
% 18.34/3.18      $i(v1) |  ~ $i(v0) |  ~ left_convergent_lines(v0, v2)) &  ! [v0: $i] :  !
% 18.34/3.18    [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~ left_convergent_lines(v0, v1))
% 18.34/3.18  
% 18.34/3.18    (ax6_cons_objs)
% 18.34/3.18     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : ( ~ (intersection_point(v0, v1) =
% 18.34/3.18        v2) |  ~ $i(v1) |  ~ $i(v0) |  ~ apart_point_and_line(v2, v1) |  ~
% 18.34/3.18      unequally_directed_lines(v0, v1) |  ? [v3: $i] : (reverse_line(v1) = v3 &
% 18.34/3.18        $i(v3) &  ~ unequally_directed_lines(v0, v3))) &  ! [v0: $i] :  ! [v1: $i]
% 18.34/3.18    :  ! [v2: $i] : ( ~ (intersection_point(v0, v1) = v2) |  ~ $i(v1) |  ~ $i(v0)
% 18.34/3.18      |  ~ apart_point_and_line(v2, v0) |  ~ unequally_directed_lines(v0, v1) |  ?
% 18.34/3.18      [v3: $i] : (reverse_line(v1) = v3 & $i(v3) &  ~ unequally_directed_lines(v0,
% 18.34/3.18          v3))) &  ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~
% 18.34/3.18      unequally_directed_lines(v0, v1) |  ? [v2: $i] :  ? [v3: $i] :
% 18.34/3.18      (intersection_point(v0, v1) = v3 & reverse_line(v1) = v2 & $i(v3) & $i(v2) &
% 18.34/3.18        ( ~ unequally_directed_lines(v0, v2) | ( ~ apart_point_and_line(v3, v1) & 
% 18.34/3.18            ~ apart_point_and_line(v3, v0)))))
% 18.34/3.18  
% 18.34/3.18    (ax9_basics)
% 18.34/3.18     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : ( ~ (reverse_line(v1) = v2) |  ~
% 18.34/3.18      $i(v1) |  ~ $i(v0) |  ~ unequally_directed_lines(v0, v2) |  ~
% 18.34/3.18      unequally_directed_lines(v0, v1) | left_convergent_lines(v0, v2) |
% 18.34/3.18      left_convergent_lines(v0, v1))
% 18.34/3.18  
% 18.34/3.18    (con)
% 18.34/3.18     ? [v0: $i] :  ? [v1: $i] :  ? [v2: $i] :  ? [v3: $i] :  ? [v4: $i] : ($i(v4)
% 18.34/3.18      & $i(v3) & $i(v2) & $i(v1) & $i(v0) & between_on_line(v0, v2, v3, v4) &
% 18.34/3.18      incident_point_and_line(v3, v1) & convergent_lines(v0, v1) &  ~
% 18.34/3.18      divides_points(v1, v2, v4))
% 18.34/3.18  
% 18.34/3.18  Further assumptions not needed in the proof:
% 18.34/3.18  --------------------------------------------
% 18.34/3.18  a2_defns, a3_defns, a4_defns, a5_defns, a6_defns, a8_defns, a9_defns,
% 18.34/3.18  ax10_basics, ax10_cons_objs, ax1_basics, ax1_cons_objs, ax1_subs, ax1_uniq_cons,
% 18.34/3.18  ax2_basics, ax2_cons_objs, ax2_subs, ax2_uniq_cons, ax3_basics, ax3_cons_objs,
% 18.34/3.18  ax3_subs, ax4_basics, ax4_cons_objs, ax4_defns, ax5_basics, ax5_cons_objs,
% 18.34/3.18  ax6_basics, ax7_basics, ax7_cons_objs, ax8_basics, ax8_cons_objs, ax9_cons_objs
% 18.34/3.18  
% 18.34/3.18  Those formulas are unsatisfiable:
% 18.34/3.18  ---------------------------------
% 18.34/3.18  
% 18.34/3.18  Begin of proof
% 18.34/3.18  | 
% 18.34/3.19  | ALPHA: (a1_defns) implies:
% 18.34/3.19  |   (1)   ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : ( ~ (reverse_line(v1) = v2) |
% 18.34/3.19  |           ~ $i(v1) |  ~ $i(v0) |  ~ unequally_directed_opposite_lines(v0, v1)
% 18.34/3.19  |          | unequally_directed_lines(v0, v2))
% 18.34/3.19  | 
% 18.34/3.19  | ALPHA: (a7_defns) implies:
% 18.34/3.19  |   (2)   ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~
% 18.34/3.19  |          convergent_lines(v0, v1) | unequally_directed_opposite_lines(v0, v1))
% 18.34/3.19  |   (3)   ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~
% 18.34/3.19  |          convergent_lines(v0, v1) | unequally_directed_lines(v0, v1))
% 18.34/3.19  | 
% 18.34/3.19  | ALPHA: (ax11_basics) implies:
% 18.34/3.19  |   (4)   ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~
% 18.34/3.19  |          left_convergent_lines(v0, v1))
% 18.34/3.19  | 
% 18.34/3.19  | ALPHA: (ax6_cons_objs) implies:
% 18.34/3.19  |   (5)   ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~
% 18.34/3.19  |          unequally_directed_lines(v0, v1) |  ? [v2: $i] :  ? [v3: $i] :
% 18.34/3.19  |          (intersection_point(v0, v1) = v3 & reverse_line(v1) = v2 & $i(v3) &
% 18.34/3.19  |            $i(v2) & ( ~ unequally_directed_lines(v0, v2) | ( ~
% 18.34/3.19  |                apart_point_and_line(v3, v1) &  ~ apart_point_and_line(v3,
% 18.34/3.19  |                  v0)))))
% 18.34/3.19  | 
% 18.34/3.19  | DELTA: instantiating (con) with fresh symbols all_49_0, all_49_1, all_49_2,
% 18.34/3.19  |        all_49_3, all_49_4 gives:
% 18.34/3.19  |   (6)  $i(all_49_0) & $i(all_49_1) & $i(all_49_2) & $i(all_49_3) &
% 18.34/3.19  |        $i(all_49_4) & between_on_line(all_49_4, all_49_2, all_49_1, all_49_0)
% 18.34/3.19  |        & incident_point_and_line(all_49_1, all_49_3) &
% 18.34/3.19  |        convergent_lines(all_49_4, all_49_3) &  ~ divides_points(all_49_3,
% 18.34/3.19  |          all_49_2, all_49_0)
% 18.34/3.19  | 
% 18.34/3.19  | ALPHA: (6) implies:
% 18.34/3.19  |   (7)  convergent_lines(all_49_4, all_49_3)
% 18.34/3.19  |   (8)  $i(all_49_4)
% 18.34/3.19  |   (9)  $i(all_49_3)
% 18.34/3.19  | 
% 18.34/3.19  | GROUND_INST: instantiating (3) with all_49_4, all_49_3, simplifying with (7),
% 18.34/3.19  |              (8), (9) gives:
% 18.34/3.19  |   (10)  unequally_directed_lines(all_49_4, all_49_3)
% 18.34/3.19  | 
% 18.34/3.19  | GROUND_INST: instantiating (2) with all_49_4, all_49_3, simplifying with (7),
% 18.34/3.19  |              (8), (9) gives:
% 18.34/3.19  |   (11)  unequally_directed_opposite_lines(all_49_4, all_49_3)
% 18.47/3.19  | 
% 18.47/3.19  | GROUND_INST: instantiating (5) with all_49_4, all_49_3, simplifying with (8),
% 18.47/3.19  |              (9), (10) gives:
% 18.47/3.20  |   (12)   ? [v0: $i] :  ? [v1: $i] : (intersection_point(all_49_4, all_49_3) =
% 18.47/3.20  |           v1 & reverse_line(all_49_3) = v0 & $i(v1) & $i(v0) & ( ~
% 18.47/3.20  |             unequally_directed_lines(all_49_4, v0) | ( ~
% 18.47/3.20  |               apart_point_and_line(v1, all_49_3) &  ~ apart_point_and_line(v1,
% 18.47/3.20  |                 all_49_4))))
% 18.47/3.20  | 
% 18.47/3.20  | DELTA: instantiating (12) with fresh symbols all_62_0, all_62_1 gives:
% 18.47/3.20  |   (13)  intersection_point(all_49_4, all_49_3) = all_62_0 &
% 18.47/3.20  |         reverse_line(all_49_3) = all_62_1 & $i(all_62_0) & $i(all_62_1) & ( ~
% 18.47/3.20  |           unequally_directed_lines(all_49_4, all_62_1) | ( ~
% 18.47/3.20  |             apart_point_and_line(all_62_0, all_49_3) &  ~
% 18.47/3.20  |             apart_point_and_line(all_62_0, all_49_4)))
% 18.47/3.20  | 
% 18.47/3.20  | ALPHA: (13) implies:
% 18.47/3.20  |   (14)  $i(all_62_1)
% 18.47/3.20  |   (15)  reverse_line(all_49_3) = all_62_1
% 18.47/3.20  |   (16)   ~ unequally_directed_lines(all_49_4, all_62_1) | ( ~
% 18.47/3.20  |           apart_point_and_line(all_62_0, all_49_3) &  ~
% 18.47/3.20  |           apart_point_and_line(all_62_0, all_49_4))
% 18.47/3.20  | 
% 18.47/3.20  | GROUND_INST: instantiating (1) with all_49_4, all_49_3, all_62_1, simplifying
% 18.47/3.20  |              with (8), (9), (11), (15) gives:
% 18.47/3.20  |   (17)  unequally_directed_lines(all_49_4, all_62_1)
% 18.47/3.20  | 
% 18.47/3.20  | BETA: splitting (16) gives:
% 18.47/3.20  | 
% 18.47/3.20  | Case 1:
% 18.47/3.20  | | 
% 18.47/3.20  | |   (18)   ~ unequally_directed_lines(all_49_4, all_62_1)
% 18.47/3.20  | | 
% 18.47/3.20  | | PRED_UNIFY: (17), (18) imply:
% 18.47/3.20  | |   (19)  $false
% 18.47/3.20  | | 
% 18.47/3.20  | | CLOSE: (19) is inconsistent.
% 18.47/3.20  | | 
% 18.47/3.20  | Case 2:
% 18.47/3.20  | | 
% 18.47/3.20  | | 
% 18.47/3.20  | | GROUND_INST: instantiating (ax9_basics) with all_49_4, all_49_3, all_62_1,
% 18.47/3.20  | |              simplifying with (8), (9), (10), (15), (17) gives:
% 18.47/3.20  | |   (20)  left_convergent_lines(all_49_4, all_62_1) |
% 18.47/3.20  | |         left_convergent_lines(all_49_4, all_49_3)
% 18.47/3.20  | | 
% 18.47/3.20  | | BETA: splitting (20) gives:
% 18.47/3.20  | | 
% 18.47/3.20  | | Case 1:
% 18.47/3.20  | | | 
% 18.47/3.20  | | |   (21)  left_convergent_lines(all_49_4, all_62_1)
% 18.47/3.20  | | | 
% 18.47/3.20  | | | GROUND_INST: instantiating (4) with all_49_4, all_62_1, simplifying with
% 18.47/3.20  | | |              (8), (14), (21) gives:
% 18.47/3.20  | | |   (22)  $false
% 18.47/3.20  | | | 
% 18.47/3.20  | | | CLOSE: (22) is inconsistent.
% 18.47/3.20  | | | 
% 18.47/3.20  | | Case 2:
% 18.47/3.20  | | | 
% 18.47/3.20  | | |   (23)  left_convergent_lines(all_49_4, all_49_3)
% 18.47/3.20  | | | 
% 18.47/3.20  | | | GROUND_INST: instantiating (4) with all_49_4, all_49_3, simplifying with
% 18.47/3.20  | | |              (8), (9), (23) gives:
% 18.47/3.20  | | |   (24)  $false
% 18.47/3.20  | | | 
% 18.47/3.20  | | | CLOSE: (24) is inconsistent.
% 18.47/3.20  | | | 
% 18.47/3.20  | | End of split
% 18.47/3.20  | | 
% 18.47/3.20  | End of split
% 18.47/3.20  | 
% 18.47/3.20  End of proof
% 18.47/3.20  % SZS output end Proof for theBenchmark
% 18.47/3.20  
% 18.47/3.20  2587ms
%------------------------------------------------------------------------------