%------------------------------------------------------------------------------ % 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 : 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 : Sun Apr 6 10:08:52 AM UTC 2025 % Result : Theorem 6.83s 1.71s % Output : Proof 8.47s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : SWX000_1 : TPTP v9.1.0. Released v9.1.0. % 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n024.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.35 % WCLimit : 300 % 0.13/0.35 % DateTime : Sun Apr 6 03:16:36 EDT 2025 % 0.13/0.35 % CPUTime : % 0.62/0.67 ________ _____ % 0.62/0.67 ___ __ \_________(_)________________________________ % 0.62/0.67 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.62/0.67 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.62/0.67 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.62/0.67 % 0.62/0.67 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.62/0.67 (2023-06-19) % 0.62/0.67 % 0.62/0.67 (c) Philipp Rümmer, 2009-2023 % 0.62/0.67 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.62/0.67 Amanda Stjerna. % 0.62/0.67 Free software under BSD-3-Clause. % 0.62/0.67 % 0.62/0.67 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.62/0.67 % 0.62/0.67 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.75/0.69 Running up to 7 provers in parallel. % 0.75/0.70 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.75/0.70 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.75/0.70 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.75/0.70 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.75/0.70 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.75/0.70 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.75/0.70 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.45/1.23 Prover 5: Preprocessing ... % 3.45/1.23 Prover 4: Preprocessing ... % 3.45/1.23 Prover 1: Preprocessing ... % 3.45/1.23 Prover 0: Preprocessing ... % 3.45/1.23 Prover 3: Preprocessing ... % 3.45/1.23 Prover 2: Preprocessing ... % 3.45/1.24 Prover 6: Preprocessing ... % 5.75/1.57 Prover 3: Warning: ignoring some quantifiers % 6.05/1.57 Prover 5: Proving ... % 6.05/1.57 Prover 1: Warning: ignoring some quantifiers % 6.05/1.57 Prover 6: Proving ... % 6.05/1.58 Prover 2: Proving ... % 6.05/1.58 Prover 3: Constructing countermodel ... % 6.05/1.59 Prover 1: Constructing countermodel ... % 6.05/1.59 Prover 4: Constructing countermodel ... % 6.05/1.61 Prover 0: Proving ... % 6.83/1.71 Prover 3: proved (1016ms) % 6.83/1.71 % 6.83/1.71 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.83/1.71 % 6.83/1.71 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 6.83/1.72 Prover 0: proved (1027ms) % 6.83/1.72 Prover 2: proved (1027ms) % 6.83/1.72 % 6.83/1.72 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.83/1.72 % 6.83/1.72 Prover 5: proved (1024ms) % 6.83/1.72 % 6.83/1.72 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.83/1.72 % 6.83/1.72 Prover 6: proved (1024ms) % 6.83/1.72 % 6.83/1.72 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.83/1.72 % 6.83/1.73 % 6.83/1.73 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 6.83/1.73 % 6.83/1.73 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 6.83/1.74 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 6.83/1.74 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 6.83/1.74 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 7.28/1.74 Prover 4: Found proof (size 6) % 7.28/1.74 Prover 1: Found proof (size 6) % 7.28/1.74 Prover 1: proved (1052ms) % 7.28/1.75 Prover 4: proved (1050ms) % 7.43/1.77 Prover 7: Preprocessing ... % 7.43/1.80 Prover 8: Preprocessing ... % 7.43/1.80 Prover 11: Preprocessing ... % 7.43/1.80 Prover 13: Preprocessing ... % 7.43/1.81 Prover 10: Preprocessing ... % 7.85/1.82 Prover 7: stopped % 7.85/1.83 Prover 10: stopped % 7.85/1.83 Prover 11: stopped % 7.85/1.84 Prover 13: stopped % 8.09/1.89 Prover 8: Warning: ignoring some quantifiers % 8.09/1.90 Prover 8: Constructing countermodel ... % 8.09/1.91 Prover 8: stopped % 8.09/1.91 % 8.09/1.91 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 8.09/1.91 % 8.09/1.91 % SZS output start Proof for theBenchmark % 8.09/1.92 Assumptions after simplification: % 8.09/1.92 --------------------------------- % 8.09/1.92 % 8.09/1.92 (formula_1_unnamed_formula) % 8.09/1.92 ? [v0: int] : ? [v1: int] : ? [v2: int] : ( ~ (v2 = v1) & % 8.09/1.92 $product($product(-1, v0), $product(-1, v0)) = v2 & $product(v0, v0) = v1) % 8.09/1.92 % 8.09/1.92 Further assumptions not needed in the proof: % 8.09/1.92 -------------------------------------------- % 8.09/1.92 antisymmetric_ordering_ax, f__integer__def_ax, f__symbolic__def_ax, % 8.09/1.92 formula_0_completed_definition_of_p_1, general_universe_ax, maximal_element_ax, % 8.09/1.92 minimal_element_ax, numeral_ordering_ax, numerals_less_than_symbols_ax, % 8.09/1.92 p__greater__def_ax, p__greater_equal__def_ax, p__is_integer__def_ax, % 8.09/1.92 p__is_symbolic__def_ax, p__less__def_ax, strongly_connected_ordering_ax, % 8.09/1.92 transitive_ordering_ax % 8.09/1.92 % 8.09/1.92 Those formulas are unsatisfiable: % 8.09/1.92 --------------------------------- % 8.09/1.92 % 8.09/1.92 Begin of proof % 8.09/1.92 | % 8.09/1.93 | DELTA: instantiating (formula_1_unnamed_formula) with fresh symbols all_24_0, % 8.09/1.93 | all_24_1, all_24_2 gives: % 8.09/1.93 | (1) ~ (all_24_0 = all_24_1) & $product($product(-1, all_24_2), % 8.09/1.93 | $product(-1, all_24_2)) = all_24_0 & $product(all_24_2, all_24_2) = % 8.09/1.93 | all_24_1 % 8.09/1.93 | % 8.09/1.93 | ALPHA: (1) implies: % 8.09/1.93 | (2) ~ (all_24_0 = all_24_1) % 8.09/1.93 | (3) $product(all_24_2, all_24_2) = all_24_1 % 8.09/1.93 | (4) $product($product(-1, all_24_2), $product(-1, all_24_2)) = all_24_0 % 8.09/1.93 | % 8.09/1.93 | THEORY_AXIOM GroebnerMultiplication: % 8.09/1.93 | (5) ! [v0: int] : ! [v1: int] : ! [v2: int] : (v2 = v1 | ~ % 8.09/1.93 | ($product($product(-1, v0), $product(-1, v0)) = v2) | ~ % 8.09/1.93 | ($product(v0, v0) = v1)) % 8.09/1.93 | % 8.09/1.93 | GROUND_INST: instantiating (5) with all_24_2, all_24_1, all_24_0, simplifying % 8.09/1.93 | with (3), (4) gives: % 8.09/1.93 | (6) all_24_0 = all_24_1 % 8.09/1.93 | % 8.09/1.93 | REDUCE: (2), (6) imply: % 8.09/1.93 | (7) $false % 8.47/1.93 | % 8.47/1.93 | CLOSE: (7) is inconsistent. % 8.47/1.93 | % 8.47/1.93 End of proof % 8.47/1.94 % SZS output end Proof for theBenchmark % 8.47/1.94 % 8.47/1.94 1261ms %------------------------------------------------------------------------------