%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWW632_2 : TPTP v8.1.2. Released v6.1.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n024.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 : Fri Sep 1 00:50:57 EDT 2023 % Result : Theorem 7.75s 1.89s % Output : Proof 9.88s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SWW632_2 : TPTP v8.1.2. Released v6.1.0. % 0.07/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.33 % Computer : n024.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 300 % 0.12/0.33 % DateTime : Sun Aug 27 20:19:53 EDT 2023 % 0.12/0.33 % 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/sandbox/benchmark/theBenchmark.p ... % 0.18/0.61 Running up to 7 provers in parallel. % 0.18/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.18/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.18/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.18/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.18/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.18/0.62 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 % 3.17/1.23 Prover 1: Preprocessing ... % 3.17/1.23 Prover 5: Preprocessing ... % 3.17/1.23 Prover 4: Preprocessing ... % 3.17/1.23 Prover 0: Preprocessing ... % 3.17/1.23 Prover 2: Preprocessing ... % 3.17/1.23 Prover 3: Preprocessing ... % 3.17/1.23 Prover 6: Preprocessing ... % 6.67/1.68 Prover 1: Warning: ignoring some quantifiers % 6.67/1.70 Prover 3: Warning: ignoring some quantifiers % 6.67/1.70 Prover 4: Warning: ignoring some quantifiers % 6.88/1.71 Prover 6: Proving ... % 6.88/1.71 Prover 0: Proving ... % 6.88/1.73 Prover 3: Constructing countermodel ... % 7.06/1.73 Prover 1: Constructing countermodel ... % 7.06/1.73 Prover 4: Constructing countermodel ... % 7.06/1.76 Prover 5: Proving ... % 7.06/1.77 Prover 2: Proving ... % 7.75/1.88 Prover 3: proved (1262ms) % 7.75/1.89 % 7.75/1.89 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.75/1.89 % 7.75/1.89 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 7.75/1.89 Prover 6: proved (1265ms) % 7.75/1.89 Prover 5: proved (1268ms) % 7.75/1.89 % 7.75/1.89 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.75/1.89 % 7.75/1.89 Prover 0: proved (1274ms) % 7.75/1.89 % 7.75/1.89 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.75/1.89 % 8.23/1.89 % 8.23/1.89 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 8.23/1.89 % 8.23/1.89 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 8.23/1.89 Prover 2: proved (1276ms) % 8.23/1.89 % 8.23/1.89 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 8.23/1.89 % 8.23/1.89 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 8.23/1.89 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 8.23/1.90 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 8.23/1.91 Prover 4: Found proof (size 8) % 8.23/1.91 Prover 4: proved (1291ms) % 8.23/1.91 Prover 1: Found proof (size 10) % 8.23/1.91 Prover 1: proved (1296ms) % 8.23/2.00 Prover 13: Preprocessing ... % 8.23/2.02 Prover 10: Preprocessing ... % 8.23/2.02 Prover 7: Preprocessing ... % 9.15/2.04 Prover 8: Preprocessing ... % 9.15/2.04 Prover 11: Preprocessing ... % 9.15/2.05 Prover 10: stopped % 9.15/2.05 Prover 7: stopped % 9.38/2.06 Prover 13: stopped % 9.38/2.07 Prover 11: stopped % 9.38/2.11 Prover 8: Warning: ignoring some quantifiers % 9.71/2.13 Prover 8: Constructing countermodel ... % 9.71/2.13 Prover 8: stopped % 9.71/2.13 % 9.71/2.13 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 9.71/2.13 % 9.71/2.14 % SZS output start Proof for theBenchmark % 9.71/2.14 Assumptions after simplification: % 9.71/2.14 --------------------------------- % 9.71/2.14 % 9.71/2.14 (power_0) % 9.71/2.15 ! [v0: int] : ! [v1: int] : (v1 = 1 | ~ (power(v0, 0) = v1)) % 9.71/2.15 % 9.71/2.15 (wP_parameter_fast_exp_imperative) % 9.71/2.15 ? [v0: int] : ? [v1: int] : ? [v2: int] : ? [v3: int] : ? [v4: int] : ? % 9.71/2.15 [v5: int] : ( ~ (v4 = v2) & $lesseq(0, v1) & power(v3, 0) = v5 & power(v0, v1) % 9.71/2.15 = v2 & $product(v4, v5) = v2) % 9.71/2.15 % 9.71/2.15 Further assumptions not needed in the proof: % 9.71/2.15 -------------------------------------------- % 9.71/2.15 abs_def, abs_le, abs_pos, bool_inversion, compatOrderMult, contents_def, % 9.71/2.15 contents_sort, div_1, div_bound, div_inf, div_mod, div_mult, div_sign_neg, % 9.71/2.15 div_sign_pos, match_bool_False, match_bool_True, match_bool_sort1, mk_ref_sort, % 9.71/2.15 mod_1, mod_bound, mod_inf, mod_mult, mod_sign_neg, mod_sign_pos, power_1, % 9.71/2.15 power_mult, power_mult2, power_s, power_s_alt, power_sum, ref_inversion, % 9.71/2.15 rounds_toward_zero, true_False, tuple0_inversion, witness_sort % 9.71/2.15 % 9.71/2.15 Those formulas are unsatisfiable: % 9.71/2.15 --------------------------------- % 9.71/2.15 % 9.71/2.15 Begin of proof % 9.71/2.16 | % 9.71/2.16 | DELTA: instantiating (wP_parameter_fast_exp_imperative) with fresh symbols % 9.71/2.16 | all_44_0, all_44_1, all_44_2, all_44_3, all_44_4, all_44_5 gives: % 9.71/2.16 | (1) ~ (all_44_1 = all_44_3) & $lesseq(0, all_44_4) & power(all_44_2, 0) = % 9.71/2.16 | all_44_0 & power(all_44_5, all_44_4) = all_44_3 & $product(all_44_1, % 9.71/2.16 | all_44_0) = all_44_3 % 9.71/2.16 | % 9.71/2.16 | ALPHA: (1) implies: % 9.71/2.16 | (2) ~ (all_44_1 = all_44_3) % 9.71/2.16 | (3) $product(all_44_1, all_44_0) = all_44_3 % 9.71/2.16 | (4) power(all_44_2, 0) = all_44_0 % 9.71/2.16 | % 9.88/2.16 | GROUND_INST: instantiating (power_0) with all_44_2, all_44_0, simplifying with % 9.88/2.16 | (4) gives: % 9.88/2.16 | (5) all_44_0 = 1 % 9.88/2.16 | % 9.88/2.16 | REDUCE: (3), (5) imply: % 9.88/2.16 | (6) $product(all_44_1, 1) = all_44_3 % 9.88/2.16 | % 9.88/2.16 | THEORY_AXIOM GroebnerMultiplication: % 9.88/2.16 | (7) ! [v0: int] : ! [v1: int] : (v1 = v0 | ~ ($product(v1, 1) = v0)) % 9.88/2.16 | % 9.88/2.16 | GROUND_INST: instantiating (7) with all_44_3, all_44_1, simplifying with (6) % 9.88/2.16 | gives: % 9.88/2.16 | (8) all_44_1 = all_44_3 % 9.88/2.16 | % 9.88/2.16 | REDUCE: (2), (8) imply: % 9.88/2.16 | (9) $false % 9.88/2.16 | % 9.88/2.16 | CLOSE: (9) is inconsistent. % 9.88/2.16 | % 9.88/2.16 End of proof % 9.88/2.16 % SZS output end Proof for theBenchmark % 9.88/2.17 % 9.88/2.17 1567ms %------------------------------------------------------------------------------