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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : KRS179+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm  : none
% Format   : tptp
% Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s

% Computer : n005.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 : Thu Aug 31 05:51:33 EDT 2023

% Result   : Theorem 6.48s 1.62s
% Output   : Proof 7.88s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : KRS179+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.08/0.14  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.14/0.35  % Computer : n005.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Mon Aug 28 01:03:08 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 0.21/0.63  ________       _____
% 0.21/0.63  ___  __ \_________(_)________________________________
% 0.21/0.63  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.21/0.63  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.21/0.63  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.21/0.63  
% 0.21/0.63  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.21/0.63  (2023-06-19)
% 0.21/0.63  
% 0.21/0.63  (c) Philipp Rümmer, 2009-2023
% 0.21/0.63  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.21/0.63                Amanda Stjerna.
% 0.21/0.63  Free software under BSD-3-Clause.
% 0.21/0.63  
% 0.21/0.63  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.21/0.63  
% 0.21/0.63  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.21/0.65  Running up to 7 provers in parallel.
% 0.21/0.67  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.21/0.67  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.21/0.67  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.21/0.67  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.21/0.67  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.21/0.67  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 0.21/0.67  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 2.63/1.09  Prover 4: Preprocessing ...
% 2.63/1.09  Prover 1: Preprocessing ...
% 2.91/1.13  Prover 2: Preprocessing ...
% 2.91/1.13  Prover 5: Preprocessing ...
% 2.91/1.13  Prover 0: Preprocessing ...
% 2.91/1.13  Prover 3: Preprocessing ...
% 2.91/1.14  Prover 6: Preprocessing ...
% 4.47/1.41  Prover 2: Proving ...
% 4.47/1.41  Prover 5: Proving ...
% 5.28/1.47  Prover 3: Constructing countermodel ...
% 5.50/1.49  Prover 6: Proving ...
% 5.50/1.49  Prover 1: Constructing countermodel ...
% 5.50/1.52  Prover 0: Proving ...
% 5.50/1.52  Prover 4: Constructing countermodel ...
% 6.48/1.61  Prover 3: proved (947ms)
% 6.48/1.62  
% 6.48/1.62  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.48/1.62  
% 6.48/1.62  Prover 5: stopped
% 6.48/1.62  Prover 6: stopped
% 6.48/1.62  Prover 2: stopped
% 6.48/1.62  Prover 0: stopped
% 6.48/1.64  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 6.48/1.64  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 6.48/1.64  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 6.48/1.64  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 6.48/1.64  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 6.48/1.66  Prover 7: Preprocessing ...
% 6.90/1.68  Prover 8: Preprocessing ...
% 6.90/1.68  Prover 13: Preprocessing ...
% 6.90/1.69  Prover 11: Preprocessing ...
% 6.90/1.69  Prover 10: Preprocessing ...
% 6.90/1.71  Prover 1: Found proof (size 17)
% 6.90/1.71  Prover 1: proved (1058ms)
% 6.90/1.72  Prover 4: stopped
% 6.90/1.73  Prover 7: Warning: ignoring some quantifiers
% 6.90/1.73  Prover 10: Warning: ignoring some quantifiers
% 6.90/1.73  Prover 11: stopped
% 6.90/1.74  Prover 10: Constructing countermodel ...
% 6.90/1.74  Prover 7: Constructing countermodel ...
% 6.90/1.74  Prover 10: stopped
% 6.90/1.75  Prover 7: stopped
% 6.90/1.75  Prover 13: Warning: ignoring some quantifiers
% 7.47/1.76  Prover 13: Constructing countermodel ...
% 7.47/1.76  Prover 13: stopped
% 7.61/1.81  Prover 8: Warning: ignoring some quantifiers
% 7.61/1.82  Prover 8: Constructing countermodel ...
% 7.81/1.82  Prover 8: stopped
% 7.81/1.82  
% 7.81/1.83  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.81/1.83  
% 7.81/1.83  % SZS output start Proof for theBenchmark
% 7.81/1.83  Assumptions after simplification:
% 7.81/1.83  ---------------------------------
% 7.81/1.83  
% 7.81/1.83    (isa)
% 7.88/1.86     ! [v0: $i] :  ! [v1: $i] :  ! [v2: int] : (v2 = 0 |  ~ (isa(v0, v1) = v2) | 
% 7.88/1.86      ~ $i(v1) |  ~ $i(v0) |  ? [v3: $i] :  ? [v4: $i] :  ? [v5: int] : ( ~ (v5 =
% 7.88/1.86          0) & status(v3, v4, v1) = v5 & status(v3, v4, v0) = 0 & $i(v4) &
% 7.88/1.86        $i(v3))) &  ! [v0: $i] :  ! [v1: $i] : ( ~ (isa(v0, v1) = 0) |  ~ $i(v1) |
% 7.88/1.86       ~ $i(v0) |  ! [v2: $i] :  ! [v3: $i] : ( ~ (status(v2, v3, v0) = 0) |  ~
% 7.88/1.86        $i(v3) |  ~ $i(v2) | status(v2, v3, v1) = 0))
% 7.88/1.86  
% 7.88/1.86    (isa_transitive)
% 7.88/1.86     ? [v0: $i] :  ? [v1: $i] :  ? [v2: $i] :  ? [v3: int] : ( ~ (v3 = 0) &
% 7.88/1.86      isa(v1, v2) = 0 & isa(v0, v2) = v3 & isa(v0, v1) = 0 & $i(v2) & $i(v1) &
% 7.88/1.86      $i(v0))
% 7.88/1.86  
% 7.88/1.86    (function-axioms)
% 7.88/1.87     ! [v0: MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] :  !
% 7.88/1.87    [v3: $i] :  ! [v4: $i] : (v1 = v0 |  ~ (status(v4, v3, v2) = v1) |  ~
% 7.88/1.87      (status(v4, v3, v2) = v0)) &  ! [v0: MultipleValueBool] :  ! [v1:
% 7.88/1.87      MultipleValueBool] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~ (model(v3,
% 7.88/1.87          v2) = v1) |  ~ (model(v3, v2) = v0)) &  ! [v0: MultipleValueBool] :  !
% 7.88/1.87    [v1: MultipleValueBool] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~ (xora(v3,
% 7.88/1.87          v2) = v1) |  ~ (xora(v3, v2) = v0)) &  ! [v0: MultipleValueBool] :  !
% 7.88/1.87    [v1: MultipleValueBool] :  ! [v2: $i] :  ! [v3: $i] : (v1 = v0 |  ~
% 7.88/1.87      (nevera(v3, v2) = v1) |  ~ (nevera(v3, v2) = v0)) &  ! [v0:
% 7.88/1.87      MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] :  ! [v3: $i]
% 7.88/1.87    : (v1 = v0 |  ~ (nota(v3, v2) = v1) |  ~ (nota(v3, v2) = v0)) &  ! [v0:
% 7.88/1.87      MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] :  ! [v3: $i]
% 7.88/1.87    : (v1 = v0 |  ~ (isa(v3, v2) = v1) |  ~ (isa(v3, v2) = v0)) &  ! [v0:
% 7.88/1.87      MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] :  ! [v3: $i]
% 7.88/1.87    : (v1 = v0 |  ~ (mighta(v3, v2) = v1) |  ~ (mighta(v3, v2) = v0)) &  ! [v0:
% 7.88/1.87      $i] :  ! [v1: $i] :  ! [v2: $i] : (v1 = v0 |  ~ (not(v2) = v1) |  ~ (not(v2)
% 7.88/1.87        = v0))
% 7.88/1.87  
% 7.88/1.87  Further assumptions not needed in the proof:
% 7.88/1.87  --------------------------------------------
% 7.88/1.87  completeness, contradiction, mighta, mixed_pair, nevera, non_thm_spt, not, nota,
% 7.88/1.87  sat_non_taut_pair, satisfiable, tautology, xora
% 7.88/1.87  
% 7.88/1.87  Those formulas are unsatisfiable:
% 7.88/1.87  ---------------------------------
% 7.88/1.87  
% 7.88/1.87  Begin of proof
% 7.88/1.87  | 
% 7.88/1.88  | ALPHA: (isa) implies:
% 7.88/1.88  |   (1)   ! [v0: $i] :  ! [v1: $i] : ( ~ (isa(v0, v1) = 0) |  ~ $i(v1) |  ~
% 7.88/1.88  |          $i(v0) |  ! [v2: $i] :  ! [v3: $i] : ( ~ (status(v2, v3, v0) = 0) | 
% 7.88/1.88  |            ~ $i(v3) |  ~ $i(v2) | status(v2, v3, v1) = 0))
% 7.88/1.88  |   (2)   ! [v0: $i] :  ! [v1: $i] :  ! [v2: int] : (v2 = 0 |  ~ (isa(v0, v1) =
% 7.88/1.88  |            v2) |  ~ $i(v1) |  ~ $i(v0) |  ? [v3: $i] :  ? [v4: $i] :  ? [v5:
% 7.88/1.88  |            int] : ( ~ (v5 = 0) & status(v3, v4, v1) = v5 & status(v3, v4, v0)
% 7.88/1.88  |            = 0 & $i(v4) & $i(v3)))
% 7.88/1.88  | 
% 7.88/1.88  | ALPHA: (function-axioms) implies:
% 7.88/1.88  |   (3)   ! [v0: MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] :
% 7.88/1.88  |         ! [v3: $i] :  ! [v4: $i] : (v1 = v0 |  ~ (status(v4, v3, v2) = v1) | 
% 7.88/1.88  |          ~ (status(v4, v3, v2) = v0))
% 7.88/1.88  | 
% 7.88/1.88  | DELTA: instantiating (isa_transitive) with fresh symbols all_18_0, all_18_1,
% 7.88/1.88  |        all_18_2, all_18_3 gives:
% 7.88/1.88  |   (4)   ~ (all_18_0 = 0) & isa(all_18_2, all_18_1) = 0 & isa(all_18_3,
% 7.88/1.88  |          all_18_1) = all_18_0 & isa(all_18_3, all_18_2) = 0 & $i(all_18_1) &
% 7.88/1.88  |        $i(all_18_2) & $i(all_18_3)
% 7.88/1.88  | 
% 7.88/1.88  | ALPHA: (4) implies:
% 7.88/1.89  |   (5)   ~ (all_18_0 = 0)
% 7.88/1.89  |   (6)  $i(all_18_3)
% 7.88/1.89  |   (7)  $i(all_18_2)
% 7.88/1.89  |   (8)  $i(all_18_1)
% 7.88/1.89  |   (9)  isa(all_18_3, all_18_2) = 0
% 7.88/1.89  |   (10)  isa(all_18_3, all_18_1) = all_18_0
% 7.88/1.89  |   (11)  isa(all_18_2, all_18_1) = 0
% 7.88/1.89  | 
% 7.88/1.89  | GROUND_INST: instantiating (1) with all_18_3, all_18_2, simplifying with (6),
% 7.88/1.89  |              (7), (9) gives:
% 7.88/1.89  |   (12)   ! [v0: $i] :  ! [v1: $i] : ( ~ (status(v0, v1, all_18_3) = 0) |  ~
% 7.88/1.89  |           $i(v1) |  ~ $i(v0) | status(v0, v1, all_18_2) = 0)
% 7.88/1.89  | 
% 7.88/1.89  | GROUND_INST: instantiating (2) with all_18_3, all_18_1, all_18_0, simplifying
% 7.88/1.89  |              with (6), (8), (10) gives:
% 7.88/1.89  |   (13)  all_18_0 = 0 |  ? [v0: $i] :  ? [v1: $i] :  ? [v2: int] : ( ~ (v2 = 0)
% 7.88/1.89  |           & status(v0, v1, all_18_1) = v2 & status(v0, v1, all_18_3) = 0 &
% 7.88/1.89  |           $i(v1) & $i(v0))
% 7.88/1.89  | 
% 7.88/1.89  | GROUND_INST: instantiating (1) with all_18_2, all_18_1, simplifying with (7),
% 7.88/1.89  |              (8), (11) gives:
% 7.88/1.89  |   (14)   ! [v0: $i] :  ! [v1: $i] : ( ~ (status(v0, v1, all_18_2) = 0) |  ~
% 7.88/1.89  |           $i(v1) |  ~ $i(v0) | status(v0, v1, all_18_1) = 0)
% 7.88/1.89  | 
% 7.88/1.89  | BETA: splitting (13) gives:
% 7.88/1.89  | 
% 7.88/1.89  | Case 1:
% 7.88/1.89  | | 
% 7.88/1.89  | |   (15)  all_18_0 = 0
% 7.88/1.89  | | 
% 7.88/1.89  | | REDUCE: (5), (15) imply:
% 7.88/1.89  | |   (16)  $false
% 7.88/1.90  | | 
% 7.88/1.90  | | CLOSE: (16) is inconsistent.
% 7.88/1.90  | | 
% 7.88/1.90  | Case 2:
% 7.88/1.90  | | 
% 7.88/1.90  | |   (17)   ? [v0: $i] :  ? [v1: $i] :  ? [v2: int] : ( ~ (v2 = 0) & status(v0,
% 7.88/1.90  | |             v1, all_18_1) = v2 & status(v0, v1, all_18_3) = 0 & $i(v1) &
% 7.88/1.90  | |           $i(v0))
% 7.88/1.90  | | 
% 7.88/1.90  | | DELTA: instantiating (17) with fresh symbols all_55_0, all_55_1, all_55_2
% 7.88/1.90  | |        gives:
% 7.88/1.90  | |   (18)   ~ (all_55_0 = 0) & status(all_55_2, all_55_1, all_18_1) = all_55_0
% 7.88/1.90  | |         & status(all_55_2, all_55_1, all_18_3) = 0 & $i(all_55_1) &
% 7.88/1.90  | |         $i(all_55_2)
% 7.88/1.90  | | 
% 7.88/1.90  | | ALPHA: (18) implies:
% 7.88/1.90  | |   (19)   ~ (all_55_0 = 0)
% 7.88/1.90  | |   (20)  $i(all_55_2)
% 7.88/1.90  | |   (21)  $i(all_55_1)
% 7.88/1.90  | |   (22)  status(all_55_2, all_55_1, all_18_3) = 0
% 7.88/1.90  | |   (23)  status(all_55_2, all_55_1, all_18_1) = all_55_0
% 7.88/1.90  | | 
% 7.88/1.90  | | GROUND_INST: instantiating (12) with all_55_2, all_55_1, simplifying with
% 7.88/1.90  | |              (20), (21), (22) gives:
% 7.88/1.90  | |   (24)  status(all_55_2, all_55_1, all_18_2) = 0
% 7.88/1.90  | | 
% 7.88/1.90  | | GROUND_INST: instantiating (14) with all_55_2, all_55_1, simplifying with
% 7.88/1.90  | |              (20), (21), (24) gives:
% 7.88/1.90  | |   (25)  status(all_55_2, all_55_1, all_18_1) = 0
% 7.88/1.90  | | 
% 7.88/1.90  | | GROUND_INST: instantiating (3) with all_55_0, 0, all_18_1, all_55_1,
% 7.88/1.90  | |              all_55_2, simplifying with (23), (25) gives:
% 7.88/1.90  | |   (26)  all_55_0 = 0
% 7.88/1.90  | | 
% 7.88/1.90  | | REDUCE: (19), (26) imply:
% 7.88/1.90  | |   (27)  $false
% 7.88/1.90  | | 
% 7.88/1.90  | | CLOSE: (27) is inconsistent.
% 7.88/1.90  | | 
% 7.88/1.90  | End of split
% 7.88/1.90  | 
% 7.88/1.90  End of proof
% 7.88/1.90  % SZS output end Proof for theBenchmark
% 7.88/1.90  
% 7.88/1.90  1268ms
%------------------------------------------------------------------------------