%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : DAT084_1 : TPTP v8.1.2. Released v6.1.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n002.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 22:19:08 EDT 2023 % Result : Theorem 6.12s 1.51s % Output : Proof 7.16s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : DAT084_1 : TPTP v8.1.2. Released v6.1.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n002.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 : Thu Aug 24 14:16:01 EDT 2023 % 0.13/0.34 % CPUTime : % 0.19/0.56 ________ _____ % 0.19/0.56 ___ __ \_________(_)________________________________ % 0.19/0.56 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.56 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.56 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.56 % 0.19/0.56 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.56 (2023-06-19) % 0.19/0.56 % 0.19/0.56 (c) Philipp Rümmer, 2009-2023 % 0.19/0.56 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.56 Amanda Stjerna. % 0.19/0.56 Free software under BSD-3-Clause. % 0.19/0.56 % 0.19/0.56 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.56 % 0.19/0.56 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.19/0.57 Running up to 7 provers in parallel. % 0.19/0.58 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.58 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.58 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.58 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.58 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.58 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.58 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.63/1.03 Prover 1: Preprocessing ... % 2.63/1.03 Prover 4: Preprocessing ... % 2.75/1.07 Prover 6: Preprocessing ... % 2.75/1.07 Prover 2: Preprocessing ... % 2.75/1.07 Prover 5: Preprocessing ... % 2.75/1.07 Prover 0: Preprocessing ... % 2.75/1.07 Prover 3: Preprocessing ... % 5.15/1.40 Prover 1: Constructing countermodel ... % 5.28/1.40 Prover 4: Constructing countermodel ... % 5.28/1.40 Prover 6: Proving ... % 5.39/1.41 Prover 0: Proving ... % 5.39/1.42 Prover 3: Constructing countermodel ... % 5.39/1.43 Prover 5: Proving ... % 5.39/1.49 Prover 2: Proving ... % 6.12/1.51 Prover 3: proved (933ms) % 6.12/1.51 % 6.12/1.51 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.12/1.51 % 6.12/1.51 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 6.12/1.52 Prover 5: proved (938ms) % 6.12/1.52 Prover 6: proved (937ms) % 6.12/1.52 % 6.12/1.52 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.12/1.52 % 6.12/1.52 % 6.12/1.52 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.12/1.52 % 6.12/1.52 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 6.12/1.52 Prover 0: proved (945ms) % 6.12/1.52 % 6.12/1.52 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.12/1.52 % 6.12/1.52 Prover 2: stopped % 6.12/1.52 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 6.12/1.53 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 6.12/1.53 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 6.12/1.54 Prover 1: Found proof (size 10) % 6.12/1.54 Prover 4: Found proof (size 10) % 6.12/1.54 Prover 4: proved (958ms) % 6.12/1.54 Prover 1: proved (960ms) % 6.12/1.56 Prover 8: Preprocessing ... % 6.12/1.57 Prover 10: Preprocessing ... % 6.12/1.57 Prover 11: Preprocessing ... % 6.12/1.57 Prover 7: Preprocessing ... % 6.12/1.58 Prover 13: Preprocessing ... % 6.12/1.59 Prover 10: stopped % 6.12/1.60 Prover 11: stopped % 6.73/1.60 Prover 7: stopped % 6.73/1.61 Prover 13: stopped % 6.73/1.64 Prover 8: Warning: ignoring some quantifiers % 6.73/1.65 Prover 8: Constructing countermodel ... % 6.73/1.66 Prover 8: stopped % 6.73/1.66 % 6.73/1.66 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.73/1.66 % 6.73/1.66 % SZS output start Proof for theBenchmark % 6.73/1.66 Assumptions after simplification: % 6.73/1.66 --------------------------------- % 6.73/1.66 % 6.73/1.66 (c) % 7.16/1.68 ? [v0: list] : ? [v1: int] : ? [v2: list] : (length(v2) = v1 & length(v0) = % 7.16/1.68 v1 & cons(1, v0) = v2 & list(v2) & list(v0)) % 7.16/1.68 % 7.16/1.68 (l_1) % 7.16/1.69 ! [v0: int] : ! [v1: list] : ! [v2: list] : ( ~ (cons(v0, v1) = v2) | ~ % 7.16/1.69 list(v1) | ? [v3: int] : (length(v2) = v3 & length(v1) = $sum(v3, -1))) % 7.16/1.69 % 7.16/1.69 (function-axioms) % 7.16/1.69 ! [v0: list] : ! [v1: list] : ! [v2: list] : ! [v3: list] : (v1 = v0 | ~ % 7.16/1.69 (append(v3, v2) = v1) | ~ (append(v3, v2) = v0)) & ! [v0: int] : ! [v1: % 7.16/1.69 int] : ! [v2: list] : ! [v3: int] : (v1 = v0 | ~ (count(v3, v2) = v1) | % 7.16/1.69 ~ (count(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 7.16/1.69 MultipleValueBool] : ! [v2: list] : ! [v3: int] : (v1 = v0 | ~ % 7.16/1.69 (inRange(v3, v2) = v1) | ~ (inRange(v3, v2) = v0)) & ! [v0: % 7.16/1.69 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: list] : ! [v3: % 7.16/1.69 int] : (v1 = v0 | ~ (in(v3, v2) = v1) | ~ (in(v3, v2) = v0)) & ! [v0: % 7.16/1.69 list] : ! [v1: list] : ! [v2: list] : ! [v3: int] : (v1 = v0 | ~ % 7.16/1.69 (cons(v3, v2) = v1) | ~ (cons(v3, v2) = v0)) & ! [v0: int] : ! [v1: int] % 7.16/1.69 : ! [v2: list] : (v1 = v0 | ~ (length(v2) = v1) | ~ (length(v2) = v0)) & ! % 7.16/1.69 [v0: list] : ! [v1: list] : ! [v2: list] : (v1 = v0 | ~ (tail(v2) = v1) | % 7.16/1.69 ~ (tail(v2) = v0)) & ! [v0: int] : ! [v1: int] : ! [v2: list] : (v1 = v0 % 7.16/1.69 | ~ (head(v2) = v1) | ~ (head(v2) = v0)) % 7.16/1.69 % 7.16/1.69 Further assumptions not needed in the proof: % 7.16/1.69 -------------------------------------------- % 7.16/1.69 a, a_3, a_4, a_8, inRange, in_conv, l, l1, l2, l3, l4, l_6, l_7 % 7.16/1.69 % 7.16/1.69 Those formulas are unsatisfiable: % 7.16/1.69 --------------------------------- % 7.16/1.69 % 7.16/1.69 Begin of proof % 7.16/1.69 | % 7.16/1.70 | ALPHA: (function-axioms) implies: % 7.16/1.70 | (1) ! [v0: int] : ! [v1: int] : ! [v2: list] : (v1 = v0 | ~ (length(v2) % 7.16/1.70 | = v1) | ~ (length(v2) = v0)) % 7.16/1.70 | % 7.16/1.70 | DELTA: instantiating (c) with fresh symbols all_19_0, all_19_1, all_19_2 % 7.16/1.70 | gives: % 7.16/1.70 | (2) length(all_19_0) = all_19_1 & length(all_19_2) = all_19_1 & cons(1, % 7.16/1.70 | all_19_2) = all_19_0 & list(all_19_0) & list(all_19_2) % 7.16/1.70 | % 7.16/1.70 | ALPHA: (2) implies: % 7.16/1.70 | (3) list(all_19_2) % 7.16/1.70 | (4) cons(1, all_19_2) = all_19_0 % 7.16/1.70 | (5) length(all_19_2) = all_19_1 % 7.16/1.70 | (6) length(all_19_0) = all_19_1 % 7.16/1.70 | % 7.16/1.70 | GROUND_INST: instantiating (l_1) with 1, all_19_2, all_19_0, simplifying with % 7.16/1.70 | (3), (4) gives: % 7.16/1.70 | (7) ? [v0: int] : (length(all_19_0) = v0 & length(all_19_2) = $sum(v0, % 7.16/1.70 | -1)) % 7.16/1.70 | % 7.16/1.70 | DELTA: instantiating (7) with fresh symbol all_27_0 gives: % 7.16/1.70 | (8) length(all_19_0) = all_27_0 & length(all_19_2) = $sum(all_27_0, -1) % 7.16/1.70 | % 7.16/1.70 | ALPHA: (8) implies: % 7.16/1.70 | (9) length(all_19_2) = $sum(all_27_0, -1) % 7.16/1.71 | (10) length(all_19_0) = all_27_0 % 7.16/1.71 | % 7.16/1.71 | GROUND_INST: instantiating (1) with all_19_1, $sum(all_27_0, -1), all_19_2, % 7.16/1.71 | simplifying with (5), (9) gives: % 7.16/1.71 | (11) $difference(all_27_0, all_19_1) = 1 % 7.16/1.71 | % 7.16/1.71 | GROUND_INST: instantiating (1) with all_19_1, all_27_0, all_19_0, simplifying % 7.16/1.71 | with (6), (10) gives: % 7.16/1.71 | (12) all_27_0 = all_19_1 % 7.16/1.71 | % 7.16/1.71 | COMBINE_EQS: (11), (12) imply: % 7.16/1.71 | (13) $false % 7.16/1.71 | % 7.16/1.71 | CLOSE: (13) is inconsistent. % 7.16/1.71 | % 7.16/1.71 End of proof % 7.16/1.71 % SZS output end Proof for theBenchmark % 7.16/1.71 % 7.16/1.71 1151ms %------------------------------------------------------------------------------