↑ Up

Princess---230619.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : MGT005+2 : TPTP v9.3.0. Bugfixed v3.2.0.
% Transfm  : none
% Format   : tptp
% Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s

% Computer : n017.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep  8 06:17:18 AM UTC 2026

% Result   : Theorem 16.84s 3.16s
% Output   : Proof 26.94s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT005+2 : TPTP v9.3.0. Bugfixed v3.2.0.
% 0.00/0.04  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.10/0.35  % Computer : n017.cluster.edu
% 0.10/0.35  % Model    : x86_64 x86_64
% 0.10/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35  % Memory   : 8046.5625MB
% 0.10/0.35  % OS       : Linux 6.8.0-71-generic
% 0.10/0.35  % CPULimit : 300
% 0.10/0.35  % WCLimit  : 300
% 0.10/0.35  % DateTime : Mon Sep  7 11:33:39 UTC 2026
% 0.10/0.35  % CPUTime  : 
% 0.12/0.37  OpenJDK 64-Bit Server VM warning: Options -Xverify:none and -noverify were deprecated in JDK 13 and will likely be removed in a future release.
% 0.71/0.71  ________       _____
% 0.71/0.71  ___  __ \_________(_)________________________________
% 0.71/0.71  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.71/0.71  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.71/0.71  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.71/0.71  
% 0.71/0.71  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.71/0.71  (2023-06-19)
% 0.71/0.71  
% 0.71/0.71  (c) Philipp Rümmer, 2009-2023
% 0.71/0.71  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.71/0.71                Amanda Stjerna.
% 0.71/0.71  Free software under BSD-3-Clause.
% 0.71/0.71  
% 0.71/0.71  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.71/0.71  
% 0.71/0.71  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.71/0.73  Running up to 7 provers in parallel.
% 0.71/0.75  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.71/0.75  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.71/0.75  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.71/0.75  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.71/0.75  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.71/0.75  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.71/0.75  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 3.83/1.48  Prover 1: Preprocessing ...
% 4.61/1.50  Prover 4: Preprocessing ...
% 4.61/1.56  Prover 5: Preprocessing ...
% 4.61/1.56  Prover 3: Preprocessing ...
% 4.61/1.56  Prover 0: Preprocessing ...
% 4.61/1.56  Prover 6: Preprocessing ...
% 4.61/1.56  Prover 2: Preprocessing ...
% 7.73/2.04  Prover 2: Constructing countermodel ...
% 7.73/2.05  Prover 5: Constructing countermodel ...
% 10.83/2.32  Prover 1: Constructing countermodel ...
% 10.83/2.33  Prover 3: Constructing countermodel ...
% 10.83/2.34  Prover 6: Constructing countermodel ...
% 16.84/3.15  Prover 5: proved (2399ms)
% 16.84/3.15  
% 16.84/3.16  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 16.84/3.16  
% 16.84/3.16  Prover 6: stopped
% 17.65/3.16  Prover 2: stopped
% 17.65/3.16  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 17.65/3.16  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 17.65/3.16  Prover 3: stopped
% 17.65/3.16  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 17.65/3.16  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 17.95/3.30  Prover 8: Preprocessing ...
% 18.78/3.30  Prover 0: stopped
% 18.78/3.30  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 18.78/3.35  Prover 7: Preprocessing ...
% 18.78/3.40  Prover 10: Preprocessing ...
% 19.54/3.43  Prover 13: Preprocessing ...
% 19.54/3.43  Prover 11: Preprocessing ...
% 20.34/3.52  Prover 10: Constructing countermodel ...
% 20.34/3.56  Prover 13: Constructing countermodel ...
% 20.34/3.56  Prover 7: Constructing countermodel ...
% 20.34/3.59  Prover 8: Warning: ignoring some quantifiers
% 21.13/3.62  Prover 8: Constructing countermodel ...
% 23.51/3.90  Prover 13: Found proof (size 10)
% 23.51/3.90  Prover 13: proved (595ms)
% 23.51/3.90  Prover 10: Found proof (size 10)
% 23.51/3.90  Prover 10: proved (744ms)
% 23.51/3.91  Prover 8: stopped
% 23.51/3.91  Prover 1: stopped
% 23.51/3.91  Prover 11: stopped
% 23.51/3.91  Prover 7: stopped
% 26.51/4.65  Prover 4: Constructing countermodel ...
% 26.51/4.68  Prover 4: stopped
% 26.51/4.68  
% 26.51/4.68  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 26.51/4.68  
% 26.51/4.69  % SZS output start Proof for theBenchmark
% 26.51/4.69  Assumptions after simplification:
% 26.51/4.69  ---------------------------------
% 26.51/4.69  
% 26.51/4.69    (a10_FOL)
% 26.94/4.71     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] :  ! [v4: $i] :  ! [v5:
% 26.94/4.71      $i] :  ! [v6: $i] :  ! [v7: $i] :  ! [v8: $i] : ( ~ $i(v8) |  ~ $i(v7) |  ~
% 26.94/4.71      $i(v6) |  ~ $i(v5) |  ~ $i(v4) |  ~ $i(v3) |  ~ $i(v2) |  ~ $i(v1) |  ~
% 26.94/4.71      $i(v0) |  ~ complexity(v1, v5, v6) |  ~ complexity(v0, v4, v6) |  ~
% 26.94/4.71      reorganization_type(v1, v2, v6) |  ~ reorganization_type(v0, v2, v6) |  ~
% 26.94/4.71      class(v1, v3, v6) |  ~ class(v0, v3, v6) |  ~ reorganization(v1, v6, v8) | 
% 26.94/4.71      ~ reorganization(v0, v6, v7) |  ~ organization(v1, v8) |  ~ organization(v1,
% 26.94/4.71        v6) |  ~ organization(v0, v6) |  ~ greater(v5, v4) | greater(v8, v7))
% 26.94/4.71  
% 26.94/4.71    (a11_FOL)
% 26.94/4.73     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] :  ! [v4: $i] :  ! [v5:
% 26.94/4.73      $i] :  ! [v6: $i] :  ! [v7: $i] :  ! [v8: $i] :  ! [v9: $i] :  ! [v10: $i] :
% 26.94/4.73     ! [v11: $i] : (v6 = v5 |  ~ $i(v11) |  ~ $i(v10) |  ~ $i(v9) |  ~ $i(v8) |  ~
% 26.94/4.73      $i(v7) |  ~ $i(v6) |  ~ $i(v5) |  ~ $i(v4) |  ~ $i(v3) |  ~ $i(v2) |  ~
% 26.94/4.73      $i(v1) |  ~ $i(v0) |  ~ complexity(v1, v8, v9) |  ~ complexity(v0, v7, v9) |
% 26.94/4.73       ~ reorganization_type(v1, v2, v9) |  ~ reorganization_type(v0, v2, v9) |  ~
% 26.94/4.73      class(v1, v3, v9) |  ~ class(v0, v3, v9) |  ~ reorganization(v1, v9, v11) | 
% 26.94/4.73      ~ reorganization(v0, v9, v10) |  ~ organization(v1, v10) |  ~
% 26.94/4.73      organization(v1, v9) |  ~ organization(v0, v10) |  ~ organization(v0, v9) | 
% 26.94/4.73      ~ survival_chance(v1, v6, v10) |  ~ survival_chance(v1, v4, v9) |  ~
% 26.94/4.73      survival_chance(v0, v5, v10) |  ~ survival_chance(v0, v4, v9) |  ~
% 26.94/4.73      greater(v8, v7) | greater(v5, v6))
% 26.94/4.73  
% 26.94/4.73    (mp13)
% 26.94/4.73     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : ( ~ $i(v3) |  ~ $i(v2)
% 26.94/4.73      |  ~ $i(v1) |  ~ $i(v0) |  ~ organization(v0, v3) |  ~ organization(v0, v2)
% 26.94/4.73      |  ~ greater(v3, v1) |  ~ greater(v1, v2) | organization(v0, v1))
% 26.94/4.73  
% 26.94/4.73    (mp7)
% 26.94/4.73     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : ( ~ $i(v2) |  ~ $i(v1) |  ~ $i(v0) |
% 26.94/4.73       ~ reorganization(v0, v1, v2) | greater(v2, v1))
% 26.94/4.73  
% 26.94/4.73    (t5_plus_FOL)
% 26.94/4.74     ? [v0: $i] :  ? [v1: $i] :  ? [v2: $i] :  ? [v3: $i] :  ? [v4: $i] :  ? [v5:
% 26.94/4.74      $i] :  ? [v6: $i] :  ? [v7: $i] :  ? [v8: $i] :  ? [v9: $i] :  ? [v10: $i] :
% 26.94/4.74     ? [v11: $i] : ( ~ (v11 = v9) &  ~ (v6 = v5) & $i(v11) & $i(v10) & $i(v9) &
% 26.94/4.74      $i(v8) & $i(v7) & $i(v6) & $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) &
% 26.94/4.74      $i(v0) & complexity(v1, v8, v10) & complexity(v0, v7, v10) &
% 26.94/4.74      reorganization_type(v1, v2, v10) & reorganization_type(v0, v2, v10) &
% 26.94/4.74      class(v1, v3, v10) & class(v0, v3, v10) & reorganization_free(v0, v9, v11) &
% 26.94/4.74      reorganization(v1, v10, v11) & reorganization(v0, v10, v9) &
% 26.94/4.74      organization(v1, v11) & organization(v1, v10) & organization(v0, v11) &
% 26.94/4.74      organization(v0, v10) & survival_chance(v1, v6, v9) & survival_chance(v1,
% 26.94/4.74        v4, v10) & survival_chance(v0, v5, v9) & survival_chance(v0, v4, v10) &
% 26.94/4.74      greater(v8, v7) &  ~ greater(v5, v6))
% 26.94/4.74  
% 26.94/4.74  Further assumptions not needed in the proof:
% 26.94/4.74  --------------------------------------------
% 26.94/4.74  a15_FOL, mp11, mp12, mp14, mp6_1, mp6_2, t3_FOL, t4_FOL
% 26.94/4.74  
% 26.94/4.74  Those formulas are unsatisfiable:
% 26.94/4.74  ---------------------------------
% 26.94/4.74  
% 26.94/4.74  Begin of proof
% 26.94/4.74  | 
% 26.94/4.74  | DELTA: instantiating (t5_plus_FOL) with fresh symbols all_14_0, all_14_1,
% 26.94/4.74  |        all_14_2, all_14_3, all_14_4, all_14_5, all_14_6, all_14_7, all_14_8,
% 26.94/4.74  |        all_14_9, all_14_10, all_14_11 gives:
% 26.94/4.75  |   (1)   ~ (all_14_0 = all_14_2) &  ~ (all_14_5 = all_14_6) & $i(all_14_0) &
% 26.94/4.75  |        $i(all_14_1) & $i(all_14_2) & $i(all_14_3) & $i(all_14_4) &
% 26.94/4.75  |        $i(all_14_5) & $i(all_14_6) & $i(all_14_7) & $i(all_14_8) &
% 26.94/4.75  |        $i(all_14_9) & $i(all_14_10) & $i(all_14_11) & complexity(all_14_10,
% 26.94/4.75  |          all_14_3, all_14_1) & complexity(all_14_11, all_14_4, all_14_1) &
% 26.94/4.75  |        reorganization_type(all_14_10, all_14_9, all_14_1) &
% 26.94/4.75  |        reorganization_type(all_14_11, all_14_9, all_14_1) & class(all_14_10,
% 26.94/4.75  |          all_14_8, all_14_1) & class(all_14_11, all_14_8, all_14_1) &
% 26.94/4.75  |        reorganization_free(all_14_11, all_14_2, all_14_0) &
% 26.94/4.75  |        reorganization(all_14_10, all_14_1, all_14_0) &
% 26.94/4.75  |        reorganization(all_14_11, all_14_1, all_14_2) & organization(all_14_10,
% 26.94/4.75  |          all_14_0) & organization(all_14_10, all_14_1) &
% 26.94/4.75  |        organization(all_14_11, all_14_0) & organization(all_14_11, all_14_1) &
% 26.94/4.75  |        survival_chance(all_14_10, all_14_5, all_14_2) &
% 26.94/4.75  |        survival_chance(all_14_10, all_14_7, all_14_1) &
% 26.94/4.75  |        survival_chance(all_14_11, all_14_6, all_14_2) &
% 26.94/4.75  |        survival_chance(all_14_11, all_14_7, all_14_1) & greater(all_14_3,
% 26.94/4.75  |          all_14_4) &  ~ greater(all_14_6, all_14_5)
% 26.94/4.75  | 
% 26.94/4.75  | ALPHA: (1) implies:
% 26.94/4.76  |   (2)   ~ (all_14_5 = all_14_6)
% 26.94/4.76  |   (3)   ~ greater(all_14_6, all_14_5)
% 26.94/4.76  |   (4)  greater(all_14_3, all_14_4)
% 26.94/4.76  |   (5)  survival_chance(all_14_11, all_14_7, all_14_1)
% 26.94/4.76  |   (6)  survival_chance(all_14_11, all_14_6, all_14_2)
% 26.94/4.76  |   (7)  survival_chance(all_14_10, all_14_7, all_14_1)
% 26.94/4.76  |   (8)  survival_chance(all_14_10, all_14_5, all_14_2)
% 26.94/4.76  |   (9)  organization(all_14_11, all_14_1)
% 26.94/4.76  |   (10)  organization(all_14_11, all_14_0)
% 26.94/4.76  |   (11)  organization(all_14_10, all_14_1)
% 26.94/4.76  |   (12)  organization(all_14_10, all_14_0)
% 26.94/4.76  |   (13)  reorganization(all_14_11, all_14_1, all_14_2)
% 26.94/4.76  |   (14)  reorganization(all_14_10, all_14_1, all_14_0)
% 26.94/4.76  |   (15)  class(all_14_11, all_14_8, all_14_1)
% 26.94/4.76  |   (16)  class(all_14_10, all_14_8, all_14_1)
% 26.94/4.76  |   (17)  reorganization_type(all_14_11, all_14_9, all_14_1)
% 26.94/4.76  |   (18)  reorganization_type(all_14_10, all_14_9, all_14_1)
% 26.94/4.76  |   (19)  complexity(all_14_11, all_14_4, all_14_1)
% 26.94/4.76  |   (20)  complexity(all_14_10, all_14_3, all_14_1)
% 26.94/4.76  |   (21)  $i(all_14_11)
% 26.94/4.76  |   (22)  $i(all_14_10)
% 26.94/4.77  |   (23)  $i(all_14_9)
% 26.94/4.77  |   (24)  $i(all_14_8)
% 26.94/4.77  |   (25)  $i(all_14_7)
% 26.94/4.77  |   (26)  $i(all_14_6)
% 26.94/4.77  |   (27)  $i(all_14_5)
% 26.94/4.77  |   (28)  $i(all_14_4)
% 26.94/4.77  |   (29)  $i(all_14_3)
% 26.94/4.77  |   (30)  $i(all_14_2)
% 26.94/4.77  |   (31)  $i(all_14_1)
% 26.94/4.77  |   (32)  $i(all_14_0)
% 26.94/4.77  | 
% 26.94/4.77  | GROUND_INST: instantiating (mp7) with all_14_11, all_14_1, all_14_2,
% 26.94/4.77  |              simplifying with (13), (21), (30), (31) gives:
% 26.94/4.77  |   (33)  greater(all_14_2, all_14_1)
% 26.94/4.77  | 
% 26.94/4.77  | GROUND_INST: instantiating (a10_FOL) with all_14_11, all_14_10, all_14_9,
% 26.94/4.77  |              all_14_8, all_14_4, all_14_3, all_14_1, all_14_2, all_14_0,
% 26.94/4.77  |              simplifying with (4), (9), (11), (12), (13), (14), (15), (16),
% 26.94/4.77  |              (17), (18), (19), (20), (21), (22), (23), (24), (28), (29), (30),
% 26.94/4.77  |              (31), (32) gives:
% 26.94/4.77  |   (34)  greater(all_14_0, all_14_2)
% 26.94/4.77  | 
% 26.94/4.77  | GROUND_INST: instantiating (mp13) with all_14_10, all_14_2, all_14_1,
% 26.94/4.77  |              all_14_0, simplifying with (11), (12), (22), (30), (31), (32),
% 26.94/4.77  |              (33), (34) gives:
% 26.94/4.77  |   (35)  organization(all_14_10, all_14_2)
% 26.94/4.77  | 
% 26.94/4.78  | GROUND_INST: instantiating (mp13) with all_14_11, all_14_2, all_14_1,
% 26.94/4.78  |              all_14_0, simplifying with (9), (10), (21), (30), (31), (32),
% 26.94/4.78  |              (33), (34) gives:
% 26.94/4.78  |   (36)  organization(all_14_11, all_14_2)
% 26.94/4.78  | 
% 26.94/4.78  | GROUND_INST: instantiating (a11_FOL) with all_14_11, all_14_10, all_14_9,
% 26.94/4.78  |              all_14_8, all_14_7, all_14_6, all_14_5, all_14_4, all_14_3,
% 26.94/4.78  |              all_14_1, all_14_2, all_14_0, simplifying with (3), (4), (5),
% 26.94/4.78  |              (6), (7), (8), (9), (11), (13), (14), (15), (16), (17), (18),
% 26.94/4.78  |              (19), (20), (21), (22), (23), (24), (25), (26), (27), (28), (29),
% 26.94/4.78  |              (30), (31), (32), (35), (36) gives:
% 26.94/4.78  |   (37)  all_14_5 = all_14_6
% 26.94/4.78  | 
% 26.94/4.78  | REDUCE: (2), (37) imply:
% 26.94/4.78  |   (38)  $false
% 26.94/4.78  | 
% 26.94/4.78  | CLOSE: (38) is inconsistent.
% 26.94/4.78  | 
% 26.94/4.79  End of proof
% 26.94/4.79  % SZS output end Proof for theBenchmark
% 26.94/4.79  
% 26.94/4.79  4072ms
%------------------------------------------------------------------------------