TSTP Solution File: MGT008+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : MGT008+1 : TPTP v8.1.2. Released v2.0.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 : Thu Aug 31 09:16:09 EDT 2023
% Result : Theorem 4.90s 1.36s
% Output : Proof 6.88s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : MGT008+1 : TPTP v8.1.2. Released v2.0.0.
% 0.06/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.33 % Computer : n007.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 05:55:27 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.59 ________ _____
% 0.20/0.59 ___ __ \_________(_)________________________________
% 0.20/0.59 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.59 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.59 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.59
% 0.20/0.59 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.59 (2023-06-19)
% 0.20/0.59
% 0.20/0.59 (c) Philipp Rümmer, 2009-2023
% 0.20/0.59 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.59 Amanda Stjerna.
% 0.20/0.59 Free software under BSD-3-Clause.
% 0.20/0.59
% 0.20/0.59 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.59
% 0.20/0.59 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.20/0.60 Running up to 7 provers in parallel.
% 0.20/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.38/0.97 Prover 1: Preprocessing ...
% 2.38/0.97 Prover 4: Preprocessing ...
% 2.55/1.02 Prover 5: Preprocessing ...
% 2.55/1.02 Prover 0: Preprocessing ...
% 2.55/1.02 Prover 6: Preprocessing ...
% 2.55/1.02 Prover 3: Preprocessing ...
% 2.55/1.02 Prover 2: Preprocessing ...
% 3.45/1.17 Prover 2: Constructing countermodel ...
% 3.45/1.19 Prover 5: Constructing countermodel ...
% 3.96/1.20 Prover 1: Constructing countermodel ...
% 3.96/1.22 Prover 6: Constructing countermodel ...
% 3.96/1.22 Prover 3: Constructing countermodel ...
% 4.90/1.36 Prover 2: proved (745ms)
% 4.90/1.36
% 4.90/1.36 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.90/1.36
% 4.90/1.36 Prover 6: stopped
% 4.90/1.36 Prover 3: stopped
% 4.90/1.38 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 4.90/1.38 Prover 5: stopped
% 4.90/1.38 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 4.90/1.39 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 4.90/1.39 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 4.90/1.39 Prover 7: Preprocessing ...
% 4.90/1.39 Prover 8: Preprocessing ...
% 4.90/1.40 Prover 10: Preprocessing ...
% 4.90/1.41 Prover 11: Preprocessing ...
% 4.90/1.41 Prover 7: Constructing countermodel ...
% 4.90/1.43 Prover 10: Constructing countermodel ...
% 4.90/1.48 Prover 8: Warning: ignoring some quantifiers
% 5.95/1.50 Prover 8: Constructing countermodel ...
% 5.95/1.50 Prover 10: Found proof (size 11)
% 5.95/1.50 Prover 10: proved (113ms)
% 5.95/1.50 Prover 11: stopped
% 5.95/1.50 Prover 7: stopped
% 5.95/1.50 Prover 1: stopped
% 5.95/1.51 Prover 8: stopped
% 5.95/1.54 Prover 4: Constructing countermodel ...
% 5.95/1.55 Prover 4: stopped
% 6.52/1.60 Prover 0: Proving ...
% 6.52/1.61 Prover 0: stopped
% 6.52/1.61
% 6.52/1.61 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.52/1.61
% 6.52/1.61 % SZS output start Proof for theBenchmark
% 6.52/1.62 Assumptions after simplification:
% 6.52/1.62 ---------------------------------
% 6.52/1.62
% 6.52/1.62 (a5_FOL)
% 6.52/1.63 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5:
% 6.52/1.63 $i] : ! [v6: $i] : ! [v7: $i] : ! [v8: $i] : ( ~ $i(v8) | ~ $i(v7) | ~
% 6.52/1.63 $i(v6) | ~ $i(v5) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~
% 6.52/1.63 $i(v0) | ~ greater(v4, v3) | ~ size(v1, v4, v8) | ~ size(v0, v3, v7) | ~
% 6.52/1.63 class(v1, v2, v8) | ~ class(v0, v2, v7) | ~ inertia(v1, v6, v8) | ~
% 6.52/1.63 inertia(v0, v5, v7) | ~ organization(v1, v8) | ~ organization(v0, v7) |
% 6.52/1.63 greater(v6, v5))
% 6.52/1.63
% 6.52/1.63 (mp5)
% 6.52/1.63 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ organization(v0, v1) |
% 6.52/1.63 ? [v2: $i] : ($i(v2) & inertia(v0, v2, v1)))
% 6.52/1.63
% 6.52/1.63 (t1_FOL)
% 6.52/1.63 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5:
% 6.52/1.63 $i] : ! [v6: $i] : ! [v7: $i] : ( ~ $i(v7) | ~ $i(v6) | ~ $i(v5) | ~
% 6.52/1.64 $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~
% 6.52/1.64 survival_chance(v1, v7, v3) | ~ survival_chance(v0, v6, v2) | ~
% 6.52/1.64 reorganization_free(v1, v3, v3) | ~ reorganization_free(v0, v2, v2) | ~
% 6.52/1.64 greater(v5, v4) | ~ inertia(v1, v5, v3) | ~ inertia(v0, v4, v2) | ~
% 6.52/1.64 organization(v1, v3) | ~ organization(v0, v2) | greater(v7, v6))
% 6.52/1.64
% 6.52/1.64 (t8_FOL)
% 6.88/1.64 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5:
% 6.88/1.64 $i] : ? [v6: $i] : ? [v7: $i] : ? [v8: $i] : ($i(v8) & $i(v7) & $i(v6) &
% 6.88/1.64 $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0) & survival_chance(v1,
% 6.88/1.64 v4, v8) & survival_chance(v0, v3, v7) & reorganization_free(v1, v8, v8) &
% 6.88/1.64 reorganization_free(v0, v7, v7) & greater(v6, v5) & size(v1, v6, v8) &
% 6.88/1.64 size(v0, v5, v7) & class(v1, v2, v8) & class(v0, v2, v7) & organization(v1,
% 6.88/1.64 v8) & organization(v0, v7) & ~ greater(v4, v3))
% 6.88/1.64
% 6.88/1.64 Those formulas are unsatisfiable:
% 6.88/1.64 ---------------------------------
% 6.88/1.64
% 6.88/1.64 Begin of proof
% 6.88/1.64 |
% 6.88/1.64 | DELTA: instantiating (t8_FOL) with fresh symbols all_5_0, all_5_1, all_5_2,
% 6.88/1.64 | all_5_3, all_5_4, all_5_5, all_5_6, all_5_7, all_5_8 gives:
% 6.88/1.65 | (1) $i(all_5_0) & $i(all_5_1) & $i(all_5_2) & $i(all_5_3) & $i(all_5_4) &
% 6.88/1.65 | $i(all_5_5) & $i(all_5_6) & $i(all_5_7) & $i(all_5_8) &
% 6.88/1.65 | survival_chance(all_5_7, all_5_4, all_5_0) & survival_chance(all_5_8,
% 6.88/1.65 | all_5_5, all_5_1) & reorganization_free(all_5_7, all_5_0, all_5_0) &
% 6.88/1.65 | reorganization_free(all_5_8, all_5_1, all_5_1) & greater(all_5_2,
% 6.88/1.65 | all_5_3) & size(all_5_7, all_5_2, all_5_0) & size(all_5_8, all_5_3,
% 6.88/1.65 | all_5_1) & class(all_5_7, all_5_6, all_5_0) & class(all_5_8, all_5_6,
% 6.88/1.65 | all_5_1) & organization(all_5_7, all_5_0) & organization(all_5_8,
% 6.88/1.65 | all_5_1) & ~ greater(all_5_4, all_5_5)
% 6.88/1.65 |
% 6.88/1.65 | ALPHA: (1) implies:
% 6.88/1.65 | (2) ~ greater(all_5_4, all_5_5)
% 6.88/1.65 | (3) organization(all_5_8, all_5_1)
% 6.88/1.65 | (4) organization(all_5_7, all_5_0)
% 6.88/1.65 | (5) class(all_5_8, all_5_6, all_5_1)
% 6.88/1.65 | (6) class(all_5_7, all_5_6, all_5_0)
% 6.88/1.65 | (7) size(all_5_8, all_5_3, all_5_1)
% 6.88/1.66 | (8) size(all_5_7, all_5_2, all_5_0)
% 6.88/1.66 | (9) greater(all_5_2, all_5_3)
% 6.88/1.66 | (10) reorganization_free(all_5_8, all_5_1, all_5_1)
% 6.88/1.66 | (11) reorganization_free(all_5_7, all_5_0, all_5_0)
% 6.88/1.66 | (12) survival_chance(all_5_8, all_5_5, all_5_1)
% 6.88/1.66 | (13) survival_chance(all_5_7, all_5_4, all_5_0)
% 6.88/1.66 | (14) $i(all_5_8)
% 6.88/1.66 | (15) $i(all_5_7)
% 6.88/1.66 | (16) $i(all_5_6)
% 6.88/1.66 | (17) $i(all_5_5)
% 6.88/1.66 | (18) $i(all_5_4)
% 6.88/1.66 | (19) $i(all_5_3)
% 6.88/1.66 | (20) $i(all_5_2)
% 6.88/1.66 | (21) $i(all_5_1)
% 6.88/1.66 | (22) $i(all_5_0)
% 6.88/1.66 |
% 6.88/1.66 | GROUND_INST: instantiating (mp5) with all_5_8, all_5_1, simplifying with (3),
% 6.88/1.66 | (14), (21) gives:
% 6.88/1.66 | (23) ? [v0: $i] : ($i(v0) & inertia(all_5_8, v0, all_5_1))
% 6.88/1.66 |
% 6.88/1.66 | GROUND_INST: instantiating (mp5) with all_5_7, all_5_0, simplifying with (4),
% 6.88/1.66 | (15), (22) gives:
% 6.88/1.66 | (24) ? [v0: $i] : ($i(v0) & inertia(all_5_7, v0, all_5_0))
% 6.88/1.66 |
% 6.88/1.66 | DELTA: instantiating (24) with fresh symbol all_12_0 gives:
% 6.88/1.66 | (25) $i(all_12_0) & inertia(all_5_7, all_12_0, all_5_0)
% 6.88/1.66 |
% 6.88/1.66 | ALPHA: (25) implies:
% 6.88/1.66 | (26) inertia(all_5_7, all_12_0, all_5_0)
% 6.88/1.66 | (27) $i(all_12_0)
% 6.88/1.66 |
% 6.88/1.66 | DELTA: instantiating (23) with fresh symbol all_14_0 gives:
% 6.88/1.66 | (28) $i(all_14_0) & inertia(all_5_8, all_14_0, all_5_1)
% 6.88/1.66 |
% 6.88/1.66 | ALPHA: (28) implies:
% 6.88/1.66 | (29) inertia(all_5_8, all_14_0, all_5_1)
% 6.88/1.66 | (30) $i(all_14_0)
% 6.88/1.66 |
% 6.88/1.66 | GROUND_INST: instantiating (a5_FOL) with all_5_8, all_5_7, all_5_6, all_5_3,
% 6.88/1.66 | all_5_2, all_14_0, all_12_0, all_5_1, all_5_0, simplifying with
% 6.88/1.66 | (3), (4), (5), (6), (7), (8), (9), (14), (15), (16), (19), (20),
% 6.88/1.66 | (21), (22), (26), (27), (29), (30) gives:
% 6.88/1.66 | (31) greater(all_12_0, all_14_0)
% 6.88/1.66 |
% 6.88/1.67 | GROUND_INST: instantiating (t1_FOL) with all_5_8, all_5_7, all_5_1, all_5_0,
% 6.88/1.67 | all_14_0, all_12_0, all_5_5, all_5_4, simplifying with (2), (3),
% 6.88/1.67 | (4), (10), (11), (12), (13), (14), (15), (17), (18), (21), (22),
% 6.88/1.67 | (26), (27), (29), (30), (31) gives:
% 6.88/1.67 | (32) $false
% 6.88/1.67 |
% 6.88/1.67 | CLOSE: (32) is inconsistent.
% 6.88/1.67 |
% 6.88/1.67 End of proof
% 6.88/1.67 % SZS output end Proof for theBenchmark
% 6.88/1.67
% 6.88/1.67 1076ms
%------------------------------------------------------------------------------