TSTP Solution File: MGT011+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : MGT011+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 : n006.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:10 EDT 2023
% Result : Theorem 6.62s 1.77s
% Output : Proof 9.95s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT011+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34 % Computer : n006.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Aug 28 06:19:22 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.63 ________ _____
% 0.19/0.63 ___ __ \_________(_)________________________________
% 0.19/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.19/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.19/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.19/0.63
% 0.19/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.19/0.63 (2023-06-19)
% 0.19/0.63
% 0.19/0.63 (c) Philipp Rümmer, 2009-2023
% 0.19/0.63 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.19/0.63 Amanda Stjerna.
% 0.19/0.63 Free software under BSD-3-Clause.
% 0.19/0.63
% 0.19/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.19/0.63
% 0.19/0.63 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.19/0.64 Running up to 7 provers in parallel.
% 0.19/0.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.19/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.19/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.19/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 0.19/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.19/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.19/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 2.47/1.16 Prover 4: Preprocessing ...
% 2.75/1.17 Prover 1: Preprocessing ...
% 2.75/1.21 Prover 2: Preprocessing ...
% 2.75/1.21 Prover 0: Preprocessing ...
% 2.75/1.21 Prover 6: Preprocessing ...
% 2.75/1.21 Prover 3: Preprocessing ...
% 2.75/1.21 Prover 5: Preprocessing ...
% 3.50/1.45 Prover 5: Constructing countermodel ...
% 3.50/1.45 Prover 2: Constructing countermodel ...
% 5.24/1.56 Prover 6: Constructing countermodel ...
% 5.24/1.58 Prover 3: Constructing countermodel ...
% 5.24/1.61 Prover 1: Constructing countermodel ...
% 6.62/1.77 Prover 5: proved (1114ms)
% 6.62/1.77
% 6.62/1.77 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.62/1.77
% 6.62/1.77 Prover 3: stopped
% 6.62/1.78 Prover 2: stopped
% 6.62/1.78 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 6.62/1.78 Prover 6: stopped
% 6.87/1.79 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 6.87/1.79 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 6.87/1.80 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 6.87/1.82 Prover 7: Preprocessing ...
% 6.87/1.82 Prover 8: Preprocessing ...
% 7.38/1.86 Prover 10: Preprocessing ...
% 7.38/1.86 Prover 11: Preprocessing ...
% 7.38/1.90 Prover 7: Constructing countermodel ...
% 7.83/1.93 Prover 4: Constructing countermodel ...
% 7.83/1.94 Prover 10: Constructing countermodel ...
% 7.83/1.96 Prover 8: Warning: ignoring some quantifiers
% 8.16/1.97 Prover 8: Constructing countermodel ...
% 8.16/1.98 Prover 0: Proving ...
% 8.16/1.99 Prover 0: stopped
% 8.16/1.99 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 8.16/2.01 Prover 13: Preprocessing ...
% 8.78/2.06 Prover 13: Constructing countermodel ...
% 8.78/2.07 Prover 7: Found proof (size 23)
% 8.78/2.07 Prover 7: proved (290ms)
% 8.78/2.07 Prover 8: stopped
% 8.78/2.07 Prover 1: stopped
% 8.78/2.07 Prover 10: stopped
% 8.78/2.07 Prover 4: stopped
% 8.78/2.08 Prover 13: stopped
% 9.60/2.28 Prover 11: Constructing countermodel ...
% 9.83/2.29 Prover 11: stopped
% 9.83/2.29
% 9.83/2.29 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.83/2.29
% 9.92/2.31 % SZS output start Proof for theBenchmark
% 9.92/2.31 Assumptions after simplification:
% 9.92/2.31 ---------------------------------
% 9.92/2.31
% 9.92/2.31 (a5_FOL)
% 9.95/2.33 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5:
% 9.95/2.33 $i] : ! [v6: $i] : ! [v7: $i] : ! [v8: $i] : ( ~ $i(v8) | ~ $i(v7) | ~
% 9.95/2.33 $i(v6) | ~ $i(v5) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~
% 9.95/2.33 $i(v0) | ~ size(v1, v4, v8) | ~ size(v0, v3, v7) | ~ class(v1, v2, v8) |
% 9.95/2.33 ~ class(v0, v2, v7) | ~ greater(v4, v3) | ~ inertia(v1, v6, v8) | ~
% 9.95/2.33 inertia(v0, v5, v7) | ~ organization(v1, v8) | ~ organization(v0, v7) |
% 9.95/2.33 greater(v6, v5))
% 9.95/2.33
% 9.95/2.33 (mp10)
% 9.95/2.33 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v4 = v3
% 9.95/2.33 | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~
% 9.95/2.33 reorganization_free(v0, v1, v2) | ~ class(v0, v4, v2) | ~ class(v0, v3,
% 9.95/2.33 v1) | ~ organization(v0, v2) | ~ organization(v0, v1))
% 9.95/2.33
% 9.95/2.33 (mp5)
% 9.95/2.33 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ organization(v0, v1) |
% 9.95/2.33 ? [v2: $i] : ($i(v2) & inertia(v0, v2, v1)))
% 9.95/2.33
% 9.95/2.33 (mp6_2)
% 9.95/2.34 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ greater(v1, v0) | ~
% 9.95/2.34 greater(v0, v1))
% 9.95/2.34
% 9.95/2.34 (mp9)
% 9.95/2.34 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ organization(v0, v1) |
% 9.95/2.34 ? [v2: $i] : ($i(v2) & class(v0, v2, v1)))
% 9.95/2.34
% 9.95/2.34 (t11_FOL)
% 9.95/2.34 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ($i(v4)
% 9.95/2.34 & $i(v3) & $i(v2) & $i(v1) & $i(v0) & size(v0, v2, v4) & size(v0, v1, v3) &
% 9.95/2.34 reorganization_free(v0, v3, v4) & greater(v4, v3) & greater(v1, v2) &
% 9.95/2.34 organization(v0, v4) & organization(v0, v3))
% 9.95/2.34
% 9.95/2.34 (t2_FOL)
% 9.95/2.35 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ( ~
% 9.95/2.35 $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~
% 9.95/2.35 reorganization_free(v0, v3, v4) | ~ greater(v4, v3) | ~ inertia(v0, v2,
% 9.95/2.35 v4) | ~ inertia(v0, v1, v3) | ~ organization(v0, v4) | ~
% 9.95/2.35 organization(v0, v3) | greater(v2, v1))
% 9.95/2.35
% 9.95/2.35 Further assumptions not needed in the proof:
% 9.95/2.35 --------------------------------------------
% 9.95/2.35 mp6_1
% 9.95/2.35
% 9.95/2.35 Those formulas are unsatisfiable:
% 9.95/2.35 ---------------------------------
% 9.95/2.35
% 9.95/2.35 Begin of proof
% 9.95/2.35 |
% 9.95/2.35 | DELTA: instantiating (t11_FOL) with fresh symbols all_9_0, all_9_1, all_9_2,
% 9.95/2.35 | all_9_3, all_9_4 gives:
% 9.95/2.35 | (1) $i(all_9_0) & $i(all_9_1) & $i(all_9_2) & $i(all_9_3) & $i(all_9_4) &
% 9.95/2.35 | size(all_9_4, all_9_2, all_9_0) & size(all_9_4, all_9_3, all_9_1) &
% 9.95/2.35 | reorganization_free(all_9_4, all_9_1, all_9_0) & greater(all_9_0,
% 9.95/2.35 | all_9_1) & greater(all_9_3, all_9_2) & organization(all_9_4, all_9_0)
% 9.95/2.35 | & organization(all_9_4, all_9_1)
% 9.95/2.35 |
% 9.95/2.35 | ALPHA: (1) implies:
% 9.95/2.36 | (2) organization(all_9_4, all_9_1)
% 9.95/2.36 | (3) organization(all_9_4, all_9_0)
% 9.95/2.36 | (4) greater(all_9_3, all_9_2)
% 9.95/2.36 | (5) greater(all_9_0, all_9_1)
% 9.95/2.36 | (6) reorganization_free(all_9_4, all_9_1, all_9_0)
% 9.95/2.36 | (7) size(all_9_4, all_9_3, all_9_1)
% 9.95/2.36 | (8) size(all_9_4, all_9_2, all_9_0)
% 9.95/2.36 | (9) $i(all_9_4)
% 9.95/2.36 | (10) $i(all_9_3)
% 9.95/2.36 | (11) $i(all_9_2)
% 9.95/2.36 | (12) $i(all_9_1)
% 9.95/2.36 | (13) $i(all_9_0)
% 9.95/2.36 |
% 9.95/2.36 | GROUND_INST: instantiating (mp9) with all_9_4, all_9_1, simplifying with (2),
% 9.95/2.36 | (9), (12) gives:
% 9.95/2.36 | (14) ? [v0: $i] : ($i(v0) & class(all_9_4, v0, all_9_1))
% 9.95/2.36 |
% 9.95/2.36 | GROUND_INST: instantiating (mp5) with all_9_4, all_9_1, simplifying with (2),
% 9.95/2.36 | (9), (12) gives:
% 9.95/2.36 | (15) ? [v0: $i] : ($i(v0) & inertia(all_9_4, v0, all_9_1))
% 9.95/2.36 |
% 9.95/2.36 | GROUND_INST: instantiating (mp9) with all_9_4, all_9_0, simplifying with (3),
% 9.95/2.36 | (9), (13) gives:
% 9.95/2.37 | (16) ? [v0: $i] : ($i(v0) & class(all_9_4, v0, all_9_0))
% 9.95/2.37 |
% 9.95/2.37 | GROUND_INST: instantiating (mp5) with all_9_4, all_9_0, simplifying with (3),
% 9.95/2.37 | (9), (13) gives:
% 9.95/2.37 | (17) ? [v0: $i] : ($i(v0) & inertia(all_9_4, v0, all_9_0))
% 9.95/2.37 |
% 9.95/2.37 | DELTA: instantiating (17) with fresh symbol all_17_0 gives:
% 9.95/2.37 | (18) $i(all_17_0) & inertia(all_9_4, all_17_0, all_9_0)
% 9.95/2.37 |
% 9.95/2.37 | ALPHA: (18) implies:
% 9.95/2.37 | (19) inertia(all_9_4, all_17_0, all_9_0)
% 9.95/2.37 | (20) $i(all_17_0)
% 9.95/2.37 |
% 9.95/2.37 | DELTA: instantiating (16) with fresh symbol all_19_0 gives:
% 9.95/2.37 | (21) $i(all_19_0) & class(all_9_4, all_19_0, all_9_0)
% 9.95/2.37 |
% 9.95/2.37 | ALPHA: (21) implies:
% 9.95/2.37 | (22) class(all_9_4, all_19_0, all_9_0)
% 9.95/2.37 | (23) $i(all_19_0)
% 9.95/2.37 |
% 9.95/2.37 | DELTA: instantiating (15) with fresh symbol all_21_0 gives:
% 9.95/2.37 | (24) $i(all_21_0) & inertia(all_9_4, all_21_0, all_9_1)
% 9.95/2.37 |
% 9.95/2.37 | ALPHA: (24) implies:
% 9.95/2.37 | (25) inertia(all_9_4, all_21_0, all_9_1)
% 9.95/2.37 | (26) $i(all_21_0)
% 9.95/2.37 |
% 9.95/2.37 | DELTA: instantiating (14) with fresh symbol all_23_0 gives:
% 9.95/2.37 | (27) $i(all_23_0) & class(all_9_4, all_23_0, all_9_1)
% 9.95/2.37 |
% 9.95/2.37 | ALPHA: (27) implies:
% 9.95/2.37 | (28) class(all_9_4, all_23_0, all_9_1)
% 9.95/2.37 | (29) $i(all_23_0)
% 9.95/2.37 |
% 9.95/2.38 | GROUND_INST: instantiating (t2_FOL) with all_9_4, all_21_0, all_17_0, all_9_1,
% 9.95/2.38 | all_9_0, simplifying with (2), (3), (5), (6), (9), (12), (13),
% 9.95/2.38 | (19), (20), (25), (26) gives:
% 9.95/2.38 | (30) greater(all_17_0, all_21_0)
% 9.95/2.38 |
% 9.95/2.38 | GROUND_INST: instantiating (a5_FOL) with all_9_4, all_9_4, all_19_0, all_9_2,
% 9.95/2.38 | all_9_3, all_17_0, all_21_0, all_9_0, all_9_1, simplifying with
% 9.95/2.38 | (2), (3), (4), (7), (8), (9), (10), (11), (12), (13), (19), (20),
% 9.95/2.38 | (22), (23), (25), (26) gives:
% 9.95/2.38 | (31) ~ class(all_9_4, all_19_0, all_9_1) | greater(all_21_0, all_17_0)
% 9.95/2.38 |
% 9.95/2.38 | GROUND_INST: instantiating (mp10) with all_9_4, all_9_1, all_9_0, all_23_0,
% 9.95/2.38 | all_19_0, simplifying with (2), (3), (6), (9), (12), (13), (22),
% 9.95/2.38 | (23), (28), (29) gives:
% 9.95/2.38 | (32) all_23_0 = all_19_0
% 9.95/2.38 |
% 9.95/2.38 | REDUCE: (28), (32) imply:
% 9.95/2.38 | (33) class(all_9_4, all_19_0, all_9_1)
% 9.95/2.38 |
% 9.95/2.38 | BETA: splitting (31) gives:
% 9.95/2.38 |
% 9.95/2.39 | Case 1:
% 9.95/2.39 | |
% 9.95/2.39 | | (34) ~ class(all_9_4, all_19_0, all_9_1)
% 9.95/2.39 | |
% 9.95/2.39 | | PRED_UNIFY: (33), (34) imply:
% 9.95/2.39 | | (35) $false
% 9.95/2.39 | |
% 9.95/2.39 | | CLOSE: (35) is inconsistent.
% 9.95/2.39 | |
% 9.95/2.39 | Case 2:
% 9.95/2.39 | |
% 9.95/2.39 | | (36) greater(all_21_0, all_17_0)
% 9.95/2.39 | |
% 9.95/2.39 | | GROUND_INST: instantiating (mp6_2) with all_17_0, all_21_0, simplifying with
% 9.95/2.39 | | (20), (26), (30), (36) gives:
% 9.95/2.39 | | (37) $false
% 9.95/2.39 | |
% 9.95/2.39 | | CLOSE: (37) is inconsistent.
% 9.95/2.39 | |
% 9.95/2.39 | End of split
% 9.95/2.39 |
% 9.95/2.39 End of proof
% 9.95/2.39 % SZS output end Proof for theBenchmark
% 9.95/2.39
% 9.95/2.39 1759ms
%------------------------------------------------------------------------------