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

View Problem - Process Solution

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

% Computer : n011.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 09:16:31 EDT 2023

% Result   : Theorem 4.63s 1.39s
% Output   : Proof 7.26s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : MGT059+1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.13  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.33  % Computer : n011.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 : Mon Aug 28 06:14:10 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.18/0.59  ________       _____
% 0.18/0.59  ___  __ \_________(_)________________________________
% 0.18/0.59  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.18/0.59  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.18/0.59  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.18/0.59  
% 0.18/0.59  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.18/0.59  (2023-06-19)
% 0.18/0.59  
% 0.18/0.59  (c) Philipp Rümmer, 2009-2023
% 0.18/0.59  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.18/0.59                Amanda Stjerna.
% 0.18/0.59  Free software under BSD-3-Clause.
% 0.18/0.59  
% 0.18/0.59  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.18/0.59  
% 0.18/0.59  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.18/0.60  Running up to 7 provers in parallel.
% 0.18/0.62  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.18/0.62  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.18/0.62  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.18/0.62  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.18/0.62  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.18/0.62  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.18/0.62  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.46/1.01  Prover 4: Preprocessing ...
% 2.46/1.01  Prover 1: Preprocessing ...
% 2.73/1.05  Prover 2: Preprocessing ...
% 2.73/1.05  Prover 3: Preprocessing ...
% 2.73/1.05  Prover 5: Preprocessing ...
% 2.73/1.05  Prover 0: Preprocessing ...
% 2.73/1.05  Prover 6: Preprocessing ...
% 4.34/1.27  Prover 2: Proving ...
% 4.34/1.27  Prover 5: Proving ...
% 4.34/1.27  Prover 1: Constructing countermodel ...
% 4.34/1.28  Prover 6: Constructing countermodel ...
% 4.34/1.28  Prover 3: Constructing countermodel ...
% 4.63/1.37  Prover 4: Constructing countermodel ...
% 4.63/1.37  Prover 3: gave up
% 4.63/1.38  Prover 6: gave up
% 4.63/1.38  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 4.63/1.38  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 4.63/1.38  Prover 1: gave up
% 4.63/1.38  Prover 9: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1423531889
% 4.63/1.39  Prover 5: proved (774ms)
% 4.63/1.39  
% 4.63/1.39  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.63/1.39  
% 4.63/1.39  Prover 2: stopped
% 4.63/1.39  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 5.25/1.40  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 5.34/1.42  Prover 7: Preprocessing ...
% 5.34/1.43  Prover 8: Preprocessing ...
% 5.34/1.43  Prover 9: Preprocessing ...
% 5.34/1.43  Prover 11: Preprocessing ...
% 5.34/1.44  Prover 10: Preprocessing ...
% 5.34/1.45  Prover 0: Proving ...
% 5.34/1.45  Prover 0: stopped
% 5.34/1.45  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 5.34/1.48  Prover 13: Preprocessing ...
% 5.34/1.49  Prover 10: Warning: ignoring some quantifiers
% 5.34/1.49  Prover 10: Constructing countermodel ...
% 6.04/1.51  Prover 7: Warning: ignoring some quantifiers
% 6.04/1.53  Prover 7: Constructing countermodel ...
% 6.04/1.54  Prover 10: Found proof (size 7)
% 6.04/1.54  Prover 10: proved (145ms)
% 6.04/1.54  Prover 4: stopped
% 6.04/1.54  Prover 7: stopped
% 6.04/1.54  Prover 13: Warning: ignoring some quantifiers
% 6.04/1.54  Prover 8: Warning: ignoring some quantifiers
% 6.04/1.55  Prover 13: Constructing countermodel ...
% 6.04/1.55  Prover 8: Constructing countermodel ...
% 6.04/1.56  Prover 13: stopped
% 6.04/1.56  Prover 8: stopped
% 6.69/1.59  Prover 9: Constructing countermodel ...
% 6.69/1.60  Prover 9: stopped
% 6.69/1.64  Prover 11: Constructing countermodel ...
% 6.69/1.65  Prover 11: stopped
% 6.69/1.65  
% 6.69/1.65  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.69/1.65  
% 6.69/1.65  % SZS output start Proof for theBenchmark
% 6.69/1.66  Assumptions after simplification:
% 6.69/1.66  ---------------------------------
% 6.69/1.66  
% 6.69/1.66    (assumption_17)
% 7.19/1.69    $i(high) & $i(mod2) & $i(mod1) & $i(low) & $i(very_low) &  ! [v0: $i] :  !
% 7.19/1.69    [v1: $i] :  ! [v2: $i] : (v2 = high |  ~ (hazard_of_mortality(v0, v1) = v2) | 
% 7.19/1.69      ~ $i(v1) |  ~ $i(v0) |  ~ organization(v0) | positional_advantage(v0, v1) |
% 7.19/1.69      is_aligned(v0, v1) | has_immunity(v0, v1)) &  ! [v0: $i] :  ! [v1: $i] :  !
% 7.19/1.69    [v2: $i] : (v2 = mod2 |  ~ (hazard_of_mortality(v0, v1) = v2) |  ~ $i(v1) |  ~
% 7.19/1.69      $i(v0) |  ~ is_aligned(v0, v1) |  ~ organization(v0) |
% 7.19/1.69      positional_advantage(v0, v1) | has_immunity(v0, v1)) &  ! [v0: $i] :  ! [v1:
% 7.19/1.69      $i] :  ! [v2: $i] : (v2 = mod1 |  ~ (hazard_of_mortality(v0, v1) = v2) |  ~
% 7.19/1.69      $i(v1) |  ~ $i(v0) |  ~ positional_advantage(v0, v1) |  ~ organization(v0) |
% 7.19/1.69      is_aligned(v0, v1) | has_immunity(v0, v1)) &  ! [v0: $i] :  ! [v1: $i] :  !
% 7.19/1.69    [v2: $i] : (v2 = low |  ~ (hazard_of_mortality(v0, v1) = v2) |  ~ $i(v1) |  ~
% 7.19/1.69      $i(v0) |  ~ positional_advantage(v0, v1) |  ~ is_aligned(v0, v1) |  ~
% 7.19/1.69      organization(v0) | has_immunity(v0, v1)) &  ! [v0: $i] :  ! [v1: $i] :  !
% 7.19/1.69    [v2: $i] : (v2 = very_low |  ~ (hazard_of_mortality(v0, v1) = v2) |  ~ $i(v1)
% 7.19/1.69      |  ~ $i(v0) |  ~ has_immunity(v0, v1) |  ~ organization(v0))
% 7.19/1.69  
% 7.19/1.69    (assumption_2)
% 7.21/1.70     ? [v0: $i] :  ? [v1: $i] :  ? [v2: $i] :  ? [v3: $i] :  ? [v4: $i] : ( ~ (v4
% 7.21/1.70        = v3) & hazard_of_mortality(v0, v2) = v4 & hazard_of_mortality(v0, v1) =
% 7.21/1.70      v3 & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0) & has_immunity(v0, v2) &
% 7.21/1.70      has_immunity(v0, v1) & organization(v0))
% 7.21/1.70  
% 7.21/1.70  Further assumptions not needed in the proof:
% 7.21/1.70  --------------------------------------------
% 7.21/1.70  definition_greater_or_equal, definition_smaller, definition_smaller_or_equal,
% 7.21/1.70  meaning_postulate_greater_comparable, meaning_postulate_greater_strict,
% 7.21/1.70  meaning_postulate_greater_transitive
% 7.21/1.70  
% 7.21/1.70  Those formulas are unsatisfiable:
% 7.21/1.70  ---------------------------------
% 7.21/1.70  
% 7.21/1.70  Begin of proof
% 7.21/1.70  | 
% 7.21/1.70  | ALPHA: (assumption_17) implies:
% 7.21/1.70  |   (1)   ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : (v2 = very_low |  ~
% 7.21/1.70  |          (hazard_of_mortality(v0, v1) = v2) |  ~ $i(v1) |  ~ $i(v0) |  ~
% 7.21/1.70  |          has_immunity(v0, v1) |  ~ organization(v0))
% 7.21/1.70  | 
% 7.25/1.70  | DELTA: instantiating (assumption_2) with fresh symbols all_13_0, all_13_1,
% 7.25/1.70  |        all_13_2, all_13_3, all_13_4 gives:
% 7.25/1.70  |   (2)   ~ (all_13_0 = all_13_1) & hazard_of_mortality(all_13_4, all_13_2) =
% 7.25/1.70  |        all_13_0 & hazard_of_mortality(all_13_4, all_13_3) = all_13_1 &
% 7.25/1.70  |        $i(all_13_0) & $i(all_13_1) & $i(all_13_2) & $i(all_13_3) &
% 7.25/1.70  |        $i(all_13_4) & has_immunity(all_13_4, all_13_2) &
% 7.25/1.70  |        has_immunity(all_13_4, all_13_3) & organization(all_13_4)
% 7.25/1.70  | 
% 7.25/1.70  | ALPHA: (2) implies:
% 7.26/1.71  |   (3)   ~ (all_13_0 = all_13_1)
% 7.26/1.71  |   (4)  organization(all_13_4)
% 7.26/1.71  |   (5)  has_immunity(all_13_4, all_13_3)
% 7.26/1.71  |   (6)  has_immunity(all_13_4, all_13_2)
% 7.26/1.71  |   (7)  $i(all_13_4)
% 7.26/1.71  |   (8)  $i(all_13_3)
% 7.26/1.71  |   (9)  $i(all_13_2)
% 7.26/1.71  |   (10)  hazard_of_mortality(all_13_4, all_13_3) = all_13_1
% 7.26/1.71  |   (11)  hazard_of_mortality(all_13_4, all_13_2) = all_13_0
% 7.26/1.71  | 
% 7.26/1.71  | GROUND_INST: instantiating (1) with all_13_4, all_13_3, all_13_1, simplifying
% 7.26/1.71  |              with (4), (5), (7), (8), (10) gives:
% 7.26/1.71  |   (12)  all_13_1 = very_low
% 7.26/1.71  | 
% 7.26/1.71  | GROUND_INST: instantiating (1) with all_13_4, all_13_2, all_13_0, simplifying
% 7.26/1.71  |              with (4), (6), (7), (9), (11) gives:
% 7.26/1.71  |   (13)  all_13_0 = very_low
% 7.26/1.71  | 
% 7.26/1.71  | REDUCE: (3), (12), (13) imply:
% 7.26/1.71  |   (14)  $false
% 7.26/1.71  | 
% 7.26/1.71  | CLOSE: (14) is inconsistent.
% 7.26/1.71  | 
% 7.26/1.71  End of proof
% 7.26/1.71  % SZS output end Proof for theBenchmark
% 7.26/1.71  
% 7.26/1.71  1121ms
%------------------------------------------------------------------------------