TSTP Solution File: GEO502+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : GEO502+1 : TPTP v8.1.2. Released v7.0.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n026.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 : Wed Aug 30 23:23:31 EDT 2023
% Result : Theorem 24.07s 4.25s
% Output : Proof 33.51s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO502+1 : TPTP v8.1.2. Released v7.0.0.
% 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.16/0.34 % Computer : n026.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Tue Aug 29 21:36:06 EDT 2023
% 0.16/0.34 % CPUTime :
% 0.18/0.60 ________ _____
% 0.18/0.60 ___ __ \_________(_)________________________________
% 0.18/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.18/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.18/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.18/0.60
% 0.18/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.18/0.60 (2023-06-19)
% 0.18/0.60
% 0.18/0.60 (c) Philipp Rümmer, 2009-2023
% 0.18/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.18/0.60 Amanda Stjerna.
% 0.18/0.60 Free software under BSD-3-Clause.
% 0.18/0.60
% 0.18/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.18/0.60
% 0.18/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.18/0.61 Running up to 7 provers in parallel.
% 0.18/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.18/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.18/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.18/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.18/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.18/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.18/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 5.61/1.53 Prover 4: Preprocessing ...
% 5.61/1.54 Prover 1: Preprocessing ...
% 5.61/1.59 Prover 3: Preprocessing ...
% 5.61/1.59 Prover 6: Preprocessing ...
% 5.61/1.59 Prover 0: Preprocessing ...
% 5.61/1.60 Prover 2: Preprocessing ...
% 5.61/1.60 Prover 5: Preprocessing ...
% 13.89/2.65 Prover 5: Proving ...
% 14.41/2.71 Prover 1: Warning: ignoring some quantifiers
% 14.41/2.72 Prover 2: Proving ...
% 14.41/2.83 Prover 1: Constructing countermodel ...
% 15.53/2.90 Prover 3: Warning: ignoring some quantifiers
% 15.53/2.93 Prover 3: Constructing countermodel ...
% 15.53/2.94 Prover 6: Proving ...
% 18.42/3.26 Prover 4: Constructing countermodel ...
% 18.92/3.36 Prover 0: Proving ...
% 24.07/4.24 Prover 2: proved (3619ms)
% 24.07/4.25
% 24.07/4.25 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 24.07/4.25
% 24.07/4.25 Prover 6: stopped
% 24.07/4.25 Prover 0: stopped
% 25.75/4.26 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 25.75/4.26 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 25.75/4.26 Prover 5: proved (3633ms)
% 25.75/4.26
% 25.75/4.26 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 25.75/4.26
% 25.75/4.26 Prover 3: stopped
% 25.75/4.27 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 25.75/4.27 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 25.75/4.27 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 28.40/4.60 Prover 11: Preprocessing ...
% 28.40/4.61 Prover 10: Preprocessing ...
% 28.62/4.65 Prover 8: Preprocessing ...
% 28.62/4.65 Prover 7: Preprocessing ...
% 28.62/4.65 Prover 13: Preprocessing ...
% 29.36/4.75 Prover 10: Warning: ignoring some quantifiers
% 29.88/4.81 Prover 7: Warning: ignoring some quantifiers
% 29.88/4.81 Prover 10: Constructing countermodel ...
% 29.88/4.84 Prover 7: Constructing countermodel ...
% 29.88/4.86 Prover 13: Warning: ignoring some quantifiers
% 30.46/4.94 Prover 13: Constructing countermodel ...
% 31.32/5.01 Prover 8: Warning: ignoring some quantifiers
% 31.32/5.02 Prover 8: Constructing countermodel ...
% 32.64/5.20 Prover 10: Found proof (size 6)
% 32.64/5.20 Prover 10: proved (936ms)
% 32.64/5.20 Prover 13: stopped
% 32.64/5.20 Prover 1: stopped
% 32.64/5.20 Prover 7: stopped
% 32.64/5.20 Prover 4: stopped
% 32.64/5.20 Prover 8: stopped
% 33.22/5.28 Prover 11: Constructing countermodel ...
% 33.22/5.31 Prover 11: stopped
% 33.22/5.31
% 33.22/5.31 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 33.22/5.31
% 33.22/5.31 % SZS output start Proof for theBenchmark
% 33.22/5.32 Assumptions after simplification:
% 33.22/5.32 ---------------------------------
% 33.22/5.32
% 33.22/5.32 (aSatz7_22)
% 33.22/5.32 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5:
% 33.22/5.32 $i] : ? [v6: $i] : ($i(v6) & $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) &
% 33.22/5.32 $i(v0) & s_m(v2, v6, v4) & s_m(v0, v5, v3) & s_t(v3, v1, v4) & s_t(v0, v1,
% 33.22/5.32 v2) & s_e(v1, v2, v1, v4) & s_e(v1, v0, v1, v3) & ~ s_t(v5, v1, v6))
% 33.22/5.32
% 33.22/5.32 (aSatz7_22b)
% 33.22/5.33 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5:
% 33.22/5.33 $i] : ! [v6: $i] : ( ~ $i(v6) | ~ $i(v5) | ~ $i(v4) | ~ $i(v3) | ~
% 33.22/5.33 $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ s_kf(v0, v1, v2, v3, v4, v5, v6) |
% 33.22/5.33 s_t(v1, v3, v5))
% 33.22/5.33
% 33.22/5.33 (d_Defn7_23)
% 33.51/5.33 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5:
% 33.51/5.33 $i] : ! [v6: $i] : ( ~ $i(v6) | ~ $i(v5) | ~ $i(v4) | ~ $i(v3) | ~
% 33.51/5.33 $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ s_kf(v0, v1, v2, v3, v4, v5, v6) |
% 33.51/5.33 s_m(v6, v5, v4)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] :
% 33.51/5.33 ! [v4: $i] : ! [v5: $i] : ! [v6: $i] : ( ~ $i(v6) | ~ $i(v5) | ~ $i(v4) |
% 33.51/5.33 ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ s_kf(v0, v1, v2, v3, v4,
% 33.51/5.33 v5, v6) | s_m(v0, v1, v2)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : !
% 33.51/5.33 [v3: $i] : ! [v4: $i] : ! [v5: $i] : ! [v6: $i] : ( ~ $i(v6) | ~ $i(v5) |
% 33.51/5.33 ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ s_kf(v0, v1,
% 33.51/5.33 v2, v3, v4, v5, v6) | s_t(v2, v3, v4)) & ! [v0: $i] : ! [v1: $i] : !
% 33.51/5.33 [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: $i] : ! [v6: $i] : ( ~ $i(v6)
% 33.51/5.33 | ~ $i(v5) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~
% 33.51/5.33 s_kf(v0, v1, v2, v3, v4, v5, v6) | s_t(v0, v3, v6)) & ! [v0: $i] : ! [v1:
% 33.51/5.33 $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: $i] : ! [v6: $i] :
% 33.51/5.33 ( ~ $i(v6) | ~ $i(v5) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~
% 33.51/5.33 $i(v0) | ~ s_kf(v0, v1, v2, v3, v4, v5, v6) | s_e(v3, v6, v3, v4)) & !
% 33.51/5.33 [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: $i]
% 33.51/5.33 : ! [v6: $i] : ( ~ $i(v6) | ~ $i(v5) | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) |
% 33.51/5.33 ~ $i(v1) | ~ $i(v0) | ~ s_kf(v0, v1, v2, v3, v4, v5, v6) | s_e(v3, v0, v3,
% 33.51/5.33 v2)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i]
% 33.51/5.33 : ! [v5: $i] : ! [v6: $i] : ( ~ $i(v6) | ~ $i(v5) | ~ $i(v4) | ~ $i(v3) |
% 33.51/5.33 ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ s_m(v6, v5, v4) | ~ s_m(v0, v1, v2)
% 33.51/5.33 | ~ s_t(v2, v3, v4) | ~ s_t(v0, v3, v6) | ~ s_e(v3, v6, v3, v4) | ~
% 33.51/5.33 s_e(v3, v0, v3, v2) | s_kf(v0, v1, v2, v3, v4, v5, v6))
% 33.51/5.33
% 33.51/5.33 Further assumptions not needed in the proof:
% 33.51/5.33 --------------------------------------------
% 33.51/5.33 aA1, aA2, aA3, aA4, aA5, aA6, aA7, aA8, aNarbouxLemma1, aSatz2_1, aSatz2_11,
% 33.51/5.33 aSatz2_12, aSatz2_13, aSatz2_14, aSatz2_15, aSatz2_2, aSatz2_3, aSatz2_4,
% 33.51/5.33 aSatz2_5, aSatz2_8, aSatz3_1, aSatz3_13a, aSatz3_13b, aSatz3_13c, aSatz3_14a,
% 33.51/5.33 aSatz3_14b, aSatz3_17, aSatz3_2, aSatz3_3, aSatz3_4, aSatz3_5a, aSatz3_5b,
% 33.51/5.33 aSatz3_6a, aSatz3_6b, aSatz3_7a, aSatz3_7b, aSatz4_11a, aSatz4_11b, aSatz4_11c,
% 33.51/5.33 aSatz4_11d, aSatz4_11e, aSatz4_12, aSatz4_12b, aSatz4_13, aSatz4_14, aSatz4_16,
% 33.51/5.33 aSatz4_17, aSatz4_18, aSatz4_19, aSatz4_2, aSatz4_3, aSatz4_5, aSatz4_6,
% 33.51/5.33 aSatz5_1, aSatz5_10, aSatz5_11, aSatz5_12a1, aSatz5_12a2, aSatz5_12b, aSatz5_2,
% 33.51/5.33 aSatz5_3, aSatz5_5a, aSatz5_5b, aSatz5_6, aSatz5_7, aSatz5_8, aSatz5_9,
% 33.51/5.33 aSatz6_11a, aSatz6_11b, aSatz6_13a, aSatz6_13b, aSatz6_15a, aSatz6_15b,
% 33.51/5.33 aSatz6_15c, aSatz6_15d, aSatz6_16a, aSatz6_16b, aSatz6_17a, aSatz6_17b,
% 33.51/5.33 aSatz6_18, aSatz6_21, aSatz6_25, aSatz6_28, aSatz6_2a, aSatz6_2b, aSatz6_3a,
% 33.51/5.33 aSatz6_3b, aSatz6_4a, aSatz6_4b, aSatz6_5, aSatz6_6, aSatz6_7, aSatz7_10a,
% 33.51/5.33 aSatz7_10b, aSatz7_13, aSatz7_15a, aSatz7_15b, aSatz7_16a, aSatz7_16b,
% 33.51/5.33 aSatz7_17, aSatz7_18, aSatz7_19, aSatz7_2, aSatz7_20, aSatz7_21, aSatz7_22a,
% 33.51/5.33 aSatz7_3a, aSatz7_3b, aSatz7_4a, aSatz7_4b, aSatz7_6, aSatz7_7, aSatz7_8,
% 33.51/5.33 aSatz7_9, d_Defn2_10, d_Defn4_1, d_Defn4_10, d_Defn4_15, d_Defn4_4, d_Defn5_4,
% 33.51/5.33 d_Defn6_1, d_Defn7_1, d_insert
% 33.51/5.33
% 33.51/5.33 Those formulas are unsatisfiable:
% 33.51/5.33 ---------------------------------
% 33.51/5.33
% 33.51/5.33 Begin of proof
% 33.51/5.34 |
% 33.51/5.34 | ALPHA: (d_Defn7_23) implies:
% 33.51/5.34 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] :
% 33.51/5.34 | ! [v5: $i] : ! [v6: $i] : ( ~ $i(v6) | ~ $i(v5) | ~ $i(v4) | ~
% 33.51/5.34 | $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ s_m(v6, v5, v4) | ~
% 33.51/5.34 | s_m(v0, v1, v2) | ~ s_t(v2, v3, v4) | ~ s_t(v0, v3, v6) | ~
% 33.51/5.34 | s_e(v3, v6, v3, v4) | ~ s_e(v3, v0, v3, v2) | s_kf(v0, v1, v2, v3,
% 33.51/5.34 | v4, v5, v6))
% 33.51/5.34 |
% 33.51/5.34 | DELTA: instantiating (aSatz7_22) with fresh symbols all_125_0, all_125_1,
% 33.51/5.34 | all_125_2, all_125_3, all_125_4, all_125_5, all_125_6 gives:
% 33.51/5.34 | (2) $i(all_125_0) & $i(all_125_1) & $i(all_125_2) & $i(all_125_3) &
% 33.51/5.34 | $i(all_125_4) & $i(all_125_5) & $i(all_125_6) & s_m(all_125_4,
% 33.51/5.34 | all_125_0, all_125_2) & s_m(all_125_6, all_125_1, all_125_3) &
% 33.51/5.34 | s_t(all_125_3, all_125_5, all_125_2) & s_t(all_125_6, all_125_5,
% 33.51/5.34 | all_125_4) & s_e(all_125_5, all_125_4, all_125_5, all_125_2) &
% 33.51/5.34 | s_e(all_125_5, all_125_6, all_125_5, all_125_3) & ~ s_t(all_125_1,
% 33.51/5.34 | all_125_5, all_125_0)
% 33.51/5.34 |
% 33.51/5.34 | ALPHA: (2) implies:
% 33.51/5.34 | (3) ~ s_t(all_125_1, all_125_5, all_125_0)
% 33.51/5.34 | (4) s_e(all_125_5, all_125_6, all_125_5, all_125_3)
% 33.51/5.34 | (5) s_e(all_125_5, all_125_4, all_125_5, all_125_2)
% 33.51/5.34 | (6) s_t(all_125_6, all_125_5, all_125_4)
% 33.51/5.34 | (7) s_t(all_125_3, all_125_5, all_125_2)
% 33.51/5.34 | (8) s_m(all_125_6, all_125_1, all_125_3)
% 33.51/5.34 | (9) s_m(all_125_4, all_125_0, all_125_2)
% 33.51/5.34 | (10) $i(all_125_6)
% 33.51/5.34 | (11) $i(all_125_5)
% 33.51/5.34 | (12) $i(all_125_4)
% 33.51/5.34 | (13) $i(all_125_3)
% 33.51/5.34 | (14) $i(all_125_2)
% 33.51/5.34 | (15) $i(all_125_1)
% 33.51/5.34 | (16) $i(all_125_0)
% 33.51/5.34 |
% 33.51/5.34 | GROUND_INST: instantiating (1) with all_125_6, all_125_1, all_125_3,
% 33.51/5.34 | all_125_5, all_125_2, all_125_0, all_125_4, simplifying with (4),
% 33.51/5.34 | (5), (6), (7), (8), (9), (10), (11), (12), (13), (14), (15), (16)
% 33.51/5.34 | gives:
% 33.51/5.34 | (17) s_kf(all_125_6, all_125_1, all_125_3, all_125_5, all_125_2, all_125_0,
% 33.51/5.34 | all_125_4)
% 33.51/5.34 |
% 33.51/5.35 | GROUND_INST: instantiating (aSatz7_22b) with all_125_6, all_125_1, all_125_3,
% 33.51/5.35 | all_125_5, all_125_2, all_125_0, all_125_4, simplifying with (3),
% 33.51/5.35 | (10), (11), (12), (13), (14), (15), (16), (17) gives:
% 33.51/5.35 | (18) $false
% 33.51/5.35 |
% 33.51/5.35 | CLOSE: (18) is inconsistent.
% 33.51/5.35 |
% 33.51/5.35 End of proof
% 33.51/5.35 % SZS output end Proof for theBenchmark
% 33.51/5.35
% 33.51/5.35 4744ms
%------------------------------------------------------------------------------