TSTP Solution File: MGT006+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : MGT006+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 : n018.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 5.01s 1.50s
% Output : Proof 8.28s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT006+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.14/0.34 % Computer : n018.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Aug 28 06:21:16 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.62 ________ _____
% 0.20/0.62 ___ __ \_________(_)________________________________
% 0.20/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.62
% 0.20/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.62 (2023-06-19)
% 0.20/0.62
% 0.20/0.62 (c) Philipp Rümmer, 2009-2023
% 0.20/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.62 Amanda Stjerna.
% 0.20/0.62 Free software under BSD-3-Clause.
% 0.20/0.62
% 0.20/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.62
% 0.20/0.62 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.20/0.63 Running up to 7 provers in parallel.
% 0.20/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.26/1.05 Prover 4: Preprocessing ...
% 2.26/1.05 Prover 1: Preprocessing ...
% 2.26/1.09 Prover 0: Preprocessing ...
% 2.26/1.09 Prover 2: Preprocessing ...
% 2.26/1.09 Prover 3: Preprocessing ...
% 2.26/1.09 Prover 5: Preprocessing ...
% 2.26/1.09 Prover 6: Preprocessing ...
% 3.43/1.25 Prover 2: Constructing countermodel ...
% 3.43/1.26 Prover 5: Constructing countermodel ...
% 4.05/1.30 Prover 6: Constructing countermodel ...
% 4.05/1.31 Prover 1: Constructing countermodel ...
% 4.05/1.32 Prover 3: Constructing countermodel ...
% 5.01/1.49 Prover 2: proved (848ms)
% 5.01/1.50
% 5.01/1.50 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.01/1.50
% 5.01/1.50 Prover 5: stopped
% 5.01/1.50 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 5.01/1.50 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 5.01/1.50 Prover 6: stopped
% 5.01/1.50 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 5.01/1.51 Prover 3: stopped
% 5.72/1.52 Prover 8: Preprocessing ...
% 5.72/1.52 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 5.72/1.53 Prover 10: Preprocessing ...
% 5.72/1.54 Prover 7: Preprocessing ...
% 5.72/1.55 Prover 11: Preprocessing ...
% 5.72/1.57 Prover 8: Warning: ignoring some quantifiers
% 5.72/1.58 Prover 10: Constructing countermodel ...
% 6.26/1.59 Prover 8: Constructing countermodel ...
% 6.26/1.60 Prover 7: Constructing countermodel ...
% 7.15/1.72 Prover 10: Found proof (size 17)
% 7.15/1.72 Prover 10: proved (218ms)
% 7.15/1.72 Prover 1: stopped
% 7.15/1.72 Prover 7: stopped
% 7.15/1.73 Prover 8: stopped
% 7.31/1.78 Prover 4: Constructing countermodel ...
% 7.31/1.79 Prover 4: stopped
% 7.91/1.84 Prover 0: Proving ...
% 7.91/1.85 Prover 0: stopped
% 7.91/1.89 Prover 11: Constructing countermodel ...
% 8.28/1.89 Prover 11: stopped
% 8.28/1.90
% 8.28/1.90 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.28/1.90
% 8.28/1.90 % SZS output start Proof for theBenchmark
% 8.28/1.90 Assumptions after simplification:
% 8.28/1.90 ---------------------------------
% 8.28/1.90
% 8.28/1.90 (a2_FOL)
% 8.28/1.92 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5:
% 8.28/1.92 $i] : ! [v6: $i] : ! [v7: $i] : ! [v8: $i] : ! [v9: $i] : ( ~ $i(v9) |
% 8.28/1.92 ~ $i(v8) | ~ $i(v7) | ~ $i(v6) | ~ $i(v5) | ~ $i(v4) | ~ $i(v3) | ~
% 8.28/1.92 $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ greater(v9, v8) | ~ accountability(v1,
% 8.28/1.92 v7, v3) | ~ accountability(v0, v6, v2) | ~ reliability(v1, v5, v3) | ~
% 8.28/1.92 reliability(v0, v4, v2) | ~ reproducibility(v1, v9, v3) | ~
% 8.28/1.92 reproducibility(v0, v8, v2) | ~ organization(v1, v3) | ~ organization(v0,
% 8.28/1.92 v2) | greater(v7, v6)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3:
% 8.28/1.92 $i] : ! [v4: $i] : ! [v5: $i] : ! [v6: $i] : ! [v7: $i] : ! [v8: $i] :
% 8.28/1.92 ! [v9: $i] : ( ~ $i(v9) | ~ $i(v8) | ~ $i(v7) | ~ $i(v6) | ~ $i(v5) | ~
% 8.28/1.92 $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ greater(v9, v8)
% 8.28/1.92 | ~ accountability(v1, v7, v3) | ~ accountability(v0, v6, v2) | ~
% 8.28/1.92 reliability(v1, v5, v3) | ~ reliability(v0, v4, v2) | ~
% 8.28/1.92 reproducibility(v1, v9, v3) | ~ reproducibility(v0, v8, v2) | ~
% 8.28/1.92 organization(v1, v3) | ~ organization(v0, v2) | greater(v5, v4)) & ! [v0:
% 8.28/1.92 $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: $i] :
% 8.28/1.92 ! [v6: $i] : ! [v7: $i] : ! [v8: $i] : ! [v9: $i] : ( ~ $i(v9) | ~ $i(v8)
% 8.28/1.92 | ~ $i(v7) | ~ $i(v6) | ~ $i(v5) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~
% 8.28/1.92 $i(v1) | ~ $i(v0) | ~ greater(v7, v6) | ~ greater(v5, v4) | ~
% 8.28/1.92 accountability(v1, v7, v3) | ~ accountability(v0, v6, v2) | ~
% 8.28/1.92 reliability(v1, v5, v3) | ~ reliability(v0, v4, v2) | ~
% 8.28/1.92 reproducibility(v1, v9, v3) | ~ reproducibility(v0, v8, v2) | ~
% 8.28/1.92 organization(v1, v3) | ~ organization(v0, v2) | greater(v9, v8))
% 8.28/1.92
% 8.28/1.92 (a4_FOL)
% 8.28/1.92 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ( ~
% 8.28/1.92 $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~
% 8.28/1.92 reorganization_free(v0, v3, v4) | ~ greater(v4, v3) | ~
% 8.28/1.92 reproducibility(v0, v2, v4) | ~ reproducibility(v0, v1, v3) | ~
% 8.28/1.92 organization(v0, v4) | ~ organization(v0, v3) | greater(v2, v1))
% 8.28/1.92
% 8.28/1.92 (mp3)
% 8.28/1.93 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ organization(v0, v1) |
% 8.28/1.93 ? [v2: $i] : ($i(v2) & reproducibility(v0, v2, v1)))
% 8.28/1.93
% 8.28/1.93 (t6_FOL)
% 8.28/1.93 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5:
% 8.28/1.93 $i] : ? [v6: $i] : ($i(v6) & $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) &
% 8.28/1.93 $i(v0) & reorganization_free(v0, v5, v6) & greater(v6, v5) &
% 8.28/1.93 accountability(v0, v4, v6) & accountability(v0, v3, v5) & reliability(v0,
% 8.28/1.93 v2, v6) & reliability(v0, v1, v5) & organization(v0, v6) &
% 8.28/1.93 organization(v0, v5) & ( ~ greater(v4, v3) | ~ greater(v2, v1)))
% 8.28/1.93
% 8.28/1.93 Those formulas are unsatisfiable:
% 8.28/1.93 ---------------------------------
% 8.28/1.93
% 8.28/1.93 Begin of proof
% 8.28/1.93 |
% 8.28/1.93 | ALPHA: (a2_FOL) implies:
% 8.28/1.93 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] :
% 8.28/1.93 | ! [v5: $i] : ! [v6: $i] : ! [v7: $i] : ! [v8: $i] : ! [v9: $i] : (
% 8.28/1.93 | ~ $i(v9) | ~ $i(v8) | ~ $i(v7) | ~ $i(v6) | ~ $i(v5) | ~ $i(v4)
% 8.28/1.93 | | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ greater(v9, v8)
% 8.28/1.93 | | ~ accountability(v1, v7, v3) | ~ accountability(v0, v6, v2) | ~
% 8.28/1.93 | reliability(v1, v5, v3) | ~ reliability(v0, v4, v2) | ~
% 8.28/1.93 | reproducibility(v1, v9, v3) | ~ reproducibility(v0, v8, v2) | ~
% 8.28/1.93 | organization(v1, v3) | ~ organization(v0, v2) | greater(v5, v4))
% 8.28/1.94 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] :
% 8.28/1.94 | ! [v5: $i] : ! [v6: $i] : ! [v7: $i] : ! [v8: $i] : ! [v9: $i] : (
% 8.28/1.94 | ~ $i(v9) | ~ $i(v8) | ~ $i(v7) | ~ $i(v6) | ~ $i(v5) | ~ $i(v4)
% 8.28/1.94 | | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ greater(v9, v8)
% 8.28/1.94 | | ~ accountability(v1, v7, v3) | ~ accountability(v0, v6, v2) | ~
% 8.28/1.94 | reliability(v1, v5, v3) | ~ reliability(v0, v4, v2) | ~
% 8.28/1.94 | reproducibility(v1, v9, v3) | ~ reproducibility(v0, v8, v2) | ~
% 8.28/1.94 | organization(v1, v3) | ~ organization(v0, v2) | greater(v7, v6))
% 8.28/1.94 |
% 8.28/1.94 | DELTA: instantiating (t6_FOL) with fresh symbols all_5_0, all_5_1, all_5_2,
% 8.28/1.94 | all_5_3, all_5_4, all_5_5, all_5_6 gives:
% 8.28/1.94 | (3) $i(all_5_0) & $i(all_5_1) & $i(all_5_2) & $i(all_5_3) & $i(all_5_4) &
% 8.28/1.94 | $i(all_5_5) & $i(all_5_6) & reorganization_free(all_5_6, all_5_1,
% 8.28/1.94 | all_5_0) & greater(all_5_0, all_5_1) & accountability(all_5_6,
% 8.28/1.94 | all_5_2, all_5_0) & accountability(all_5_6, all_5_3, all_5_1) &
% 8.28/1.94 | reliability(all_5_6, all_5_4, all_5_0) & reliability(all_5_6, all_5_5,
% 8.28/1.94 | all_5_1) & organization(all_5_6, all_5_0) & organization(all_5_6,
% 8.28/1.94 | all_5_1) & ( ~ greater(all_5_2, all_5_3) | ~ greater(all_5_4,
% 8.28/1.94 | all_5_5))
% 8.28/1.94 |
% 8.28/1.94 | ALPHA: (3) implies:
% 8.28/1.94 | (4) organization(all_5_6, all_5_1)
% 8.28/1.94 | (5) organization(all_5_6, all_5_0)
% 8.28/1.94 | (6) reliability(all_5_6, all_5_5, all_5_1)
% 8.28/1.94 | (7) reliability(all_5_6, all_5_4, all_5_0)
% 8.28/1.94 | (8) accountability(all_5_6, all_5_3, all_5_1)
% 8.28/1.94 | (9) accountability(all_5_6, all_5_2, all_5_0)
% 8.28/1.94 | (10) greater(all_5_0, all_5_1)
% 8.28/1.94 | (11) reorganization_free(all_5_6, all_5_1, all_5_0)
% 8.28/1.94 | (12) $i(all_5_6)
% 8.28/1.94 | (13) $i(all_5_5)
% 8.28/1.94 | (14) $i(all_5_4)
% 8.28/1.94 | (15) $i(all_5_3)
% 8.28/1.94 | (16) $i(all_5_2)
% 8.28/1.94 | (17) $i(all_5_1)
% 8.28/1.94 | (18) $i(all_5_0)
% 8.28/1.94 | (19) ~ greater(all_5_2, all_5_3) | ~ greater(all_5_4, all_5_5)
% 8.28/1.94 |
% 8.28/1.94 | GROUND_INST: instantiating (mp3) with all_5_6, all_5_1, simplifying with (4),
% 8.28/1.94 | (12), (17) gives:
% 8.28/1.95 | (20) ? [v0: $i] : ($i(v0) & reproducibility(all_5_6, v0, all_5_1))
% 8.28/1.95 |
% 8.28/1.95 | GROUND_INST: instantiating (mp3) with all_5_6, all_5_0, simplifying with (5),
% 8.28/1.95 | (12), (18) gives:
% 8.28/1.95 | (21) ? [v0: $i] : ($i(v0) & reproducibility(all_5_6, v0, all_5_0))
% 8.28/1.95 |
% 8.28/1.95 | DELTA: instantiating (21) with fresh symbol all_12_0 gives:
% 8.28/1.95 | (22) $i(all_12_0) & reproducibility(all_5_6, all_12_0, all_5_0)
% 8.28/1.95 |
% 8.28/1.95 | ALPHA: (22) implies:
% 8.28/1.95 | (23) reproducibility(all_5_6, all_12_0, all_5_0)
% 8.28/1.95 | (24) $i(all_12_0)
% 8.28/1.95 |
% 8.28/1.95 | DELTA: instantiating (20) with fresh symbol all_14_0 gives:
% 8.28/1.95 | (25) $i(all_14_0) & reproducibility(all_5_6, all_14_0, all_5_1)
% 8.28/1.95 |
% 8.28/1.95 | ALPHA: (25) implies:
% 8.28/1.95 | (26) reproducibility(all_5_6, all_14_0, all_5_1)
% 8.28/1.95 | (27) $i(all_14_0)
% 8.28/1.95 |
% 8.28/1.95 | GROUND_INST: instantiating (a4_FOL) with all_5_6, all_14_0, all_12_0, all_5_1,
% 8.28/1.95 | all_5_0, simplifying with (4), (5), (10), (11), (12), (17), (18),
% 8.28/1.95 | (23), (24), (26), (27) gives:
% 8.28/1.95 | (28) greater(all_12_0, all_14_0)
% 8.28/1.95 |
% 8.28/1.95 | GROUND_INST: instantiating (2) with all_5_6, all_5_6, all_5_1, all_5_0,
% 8.28/1.95 | all_5_5, all_5_4, all_5_3, all_5_2, all_14_0, all_12_0,
% 8.28/1.95 | simplifying with (4), (5), (6), (7), (8), (9), (12), (13), (14),
% 8.28/1.95 | (15), (16), (17), (18), (23), (24), (26), (27), (28) gives:
% 8.28/1.95 | (29) greater(all_5_2, all_5_3)
% 8.28/1.95 |
% 8.28/1.95 | GROUND_INST: instantiating (1) with all_5_6, all_5_6, all_5_1, all_5_0,
% 8.28/1.95 | all_5_5, all_5_4, all_5_3, all_5_2, all_14_0, all_12_0,
% 8.28/1.95 | simplifying with (4), (5), (6), (7), (8), (9), (12), (13), (14),
% 8.28/1.95 | (15), (16), (17), (18), (23), (24), (26), (27), (28) gives:
% 8.28/1.95 | (30) greater(all_5_4, all_5_5)
% 8.28/1.95 |
% 8.28/1.95 | BETA: splitting (19) gives:
% 8.28/1.95 |
% 8.28/1.95 | Case 1:
% 8.28/1.95 | |
% 8.28/1.95 | | (31) ~ greater(all_5_2, all_5_3)
% 8.28/1.95 | |
% 8.28/1.95 | | PRED_UNIFY: (29), (31) imply:
% 8.28/1.95 | | (32) $false
% 8.28/1.96 | |
% 8.28/1.96 | | CLOSE: (32) is inconsistent.
% 8.28/1.96 | |
% 8.28/1.96 | Case 2:
% 8.28/1.96 | |
% 8.28/1.96 | | (33) ~ greater(all_5_4, all_5_5)
% 8.28/1.96 | |
% 8.28/1.96 | | PRED_UNIFY: (30), (33) imply:
% 8.28/1.96 | | (34) $false
% 8.28/1.96 | |
% 8.28/1.96 | | CLOSE: (34) is inconsistent.
% 8.28/1.96 | |
% 8.28/1.96 | End of split
% 8.28/1.96 |
% 8.28/1.96 End of proof
% 8.28/1.96 % SZS output end Proof for theBenchmark
% 8.28/1.96
% 8.28/1.96 1336ms
%------------------------------------------------------------------------------