↑ Up

Princess---230619.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : GEO184+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 : n023.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:21:58 EDT 2023

% Result   : Theorem 5.77s 1.47s
% Output   : Proof 7.70s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : GEO184+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.12  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.33  % Computer : n023.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:20:39 EDT 2023
% 0.13/0.33  % CPUTime  : 
% 0.62/0.59  ________       _____
% 0.62/0.59  ___  __ \_________(_)________________________________
% 0.62/0.59  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.62/0.59  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.62/0.59  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.62/0.59  
% 0.62/0.59  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.62/0.59  (2023-06-19)
% 0.62/0.59  
% 0.62/0.59  (c) Philipp Rümmer, 2009-2023
% 0.62/0.59  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.62/0.59                Amanda Stjerna.
% 0.62/0.59  Free software under BSD-3-Clause.
% 0.62/0.59  
% 0.62/0.59  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.62/0.59  
% 0.62/0.59  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.62/0.60  Running up to 7 provers in parallel.
% 0.62/0.61  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.62/0.61  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.62/0.61  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.62/0.61  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.62/0.61  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.62/0.61  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.62/0.61  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.57/1.03  Prover 1: Preprocessing ...
% 2.57/1.04  Prover 4: Preprocessing ...
% 2.57/1.07  Prover 3: Preprocessing ...
% 2.57/1.07  Prover 6: Preprocessing ...
% 2.57/1.07  Prover 5: Preprocessing ...
% 2.57/1.07  Prover 2: Preprocessing ...
% 2.57/1.07  Prover 0: Preprocessing ...
% 4.63/1.31  Prover 2: Proving ...
% 4.63/1.32  Prover 5: Proving ...
% 4.63/1.34  Prover 6: Constructing countermodel ...
% 4.63/1.36  Prover 3: Constructing countermodel ...
% 5.08/1.36  Prover 1: Constructing countermodel ...
% 5.77/1.46  Prover 4: Constructing countermodel ...
% 5.77/1.47  Prover 2: proved (859ms)
% 5.77/1.47  
% 5.77/1.47  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.77/1.47  
% 5.77/1.47  Prover 5: proved (856ms)
% 5.77/1.47  
% 5.77/1.47  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.77/1.47  
% 5.77/1.47  Prover 0: Proving ...
% 5.77/1.47  Prover 3: stopped
% 5.77/1.47  Prover 6: stopped
% 5.77/1.48  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 5.77/1.48  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 5.77/1.48  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 5.77/1.48  Prover 0: stopped
% 5.77/1.48  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 5.77/1.49  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 6.03/1.50  Prover 8: Preprocessing ...
% 6.03/1.52  Prover 10: Preprocessing ...
% 6.03/1.52  Prover 11: Preprocessing ...
% 6.03/1.53  Prover 7: Preprocessing ...
% 6.03/1.53  Prover 13: Preprocessing ...
% 6.32/1.55  Prover 10: Warning: ignoring some quantifiers
% 6.32/1.56  Prover 7: Warning: ignoring some quantifiers
% 6.32/1.56  Prover 7: Constructing countermodel ...
% 6.32/1.57  Prover 10: Constructing countermodel ...
% 6.32/1.57  Prover 13: Warning: ignoring some quantifiers
% 6.32/1.58  Prover 13: Constructing countermodel ...
% 6.87/1.62  Prover 1: Found proof (size 32)
% 6.87/1.62  Prover 1: proved (1011ms)
% 6.87/1.62  Prover 4: stopped
% 6.87/1.62  Prover 13: stopped
% 6.87/1.62  Prover 8: Warning: ignoring some quantifiers
% 6.87/1.62  Prover 7: stopped
% 6.87/1.62  Prover 10: stopped
% 6.87/1.63  Prover 8: Constructing countermodel ...
% 6.87/1.64  Prover 8: stopped
% 7.23/1.69  Prover 11: Constructing countermodel ...
% 7.23/1.69  Prover 11: stopped
% 7.23/1.69  
% 7.23/1.70  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.23/1.70  
% 7.23/1.70  % SZS output start Proof for theBenchmark
% 7.23/1.71  Assumptions after simplification:
% 7.23/1.71  ---------------------------------
% 7.23/1.71  
% 7.23/1.71    (ci1)
% 7.23/1.73     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : ( ~ (line_connecting(v0, v1) = v2) |
% 7.23/1.73       ~ (apart_point_and_line(v0, v2) = 0) |  ~ $i(v1) |  ~ $i(v0) |  ? [v3: int]
% 7.23/1.73      : ( ~ (v3 = 0) & distinct_points(v0, v1) = v3))
% 7.23/1.73  
% 7.23/1.73    (ci2)
% 7.23/1.73     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : ( ~ (line_connecting(v0, v1) = v2) |
% 7.23/1.73       ~ (apart_point_and_line(v1, v2) = 0) |  ~ $i(v1) |  ~ $i(v0) |  ? [v3: int]
% 7.23/1.73      : ( ~ (v3 = 0) & distinct_points(v0, v1) = v3))
% 7.23/1.73  
% 7.23/1.73    (con)
% 7.23/1.74     ? [v0: $i] :  ? [v1: $i] :  ? [v2: $i] :  ? [v3: $i] :  ? [v4: int] :  ? [v5:
% 7.23/1.74      int] :  ? [v6: $i] : ( ~ (v5 = 0) &  ~ (v4 = 0) & line_connecting(v0, v1) =
% 7.23/1.74      v6 & apart_point_and_line(v1, v2) = v5 & apart_point_and_line(v0, v2) = v4 &
% 7.23/1.74      convergent_lines(v2, v3) = 0 & distinct_lines(v2, v6) = 0 &
% 7.23/1.74      distinct_points(v0, v1) = 0 & $i(v6) & $i(v3) & $i(v2) & $i(v1) & $i(v0))
% 7.23/1.74  
% 7.23/1.74    (cu1)
% 7.23/1.74     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : ( ~
% 7.23/1.74      (distinct_lines(v2, v3) = 0) |  ~ (distinct_points(v0, v1) = 0) |  ~ $i(v3)
% 7.23/1.74      |  ~ $i(v2) |  ~ $i(v1) |  ~ $i(v0) |  ? [v4: any] :  ? [v5: any] :  ? [v6:
% 7.23/1.74        any] :  ? [v7: any] : (apart_point_and_line(v1, v3) = v7 &
% 7.23/1.74        apart_point_and_line(v1, v2) = v6 & apart_point_and_line(v0, v3) = v5 &
% 7.23/1.74        apart_point_and_line(v0, v2) = v4 & (v7 = 0 | v6 = 0 | v5 = 0 | v4 = 0)))
% 7.23/1.74  
% 7.23/1.74    (function-axioms)
% 7.23/1.75     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~
% 7.23/1.75      (intersection_point(v3, v2) = v1) |  ~ (intersection_point(v3, v2) = v0)) & 
% 7.23/1.75    ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~
% 7.23/1.75      (line_connecting(v3, v2) = v1) |  ~ (line_connecting(v3, v2) = v0)) &  !
% 7.23/1.75    [v0: MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] :  ! [v3:
% 7.23/1.75      $i] : (v1 = v0 |  ~ (apart_point_and_line(v3, v2) = v1) |  ~
% 7.23/1.75      (apart_point_and_line(v3, v2) = v0)) &  ! [v0: MultipleValueBool] :  ! [v1:
% 7.23/1.75      MultipleValueBool] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~
% 7.23/1.75      (convergent_lines(v3, v2) = v1) |  ~ (convergent_lines(v3, v2) = v0)) &  !
% 7.23/1.75    [v0: MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] :  ! [v3:
% 7.23/1.75      $i] : (v1 = v0 |  ~ (distinct_lines(v3, v2) = v1) |  ~ (distinct_lines(v3,
% 7.23/1.75          v2) = v0)) &  ! [v0: MultipleValueBool] :  ! [v1: MultipleValueBool] : 
% 7.23/1.75    ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~ (distinct_points(v3, v2) = v1) |  ~
% 7.23/1.75      (distinct_points(v3, v2) = v0))
% 7.23/1.75  
% 7.23/1.75  Further assumptions not needed in the proof:
% 7.23/1.75  --------------------------------------------
% 7.23/1.75  apart1, apart2, apart3, apart4, apart5, ax6, ceq1, ceq2, ceq3, ci3, ci4
% 7.23/1.75  
% 7.23/1.75  Those formulas are unsatisfiable:
% 7.23/1.75  ---------------------------------
% 7.23/1.75  
% 7.23/1.75  Begin of proof
% 7.23/1.75  | 
% 7.23/1.75  | ALPHA: (function-axioms) implies:
% 7.23/1.75  |   (1)   ! [v0: MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] :
% 7.23/1.75  |         ! [v3: $i] : (v1 = v0 |  ~ (distinct_points(v3, v2) = v1) |  ~
% 7.23/1.75  |          (distinct_points(v3, v2) = v0))
% 7.23/1.75  |   (2)   ! [v0: MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] :
% 7.23/1.75  |         ! [v3: $i] : (v1 = v0 |  ~ (apart_point_and_line(v3, v2) = v1) |  ~
% 7.23/1.75  |          (apart_point_and_line(v3, v2) = v0))
% 7.23/1.75  | 
% 7.23/1.75  | DELTA: instantiating (con) with fresh symbols all_17_0, all_17_1, all_17_2,
% 7.23/1.75  |        all_17_3, all_17_4, all_17_5, all_17_6 gives:
% 7.23/1.75  |   (3)   ~ (all_17_1 = 0) &  ~ (all_17_2 = 0) & line_connecting(all_17_6,
% 7.23/1.75  |          all_17_5) = all_17_0 & apart_point_and_line(all_17_5, all_17_4) =
% 7.23/1.75  |        all_17_1 & apart_point_and_line(all_17_6, all_17_4) = all_17_2 &
% 7.23/1.75  |        convergent_lines(all_17_4, all_17_3) = 0 & distinct_lines(all_17_4,
% 7.23/1.75  |          all_17_0) = 0 & distinct_points(all_17_6, all_17_5) = 0 &
% 7.23/1.75  |        $i(all_17_0) & $i(all_17_3) & $i(all_17_4) & $i(all_17_5) &
% 7.23/1.75  |        $i(all_17_6)
% 7.23/1.75  | 
% 7.23/1.75  | ALPHA: (3) implies:
% 7.23/1.76  |   (4)   ~ (all_17_2 = 0)
% 7.23/1.76  |   (5)   ~ (all_17_1 = 0)
% 7.23/1.76  |   (6)  $i(all_17_6)
% 7.23/1.76  |   (7)  $i(all_17_5)
% 7.23/1.76  |   (8)  $i(all_17_4)
% 7.23/1.76  |   (9)  $i(all_17_0)
% 7.23/1.76  |   (10)  distinct_points(all_17_6, all_17_5) = 0
% 7.23/1.76  |   (11)  distinct_lines(all_17_4, all_17_0) = 0
% 7.23/1.76  |   (12)  apart_point_and_line(all_17_6, all_17_4) = all_17_2
% 7.23/1.76  |   (13)  apart_point_and_line(all_17_5, all_17_4) = all_17_1
% 7.23/1.76  |   (14)  line_connecting(all_17_6, all_17_5) = all_17_0
% 7.23/1.76  | 
% 7.23/1.76  | GROUND_INST: instantiating (cu1) with all_17_6, all_17_5, all_17_4, all_17_0,
% 7.23/1.76  |              simplifying with (6), (7), (8), (9), (10), (11) gives:
% 7.23/1.76  |   (15)   ? [v0: any] :  ? [v1: any] :  ? [v2: any] :  ? [v3: any] :
% 7.23/1.76  |         (apart_point_and_line(all_17_5, all_17_0) = v3 &
% 7.23/1.76  |           apart_point_and_line(all_17_5, all_17_4) = v2 &
% 7.23/1.76  |           apart_point_and_line(all_17_6, all_17_0) = v1 &
% 7.23/1.76  |           apart_point_and_line(all_17_6, all_17_4) = v0 & (v3 = 0 | v2 = 0 |
% 7.23/1.76  |             v1 = 0 | v0 = 0))
% 7.23/1.76  | 
% 7.23/1.76  | DELTA: instantiating (15) with fresh symbols all_24_0, all_24_1, all_24_2,
% 7.23/1.76  |        all_24_3 gives:
% 7.23/1.76  |   (16)  apart_point_and_line(all_17_5, all_17_0) = all_24_0 &
% 7.23/1.76  |         apart_point_and_line(all_17_5, all_17_4) = all_24_1 &
% 7.23/1.76  |         apart_point_and_line(all_17_6, all_17_0) = all_24_2 &
% 7.23/1.76  |         apart_point_and_line(all_17_6, all_17_4) = all_24_3 & (all_24_0 = 0 |
% 7.23/1.76  |           all_24_1 = 0 | all_24_2 = 0 | all_24_3 = 0)
% 7.23/1.76  | 
% 7.23/1.76  | ALPHA: (16) implies:
% 7.23/1.76  |   (17)  apart_point_and_line(all_17_6, all_17_4) = all_24_3
% 7.23/1.76  |   (18)  apart_point_and_line(all_17_6, all_17_0) = all_24_2
% 7.23/1.76  |   (19)  apart_point_and_line(all_17_5, all_17_4) = all_24_1
% 7.23/1.76  |   (20)  apart_point_and_line(all_17_5, all_17_0) = all_24_0
% 7.23/1.76  |   (21)  all_24_0 = 0 | all_24_1 = 0 | all_24_2 = 0 | all_24_3 = 0
% 7.23/1.76  | 
% 7.23/1.76  | GROUND_INST: instantiating (2) with all_17_2, all_24_3, all_17_4, all_17_6,
% 7.23/1.76  |              simplifying with (12), (17) gives:
% 7.23/1.76  |   (22)  all_24_3 = all_17_2
% 7.23/1.76  | 
% 7.23/1.76  | GROUND_INST: instantiating (2) with all_17_1, all_24_1, all_17_4, all_17_5,
% 7.23/1.76  |              simplifying with (13), (19) gives:
% 7.23/1.76  |   (23)  all_24_1 = all_17_1
% 7.23/1.76  | 
% 7.23/1.76  | BETA: splitting (21) gives:
% 7.23/1.76  | 
% 7.23/1.76  | Case 1:
% 7.23/1.76  | | 
% 7.23/1.76  | |   (24)  all_24_0 = 0
% 7.23/1.77  | | 
% 7.23/1.77  | | REDUCE: (20), (24) imply:
% 7.23/1.77  | |   (25)  apart_point_and_line(all_17_5, all_17_0) = 0
% 7.23/1.77  | | 
% 7.23/1.77  | | GROUND_INST: instantiating (ci2) with all_17_6, all_17_5, all_17_0,
% 7.23/1.77  | |              simplifying with (6), (7), (14), (25) gives:
% 7.23/1.77  | |   (26)   ? [v0: int] : ( ~ (v0 = 0) & distinct_points(all_17_6, all_17_5) =
% 7.23/1.77  | |           v0)
% 7.23/1.77  | | 
% 7.23/1.77  | | DELTA: instantiating (26) with fresh symbol all_42_0 gives:
% 7.23/1.77  | |   (27)   ~ (all_42_0 = 0) & distinct_points(all_17_6, all_17_5) = all_42_0
% 7.23/1.77  | | 
% 7.23/1.77  | | ALPHA: (27) implies:
% 7.23/1.77  | |   (28)   ~ (all_42_0 = 0)
% 7.23/1.77  | |   (29)  distinct_points(all_17_6, all_17_5) = all_42_0
% 7.23/1.77  | | 
% 7.23/1.77  | | GROUND_INST: instantiating (1) with 0, all_42_0, all_17_5, all_17_6,
% 7.23/1.77  | |              simplifying with (10), (29) gives:
% 7.23/1.77  | |   (30)  all_42_0 = 0
% 7.23/1.77  | | 
% 7.23/1.77  | | REDUCE: (28), (30) imply:
% 7.23/1.77  | |   (31)  $false
% 7.70/1.77  | | 
% 7.70/1.77  | | CLOSE: (31) is inconsistent.
% 7.70/1.77  | | 
% 7.70/1.77  | Case 2:
% 7.70/1.77  | | 
% 7.70/1.77  | |   (32)  all_24_1 = 0 | all_24_2 = 0 | all_24_3 = 0
% 7.70/1.77  | | 
% 7.70/1.77  | | BETA: splitting (32) gives:
% 7.70/1.77  | | 
% 7.70/1.77  | | Case 1:
% 7.70/1.77  | | | 
% 7.70/1.77  | | |   (33)  all_24_1 = 0
% 7.70/1.77  | | | 
% 7.70/1.77  | | | COMBINE_EQS: (23), (33) imply:
% 7.70/1.77  | | |   (34)  all_17_1 = 0
% 7.70/1.77  | | | 
% 7.70/1.77  | | | REDUCE: (5), (34) imply:
% 7.70/1.77  | | |   (35)  $false
% 7.70/1.77  | | | 
% 7.70/1.77  | | | CLOSE: (35) is inconsistent.
% 7.70/1.77  | | | 
% 7.70/1.77  | | Case 2:
% 7.70/1.77  | | | 
% 7.70/1.77  | | |   (36)  all_24_2 = 0 | all_24_3 = 0
% 7.70/1.77  | | | 
% 7.70/1.77  | | | BETA: splitting (36) gives:
% 7.70/1.77  | | | 
% 7.70/1.77  | | | Case 1:
% 7.70/1.77  | | | | 
% 7.70/1.77  | | | |   (37)  all_24_2 = 0
% 7.70/1.77  | | | | 
% 7.70/1.77  | | | | REDUCE: (18), (37) imply:
% 7.70/1.77  | | | |   (38)  apart_point_and_line(all_17_6, all_17_0) = 0
% 7.70/1.77  | | | | 
% 7.70/1.77  | | | | GROUND_INST: instantiating (ci1) with all_17_6, all_17_5, all_17_0,
% 7.70/1.77  | | | |              simplifying with (6), (7), (14), (38) gives:
% 7.70/1.77  | | | |   (39)   ? [v0: int] : ( ~ (v0 = 0) & distinct_points(all_17_6,
% 7.70/1.77  | | | |             all_17_5) = v0)
% 7.70/1.77  | | | | 
% 7.70/1.77  | | | | DELTA: instantiating (39) with fresh symbol all_50_0 gives:
% 7.70/1.77  | | | |   (40)   ~ (all_50_0 = 0) & distinct_points(all_17_6, all_17_5) =
% 7.70/1.77  | | | |         all_50_0
% 7.70/1.77  | | | | 
% 7.70/1.77  | | | | ALPHA: (40) implies:
% 7.70/1.77  | | | |   (41)   ~ (all_50_0 = 0)
% 7.70/1.77  | | | |   (42)  distinct_points(all_17_6, all_17_5) = all_50_0
% 7.70/1.77  | | | | 
% 7.70/1.77  | | | | GROUND_INST: instantiating (1) with 0, all_50_0, all_17_5, all_17_6,
% 7.70/1.77  | | | |              simplifying with (10), (42) gives:
% 7.70/1.77  | | | |   (43)  all_50_0 = 0
% 7.70/1.77  | | | | 
% 7.70/1.77  | | | | REDUCE: (41), (43) imply:
% 7.70/1.77  | | | |   (44)  $false
% 7.70/1.77  | | | | 
% 7.70/1.77  | | | | CLOSE: (44) is inconsistent.
% 7.70/1.77  | | | | 
% 7.70/1.78  | | | Case 2:
% 7.70/1.78  | | | | 
% 7.70/1.78  | | | |   (45)  all_24_3 = 0
% 7.70/1.78  | | | | 
% 7.70/1.78  | | | | COMBINE_EQS: (22), (45) imply:
% 7.70/1.78  | | | |   (46)  all_17_2 = 0
% 7.70/1.78  | | | | 
% 7.70/1.78  | | | | SIMP: (46) implies:
% 7.70/1.78  | | | |   (47)  all_17_2 = 0
% 7.70/1.78  | | | | 
% 7.70/1.78  | | | | REDUCE: (4), (47) imply:
% 7.70/1.78  | | | |   (48)  $false
% 7.70/1.78  | | | | 
% 7.70/1.78  | | | | CLOSE: (48) is inconsistent.
% 7.70/1.78  | | | | 
% 7.70/1.78  | | | End of split
% 7.70/1.78  | | | 
% 7.70/1.78  | | End of split
% 7.70/1.78  | | 
% 7.70/1.78  | End of split
% 7.70/1.78  | 
% 7.70/1.78  End of proof
% 7.70/1.78  % SZS output end Proof for theBenchmark
% 7.70/1.78  
% 7.70/1.78  1186ms
%------------------------------------------------------------------------------