TSTP Solution File: MGT005+2 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : MGT005+2 : TPTP v8.1.2. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n016.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:08 EDT 2023
% Result : Theorem 10.35s 2.24s
% Output : Proof 16.07s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : MGT005+2 : TPTP v8.1.2. Bugfixed v3.2.0.
% 0.00/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.14/0.35 % Computer : n016.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 06:48:15 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.64 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.21/0.65 Running up to 7 provers in parallel.
% 0.21/0.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.21/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.21/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.21/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.21/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.21/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.21/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.91/1.15 Prover 1: Preprocessing ...
% 2.91/1.15 Prover 4: Preprocessing ...
% 3.20/1.19 Prover 6: Preprocessing ...
% 3.20/1.19 Prover 2: Preprocessing ...
% 3.20/1.19 Prover 3: Preprocessing ...
% 3.20/1.20 Prover 0: Preprocessing ...
% 3.20/1.20 Prover 5: Preprocessing ...
% 4.94/1.51 Prover 5: Constructing countermodel ...
% 4.94/1.53 Prover 2: Constructing countermodel ...
% 6.01/1.63 Prover 3: Constructing countermodel ...
% 6.35/1.64 Prover 6: Constructing countermodel ...
% 6.35/1.65 Prover 1: Constructing countermodel ...
% 10.35/2.24 Prover 2: proved (1581ms)
% 10.35/2.24
% 10.35/2.24 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.35/2.24
% 10.35/2.24 Prover 3: stopped
% 10.35/2.25 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 10.35/2.25 Prover 5: stopped
% 10.35/2.26 Prover 6: stopped
% 10.99/2.27 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 10.99/2.27 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 10.99/2.28 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 11.41/2.34 Prover 8: Preprocessing ...
% 11.41/2.34 Prover 7: Preprocessing ...
% 11.41/2.37 Prover 10: Preprocessing ...
% 11.41/2.39 Prover 11: Preprocessing ...
% 12.07/2.41 Prover 7: Constructing countermodel ...
% 12.07/2.45 Prover 10: Constructing countermodel ...
% 12.59/2.52 Prover 8: Warning: ignoring some quantifiers
% 12.59/2.53 Prover 8: Constructing countermodel ...
% 13.58/2.72 Prover 10: Found proof (size 10)
% 13.58/2.72 Prover 10: proved (441ms)
% 13.58/2.72 Prover 7: stopped
% 13.58/2.72 Prover 8: stopped
% 13.58/2.72 Prover 1: stopped
% 14.20/2.76 Prover 11: stopped
% 14.99/2.88 Prover 4: Constructing countermodel ...
% 14.99/2.89 Prover 4: stopped
% 15.64/2.98 Prover 0: Proving ...
% 15.64/2.99 Prover 0: stopped
% 15.64/2.99
% 15.64/2.99 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 15.64/2.99
% 15.64/2.99 % SZS output start Proof for theBenchmark
% 15.64/3.00 Assumptions after simplification:
% 15.64/3.00 ---------------------------------
% 15.64/3.00
% 15.64/3.00 (a10_FOL)
% 15.64/3.01 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5:
% 15.64/3.01 $i] : ! [v6: $i] : ! [v7: $i] : ! [v8: $i] : ( ~ $i(v8) | ~ $i(v7) | ~
% 15.64/3.01 $i(v6) | ~ $i(v5) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~
% 15.64/3.01 $i(v0) | ~ complexity(v1, v5, v6) | ~ complexity(v0, v4, v6) | ~
% 15.64/3.01 reorganization_type(v1, v2, v6) | ~ reorganization_type(v0, v2, v6) | ~
% 15.64/3.01 class(v1, v3, v6) | ~ class(v0, v3, v6) | ~ reorganization(v1, v6, v8) |
% 15.64/3.01 ~ reorganization(v0, v6, v7) | ~ organization(v1, v8) | ~ organization(v1,
% 15.64/3.01 v6) | ~ organization(v0, v6) | ~ greater(v5, v4) | greater(v8, v7))
% 15.64/3.01
% 15.64/3.01 (a11_FOL)
% 15.64/3.02 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5:
% 15.64/3.02 $i] : ! [v6: $i] : ! [v7: $i] : ! [v8: $i] : ! [v9: $i] : ! [v10: $i] :
% 15.64/3.02 ! [v11: $i] : (v6 = v5 | ~ $i(v11) | ~ $i(v10) | ~ $i(v9) | ~ $i(v8) | ~
% 15.64/3.02 $i(v7) | ~ $i(v6) | ~ $i(v5) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~
% 15.64/3.02 $i(v1) | ~ $i(v0) | ~ complexity(v1, v8, v9) | ~ complexity(v0, v7, v9) |
% 15.64/3.02 ~ reorganization_type(v1, v2, v9) | ~ reorganization_type(v0, v2, v9) | ~
% 15.64/3.02 class(v1, v3, v9) | ~ class(v0, v3, v9) | ~ reorganization(v1, v9, v11) |
% 15.64/3.02 ~ reorganization(v0, v9, v10) | ~ organization(v1, v10) | ~
% 15.64/3.02 organization(v1, v9) | ~ organization(v0, v10) | ~ organization(v0, v9) |
% 15.64/3.02 ~ survival_chance(v1, v6, v10) | ~ survival_chance(v1, v4, v9) | ~
% 15.64/3.02 survival_chance(v0, v5, v10) | ~ survival_chance(v0, v4, v9) | ~
% 15.64/3.02 greater(v8, v7) | greater(v5, v6))
% 15.64/3.02
% 15.64/3.02 (mp13)
% 15.64/3.02 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | ~ $i(v2)
% 15.64/3.02 | ~ $i(v1) | ~ $i(v0) | ~ organization(v0, v3) | ~ organization(v0, v2)
% 15.64/3.02 | ~ greater(v3, v1) | ~ greater(v1, v2) | organization(v0, v1))
% 15.64/3.02
% 15.64/3.02 (mp7)
% 15.64/3.02 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) |
% 15.64/3.02 ~ reorganization(v0, v1, v2) | greater(v2, v1))
% 15.64/3.02
% 15.64/3.02 (t5_plus_FOL)
% 15.64/3.03 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5:
% 15.64/3.03 $i] : ? [v6: $i] : ? [v7: $i] : ? [v8: $i] : ? [v9: $i] : ? [v10: $i] :
% 15.64/3.03 ? [v11: $i] : ( ~ (v11 = v9) & ~ (v6 = v5) & $i(v11) & $i(v10) & $i(v9) &
% 15.64/3.03 $i(v8) & $i(v7) & $i(v6) & $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) &
% 15.64/3.03 $i(v0) & complexity(v1, v8, v10) & complexity(v0, v7, v10) &
% 15.64/3.03 reorganization_type(v1, v2, v10) & reorganization_type(v0, v2, v10) &
% 15.64/3.03 class(v1, v3, v10) & class(v0, v3, v10) & reorganization_free(v0, v9, v11) &
% 15.64/3.03 reorganization(v1, v10, v11) & reorganization(v0, v10, v9) &
% 15.64/3.03 organization(v1, v11) & organization(v1, v10) & organization(v0, v11) &
% 15.64/3.03 organization(v0, v10) & survival_chance(v1, v6, v9) & survival_chance(v1,
% 15.64/3.03 v4, v10) & survival_chance(v0, v5, v9) & survival_chance(v0, v4, v10) &
% 15.64/3.03 greater(v8, v7) & ~ greater(v5, v6))
% 15.64/3.03
% 15.64/3.03 Further assumptions not needed in the proof:
% 15.64/3.03 --------------------------------------------
% 15.64/3.03 a15_FOL, mp11, mp12, mp14, mp6_1, mp6_2, t3_FOL, t4_FOL
% 15.64/3.03
% 15.64/3.03 Those formulas are unsatisfiable:
% 15.64/3.03 ---------------------------------
% 15.64/3.03
% 15.64/3.03 Begin of proof
% 15.64/3.03 |
% 15.64/3.03 | DELTA: instantiating (t5_plus_FOL) with fresh symbols all_14_0, all_14_1,
% 15.64/3.03 | all_14_2, all_14_3, all_14_4, all_14_5, all_14_6, all_14_7, all_14_8,
% 15.64/3.03 | all_14_9, all_14_10, all_14_11 gives:
% 15.64/3.04 | (1) ~ (all_14_0 = all_14_2) & ~ (all_14_5 = all_14_6) & $i(all_14_0) &
% 15.64/3.04 | $i(all_14_1) & $i(all_14_2) & $i(all_14_3) & $i(all_14_4) &
% 15.64/3.04 | $i(all_14_5) & $i(all_14_6) & $i(all_14_7) & $i(all_14_8) &
% 15.64/3.04 | $i(all_14_9) & $i(all_14_10) & $i(all_14_11) & complexity(all_14_10,
% 15.64/3.04 | all_14_3, all_14_1) & complexity(all_14_11, all_14_4, all_14_1) &
% 15.64/3.04 | reorganization_type(all_14_10, all_14_9, all_14_1) &
% 15.64/3.04 | reorganization_type(all_14_11, all_14_9, all_14_1) & class(all_14_10,
% 15.64/3.04 | all_14_8, all_14_1) & class(all_14_11, all_14_8, all_14_1) &
% 15.64/3.04 | reorganization_free(all_14_11, all_14_2, all_14_0) &
% 15.64/3.04 | reorganization(all_14_10, all_14_1, all_14_0) &
% 15.64/3.04 | reorganization(all_14_11, all_14_1, all_14_2) & organization(all_14_10,
% 15.64/3.04 | all_14_0) & organization(all_14_10, all_14_1) &
% 15.64/3.04 | organization(all_14_11, all_14_0) & organization(all_14_11, all_14_1) &
% 15.64/3.04 | survival_chance(all_14_10, all_14_5, all_14_2) &
% 15.64/3.04 | survival_chance(all_14_10, all_14_7, all_14_1) &
% 15.64/3.04 | survival_chance(all_14_11, all_14_6, all_14_2) &
% 15.64/3.04 | survival_chance(all_14_11, all_14_7, all_14_1) & greater(all_14_3,
% 15.64/3.04 | all_14_4) & ~ greater(all_14_6, all_14_5)
% 15.64/3.04 |
% 15.64/3.04 | ALPHA: (1) implies:
% 15.64/3.04 | (2) ~ (all_14_5 = all_14_6)
% 15.64/3.04 | (3) ~ greater(all_14_6, all_14_5)
% 15.64/3.04 | (4) greater(all_14_3, all_14_4)
% 15.64/3.04 | (5) survival_chance(all_14_11, all_14_7, all_14_1)
% 15.64/3.04 | (6) survival_chance(all_14_11, all_14_6, all_14_2)
% 15.64/3.04 | (7) survival_chance(all_14_10, all_14_7, all_14_1)
% 15.64/3.04 | (8) survival_chance(all_14_10, all_14_5, all_14_2)
% 15.64/3.04 | (9) organization(all_14_11, all_14_1)
% 15.64/3.04 | (10) organization(all_14_11, all_14_0)
% 15.64/3.04 | (11) organization(all_14_10, all_14_1)
% 15.64/3.04 | (12) organization(all_14_10, all_14_0)
% 15.64/3.04 | (13) reorganization(all_14_11, all_14_1, all_14_2)
% 15.64/3.04 | (14) reorganization(all_14_10, all_14_1, all_14_0)
% 15.64/3.05 | (15) class(all_14_11, all_14_8, all_14_1)
% 15.64/3.05 | (16) class(all_14_10, all_14_8, all_14_1)
% 15.64/3.05 | (17) reorganization_type(all_14_11, all_14_9, all_14_1)
% 15.64/3.05 | (18) reorganization_type(all_14_10, all_14_9, all_14_1)
% 15.64/3.05 | (19) complexity(all_14_11, all_14_4, all_14_1)
% 15.64/3.05 | (20) complexity(all_14_10, all_14_3, all_14_1)
% 15.64/3.05 | (21) $i(all_14_11)
% 15.64/3.05 | (22) $i(all_14_10)
% 15.64/3.05 | (23) $i(all_14_9)
% 15.64/3.05 | (24) $i(all_14_8)
% 15.64/3.05 | (25) $i(all_14_7)
% 15.64/3.05 | (26) $i(all_14_6)
% 15.64/3.05 | (27) $i(all_14_5)
% 15.64/3.05 | (28) $i(all_14_4)
% 15.64/3.05 | (29) $i(all_14_3)
% 15.64/3.05 | (30) $i(all_14_2)
% 15.64/3.05 | (31) $i(all_14_1)
% 15.64/3.05 | (32) $i(all_14_0)
% 15.64/3.05 |
% 15.64/3.05 | GROUND_INST: instantiating (mp7) with all_14_11, all_14_1, all_14_2,
% 15.64/3.05 | simplifying with (13), (21), (30), (31) gives:
% 15.64/3.05 | (33) greater(all_14_2, all_14_1)
% 15.64/3.05 |
% 15.64/3.05 | GROUND_INST: instantiating (a10_FOL) with all_14_11, all_14_10, all_14_9,
% 15.64/3.05 | all_14_8, all_14_4, all_14_3, all_14_1, all_14_2, all_14_0,
% 15.64/3.05 | simplifying with (4), (9), (11), (12), (13), (14), (15), (16),
% 15.64/3.05 | (17), (18), (19), (20), (21), (22), (23), (24), (28), (29), (30),
% 15.64/3.05 | (31), (32) gives:
% 15.64/3.05 | (34) greater(all_14_0, all_14_2)
% 15.64/3.05 |
% 15.64/3.05 | GROUND_INST: instantiating (mp13) with all_14_10, all_14_2, all_14_1,
% 15.64/3.05 | all_14_0, simplifying with (11), (12), (22), (30), (31), (32),
% 15.64/3.05 | (33), (34) gives:
% 15.64/3.05 | (35) organization(all_14_10, all_14_2)
% 15.64/3.05 |
% 15.64/3.05 | GROUND_INST: instantiating (mp13) with all_14_11, all_14_2, all_14_1,
% 15.64/3.05 | all_14_0, simplifying with (9), (10), (21), (30), (31), (32),
% 15.64/3.05 | (33), (34) gives:
% 15.64/3.05 | (36) organization(all_14_11, all_14_2)
% 15.64/3.05 |
% 15.64/3.06 | GROUND_INST: instantiating (a11_FOL) with all_14_11, all_14_10, all_14_9,
% 15.64/3.06 | all_14_8, all_14_7, all_14_6, all_14_5, all_14_4, all_14_3,
% 15.64/3.06 | all_14_1, all_14_2, all_14_0, simplifying with (3), (4), (5),
% 15.64/3.06 | (6), (7), (8), (9), (11), (13), (14), (15), (16), (17), (18),
% 15.64/3.06 | (19), (20), (21), (22), (23), (24), (25), (26), (27), (28), (29),
% 15.64/3.06 | (30), (31), (32), (35), (36) gives:
% 15.64/3.06 | (37) all_14_5 = all_14_6
% 15.64/3.06 |
% 15.64/3.06 | REDUCE: (2), (37) imply:
% 15.64/3.06 | (38) $false
% 16.07/3.06 |
% 16.07/3.06 | CLOSE: (38) is inconsistent.
% 16.07/3.06 |
% 16.07/3.06 End of proof
% 16.07/3.06 % SZS output end Proof for theBenchmark
% 16.07/3.06
% 16.07/3.06 2425ms
%------------------------------------------------------------------------------