TSTP Solution File: GEO170+1 by Princess---230619

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : GEO170+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 : 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:21:48 EDT 2023

% Result   : Theorem 6.09s 1.62s
% Output   : Proof 9.74s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10  % Problem  : GEO170+1 : TPTP v8.1.2. Released v3.3.0.
% 0.03/0.11  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.10/0.31  % Computer : n007.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit : 300
% 0.10/0.31  % WCLimit  : 300
% 0.10/0.31  % DateTime : Tue Aug 29 21:55:43 EDT 2023
% 0.10/0.31  % CPUTime  : 
% 0.56/0.58  ________       _____
% 0.56/0.58  ___  __ \_________(_)________________________________
% 0.56/0.58  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.56/0.58  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.56/0.58  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.56/0.58  
% 0.56/0.58  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.56/0.58  (2023-06-19)
% 0.56/0.58  
% 0.56/0.58  (c) Philipp Rümmer, 2009-2023
% 0.56/0.58  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.56/0.58                Amanda Stjerna.
% 0.56/0.58  Free software under BSD-3-Clause.
% 0.56/0.58  
% 0.56/0.58  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.56/0.58  
% 0.56/0.58  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.56/0.60  Running up to 7 provers in parallel.
% 0.56/0.61  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.56/0.61  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.56/0.61  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.56/0.61  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.56/0.61  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.56/0.61  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.56/0.61  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.37/1.08  Prover 4: Preprocessing ...
% 2.37/1.08  Prover 1: Preprocessing ...
% 2.67/1.13  Prover 0: Preprocessing ...
% 2.67/1.13  Prover 3: Preprocessing ...
% 2.67/1.13  Prover 2: Preprocessing ...
% 2.67/1.13  Prover 5: Preprocessing ...
% 2.67/1.13  Prover 6: Preprocessing ...
% 4.75/1.42  Prover 5: Proving ...
% 4.75/1.42  Prover 2: Proving ...
% 4.75/1.44  Prover 6: Constructing countermodel ...
% 5.41/1.47  Prover 3: Constructing countermodel ...
% 5.65/1.49  Prover 1: Constructing countermodel ...
% 6.09/1.62  Prover 5: proved (1005ms)
% 6.09/1.62  
% 6.09/1.62  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.09/1.62  
% 6.09/1.62  Prover 2: proved (1010ms)
% 6.09/1.62  
% 6.09/1.62  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.09/1.62  
% 6.09/1.62  Prover 6: stopped
% 6.09/1.62  Prover 3: stopped
% 6.09/1.62  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 6.09/1.62  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 6.69/1.63  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 6.69/1.63  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 6.69/1.63  Prover 4: Constructing countermodel ...
% 6.69/1.66  Prover 0: Proving ...
% 6.69/1.67  Prover 8: Preprocessing ...
% 6.69/1.67  Prover 11: Preprocessing ...
% 7.10/1.69  Prover 7: Preprocessing ...
% 7.10/1.69  Prover 10: Preprocessing ...
% 7.10/1.69  Prover 0: stopped
% 7.10/1.70  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 7.10/1.74  Prover 13: Preprocessing ...
% 7.10/1.75  Prover 10: Warning: ignoring some quantifiers
% 7.10/1.77  Prover 10: Constructing countermodel ...
% 7.75/1.78  Prover 7: Warning: ignoring some quantifiers
% 7.89/1.79  Prover 7: Constructing countermodel ...
% 7.89/1.79  Prover 8: Warning: ignoring some quantifiers
% 8.08/1.82  Prover 8: Constructing countermodel ...
% 8.08/1.82  Prover 13: Warning: ignoring some quantifiers
% 8.18/1.83  Prover 13: Constructing countermodel ...
% 8.18/1.86  Prover 1: Found proof (size 32)
% 8.18/1.88  Prover 1: proved (1252ms)
% 8.18/1.88  Prover 4: stopped
% 8.18/1.88  Prover 8: stopped
% 8.18/1.88  Prover 13: stopped
% 8.18/1.88  Prover 10: stopped
% 8.18/1.88  Prover 7: stopped
% 9.08/1.99  Prover 11: Constructing countermodel ...
% 9.08/2.00  Prover 11: stopped
% 9.08/2.00  
% 9.08/2.00  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.08/2.00  
% 9.08/2.01  % SZS output start Proof for theBenchmark
% 9.08/2.02  Assumptions after simplification:
% 9.08/2.02  ---------------------------------
% 9.08/2.02  
% 9.08/2.02    (ci1)
% 9.08/2.06     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : ( ~ (line_connecting(v0, v1) = v2) |
% 9.08/2.06       ~ (apart_point_and_line(v0, v2) = 0) |  ~ $i(v1) |  ~ $i(v0) |  ? [v3: int]
% 9.08/2.06      : ( ~ (v3 = 0) & distinct_points(v0, v1) = v3))
% 9.08/2.06  
% 9.08/2.06    (ci2)
% 9.51/2.07     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : ( ~ (line_connecting(v0, v1) = v2) |
% 9.51/2.07       ~ (apart_point_and_line(v1, v2) = 0) |  ~ $i(v1) |  ~ $i(v0) |  ? [v3: int]
% 9.51/2.07      : ( ~ (v3 = 0) & distinct_points(v0, v1) = v3))
% 9.51/2.07  
% 9.51/2.07    (con)
% 9.51/2.07     ? [v0: $i] :  ? [v1: $i] :  ? [v2: $i] :  ? [v3: int] :  ? [v4: int] :  ?
% 9.51/2.07    [v5: $i] : ( ~ (v4 = 0) &  ~ (v3 = 0) & line_connecting(v0, v1) = v5 &
% 9.51/2.07      apart_point_and_line(v1, v2) = v4 & apart_point_and_line(v0, v2) = v3 &
% 9.51/2.07      distinct_lines(v2, v5) = 0 & distinct_points(v0, v1) = 0 & $i(v5) & $i(v2) &
% 9.51/2.07      $i(v1) & $i(v0))
% 9.51/2.07  
% 9.51/2.07    (cu1)
% 9.51/2.08     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : ( ~
% 9.51/2.08      (distinct_lines(v2, v3) = 0) |  ~ (distinct_points(v0, v1) = 0) |  ~ $i(v3)
% 9.51/2.08      |  ~ $i(v2) |  ~ $i(v1) |  ~ $i(v0) |  ? [v4: any] :  ? [v5: any] :  ? [v6:
% 9.51/2.08        any] :  ? [v7: any] : (apart_point_and_line(v1, v3) = v7 &
% 9.51/2.08        apart_point_and_line(v1, v2) = v6 & apart_point_and_line(v0, v3) = v5 &
% 9.51/2.08        apart_point_and_line(v0, v2) = v4 & (v7 = 0 | v6 = 0 | v5 = 0 | v4 = 0)))
% 9.51/2.08  
% 9.51/2.08    (function-axioms)
% 9.59/2.09     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~
% 9.59/2.09      (intersection_point(v3, v2) = v1) |  ~ (intersection_point(v3, v2) = v0)) & 
% 9.59/2.09    ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~
% 9.59/2.09      (line_connecting(v3, v2) = v1) |  ~ (line_connecting(v3, v2) = v0)) &  !
% 9.59/2.09    [v0: MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] :  ! [v3:
% 9.59/2.09      $i] : (v1 = v0 |  ~ (apart_point_and_line(v3, v2) = v1) |  ~
% 9.59/2.09      (apart_point_and_line(v3, v2) = v0)) &  ! [v0: MultipleValueBool] :  ! [v1:
% 9.59/2.09      MultipleValueBool] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~
% 9.59/2.09      (convergent_lines(v3, v2) = v1) |  ~ (convergent_lines(v3, v2) = v0)) &  !
% 9.59/2.09    [v0: MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] :  ! [v3:
% 9.59/2.09      $i] : (v1 = v0 |  ~ (distinct_lines(v3, v2) = v1) |  ~ (distinct_lines(v3,
% 9.59/2.09          v2) = v0)) &  ! [v0: MultipleValueBool] :  ! [v1: MultipleValueBool] : 
% 9.59/2.09    ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~ (distinct_points(v3, v2) = v1) |  ~
% 9.59/2.09      (distinct_points(v3, v2) = v0))
% 9.59/2.09  
% 9.59/2.09  Further assumptions not needed in the proof:
% 9.59/2.09  --------------------------------------------
% 9.59/2.09  apart1, apart2, apart3, apart4, apart5, ax6, ceq1, ceq2, ceq3, ci3, ci4
% 9.59/2.09  
% 9.59/2.09  Those formulas are unsatisfiable:
% 9.59/2.09  ---------------------------------
% 9.59/2.09  
% 9.59/2.09  Begin of proof
% 9.59/2.09  | 
% 9.59/2.09  | ALPHA: (function-axioms) implies:
% 9.59/2.10  |   (1)   ! [v0: MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] :
% 9.59/2.10  |         ! [v3: $i] : (v1 = v0 |  ~ (distinct_points(v3, v2) = v1) |  ~
% 9.59/2.10  |          (distinct_points(v3, v2) = v0))
% 9.59/2.10  |   (2)   ! [v0: MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] :
% 9.59/2.10  |         ! [v3: $i] : (v1 = v0 |  ~ (apart_point_and_line(v3, v2) = v1) |  ~
% 9.59/2.10  |          (apart_point_and_line(v3, v2) = v0))
% 9.59/2.10  | 
% 9.59/2.10  | DELTA: instantiating (con) with fresh symbols all_17_0, all_17_1, all_17_2,
% 9.59/2.10  |        all_17_3, all_17_4, all_17_5 gives:
% 9.59/2.10  |   (3)   ~ (all_17_1 = 0) &  ~ (all_17_2 = 0) & line_connecting(all_17_5,
% 9.59/2.10  |          all_17_4) = all_17_0 & apart_point_and_line(all_17_4, all_17_3) =
% 9.59/2.10  |        all_17_1 & apart_point_and_line(all_17_5, all_17_3) = all_17_2 &
% 9.59/2.10  |        distinct_lines(all_17_3, all_17_0) = 0 & distinct_points(all_17_5,
% 9.59/2.10  |          all_17_4) = 0 & $i(all_17_0) & $i(all_17_3) & $i(all_17_4) &
% 9.59/2.10  |        $i(all_17_5)
% 9.59/2.10  | 
% 9.59/2.10  | ALPHA: (3) implies:
% 9.59/2.10  |   (4)   ~ (all_17_2 = 0)
% 9.59/2.10  |   (5)   ~ (all_17_1 = 0)
% 9.59/2.10  |   (6)  $i(all_17_5)
% 9.59/2.10  |   (7)  $i(all_17_4)
% 9.59/2.10  |   (8)  $i(all_17_3)
% 9.59/2.10  |   (9)  $i(all_17_0)
% 9.59/2.11  |   (10)  distinct_points(all_17_5, all_17_4) = 0
% 9.59/2.11  |   (11)  distinct_lines(all_17_3, all_17_0) = 0
% 9.59/2.11  |   (12)  apart_point_and_line(all_17_5, all_17_3) = all_17_2
% 9.59/2.11  |   (13)  apart_point_and_line(all_17_4, all_17_3) = all_17_1
% 9.59/2.11  |   (14)  line_connecting(all_17_5, all_17_4) = all_17_0
% 9.59/2.11  | 
% 9.59/2.11  | GROUND_INST: instantiating (cu1) with all_17_5, all_17_4, all_17_3, all_17_0,
% 9.59/2.11  |              simplifying with (6), (7), (8), (9), (10), (11) gives:
% 9.59/2.11  |   (15)   ? [v0: any] :  ? [v1: any] :  ? [v2: any] :  ? [v3: any] :
% 9.59/2.11  |         (apart_point_and_line(all_17_4, all_17_0) = v3 &
% 9.59/2.11  |           apart_point_and_line(all_17_4, all_17_3) = v2 &
% 9.59/2.11  |           apart_point_and_line(all_17_5, all_17_0) = v1 &
% 9.59/2.11  |           apart_point_and_line(all_17_5, all_17_3) = v0 & (v3 = 0 | v2 = 0 |
% 9.59/2.11  |             v1 = 0 | v0 = 0))
% 9.59/2.11  | 
% 9.59/2.11  | DELTA: instantiating (15) with fresh symbols all_24_0, all_24_1, all_24_2,
% 9.59/2.11  |        all_24_3 gives:
% 9.74/2.12  |   (16)  apart_point_and_line(all_17_4, all_17_0) = all_24_0 &
% 9.74/2.12  |         apart_point_and_line(all_17_4, all_17_3) = all_24_1 &
% 9.74/2.12  |         apart_point_and_line(all_17_5, all_17_0) = all_24_2 &
% 9.74/2.12  |         apart_point_and_line(all_17_5, all_17_3) = all_24_3 & (all_24_0 = 0 |
% 9.74/2.12  |           all_24_1 = 0 | all_24_2 = 0 | all_24_3 = 0)
% 9.74/2.12  | 
% 9.74/2.12  | ALPHA: (16) implies:
% 9.74/2.12  |   (17)  apart_point_and_line(all_17_5, all_17_3) = all_24_3
% 9.74/2.12  |   (18)  apart_point_and_line(all_17_5, all_17_0) = all_24_2
% 9.74/2.12  |   (19)  apart_point_and_line(all_17_4, all_17_3) = all_24_1
% 9.74/2.12  |   (20)  apart_point_and_line(all_17_4, all_17_0) = all_24_0
% 9.74/2.12  |   (21)  all_24_0 = 0 | all_24_1 = 0 | all_24_2 = 0 | all_24_3 = 0
% 9.74/2.12  | 
% 9.74/2.12  | GROUND_INST: instantiating (2) with all_17_2, all_24_3, all_17_3, all_17_5,
% 9.74/2.12  |              simplifying with (12), (17) gives:
% 9.74/2.12  |   (22)  all_24_3 = all_17_2
% 9.74/2.12  | 
% 9.74/2.12  | GROUND_INST: instantiating (2) with all_17_1, all_24_1, all_17_3, all_17_4,
% 9.74/2.12  |              simplifying with (13), (19) gives:
% 9.74/2.12  |   (23)  all_24_1 = all_17_1
% 9.74/2.12  | 
% 9.74/2.12  | BETA: splitting (21) gives:
% 9.74/2.12  | 
% 9.74/2.12  | Case 1:
% 9.74/2.12  | | 
% 9.74/2.12  | |   (24)  all_24_0 = 0
% 9.74/2.12  | | 
% 9.74/2.12  | | REDUCE: (20), (24) imply:
% 9.74/2.12  | |   (25)  apart_point_and_line(all_17_4, all_17_0) = 0
% 9.74/2.12  | | 
% 9.74/2.12  | | GROUND_INST: instantiating (ci2) with all_17_5, all_17_4, all_17_0,
% 9.74/2.12  | |              simplifying with (6), (7), (14), (25) gives:
% 9.74/2.12  | |   (26)   ? [v0: int] : ( ~ (v0 = 0) & distinct_points(all_17_5, all_17_4) =
% 9.74/2.12  | |           v0)
% 9.74/2.12  | | 
% 9.74/2.12  | | DELTA: instantiating (26) with fresh symbol all_42_0 gives:
% 9.74/2.12  | |   (27)   ~ (all_42_0 = 0) & distinct_points(all_17_5, all_17_4) = all_42_0
% 9.74/2.12  | | 
% 9.74/2.12  | | ALPHA: (27) implies:
% 9.74/2.12  | |   (28)   ~ (all_42_0 = 0)
% 9.74/2.12  | |   (29)  distinct_points(all_17_5, all_17_4) = all_42_0
% 9.74/2.12  | | 
% 9.74/2.13  | | GROUND_INST: instantiating (1) with 0, all_42_0, all_17_4, all_17_5,
% 9.74/2.13  | |              simplifying with (10), (29) gives:
% 9.74/2.13  | |   (30)  all_42_0 = 0
% 9.74/2.13  | | 
% 9.74/2.13  | | REDUCE: (28), (30) imply:
% 9.74/2.13  | |   (31)  $false
% 9.74/2.13  | | 
% 9.74/2.13  | | CLOSE: (31) is inconsistent.
% 9.74/2.13  | | 
% 9.74/2.13  | Case 2:
% 9.74/2.13  | | 
% 9.74/2.13  | |   (32)  all_24_1 = 0 | all_24_2 = 0 | all_24_3 = 0
% 9.74/2.13  | | 
% 9.74/2.13  | | BETA: splitting (32) gives:
% 9.74/2.13  | | 
% 9.74/2.13  | | Case 1:
% 9.74/2.13  | | | 
% 9.74/2.13  | | |   (33)  all_24_1 = 0
% 9.74/2.13  | | | 
% 9.74/2.13  | | | COMBINE_EQS: (23), (33) imply:
% 9.74/2.13  | | |   (34)  all_17_1 = 0
% 9.74/2.13  | | | 
% 9.74/2.13  | | | REDUCE: (5), (34) imply:
% 9.74/2.13  | | |   (35)  $false
% 9.74/2.13  | | | 
% 9.74/2.13  | | | CLOSE: (35) is inconsistent.
% 9.74/2.13  | | | 
% 9.74/2.13  | | Case 2:
% 9.74/2.13  | | | 
% 9.74/2.13  | | |   (36)  all_24_2 = 0 | all_24_3 = 0
% 9.74/2.13  | | | 
% 9.74/2.13  | | | BETA: splitting (36) gives:
% 9.74/2.13  | | | 
% 9.74/2.13  | | | Case 1:
% 9.74/2.13  | | | | 
% 9.74/2.13  | | | |   (37)  all_24_2 = 0
% 9.74/2.13  | | | | 
% 9.74/2.13  | | | | REDUCE: (18), (37) imply:
% 9.74/2.13  | | | |   (38)  apart_point_and_line(all_17_5, all_17_0) = 0
% 9.74/2.13  | | | | 
% 9.74/2.13  | | | | GROUND_INST: instantiating (ci1) with all_17_5, all_17_4, all_17_0,
% 9.74/2.13  | | | |              simplifying with (6), (7), (14), (38) gives:
% 9.74/2.14  | | | |   (39)   ? [v0: int] : ( ~ (v0 = 0) & distinct_points(all_17_5,
% 9.74/2.14  | | | |             all_17_4) = v0)
% 9.74/2.14  | | | | 
% 9.74/2.14  | | | | DELTA: instantiating (39) with fresh symbol all_50_0 gives:
% 9.74/2.14  | | | |   (40)   ~ (all_50_0 = 0) & distinct_points(all_17_5, all_17_4) =
% 9.74/2.14  | | | |         all_50_0
% 9.74/2.14  | | | | 
% 9.74/2.14  | | | | ALPHA: (40) implies:
% 9.74/2.14  | | | |   (41)   ~ (all_50_0 = 0)
% 9.74/2.14  | | | |   (42)  distinct_points(all_17_5, all_17_4) = all_50_0
% 9.74/2.14  | | | | 
% 9.74/2.14  | | | | GROUND_INST: instantiating (1) with 0, all_50_0, all_17_4, all_17_5,
% 9.74/2.14  | | | |              simplifying with (10), (42) gives:
% 9.74/2.14  | | | |   (43)  all_50_0 = 0
% 9.74/2.14  | | | | 
% 9.74/2.14  | | | | REDUCE: (41), (43) imply:
% 9.74/2.14  | | | |   (44)  $false
% 9.74/2.14  | | | | 
% 9.74/2.14  | | | | CLOSE: (44) is inconsistent.
% 9.74/2.14  | | | | 
% 9.74/2.14  | | | Case 2:
% 9.74/2.14  | | | | 
% 9.74/2.14  | | | |   (45)  all_24_3 = 0
% 9.74/2.14  | | | | 
% 9.74/2.14  | | | | COMBINE_EQS: (22), (45) imply:
% 9.74/2.14  | | | |   (46)  all_17_2 = 0
% 9.74/2.14  | | | | 
% 9.74/2.14  | | | | SIMP: (46) implies:
% 9.74/2.14  | | | |   (47)  all_17_2 = 0
% 9.74/2.14  | | | | 
% 9.74/2.14  | | | | REDUCE: (4), (47) imply:
% 9.74/2.14  | | | |   (48)  $false
% 9.74/2.14  | | | | 
% 9.74/2.14  | | | | CLOSE: (48) is inconsistent.
% 9.74/2.14  | | | | 
% 9.74/2.14  | | | End of split
% 9.74/2.14  | | | 
% 9.74/2.14  | | End of split
% 9.74/2.14  | | 
% 9.74/2.14  | End of split
% 9.74/2.14  | 
% 9.74/2.14  End of proof
% 9.74/2.14  % SZS output end Proof for theBenchmark
% 9.74/2.14  
% 9.74/2.14  1555ms
%------------------------------------------------------------------------------