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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : GEO183+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:57 EDT 2023

% Result   : Theorem 5.43s 1.52s
% Output   : Proof 7.23s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GEO183+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.12  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.12/0.33  % Computer : n007.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Tue Aug 29 22:27:29 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.50/0.60  ________       _____
% 0.50/0.60  ___  __ \_________(_)________________________________
% 0.50/0.60  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.50/0.60  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.50/0.60  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.50/0.60  
% 0.50/0.60  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.50/0.60  (2023-06-19)
% 0.50/0.60  
% 0.50/0.60  (c) Philipp Rümmer, 2009-2023
% 0.50/0.60  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.50/0.60                Amanda Stjerna.
% 0.50/0.60  Free software under BSD-3-Clause.
% 0.50/0.60  
% 0.50/0.60  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.50/0.60  
% 0.50/0.60  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.50/0.61  Running up to 7 provers in parallel.
% 0.50/0.63  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.50/0.63  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.50/0.63  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.50/0.63  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.50/0.63  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.50/0.63  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.50/0.63  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.55/1.05  Prover 1: Preprocessing ...
% 2.55/1.06  Prover 4: Preprocessing ...
% 2.62/1.10  Prover 2: Preprocessing ...
% 2.62/1.10  Prover 5: Preprocessing ...
% 2.62/1.10  Prover 3: Preprocessing ...
% 2.62/1.10  Prover 6: Preprocessing ...
% 2.96/1.11  Prover 0: Preprocessing ...
% 4.15/1.33  Prover 2: Proving ...
% 4.15/1.33  Prover 5: Proving ...
% 4.58/1.35  Prover 6: Constructing countermodel ...
% 4.68/1.36  Prover 3: Constructing countermodel ...
% 4.68/1.40  Prover 1: Constructing countermodel ...
% 5.43/1.49  Prover 4: Constructing countermodel ...
% 5.43/1.51  Prover 0: Proving ...
% 5.43/1.52  Prover 6: proved (895ms)
% 5.43/1.52  Prover 3: proved (898ms)
% 5.43/1.52  
% 5.43/1.52  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.43/1.52  
% 5.43/1.53  
% 5.43/1.53  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.43/1.53  
% 5.43/1.53  Prover 0: stopped
% 5.43/1.53  Prover 2: stopped
% 5.43/1.53  Prover 5: stopped
% 5.43/1.53  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 5.43/1.53  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 5.43/1.53  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 5.43/1.53  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 5.43/1.53  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 6.07/1.57  Prover 8: Preprocessing ...
% 6.07/1.57  Prover 10: Preprocessing ...
% 6.40/1.58  Prover 11: Preprocessing ...
% 6.40/1.58  Prover 13: Preprocessing ...
% 6.40/1.59  Prover 7: Preprocessing ...
% 6.40/1.61  Prover 10: Warning: ignoring some quantifiers
% 6.40/1.61  Prover 1: Found proof (size 26)
% 6.40/1.61  Prover 1: proved (987ms)
% 6.40/1.61  Prover 4: stopped
% 6.40/1.62  Prover 10: Constructing countermodel ...
% 6.40/1.62  Prover 10: stopped
% 6.40/1.62  Prover 7: Warning: ignoring some quantifiers
% 6.40/1.63  Prover 13: stopped
% 6.40/1.63  Prover 7: Constructing countermodel ...
% 6.40/1.64  Prover 7: stopped
% 6.40/1.64  Prover 8: Warning: ignoring some quantifiers
% 6.86/1.65  Prover 8: Constructing countermodel ...
% 6.86/1.65  Prover 8: stopped
% 6.86/1.66  Prover 11: stopped
% 6.86/1.66  
% 6.86/1.66  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.86/1.66  
% 6.86/1.66  % SZS output start Proof for theBenchmark
% 6.94/1.67  Assumptions after simplification:
% 6.94/1.67  ---------------------------------
% 6.94/1.67  
% 6.94/1.67    (ceq2)
% 6.94/1.70     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: int] : (v3 = 0 |  ~
% 6.94/1.70      (apart_point_and_line(v0, v1) = 0) |  ~ (distinct_lines(v1, v2) = v3) |  ~
% 6.94/1.70      $i(v2) |  ~ $i(v1) |  ~ $i(v0) | apart_point_and_line(v0, v2) = 0)
% 6.94/1.70  
% 6.94/1.70    (ci1)
% 6.94/1.70     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : ( ~ (line_connecting(v0, v1) = v2) |
% 6.94/1.70       ~ (apart_point_and_line(v0, v2) = 0) |  ~ $i(v1) |  ~ $i(v0) |  ? [v3: int]
% 6.94/1.70      : ( ~ (v3 = 0) & distinct_points(v0, v1) = v3))
% 6.94/1.70  
% 6.94/1.70    (ci2)
% 6.94/1.70     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : ( ~ (line_connecting(v0, v1) = v2) |
% 6.94/1.70       ~ (apart_point_and_line(v1, v2) = 0) |  ~ $i(v1) |  ~ $i(v0) |  ? [v3: int]
% 6.94/1.70      : ( ~ (v3 = 0) & distinct_points(v0, v1) = v3))
% 6.94/1.70  
% 6.94/1.70    (con)
% 6.94/1.70     ? [v0: $i] :  ? [v1: $i] :  ? [v2: $i] :  ? [v3: $i] :  ? [v4: $i] :  ? [v5:
% 6.94/1.70      int] :  ? [v6: any] :  ? [v7: any] : ( ~ (v5 = 0) & line_connecting(v0, v1)
% 6.94/1.70      = v4 & apart_point_and_line(v1, v2) = v7 & apart_point_and_line(v0, v2) = v6
% 6.94/1.70      & convergent_lines(v2, v3) = 0 & distinct_lines(v2, v4) = v5 &
% 6.94/1.70      distinct_points(v0, v1) = 0 & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0) &
% 6.94/1.70      (v7 = 0 | v6 = 0))
% 6.94/1.70  
% 6.94/1.70    (function-axioms)
% 6.94/1.71     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~
% 6.94/1.71      (intersection_point(v3, v2) = v1) |  ~ (intersection_point(v3, v2) = v0)) & 
% 6.94/1.71    ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~
% 6.94/1.71      (line_connecting(v3, v2) = v1) |  ~ (line_connecting(v3, v2) = v0)) &  !
% 6.94/1.71    [v0: MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] :  ! [v3:
% 6.94/1.71      $i] : (v1 = v0 |  ~ (apart_point_and_line(v3, v2) = v1) |  ~
% 6.94/1.71      (apart_point_and_line(v3, v2) = v0)) &  ! [v0: MultipleValueBool] :  ! [v1:
% 6.94/1.71      MultipleValueBool] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~
% 6.94/1.71      (convergent_lines(v3, v2) = v1) |  ~ (convergent_lines(v3, v2) = v0)) &  !
% 6.94/1.71    [v0: MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] :  ! [v3:
% 6.94/1.71      $i] : (v1 = v0 |  ~ (distinct_lines(v3, v2) = v1) |  ~ (distinct_lines(v3,
% 6.94/1.71          v2) = v0)) &  ! [v0: MultipleValueBool] :  ! [v1: MultipleValueBool] : 
% 6.94/1.71    ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~ (distinct_points(v3, v2) = v1) |  ~
% 6.94/1.71      (distinct_points(v3, v2) = v0))
% 6.94/1.71  
% 6.94/1.71  Further assumptions not needed in the proof:
% 6.94/1.71  --------------------------------------------
% 6.94/1.71  apart1, apart2, apart3, apart4, apart5, ax6, ceq1, ceq3, ci3, ci4, cu1
% 6.94/1.71  
% 6.94/1.71  Those formulas are unsatisfiable:
% 6.94/1.71  ---------------------------------
% 6.94/1.71  
% 6.94/1.71  Begin of proof
% 6.94/1.71  | 
% 6.94/1.71  | ALPHA: (function-axioms) implies:
% 6.94/1.71  |   (1)   ! [v0: MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] :
% 6.94/1.71  |         ! [v3: $i] : (v1 = v0 |  ~ (distinct_points(v3, v2) = v1) |  ~
% 6.94/1.71  |          (distinct_points(v3, v2) = v0))
% 6.94/1.71  | 
% 6.94/1.71  | DELTA: instantiating (con) with fresh symbols all_17_0, all_17_1, all_17_2,
% 6.94/1.71  |        all_17_3, all_17_4, all_17_5, all_17_6, all_17_7 gives:
% 6.94/1.71  |   (2)   ~ (all_17_2 = 0) & line_connecting(all_17_7, all_17_6) = all_17_3 &
% 6.94/1.71  |        apart_point_and_line(all_17_6, all_17_5) = all_17_0 &
% 6.94/1.71  |        apart_point_and_line(all_17_7, all_17_5) = all_17_1 &
% 6.94/1.71  |        convergent_lines(all_17_5, all_17_4) = 0 & distinct_lines(all_17_5,
% 6.94/1.71  |          all_17_3) = all_17_2 & distinct_points(all_17_7, all_17_6) = 0 &
% 6.94/1.71  |        $i(all_17_3) & $i(all_17_4) & $i(all_17_5) & $i(all_17_6) &
% 6.94/1.71  |        $i(all_17_7) & (all_17_0 = 0 | all_17_1 = 0)
% 6.94/1.71  | 
% 6.94/1.71  | ALPHA: (2) implies:
% 6.94/1.72  |   (3)   ~ (all_17_2 = 0)
% 6.94/1.72  |   (4)  $i(all_17_7)
% 6.94/1.72  |   (5)  $i(all_17_6)
% 6.94/1.72  |   (6)  $i(all_17_5)
% 6.94/1.72  |   (7)  $i(all_17_3)
% 6.94/1.72  |   (8)  distinct_points(all_17_7, all_17_6) = 0
% 6.94/1.72  |   (9)  distinct_lines(all_17_5, all_17_3) = all_17_2
% 6.94/1.72  |   (10)  apart_point_and_line(all_17_7, all_17_5) = all_17_1
% 6.94/1.72  |   (11)  apart_point_and_line(all_17_6, all_17_5) = all_17_0
% 6.94/1.72  |   (12)  line_connecting(all_17_7, all_17_6) = all_17_3
% 6.94/1.72  |   (13)  all_17_0 = 0 | all_17_1 = 0
% 6.94/1.72  | 
% 6.94/1.72  | BETA: splitting (13) gives:
% 6.94/1.72  | 
% 6.94/1.72  | Case 1:
% 6.94/1.72  | | 
% 6.94/1.72  | |   (14)  all_17_0 = 0
% 6.94/1.72  | | 
% 6.94/1.72  | | REDUCE: (11), (14) imply:
% 6.94/1.72  | |   (15)  apart_point_and_line(all_17_6, all_17_5) = 0
% 6.94/1.72  | | 
% 6.94/1.72  | | GROUND_INST: instantiating (ceq2) with all_17_6, all_17_5, all_17_3,
% 6.94/1.72  | |              all_17_2, simplifying with (5), (6), (7), (9), (15) gives:
% 6.94/1.72  | |   (16)  all_17_2 = 0 | apart_point_and_line(all_17_6, all_17_3) = 0
% 6.94/1.72  | | 
% 6.94/1.72  | | BETA: splitting (16) gives:
% 6.94/1.72  | | 
% 6.94/1.72  | | Case 1:
% 6.94/1.72  | | | 
% 7.23/1.72  | | |   (17)  apart_point_and_line(all_17_6, all_17_3) = 0
% 7.23/1.72  | | | 
% 7.23/1.72  | | | GROUND_INST: instantiating (ci2) with all_17_7, all_17_6, all_17_3,
% 7.23/1.72  | | |              simplifying with (4), (5), (12), (17) gives:
% 7.23/1.72  | | |   (18)   ? [v0: int] : ( ~ (v0 = 0) & distinct_points(all_17_7, all_17_6)
% 7.23/1.72  | | |           = v0)
% 7.23/1.72  | | | 
% 7.23/1.72  | | | DELTA: instantiating (18) with fresh symbol all_38_0 gives:
% 7.23/1.72  | | |   (19)   ~ (all_38_0 = 0) & distinct_points(all_17_7, all_17_6) = all_38_0
% 7.23/1.72  | | | 
% 7.23/1.72  | | | ALPHA: (19) implies:
% 7.23/1.72  | | |   (20)   ~ (all_38_0 = 0)
% 7.23/1.73  | | |   (21)  distinct_points(all_17_7, all_17_6) = all_38_0
% 7.23/1.73  | | | 
% 7.23/1.73  | | | GROUND_INST: instantiating (1) with 0, all_38_0, all_17_6, all_17_7,
% 7.23/1.73  | | |              simplifying with (8), (21) gives:
% 7.23/1.73  | | |   (22)  all_38_0 = 0
% 7.23/1.73  | | | 
% 7.23/1.73  | | | REDUCE: (20), (22) imply:
% 7.23/1.73  | | |   (23)  $false
% 7.23/1.73  | | | 
% 7.23/1.73  | | | CLOSE: (23) is inconsistent.
% 7.23/1.73  | | | 
% 7.23/1.73  | | Case 2:
% 7.23/1.73  | | | 
% 7.23/1.73  | | |   (24)  all_17_2 = 0
% 7.23/1.73  | | | 
% 7.23/1.73  | | | REDUCE: (3), (24) imply:
% 7.23/1.73  | | |   (25)  $false
% 7.23/1.73  | | | 
% 7.23/1.73  | | | CLOSE: (25) is inconsistent.
% 7.23/1.73  | | | 
% 7.23/1.73  | | End of split
% 7.23/1.73  | | 
% 7.23/1.73  | Case 2:
% 7.23/1.73  | | 
% 7.23/1.73  | |   (26)  all_17_1 = 0
% 7.23/1.73  | | 
% 7.23/1.73  | | REDUCE: (10), (26) imply:
% 7.23/1.73  | |   (27)  apart_point_and_line(all_17_7, all_17_5) = 0
% 7.23/1.73  | | 
% 7.23/1.73  | | GROUND_INST: instantiating (ceq2) with all_17_7, all_17_5, all_17_3,
% 7.23/1.73  | |              all_17_2, simplifying with (4), (6), (7), (9), (27) gives:
% 7.23/1.73  | |   (28)  all_17_2 = 0 | apart_point_and_line(all_17_7, all_17_3) = 0
% 7.23/1.73  | | 
% 7.23/1.73  | | BETA: splitting (28) gives:
% 7.23/1.73  | | 
% 7.23/1.73  | | Case 1:
% 7.23/1.73  | | | 
% 7.23/1.73  | | |   (29)  apart_point_and_line(all_17_7, all_17_3) = 0
% 7.23/1.73  | | | 
% 7.23/1.73  | | | GROUND_INST: instantiating (ci1) with all_17_7, all_17_6, all_17_3,
% 7.23/1.73  | | |              simplifying with (4), (5), (12), (29) gives:
% 7.23/1.73  | | |   (30)   ? [v0: int] : ( ~ (v0 = 0) & distinct_points(all_17_7, all_17_6)
% 7.23/1.73  | | |           = v0)
% 7.23/1.73  | | | 
% 7.23/1.73  | | | DELTA: instantiating (30) with fresh symbol all_38_0 gives:
% 7.23/1.73  | | |   (31)   ~ (all_38_0 = 0) & distinct_points(all_17_7, all_17_6) = all_38_0
% 7.23/1.73  | | | 
% 7.23/1.73  | | | ALPHA: (31) implies:
% 7.23/1.73  | | |   (32)   ~ (all_38_0 = 0)
% 7.23/1.73  | | |   (33)  distinct_points(all_17_7, all_17_6) = all_38_0
% 7.23/1.73  | | | 
% 7.23/1.73  | | | GROUND_INST: instantiating (1) with 0, all_38_0, all_17_6, all_17_7,
% 7.23/1.73  | | |              simplifying with (8), (33) gives:
% 7.23/1.73  | | |   (34)  all_38_0 = 0
% 7.23/1.73  | | | 
% 7.23/1.73  | | | REDUCE: (32), (34) imply:
% 7.23/1.73  | | |   (35)  $false
% 7.23/1.73  | | | 
% 7.23/1.73  | | | CLOSE: (35) is inconsistent.
% 7.23/1.73  | | | 
% 7.23/1.73  | | Case 2:
% 7.23/1.73  | | | 
% 7.23/1.73  | | |   (36)  all_17_2 = 0
% 7.23/1.73  | | | 
% 7.23/1.73  | | | REDUCE: (3), (36) imply:
% 7.23/1.73  | | |   (37)  $false
% 7.23/1.73  | | | 
% 7.23/1.73  | | | CLOSE: (37) is inconsistent.
% 7.23/1.73  | | | 
% 7.23/1.73  | | End of split
% 7.23/1.73  | | 
% 7.23/1.73  | End of split
% 7.23/1.73  | 
% 7.23/1.73  End of proof
% 7.23/1.73  % SZS output end Proof for theBenchmark
% 7.23/1.73  
% 7.23/1.73  1131ms
%------------------------------------------------------------------------------