%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWX000_1 : TPTP v9.1.0. Released v9.1.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n016.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 : Sun Apr 6 10:08:50 AM UTC 2025 % Result : Theorem 6.23s 1.60s % Output : Proof 7.77s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.13 % Problem : SWX000_1 : TPTP v9.1.0. Released v9.1.0. % 0.11/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.35 % Computer : n016.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 300 % 0.14/0.35 % DateTime : Sun Apr 6 03:08:08 EDT 2025 % 0.14/0.35 % CPUTime : % 0.20/0.63 ________ _____ % 0.20/0.63 ___ __ \_________(_)________________________________ % 0.20/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.63 % 0.20/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.63 (2023-06-19) % 0.20/0.63 % 0.20/0.63 (c) Philipp Rümmer, 2009-2023 % 0.20/0.63 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.63 Amanda Stjerna. % 0.20/0.63 Free software under BSD-3-Clause. % 0.20/0.63 % 0.20/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.63 % 0.20/0.63 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.64 Running up to 7 provers in parallel. % 0.20/0.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.03/1.14 Prover 4: Preprocessing ... % 3.03/1.14 Prover 1: Preprocessing ... % 3.03/1.17 Prover 5: Preprocessing ... % 3.03/1.17 Prover 0: Preprocessing ... % 3.03/1.17 Prover 6: Preprocessing ... % 3.03/1.17 Prover 2: Preprocessing ... % 3.03/1.17 Prover 3: Preprocessing ... % 5.12/1.48 Prover 5: Proving ... % 5.12/1.50 Prover 2: Proving ... % 5.71/1.50 Prover 1: Constructing countermodel ... % 5.71/1.51 Prover 6: Proving ... % 5.71/1.51 Prover 3: Constructing countermodel ... % 5.71/1.55 Prover 0: Proving ... % 5.71/1.56 Prover 4: Constructing countermodel ... % 6.23/1.59 Prover 3: proved (945ms) % 6.23/1.60 % 6.23/1.60 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.23/1.60 % 6.23/1.60 Prover 0: stopped % 6.23/1.60 Prover 6: stopped % 6.23/1.60 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 6.23/1.60 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 6.23/1.60 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 6.23/1.61 Prover 5: proved (955ms) % 6.23/1.61 % 6.23/1.61 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.23/1.61 % 6.23/1.61 Prover 2: proved (958ms) % 6.23/1.61 % 6.23/1.61 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.23/1.61 % 6.23/1.61 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 6.23/1.61 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 6.23/1.62 Prover 1: Found proof (size 5) % 6.23/1.62 Prover 1: proved (974ms) % 6.23/1.63 Prover 4: stopped % 6.92/1.68 Prover 11: Preprocessing ... % 6.92/1.68 Prover 8: Preprocessing ... % 6.92/1.69 Prover 7: Preprocessing ... % 6.92/1.69 Prover 10: Preprocessing ... % 6.92/1.69 Prover 13: Preprocessing ... % 7.09/1.71 Prover 7: stopped % 7.09/1.72 Prover 10: stopped % 7.32/1.72 Prover 13: stopped % 7.32/1.73 Prover 11: stopped % 7.37/1.80 Prover 8: Warning: ignoring some quantifiers % 7.77/1.81 Prover 8: Constructing countermodel ... % 7.77/1.82 Prover 8: stopped % 7.77/1.82 % 7.77/1.82 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 7.77/1.82 % 7.77/1.82 % SZS output start Proof for theBenchmark % 7.77/1.82 Assumptions after simplification: % 7.77/1.82 --------------------------------- % 7.77/1.82 % 7.77/1.82 (formula_2_right_0) % 7.77/1.85 ! [v0: general] : ! [v1: int] : (v1 = 0 | ~ (hp(v0) = 0) | ~ (hq(v0) = v1) % 7.77/1.85 | ~ (tq(v0) = 0) | ~ general(v0)) % 7.77/1.85 % 7.77/1.85 (formula_3_left_0) % 7.77/1.85 ? [v0: general] : ? [v1: int] : ( ~ (v1 = 0) & hp(v0) = 0 & hq(v0) = v1 & % 7.77/1.85 tq(v0) = 0 & general(v0)) % 7.77/1.85 % 7.77/1.85 Further assumptions not needed in the proof: % 7.77/1.85 -------------------------------------------- % 7.77/1.85 antisymmetric_ordering_ax, f__integer__def_ax, f__symbolic__def_ax, % 7.77/1.85 formula_0_transition_axiom_0, formula_1_transition_axiom_1, general_universe_ax, % 7.77/1.85 maximal_element_ax, minimal_element_ax, numeral_ordering_ax, % 7.77/1.85 numerals_less_than_symbols_ax, p__greater__def_ax, p__greater_equal__def_ax, % 7.77/1.85 p__is_integer__def_ax, p__is_symbolic__def_ax, p__less__def_ax, % 7.77/1.85 strongly_connected_ordering_ax, transitive_ordering_ax % 7.77/1.85 % 7.77/1.85 Those formulas are unsatisfiable: % 7.77/1.85 --------------------------------- % 7.77/1.85 % 7.77/1.85 Begin of proof % 7.77/1.85 | % 7.77/1.85 | DELTA: instantiating (formula_3_left_0) with fresh symbols all_26_0, all_26_1 % 7.77/1.85 | gives: % 7.77/1.85 | (1) ~ (all_26_0 = 0) & hp(all_26_1) = 0 & hq(all_26_1) = all_26_0 & % 7.77/1.85 | tq(all_26_1) = 0 & general(all_26_1) % 7.77/1.85 | % 7.77/1.85 | ALPHA: (1) implies: % 7.77/1.85 | (2) ~ (all_26_0 = 0) % 7.77/1.86 | (3) general(all_26_1) % 7.77/1.86 | (4) tq(all_26_1) = 0 % 7.77/1.86 | (5) hq(all_26_1) = all_26_0 % 7.77/1.86 | (6) hp(all_26_1) = 0 % 7.77/1.86 | % 7.77/1.86 | GROUND_INST: instantiating (formula_2_right_0) with all_26_1, all_26_0, % 7.77/1.86 | simplifying with (3), (4), (5), (6) gives: % 7.77/1.86 | (7) all_26_0 = 0 % 7.77/1.86 | % 7.77/1.86 | REDUCE: (2), (7) imply: % 7.77/1.86 | (8) $false % 7.77/1.86 | % 7.77/1.86 | CLOSE: (8) is inconsistent. % 7.77/1.86 | % 7.77/1.86 End of proof % 7.77/1.86 % SZS output end Proof for theBenchmark % 7.77/1.86 % 7.77/1.86 1230ms %------------------------------------------------------------------------------