%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : GEO498+1 : TPTP v8.1.2. Released v7.0.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n027.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 : Wed Aug 30 23:23:30 EDT 2023 % Result : Theorem 14.73s 2.75s % Output : Proof 22.31s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : GEO498+1 : TPTP v8.1.2. Released v7.0.0. % 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.35 % Computer : n027.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 300 % 0.13/0.35 % DateTime : Tue Aug 29 23:28:53 EDT 2023 % 0.13/0.36 % CPUTime : % 0.44/0.64 ________ _____ % 0.44/0.64 ___ __ \_________(_)________________________________ % 0.44/0.64 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.44/0.64 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.44/0.64 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.44/0.64 % 0.44/0.64 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.44/0.64 (2023-06-19) % 0.44/0.64 % 0.44/0.64 (c) Philipp Rümmer, 2009-2023 % 0.44/0.64 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.44/0.64 Amanda Stjerna. % 0.44/0.64 Free software under BSD-3-Clause. % 0.44/0.64 % 0.44/0.64 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.44/0.64 % 0.44/0.64 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.70/0.65 Running up to 7 provers in parallel. % 0.70/0.67 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.70/0.67 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.70/0.67 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.70/0.67 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.70/0.67 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.70/0.67 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.70/0.67 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 6.71/1.65 Prover 1: Preprocessing ... % 6.71/1.65 Prover 4: Preprocessing ... % 6.71/1.67 Prover 5: Preprocessing ... % 6.71/1.67 Prover 2: Preprocessing ... % 6.71/1.67 Prover 0: Preprocessing ... % 6.71/1.67 Prover 3: Preprocessing ... % 6.71/1.67 Prover 6: Preprocessing ... % 13.10/2.53 Prover 5: Proving ... % 13.47/2.58 Prover 2: Proving ... % 13.70/2.59 Prover 1: Warning: ignoring some quantifiers % 14.22/2.67 Prover 1: Constructing countermodel ... % 14.22/2.67 Prover 6: Proving ... % 14.22/2.70 Prover 3: Warning: ignoring some quantifiers % 14.73/2.75 Prover 2: proved (2085ms) % 14.73/2.75 % 14.73/2.75 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 14.73/2.75 % 14.73/2.76 Prover 6: stopped % 15.08/2.77 Prover 3: Constructing countermodel ... % 15.08/2.77 Prover 3: stopped % 15.08/2.77 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 15.08/2.77 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 15.08/2.77 Prover 5: stopped % 15.08/2.79 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 15.08/2.79 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 15.93/2.91 Prover 1: gave up % 15.93/2.92 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 16.50/3.04 Prover 4: Constructing countermodel ... % 16.50/3.04 Prover 10: Preprocessing ... % 16.50/3.07 Prover 7: Preprocessing ... % 16.50/3.07 Prover 8: Preprocessing ... % 16.50/3.09 Prover 0: Proving ... % 16.50/3.09 Prover 11: Preprocessing ... % 17.30/3.10 Prover 0: stopped % 17.30/3.12 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 17.98/3.20 Prover 13: Preprocessing ... % 19.02/3.29 Prover 16: Preprocessing ... % 19.02/3.31 Prover 10: Warning: ignoring some quantifiers % 19.02/3.33 Prover 7: Warning: ignoring some quantifiers % 19.56/3.35 Prover 10: Constructing countermodel ... % 19.56/3.36 Prover 7: Constructing countermodel ... % 19.71/3.41 Prover 13: Warning: ignoring some quantifiers % 20.11/3.45 Prover 13: Constructing countermodel ... % 20.35/3.51 Prover 8: Warning: ignoring some quantifiers % 20.35/3.52 Prover 16: Warning: ignoring some quantifiers % 20.94/3.55 Prover 16: Constructing countermodel ... % 20.94/3.55 Prover 7: Found proof (size 8) % 20.94/3.55 Prover 7: proved (787ms) % 20.94/3.55 Prover 4: stopped % 20.94/3.55 Prover 8: Constructing countermodel ... % 20.94/3.55 Prover 10: stopped % 20.94/3.55 Prover 13: stopped % 20.94/3.56 Prover 16: stopped % 20.94/3.57 Prover 8: stopped % 21.75/3.76 Prover 11: Constructing countermodel ... % 22.05/3.79 Prover 11: stopped % 22.05/3.79 % 22.05/3.79 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 22.05/3.79 % 22.05/3.79 % SZS output start Proof for theBenchmark % 22.18/3.81 Assumptions after simplification: % 22.18/3.81 --------------------------------- % 22.18/3.81 % 22.18/3.81 (aSatz7_7) % 22.31/3.84 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (s(v0, v1) = v2) | ~ $i(v1) | % 22.31/3.84 ~ $i(v0) | s(v0, v2) = v1) % 22.31/3.84 % 22.31/3.84 (aSatz7_8) % 22.31/3.85 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ( ~ (v3 = v1) & s(v0, % 22.31/3.85 v3) = v2 & s(v0, v1) = v2 & $i(v3) & $i(v2) & $i(v1) & $i(v0)) % 22.31/3.85 % 22.31/3.85 (function-axioms) % 22.31/3.86 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 22.31/3.86 $i] : ! [v6: $i] : ! [v7: $i] : (v1 = v0 | ~ (crossbar(v7, v6, v5, v4, % 22.31/3.86 v3, v2) = v1) | ~ (crossbar(v7, v6, v5, v4, v3, v2) = v0)) & ! [v0: % 22.31/3.86 $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: $i] : % 22.31/3.86 ! [v6: $i] : (v1 = v0 | ~ (insert5(v6, v5, v4, v3, v2) = v1) | ~ % 22.31/3.86 (insert5(v6, v5, v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: % 22.31/3.86 $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: $i] : ! [v6: $i] : (v1 = v0 | ~ % 22.31/3.86 (ip(v6, v5, v4, v3, v2) = v1) | ~ (ip(v6, v5, v4, v3, v2) = v0)) & ! [v0: % 22.31/3.86 $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: $i] : % 22.31/3.86 (v1 = v0 | ~ (ins(v5, v4, v3, v2) = v1) | ~ (ins(v5, v4, v3, v2) = v0)) & ! % 22.31/3.86 [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: $i] % 22.31/3.86 : (v1 = v0 | ~ (insert(v5, v4, v3, v2) = v1) | ~ (insert(v5, v4, v3, v2) = % 22.31/3.86 v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] % 22.31/3.86 : ! [v5: $i] : (v1 = v0 | ~ (ext(v5, v4, v3, v2) = v1) | ~ (ext(v5, v4, v3, % 22.31/3.86 v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! % 22.31/3.86 [v4: $i] : (v1 = v0 | ~ (c63(v4, v3, v2) = v1) | ~ (c63(v4, v3, v2) = v0)) & % 22.31/3.86 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (s(v3, % 22.31/3.86 v2) = v1) | ~ (s(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: % 22.31/3.86 $i] : ! [v3: $i] : (v1 = v0 | ~ (pointOffLine(v3, v2) = v1) | ~ % 22.31/3.86 (pointOffLine(v3, v2) = v0)) % 22.31/3.86 % 22.31/3.86 Further assumptions not needed in the proof: % 22.31/3.86 -------------------------------------------- % 22.31/3.86 aA1, aA2, aA3, aA4, aA5, aA6, aA7, aA8, aNarbouxLemma1, aSatz2_1, aSatz2_11, % 22.31/3.86 aSatz2_12, aSatz2_13, aSatz2_14, aSatz2_15, aSatz2_2, aSatz2_3, aSatz2_4, % 22.31/3.86 aSatz2_5, aSatz2_8, aSatz3_1, aSatz3_13a, aSatz3_13b, aSatz3_13c, aSatz3_14a, % 22.31/3.86 aSatz3_14b, aSatz3_17, aSatz3_2, aSatz3_3, aSatz3_4, aSatz3_5a, aSatz3_5b, % 22.31/3.86 aSatz3_6a, aSatz3_6b, aSatz3_7a, aSatz3_7b, aSatz4_11a, aSatz4_11b, aSatz4_11c, % 22.31/3.86 aSatz4_11d, aSatz4_11e, aSatz4_12, aSatz4_12b, aSatz4_13, aSatz4_14, aSatz4_16, % 22.31/3.86 aSatz4_17, aSatz4_18, aSatz4_19, aSatz4_2, aSatz4_3, aSatz4_5, aSatz4_6, % 22.31/3.86 aSatz5_1, aSatz5_10, aSatz5_11, aSatz5_12a1, aSatz5_12a2, aSatz5_12b, aSatz5_2, % 22.31/3.86 aSatz5_3, aSatz5_5a, aSatz5_5b, aSatz5_6, aSatz5_7, aSatz5_8, aSatz5_9, % 22.31/3.86 aSatz6_11a, aSatz6_11b, aSatz6_13a, aSatz6_13b, aSatz6_15a, aSatz6_15b, % 22.31/3.86 aSatz6_15c, aSatz6_15d, aSatz6_16a, aSatz6_16b, aSatz6_17a, aSatz6_17b, % 22.31/3.86 aSatz6_18, aSatz6_21, aSatz6_25, aSatz6_28, aSatz6_2a, aSatz6_2b, aSatz6_3a, % 22.31/3.86 aSatz6_3b, aSatz6_4a, aSatz6_4b, aSatz6_5, aSatz6_6, aSatz6_7, aSatz7_2, % 22.31/3.86 aSatz7_3a, aSatz7_3b, aSatz7_4a, aSatz7_4b, aSatz7_6, d_Defn2_10, d_Defn4_1, % 22.31/3.86 d_Defn4_10, d_Defn4_15, d_Defn4_4, d_Defn5_4, d_Defn6_1, d_Defn7_1, d_Defn7_23, % 22.31/3.86 d_insert % 22.31/3.86 % 22.31/3.86 Those formulas are unsatisfiable: % 22.31/3.86 --------------------------------- % 22.31/3.86 % 22.31/3.86 Begin of proof % 22.31/3.86 | % 22.31/3.86 | ALPHA: (function-axioms) implies: % 22.31/3.87 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 22.31/3.87 | (s(v3, v2) = v1) | ~ (s(v3, v2) = v0)) % 22.31/3.87 | % 22.31/3.87 | DELTA: instantiating (aSatz7_8) with fresh symbols all_109_0, all_109_1, % 22.31/3.87 | all_109_2, all_109_3 gives: % 22.31/3.87 | (2) ~ (all_109_0 = all_109_2) & s(all_109_3, all_109_0) = all_109_1 & % 22.31/3.87 | s(all_109_3, all_109_2) = all_109_1 & $i(all_109_0) & $i(all_109_1) & % 22.31/3.87 | $i(all_109_2) & $i(all_109_3) % 22.31/3.87 | % 22.31/3.87 | ALPHA: (2) implies: % 22.31/3.87 | (3) ~ (all_109_0 = all_109_2) % 22.31/3.87 | (4) $i(all_109_3) % 22.31/3.87 | (5) $i(all_109_2) % 22.31/3.87 | (6) $i(all_109_0) % 22.31/3.87 | (7) s(all_109_3, all_109_2) = all_109_1 % 22.31/3.87 | (8) s(all_109_3, all_109_0) = all_109_1 % 22.31/3.87 | % 22.31/3.87 | GROUND_INST: instantiating (aSatz7_7) with all_109_3, all_109_2, all_109_1, % 22.31/3.87 | simplifying with (4), (5), (7) gives: % 22.31/3.87 | (9) s(all_109_3, all_109_1) = all_109_2 % 22.31/3.87 | % 22.31/3.87 | GROUND_INST: instantiating (aSatz7_7) with all_109_3, all_109_0, all_109_1, % 22.31/3.87 | simplifying with (4), (6), (8) gives: % 22.31/3.87 | (10) s(all_109_3, all_109_1) = all_109_0 % 22.31/3.87 | % 22.31/3.87 | GROUND_INST: instantiating (1) with all_109_2, all_109_0, all_109_1, % 22.31/3.87 | all_109_3, simplifying with (9), (10) gives: % 22.31/3.87 | (11) all_109_0 = all_109_2 % 22.31/3.87 | % 22.31/3.87 | REDUCE: (3), (11) imply: % 22.31/3.87 | (12) $false % 22.31/3.88 | % 22.31/3.88 | CLOSE: (12) is inconsistent. % 22.31/3.88 | % 22.31/3.88 End of proof % 22.31/3.88 % SZS output end Proof for theBenchmark % 22.31/3.88 % 22.31/3.88 3232ms %------------------------------------------------------------------------------