%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWW592_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 : 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 : Fri Sep 1 00:50:50 EDT 2023 % Result : Theorem 8.65s 2.01s % Output : Proof 10.95s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SWW592_2 : TPTP v8.1.2. Released v6.1.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.34 % Computer : n029.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 300 % 0.12/0.34 % DateTime : Sun Aug 27 18:52:40 EDT 2023 % 0.12/0.34 % CPUTime : % 0.20/0.60 ________ _____ % 0.20/0.60 ___ __ \_________(_)________________________________ % 0.20/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.60 % 0.20/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.60 (2023-06-19) % 0.20/0.60 % 0.20/0.60 (c) Philipp Rümmer, 2009-2023 % 0.20/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.60 Amanda Stjerna. % 0.20/0.60 Free software under BSD-3-Clause. % 0.20/0.60 % 0.20/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.60 % 0.20/0.61 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.20/0.62 Running up to 7 provers in parallel. % 0.20/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.81/1.13 Prover 4: Preprocessing ... % 2.81/1.13 Prover 0: Preprocessing ... % 2.81/1.14 Prover 2: Preprocessing ... % 3.25/1.15 Prover 5: Preprocessing ... % 3.31/1.16 Prover 1: Preprocessing ... % 3.31/1.16 Prover 6: Preprocessing ... % 3.31/1.16 Prover 3: Preprocessing ... % 7.17/1.75 Prover 1: Warning: ignoring some quantifiers % 7.17/1.75 Prover 4: Warning: ignoring some quantifiers % 7.67/1.79 Prover 1: Constructing countermodel ... % 7.67/1.79 Prover 4: Constructing countermodel ... % 7.67/1.81 Prover 3: Warning: ignoring some quantifiers % 7.67/1.82 Prover 6: Proving ... % 7.67/1.83 Prover 3: Constructing countermodel ... % 7.67/1.86 Prover 0: Proving ... % 8.65/1.96 Prover 5: Proving ... % 8.65/2.00 Prover 3: proved (1367ms) % 8.65/2.00 % 8.65/2.01 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 8.65/2.01 % 8.65/2.01 Prover 6: stopped % 8.65/2.03 Prover 5: stopped % 8.65/2.03 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 8.65/2.03 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 8.65/2.03 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 8.65/2.03 Prover 2: Proving ... % 8.65/2.04 Prover 2: stopped % 8.65/2.04 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 8.65/2.04 Prover 0: proved (1418ms) % 8.65/2.04 % 8.65/2.04 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 8.65/2.04 % 8.65/2.05 Prover 1: Found proof (size 12) % 8.65/2.05 Prover 1: proved (1420ms) % 8.65/2.05 Prover 4: Found proof (size 21) % 8.65/2.05 Prover 4: proved (1417ms) % 8.65/2.05 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 8.65/2.13 Prover 11: Preprocessing ... % 9.64/2.14 Prover 7: Preprocessing ... % 9.64/2.16 Prover 8: Preprocessing ... % 9.64/2.16 Prover 13: Preprocessing ... % 9.64/2.17 Prover 10: Preprocessing ... % 9.64/2.18 Prover 11: stopped % 9.64/2.19 Prover 7: stopped % 10.51/2.23 Prover 13: stopped % 10.51/2.23 Prover 10: stopped % 10.51/2.28 Prover 8: Warning: ignoring some quantifiers % 10.95/2.29 Prover 8: Constructing countermodel ... % 10.95/2.30 Prover 8: stopped % 10.95/2.30 % 10.95/2.30 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 10.95/2.30 % 10.95/2.30 % SZS output start Proof for theBenchmark % 10.95/2.31 Assumptions after simplification: % 10.95/2.31 --------------------------------- % 10.95/2.31 % 10.95/2.31 (power_0) % 10.95/2.32 ? [v0: t1] : (mk_t1(1, 0, 0, 1) = v0 & t1(v0) & ! [v1: t1] : ! [v2: t1] : % 10.95/2.32 (v2 = v0 | ~ (power1(v1, 0) = v2) | ~ t1(v1))) % 10.95/2.32 % 10.95/2.32 (wP_parameter_logfib) % 10.95/2.32 ? [v0: t1] : ? [v1: t1] : (mk_t1(1, 1, 1, 0) = v0 & mk_t1(1, 0, 0, 1) = v1 & % 10.95/2.32 t1(v1) & t1(v0) & ? [v2: t1] : ( ~ (v2 = v1) & power1(v0, 0) = v2 & % 10.95/2.32 t1(v2))) % 10.95/2.32 % 10.95/2.32 (function-axioms) % 10.95/2.33 ! [v0: t1] : ! [v1: t1] : ! [v2: int] : ! [v3: int] : ! [v4: int] : ! % 10.95/2.33 [v5: int] : (v1 = v0 | ~ (mk_t1(v5, v4, v3, v2) = v1) | ~ (mk_t1(v5, v4, v3, % 10.95/2.33 v2) = v0)) & ! [v0: uni] : ! [v1: uni] : ! [v2: uni] : ! [v3: uni] : % 10.95/2.33 ! [v4: bool1] : ! [v5: ty] : (v1 = v0 | ~ (match_bool1(v5, v4, v3, v2) = % 10.95/2.33 v1) | ~ (match_bool1(v5, v4, v3, v2) = v0)) & ! [v0: t1] : ! [v1: t1] : % 10.95/2.33 ! [v2: int] : ! [v3: t1] : (v1 = v0 | ~ (power1(v3, v2) = v1) | ~ % 10.95/2.33 (power1(v3, v2) = v0)) & ! [v0: t1] : ! [v1: t1] : ! [v2: t1] : ! [v3: % 10.95/2.33 t1] : (v1 = v0 | ~ (mult1(v3, v2) = v1) | ~ (mult1(v3, v2) = v0)) & ! % 10.95/2.33 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: uni] : ! [v3: % 10.95/2.33 ty] : (v1 = v0 | ~ (sort1(v3, v2) = v1) | ~ (sort1(v3, v2) = v0)) & ! % 10.95/2.33 [v0: int] : ! [v1: int] : ! [v2: t1] : (v1 = v0 | ~ (a221(v2) = v1) | ~ % 10.95/2.33 (a221(v2) = v0)) & ! [v0: int] : ! [v1: int] : ! [v2: t1] : (v1 = v0 | ~ % 10.95/2.33 (a211(v2) = v1) | ~ (a211(v2) = v0)) & ! [v0: int] : ! [v1: int] : ! % 10.95/2.33 [v2: t1] : (v1 = v0 | ~ (a121(v2) = v1) | ~ (a121(v2) = v0)) & ! [v0: int] % 10.95/2.33 : ! [v1: int] : ! [v2: t1] : (v1 = v0 | ~ (a111(v2) = v1) | ~ (a111(v2) = % 10.95/2.33 v0)) & ! [v0: int] : ! [v1: int] : ! [v2: int] : (v1 = v0 | ~ % 10.95/2.33 (abs1(v2) = v1) | ~ (abs1(v2) = v0)) & ! [v0: int] : ! [v1: int] : ! % 10.95/2.33 [v2: int] : (v1 = v0 | ~ (fib1(v2) = v1) | ~ (fib1(v2) = v0)) & ! [v0: uni] % 10.95/2.33 : ! [v1: uni] : ! [v2: ty] : (v1 = v0 | ~ (witness1(v2) = v1) | ~ % 10.95/2.33 (witness1(v2) = v0)) % 10.95/2.33 % 10.95/2.33 Further assumptions not needed in the proof: % 10.95/2.33 -------------------------------------------- % 10.95/2.33 a11_def1, a12_def1, a21_def1, a22_def1, abs_def, abs_le, abs_pos, assoc2, % 10.95/2.33 bool_inversion, comm2, compatOrderMult, div_mult, fib0, fib1, fibn, % 10.95/2.33 match_bool_False, match_bool_True, match_bool_sort1, mod_mult, mult_def, % 10.95/2.33 power_1, power_mult, power_mult2, power_s, power_s_alt, power_sum, t_inversion1, % 10.95/2.33 true_False, tuple0_inversion, unit_def_l1, unit_def_r1, witness_sort1 % 10.95/2.33 % 10.95/2.33 Those formulas are unsatisfiable: % 10.95/2.33 --------------------------------- % 10.95/2.33 % 10.95/2.33 Begin of proof % 10.95/2.33 | % 10.95/2.33 | ALPHA: (function-axioms) implies: % 10.95/2.33 | (1) ! [v0: t1] : ! [v1: t1] : ! [v2: int] : ! [v3: int] : ! [v4: int] % 10.95/2.33 | : ! [v5: int] : (v1 = v0 | ~ (mk_t1(v5, v4, v3, v2) = v1) | ~ % 10.95/2.33 | (mk_t1(v5, v4, v3, v2) = v0)) % 10.95/2.33 | % 10.95/2.33 | DELTA: instantiating (power_0) with fresh symbol all_40_0 gives: % 10.95/2.33 | (2) mk_t1(1, 0, 0, 1) = all_40_0 & t1(all_40_0) & ! [v0: t1] : ! [v1: % 10.95/2.33 | int] : (v1 = all_40_0 | ~ (power1(v0, 0) = v1) | ~ t1(v0)) % 10.95/2.33 | % 10.95/2.33 | ALPHA: (2) implies: % 10.95/2.34 | (3) mk_t1(1, 0, 0, 1) = all_40_0 % 10.95/2.34 | (4) ! [v0: t1] : ! [v1: int] : (v1 = all_40_0 | ~ (power1(v0, 0) = v1) | % 10.95/2.34 | ~ t1(v0)) % 10.95/2.34 | % 10.95/2.34 | DELTA: instantiating (wP_parameter_logfib) with fresh symbols all_51_0, % 10.95/2.34 | all_51_1 gives: % 10.95/2.34 | (5) mk_t1(1, 1, 1, 0) = all_51_1 & mk_t1(1, 0, 0, 1) = all_51_0 & % 10.95/2.34 | t1(all_51_0) & t1(all_51_1) & ? [v0: any] : ( ~ (v0 = all_51_0) & % 10.95/2.34 | power1(all_51_1, 0) = v0 & t1(v0)) % 10.95/2.34 | % 10.95/2.34 | ALPHA: (5) implies: % 10.95/2.34 | (6) t1(all_51_1) % 10.95/2.34 | (7) mk_t1(1, 0, 0, 1) = all_51_0 % 10.95/2.34 | (8) ? [v0: any] : ( ~ (v0 = all_51_0) & power1(all_51_1, 0) = v0 & t1(v0)) % 10.95/2.34 | % 10.95/2.34 | DELTA: instantiating (8) with fresh symbol all_54_0 gives: % 10.95/2.34 | (9) ~ (all_54_0 = all_51_0) & power1(all_51_1, 0) = all_54_0 & % 10.95/2.34 | t1(all_54_0) % 10.95/2.34 | % 10.95/2.34 | ALPHA: (9) implies: % 10.95/2.34 | (10) ~ (all_54_0 = all_51_0) % 10.95/2.34 | (11) power1(all_51_1, 0) = all_54_0 % 10.95/2.34 | % 10.95/2.34 | GROUND_INST: instantiating (1) with all_40_0, all_51_0, 1, 0, 0, 1, % 10.95/2.34 | simplifying with (3), (7) gives: % 10.95/2.34 | (12) all_51_0 = all_40_0 % 10.95/2.34 | % 10.95/2.34 | REDUCE: (10), (12) imply: % 10.95/2.34 | (13) ~ (all_54_0 = all_40_0) % 10.95/2.34 | % 10.95/2.34 | GROUND_INST: instantiating (4) with all_51_1, all_54_0, simplifying with (6), % 10.95/2.34 | (11) gives: % 10.95/2.34 | (14) all_54_0 = all_40_0 % 10.95/2.34 | % 10.95/2.34 | REDUCE: (13), (14) imply: % 10.95/2.34 | (15) $false % 10.95/2.34 | % 10.95/2.34 | CLOSE: (15) is inconsistent. % 10.95/2.34 | % 10.95/2.34 End of proof % 10.95/2.34 % SZS output end Proof for theBenchmark % 10.95/2.34 % 10.95/2.34 1738ms %------------------------------------------------------------------------------