%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : GEO499+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 : n029.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:30 EDT 2023 % Result : Theorem 28.75s 4.58s % Output : Proof 42.95s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.11 % Problem : GEO499+1 : TPTP v8.1.2. Released v7.0.0. % 0.11/0.11 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.11/0.32 % Computer : n029.cluster.edu % 0.11/0.32 % Model : x86_64 x86_64 % 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.32 % Memory : 8042.1875MB % 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.32 % CPULimit : 300 % 0.11/0.32 % WCLimit : 300 % 0.11/0.32 % DateTime : Tue Aug 29 22:48:42 EDT 2023 % 0.11/0.32 % CPUTime : % 0.58/0.60 ________ _____ % 0.58/0.60 ___ __ \_________(_)________________________________ % 0.58/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.58/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.58/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.58/0.60 % 0.58/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.58/0.60 (2023-06-19) % 0.58/0.60 % 0.58/0.60 (c) Philipp Rümmer, 2009-2023 % 0.58/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.58/0.60 Amanda Stjerna. % 0.58/0.60 Free software under BSD-3-Clause. % 0.58/0.60 % 0.58/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.58/0.60 % 0.58/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.58/0.62 Running up to 7 provers in parallel. % 0.58/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.58/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.58/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.58/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.58/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.58/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.58/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 8.24/1.84 Prover 4: Preprocessing ... % 8.24/1.86 Prover 1: Preprocessing ... % 8.24/1.86 Prover 6: Preprocessing ... % 8.24/1.86 Prover 3: Preprocessing ... % 8.24/1.86 Prover 0: Preprocessing ... % 8.24/1.86 Prover 5: Preprocessing ... % 8.24/1.87 Prover 2: Preprocessing ... % 18.46/3.19 Prover 5: Proving ... % 18.46/3.23 Prover 2: Proving ... % 19.97/3.41 Prover 1: Warning: ignoring some quantifiers % 19.97/3.44 Prover 3: Warning: ignoring some quantifiers % 19.97/3.45 Prover 6: Proving ... % 20.66/3.50 Prover 1: Constructing countermodel ... % 20.66/3.53 Prover 3: Constructing countermodel ... % 24.54/4.07 Prover 4: Constructing countermodel ... % 26.14/4.23 Prover 0: Proving ... % 28.50/4.53 Prover 3: gave up % 28.75/4.55 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 28.75/4.57 Prover 2: proved (3948ms) % 28.75/4.58 % 28.75/4.58 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 28.75/4.58 % 28.75/4.58 Prover 5: stopped % 28.75/4.58 Prover 0: stopped % 28.75/4.59 Prover 6: stopped % 28.75/4.60 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 28.75/4.60 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 28.75/4.60 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 28.75/4.60 Prover 1: gave up % 28.75/4.60 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 28.75/4.60 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 31.43/4.95 Prover 10: Preprocessing ... % 31.81/5.00 Prover 11: Preprocessing ... % 31.81/5.03 Prover 8: Preprocessing ... % 32.53/5.05 Prover 13: Preprocessing ... % 32.81/5.11 Prover 7: Preprocessing ... % 33.24/5.16 Prover 16: Preprocessing ... % 34.30/5.33 Prover 7: Warning: ignoring some quantifiers % 34.99/5.40 Prover 7: Constructing countermodel ... % 35.50/5.45 Prover 10: Warning: ignoring some quantifiers % 35.50/5.51 Prover 10: Constructing countermodel ... % 35.50/5.51 Prover 13: Warning: ignoring some quantifiers % 36.15/5.54 Prover 13: Constructing countermodel ... % 36.15/5.57 Prover 8: Warning: ignoring some quantifiers % 36.63/5.60 Prover 16: Warning: ignoring some quantifiers % 36.63/5.60 Prover 8: Constructing countermodel ... % 36.63/5.62 Prover 16: Constructing countermodel ... % 41.35/6.24 Prover 11: Constructing countermodel ... % 42.41/6.33 Prover 7: Found proof (size 8) % 42.41/6.34 Prover 7: proved (1787ms) % 42.41/6.34 Prover 10: stopped % 42.41/6.34 Prover 16: stopped % 42.41/6.34 Prover 13: stopped % 42.41/6.34 Prover 4: stopped % 42.41/6.34 Prover 8: stopped % 42.41/6.36 Prover 11: stopped % 42.41/6.36 % 42.41/6.36 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 42.41/6.36 % 42.41/6.36 % SZS output start Proof for theBenchmark % 42.41/6.38 Assumptions after simplification: % 42.41/6.38 --------------------------------- % 42.41/6.38 % 42.41/6.38 (aSatz7_15a) % 42.95/6.42 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 42.95/6.42 $i] : ! [v6: $i] : ( ~ (s(v3, v2) = v6) | ~ (s(v3, v1) = v5) | ~ (s(v3, % 42.95/6.42 v0) = v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ s_t(v0, % 42.95/6.42 v1, v2) | s_t(v4, v5, v6)) % 42.95/6.42 % 42.95/6.42 (aSatz7_15b) % 42.95/6.42 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5: % 42.95/6.42 $i] : ? [v6: $i] : (s(v3, v2) = v6 & s(v3, v1) = v5 & s(v3, v0) = v4 & % 42.95/6.42 $i(v6) & $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0) & s_t(v4, v5, % 42.95/6.42 v6) & ~ s_t(v0, v1, v2)) % 42.95/6.42 % 42.95/6.42 (aSatz7_7) % 42.95/6.42 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (s(v0, v1) = v2) | ~ $i(v1) | % 42.95/6.42 ~ $i(v0) | s(v0, v2) = v1) % 42.95/6.42 % 42.95/6.42 Further assumptions not needed in the proof: % 42.95/6.42 -------------------------------------------- % 42.95/6.42 aA1, aA2, aA3, aA4, aA5, aA6, aA7, aA8, aNarbouxLemma1, aSatz2_1, aSatz2_11, % 42.95/6.42 aSatz2_12, aSatz2_13, aSatz2_14, aSatz2_15, aSatz2_2, aSatz2_3, aSatz2_4, % 42.95/6.42 aSatz2_5, aSatz2_8, aSatz3_1, aSatz3_13a, aSatz3_13b, aSatz3_13c, aSatz3_14a, % 42.95/6.43 aSatz3_14b, aSatz3_17, aSatz3_2, aSatz3_3, aSatz3_4, aSatz3_5a, aSatz3_5b, % 42.95/6.43 aSatz3_6a, aSatz3_6b, aSatz3_7a, aSatz3_7b, aSatz4_11a, aSatz4_11b, aSatz4_11c, % 42.95/6.43 aSatz4_11d, aSatz4_11e, aSatz4_12, aSatz4_12b, aSatz4_13, aSatz4_14, aSatz4_16, % 42.95/6.43 aSatz4_17, aSatz4_18, aSatz4_19, aSatz4_2, aSatz4_3, aSatz4_5, aSatz4_6, % 42.95/6.43 aSatz5_1, aSatz5_10, aSatz5_11, aSatz5_12a1, aSatz5_12a2, aSatz5_12b, aSatz5_2, % 42.95/6.43 aSatz5_3, aSatz5_5a, aSatz5_5b, aSatz5_6, aSatz5_7, aSatz5_8, aSatz5_9, % 42.95/6.43 aSatz6_11a, aSatz6_11b, aSatz6_13a, aSatz6_13b, aSatz6_15a, aSatz6_15b, % 42.95/6.43 aSatz6_15c, aSatz6_15d, aSatz6_16a, aSatz6_16b, aSatz6_17a, aSatz6_17b, % 42.95/6.43 aSatz6_18, aSatz6_21, aSatz6_25, aSatz6_28, aSatz6_2a, aSatz6_2b, aSatz6_3a, % 42.95/6.43 aSatz6_3b, aSatz6_4a, aSatz6_4b, aSatz6_5, aSatz6_6, aSatz6_7, aSatz7_10a, % 42.95/6.43 aSatz7_10b, aSatz7_13, aSatz7_2, aSatz7_3a, aSatz7_3b, aSatz7_4a, aSatz7_4b, % 42.95/6.43 aSatz7_6, aSatz7_8, aSatz7_9, d_Defn2_10, d_Defn4_1, d_Defn4_10, d_Defn4_15, % 42.95/6.43 d_Defn4_4, d_Defn5_4, d_Defn6_1, d_Defn7_1, d_Defn7_23, d_insert % 42.95/6.43 % 42.95/6.43 Those formulas are unsatisfiable: % 42.95/6.43 --------------------------------- % 42.95/6.43 % 42.95/6.43 Begin of proof % 42.95/6.43 | % 42.95/6.43 | DELTA: instantiating (aSatz7_15b) with fresh symbols all_115_0, all_115_1, % 42.95/6.43 | all_115_2, all_115_3, all_115_4, all_115_5, all_115_6 gives: % 42.95/6.43 | (1) s(all_115_3, all_115_4) = all_115_0 & s(all_115_3, all_115_5) = % 42.95/6.43 | all_115_1 & s(all_115_3, all_115_6) = all_115_2 & $i(all_115_0) & % 42.95/6.43 | $i(all_115_1) & $i(all_115_2) & $i(all_115_3) & $i(all_115_4) & % 42.95/6.43 | $i(all_115_5) & $i(all_115_6) & s_t(all_115_2, all_115_1, all_115_0) & % 42.95/6.43 | ~ s_t(all_115_6, all_115_5, all_115_4) % 42.95/6.43 | % 42.95/6.43 | ALPHA: (1) implies: % 42.95/6.44 | (2) ~ s_t(all_115_6, all_115_5, all_115_4) % 42.95/6.44 | (3) s_t(all_115_2, all_115_1, all_115_0) % 42.95/6.44 | (4) $i(all_115_6) % 42.95/6.44 | (5) $i(all_115_5) % 42.95/6.44 | (6) $i(all_115_4) % 42.95/6.44 | (7) $i(all_115_3) % 42.95/6.44 | (8) $i(all_115_2) % 42.95/6.44 | (9) $i(all_115_1) % 42.95/6.44 | (10) $i(all_115_0) % 42.95/6.44 | (11) s(all_115_3, all_115_6) = all_115_2 % 42.95/6.44 | (12) s(all_115_3, all_115_5) = all_115_1 % 42.95/6.44 | (13) s(all_115_3, all_115_4) = all_115_0 % 42.95/6.44 | % 42.95/6.44 | GROUND_INST: instantiating (aSatz7_7) with all_115_3, all_115_6, all_115_2, % 42.95/6.44 | simplifying with (4), (7), (11) gives: % 42.95/6.44 | (14) s(all_115_3, all_115_2) = all_115_6 % 42.95/6.44 | % 42.95/6.44 | GROUND_INST: instantiating (aSatz7_7) with all_115_3, all_115_5, all_115_1, % 42.95/6.44 | simplifying with (5), (7), (12) gives: % 42.95/6.44 | (15) s(all_115_3, all_115_1) = all_115_5 % 42.95/6.44 | % 42.95/6.44 | GROUND_INST: instantiating (aSatz7_7) with all_115_3, all_115_4, all_115_0, % 42.95/6.44 | simplifying with (6), (7), (13) gives: % 42.95/6.44 | (16) s(all_115_3, all_115_0) = all_115_4 % 42.95/6.44 | % 42.95/6.44 | GROUND_INST: instantiating (aSatz7_15a) with all_115_2, all_115_1, all_115_0, % 42.95/6.44 | all_115_3, all_115_6, all_115_5, all_115_4, simplifying with (2), % 42.95/6.44 | (3), (7), (8), (9), (10), (14), (15), (16) gives: % 42.95/6.44 | (17) $false % 42.95/6.45 | % 42.95/6.45 | CLOSE: (17) is inconsistent. % 42.95/6.45 | % 42.95/6.45 End of proof % 42.95/6.45 % SZS output end Proof for theBenchmark % 42.95/6.45 % 42.95/6.45 5842ms %------------------------------------------------------------------------------