%------------------------------------------------------------------------------ % 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 : n020.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:53 AM UTC 2025 % Result : Theorem 9.16s 1.95s % Output : Proof 11.40s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SWX000_1 : TPTP v9.1.0. Released v9.1.0. % 0.06/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n020.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:08:49 EDT 2025 % 0.13/0.34 % CPUTime : % 0.65/0.67 ________ _____ % 0.65/0.67 ___ __ \_________(_)________________________________ % 0.65/0.67 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.65/0.67 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.65/0.67 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.65/0.67 % 0.65/0.67 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.65/0.67 (2023-06-19) % 0.65/0.67 % 0.65/0.68 (c) Philipp Rümmer, 2009-2023 % 0.65/0.68 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.65/0.68 Amanda Stjerna. % 0.65/0.68 Free software under BSD-3-Clause. % 0.65/0.68 % 0.65/0.68 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.65/0.68 % 0.65/0.68 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.76/0.69 Running up to 7 provers in parallel. % 0.76/0.70 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.76/0.70 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.76/0.70 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.76/0.70 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.76/0.70 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.76/0.70 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.76/0.70 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.81/1.26 Prover 1: Preprocessing ... % 4.12/1.27 Prover 4: Preprocessing ... % 4.12/1.30 Prover 2: Preprocessing ... % 4.12/1.30 Prover 6: Preprocessing ... % 4.12/1.30 Prover 5: Preprocessing ... % 4.12/1.30 Prover 3: Preprocessing ... % 4.12/1.30 Prover 0: Preprocessing ... % 7.79/1.80 Prover 5: Proving ... % 7.79/1.80 Prover 2: Proving ... % 7.79/1.82 Prover 4: Constructing countermodel ... % 8.26/1.82 Prover 3: Warning: ignoring some quantifiers % 8.26/1.84 Prover 6: Proving ... % 8.26/1.84 Prover 0: Proving ... % 8.26/1.85 Prover 3: Constructing countermodel ... % 8.56/1.86 Prover 1: Warning: ignoring some quantifiers % 8.56/1.88 Prover 1: Constructing countermodel ... % 9.16/1.95 Prover 5: proved (1247ms) % 9.16/1.95 % 9.16/1.95 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 9.16/1.95 % 9.16/1.95 Prover 3: stopped % 9.16/1.95 Prover 0: stopped % 9.16/1.96 Prover 2: stopped % 9.16/1.96 Prover 6: stopped % 9.16/1.96 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 9.16/1.96 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 9.16/1.96 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 9.16/1.96 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 9.16/1.96 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 9.45/2.01 Prover 4: Found proof (size 5) % 9.45/2.01 Prover 4: proved (1310ms) % 9.45/2.01 Prover 1: Found proof (size 5) % 9.45/2.01 Prover 1: proved (1313ms) % 10.08/2.07 Prover 11: Preprocessing ... % 10.08/2.07 Prover 10: Preprocessing ... % 10.08/2.07 Prover 8: Preprocessing ... % 10.08/2.08 Prover 7: Preprocessing ... % 10.08/2.08 Prover 13: Preprocessing ... % 10.08/2.11 Prover 10: stopped % 10.53/2.12 Prover 7: stopped % 10.53/2.13 Prover 11: stopped % 10.53/2.13 Prover 13: stopped % 10.82/2.24 Prover 8: Warning: ignoring some quantifiers % 11.21/2.26 Prover 8: Constructing countermodel ... % 11.21/2.26 Prover 8: stopped % 11.21/2.27 % 11.21/2.27 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 11.21/2.27 % 11.21/2.27 % SZS output start Proof for theBenchmark % 11.21/2.27 Assumptions after simplification: % 11.21/2.27 --------------------------------- % 11.21/2.27 % 11.21/2.27 (formula_6_constraint_0) % 11.40/2.29 ! [v0: general] : ! [v1: general] : ! [v2: general] : ! [v3: general] : % 11.40/2.29 (v3 = v1 | ~ (in(v0, v3, v2) = 0) | ~ (in(v0, v1, v2) = 0) | ~ general(v3) % 11.40/2.29 | ~ general(v2) | ~ general(v1) | ~ general(v0)) % 11.40/2.29 % 11.40/2.29 (formula_9_constraint_0) % 11.40/2.29 ? [v0: general] : ? [v1: general] : ? [v2: general] : ? [v3: general] : ( % 11.40/2.29 ~ (v3 = v1) & in(v0, v3, v2) = 0 & in(v0, v1, v2) = 0 & general(v3) & % 11.40/2.29 general(v2) & general(v1) & general(v0)) % 11.40/2.29 % 11.40/2.29 Further assumptions not needed in the proof: % 11.40/2.29 -------------------------------------------- % 11.40/2.29 antisymmetric_ordering_ax, f__integer__def_ax, f__symbolic__def_ax, % 11.40/2.29 formula_0_unnamed_formula, formula_1_unnamed_formula, formula_2_unnamed_formula, % 11.40/2.29 formula_3_completed_definition_of_go_2, % 11.40/2.29 formula_4_completed_definition_of_in_building_2, % 11.40/2.29 formula_5_completed_definition_of_in_building_2, formula_7_constraint_1, % 11.40/2.29 formula_8_completed_definition_of_in_3, general_universe_ax, maximal_element_ax, % 11.40/2.29 minimal_element_ax, numeral_ordering_ax, numerals_less_than_symbols_ax, % 11.40/2.29 p__greater__def_ax, p__greater_equal__def_ax, p__is_integer__def_ax, % 11.40/2.29 p__is_symbolic__def_ax, p__less__def_ax, strongly_connected_ordering_ax, % 11.40/2.29 transitive_ordering_ax % 11.40/2.29 % 11.40/2.29 Those formulas are unsatisfiable: % 11.40/2.29 --------------------------------- % 11.40/2.29 % 11.40/2.29 Begin of proof % 11.40/2.29 | % 11.40/2.29 | DELTA: instantiating (formula_9_constraint_0) with fresh symbols all_30_0, % 11.40/2.29 | all_30_1, all_30_2, all_30_3 gives: % 11.40/2.29 | (1) ~ (all_30_0 = all_30_2) & in(all_30_3, all_30_0, all_30_1) = 0 & % 11.40/2.29 | in(all_30_3, all_30_2, all_30_1) = 0 & general(all_30_0) & % 11.40/2.29 | general(all_30_1) & general(all_30_2) & general(all_30_3) % 11.40/2.30 | % 11.40/2.30 | ALPHA: (1) implies: % 11.40/2.30 | (2) ~ (all_30_0 = all_30_2) % 11.40/2.30 | (3) general(all_30_3) % 11.40/2.30 | (4) general(all_30_2) % 11.40/2.30 | (5) general(all_30_1) % 11.40/2.30 | (6) general(all_30_0) % 11.40/2.30 | (7) in(all_30_3, all_30_2, all_30_1) = 0 % 11.40/2.30 | (8) in(all_30_3, all_30_0, all_30_1) = 0 % 11.40/2.30 | % 11.40/2.30 | GROUND_INST: instantiating (formula_6_constraint_0) with all_30_3, all_30_2, % 11.40/2.30 | all_30_1, all_30_0, simplifying with (3), (4), (5), (6), (7), (8) % 11.40/2.30 | gives: % 11.40/2.30 | (9) all_30_0 = all_30_2 % 11.40/2.30 | % 11.40/2.30 | REDUCE: (2), (9) imply: % 11.40/2.30 | (10) $false % 11.40/2.30 | % 11.40/2.30 | CLOSE: (10) is inconsistent. % 11.40/2.30 | % 11.40/2.30 End of proof % 11.40/2.30 % SZS output end Proof for theBenchmark % 11.40/2.30 % 11.40/2.30 1625ms %------------------------------------------------------------------------------