%------------------------------------------------------------------------------ % 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 : n025.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 7.13s 1.72s % Output : Proof 9.10s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % 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 : n025.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.34 % WCLimit : 300 % 0.13/0.34 % DateTime : Sun Apr 6 03:12:35 EDT 2025 % 0.13/0.35 % CPUTime : % 0.65/0.63 ________ _____ % 0.65/0.63 ___ __ \_________(_)________________________________ % 0.65/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.65/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.65/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.65/0.63 % 0.65/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.65/0.63 (2023-06-19) % 0.65/0.63 % 0.65/0.63 (c) Philipp Rümmer, 2009-2023 % 0.65/0.63 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.65/0.63 Amanda Stjerna. % 0.65/0.63 Free software under BSD-3-Clause. % 0.65/0.63 % 0.65/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.65/0.63 % 0.65/0.63 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.71/0.64 Running up to 7 provers in parallel. % 0.71/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.71/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.71/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.71/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.71/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.71/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.71/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.95/1.15 Prover 4: Preprocessing ... % 2.95/1.15 Prover 1: Preprocessing ... % 3.58/1.19 Prover 6: Preprocessing ... % 3.58/1.19 Prover 3: Preprocessing ... % 3.58/1.19 Prover 5: Preprocessing ... % 3.58/1.19 Prover 2: Preprocessing ... % 3.58/1.19 Prover 0: Preprocessing ... % 6.19/1.57 Prover 5: Proving ... % 6.19/1.58 Prover 3: Warning: ignoring some quantifiers % 6.19/1.58 Prover 2: Proving ... % 6.19/1.60 Prover 3: Constructing countermodel ... % 6.19/1.61 Prover 1: Warning: ignoring some quantifiers % 6.70/1.61 Prover 6: Proving ... % 6.70/1.64 Prover 0: Proving ... % 6.70/1.64 Prover 1: Constructing countermodel ... % 6.70/1.66 Prover 4: Constructing countermodel ... % 7.13/1.71 Prover 5: proved (1060ms) % 7.13/1.71 % 7.13/1.72 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.13/1.72 % 7.13/1.72 Prover 0: stopped % 7.13/1.72 Prover 2: stopped % 7.13/1.72 Prover 6: stopped % 7.13/1.73 Prover 3: proved (1068ms) % 7.13/1.73 % 7.13/1.73 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 7.13/1.73 % 7.13/1.74 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 7.13/1.74 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 7.13/1.74 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 7.13/1.74 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 7.13/1.74 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 7.95/1.81 Prover 1: Found proof (size 7) % 7.95/1.81 Prover 1: proved (1158ms) % 7.95/1.81 Prover 4: stopped % 8.28/1.85 Prover 7: Preprocessing ... % 8.28/1.85 Prover 13: Preprocessing ... % 8.28/1.85 Prover 10: Preprocessing ... % 8.28/1.85 Prover 8: Preprocessing ... % 8.28/1.87 Prover 11: Preprocessing ... % 8.28/1.88 Prover 10: stopped % 8.28/1.88 Prover 7: stopped % 8.28/1.89 Prover 13: stopped % 8.78/1.90 Prover 11: stopped % 9.10/1.96 Prover 8: Warning: ignoring some quantifiers % 9.10/1.98 Prover 8: Constructing countermodel ... % 9.10/1.99 Prover 8: stopped % 9.10/1.99 % 9.10/1.99 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 9.10/1.99 % 9.10/1.99 % SZS output start Proof for theBenchmark % 9.10/1.99 Assumptions after simplification: % 9.10/1.99 --------------------------------- % 9.10/1.99 % 9.10/1.99 (formula_3_constraint_0) % 9.10/2.01 ! [v0: general] : ! [v1: general] : ! [v2: general] : (v1 = v0 | ~ % 9.10/2.01 (in_cover(v1) = 0) | ~ (in_cover(v0) = 0) | ~ (s(v2, v1) = 0) | ~ (s(v2, % 9.10/2.01 v0) = 0) | ~ general(v2) | ~ general(v1) | ~ general(v0)) % 9.10/2.01 % 9.10/2.01 (formula_8_unnamed_formula) % 9.10/2.02 ? [v0: general] : ? [v1: general] : ( ~ (v1 = v0) & in_cover(v1) = 0 & % 9.10/2.02 in_cover(v0) = 0 & general(v1) & general(v0) & ? [v2: general] : (s(v2, v1) % 9.10/2.02 = 0 & s(v2, v0) = 0 & general(v2))) % 9.10/2.02 % 9.10/2.02 Further assumptions not needed in the proof: % 9.10/2.02 -------------------------------------------- % 9.10/2.02 antisymmetric_ordering_ax, f__integer__def_ax, f__symbolic__def_ax, % 9.10/2.02 formula_0_unnamed_formula, formula_1_unnamed_formula, % 9.10/2.02 formula_2_completed_definition_of_covered_1, formula_4_constraint_1, % 9.10/2.02 formula_5_completed_definition_of_in_cover_1, formula_6_unnamed_formula, % 9.10/2.02 formula_7_unnamed_formula, general_universe_ax, maximal_element_ax, % 9.10/2.02 minimal_element_ax, numeral_ordering_ax, numerals_less_than_symbols_ax, % 9.10/2.02 p__greater__def_ax, p__greater_equal__def_ax, p__is_integer__def_ax, % 9.10/2.02 p__is_symbolic__def_ax, p__less__def_ax, strongly_connected_ordering_ax, % 9.10/2.02 transitive_ordering_ax % 9.10/2.02 % 9.10/2.02 Those formulas are unsatisfiable: % 9.10/2.02 --------------------------------- % 9.10/2.02 % 9.10/2.02 Begin of proof % 9.10/2.02 | % 9.10/2.02 | DELTA: instantiating (formula_8_unnamed_formula) with fresh symbols all_30_0, % 9.10/2.02 | all_30_1 gives: % 9.10/2.02 | (1) ~ (all_30_0 = all_30_1) & in_cover(all_30_0) = 0 & in_cover(all_30_1) % 9.10/2.02 | = 0 & general(all_30_0) & general(all_30_1) & ? [v0: general] : (s(v0, % 9.10/2.02 | all_30_0) = 0 & s(v0, all_30_1) = 0 & general(v0)) % 9.10/2.02 | % 9.10/2.02 | ALPHA: (1) implies: % 9.10/2.02 | (2) ~ (all_30_0 = all_30_1) % 9.10/2.02 | (3) general(all_30_1) % 9.10/2.02 | (4) general(all_30_0) % 9.10/2.02 | (5) in_cover(all_30_1) = 0 % 9.10/2.02 | (6) in_cover(all_30_0) = 0 % 9.10/2.02 | (7) ? [v0: general] : (s(v0, all_30_0) = 0 & s(v0, all_30_1) = 0 & % 9.10/2.02 | general(v0)) % 9.10/2.02 | % 9.10/2.02 | DELTA: instantiating (7) with fresh symbol all_34_0 gives: % 9.10/2.03 | (8) s(all_34_0, all_30_0) = 0 & s(all_34_0, all_30_1) = 0 & % 9.10/2.03 | general(all_34_0) % 9.10/2.03 | % 9.10/2.03 | ALPHA: (8) implies: % 9.10/2.03 | (9) general(all_34_0) % 9.10/2.03 | (10) s(all_34_0, all_30_1) = 0 % 9.10/2.03 | (11) s(all_34_0, all_30_0) = 0 % 9.10/2.03 | % 9.10/2.03 | GROUND_INST: instantiating (formula_3_constraint_0) with all_30_1, all_30_0, % 9.10/2.03 | all_34_0, simplifying with (3), (4), (5), (6), (9), (10), (11) % 9.10/2.03 | gives: % 9.10/2.03 | (12) all_30_0 = all_30_1 % 9.10/2.03 | % 9.10/2.03 | REDUCE: (2), (12) imply: % 9.10/2.03 | (13) $false % 9.10/2.03 | % 9.10/2.03 | CLOSE: (13) is inconsistent. % 9.10/2.03 | % 9.10/2.03 End of proof % 9.10/2.03 % SZS output end Proof for theBenchmark % 9.10/2.03 % 9.10/2.03 1399ms %------------------------------------------------------------------------------