%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : DAT083_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 : n031.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 5.88s 1.62s % Output : Proof 7.48s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : DAT083_1 : TPTP v8.1.2. Released v6.1.0. % 0.13/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n031.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:42:21 EDT 2023 % 0.13/0.34 % CPUTime : % 0.20/0.60 ________ _____ % 0.20/0.60 ___ __ \_________(_)________________________________ % 0.20/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.60 % 0.20/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.60 (2023-06-19) % 0.20/0.60 % 0.20/0.60 (c) Philipp Rümmer, 2009-2023 % 0.20/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.60 Amanda Stjerna. % 0.20/0.60 Free software under BSD-3-Clause. % 0.20/0.60 % 0.20/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.60 % 0.20/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.61 Running up to 7 provers in parallel. % 0.20/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.52/1.08 Prover 4: Preprocessing ... % 2.52/1.08 Prover 1: Preprocessing ... % 2.82/1.13 Prover 3: Preprocessing ... % 2.82/1.13 Prover 6: Preprocessing ... % 2.82/1.13 Prover 2: Preprocessing ... % 2.82/1.13 Prover 0: Preprocessing ... % 2.82/1.13 Prover 5: Preprocessing ... % 5.15/1.47 Prover 1: Constructing countermodel ... % 5.15/1.48 Prover 3: Constructing countermodel ... % 5.15/1.49 Prover 4: Constructing countermodel ... % 5.15/1.49 Prover 6: Proving ... % 5.55/1.51 Prover 5: Proving ... % 5.55/1.51 Prover 0: Proving ... % 5.88/1.59 Prover 2: Proving ... % 5.88/1.62 Prover 0: proved (995ms) % 5.88/1.62 Prover 6: proved (985ms) % 5.88/1.62 % 5.88/1.62 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.88/1.62 % 5.88/1.62 % 5.88/1.62 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.88/1.62 % 5.88/1.62 Prover 3: proved (987ms) % 5.88/1.62 % 5.88/1.62 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 5.88/1.62 % 5.88/1.62 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 5.88/1.62 Prover 5: stopped % 5.88/1.62 Prover 2: stopped % 5.88/1.63 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 5.88/1.63 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.88/1.63 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 5.88/1.63 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 6.54/1.66 Prover 4: Found proof (size 18) % 6.54/1.66 Prover 4: proved (1032ms) % 6.54/1.66 Prover 1: stopped % 6.54/1.67 Prover 10: Preprocessing ... % 6.54/1.67 Prover 8: Preprocessing ... % 6.54/1.68 Prover 7: Preprocessing ... % 6.54/1.69 Prover 13: Preprocessing ... % 6.91/1.70 Prover 7: stopped % 6.91/1.70 Prover 11: Preprocessing ... % 6.91/1.70 Prover 10: stopped % 6.91/1.72 Prover 11: stopped % 6.91/1.73 Prover 13: stopped % 7.22/1.75 Prover 8: Warning: ignoring some quantifiers % 7.22/1.75 Prover 8: Constructing countermodel ... % 7.22/1.76 Prover 8: stopped % 7.22/1.76 % 7.22/1.76 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 7.22/1.76 % 7.22/1.77 % SZS output start Proof for theBenchmark % 7.22/1.77 Assumptions after simplification: % 7.22/1.77 --------------------------------- % 7.22/1.77 % 7.22/1.77 (c) % 7.22/1.79 list(nil) & ? [v0: list] : ? [v1: list] : (length(v1) = 3 & cons(2, nil) = % 7.22/1.79 v0 & cons(1, v0) = v1 & list(v1) & list(v0)) % 7.22/1.79 % 7.22/1.79 (l) % 7.22/1.79 length(nil) = 0 & list(nil) % 7.22/1.79 % 7.22/1.79 (l_1) % 7.22/1.79 ! [v0: int] : ! [v1: list] : ! [v2: list] : ( ~ (cons(v0, v1) = v2) | ~ % 7.22/1.79 list(v1) | ? [v3: int] : (length(v2) = v3 & length(v1) = $sum(v3, -1))) % 7.22/1.79 % 7.22/1.79 (function-axioms) % 7.48/1.80 ! [v0: list] : ! [v1: list] : ! [v2: list] : ! [v3: list] : (v1 = v0 | ~ % 7.48/1.80 (append(v3, v2) = v1) | ~ (append(v3, v2) = v0)) & ! [v0: int] : ! [v1: % 7.48/1.80 int] : ! [v2: list] : ! [v3: int] : (v1 = v0 | ~ (count(v3, v2) = v1) | % 7.48/1.80 ~ (count(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 7.48/1.80 MultipleValueBool] : ! [v2: list] : ! [v3: int] : (v1 = v0 | ~ % 7.48/1.80 (inRange(v3, v2) = v1) | ~ (inRange(v3, v2) = v0)) & ! [v0: % 7.48/1.80 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: list] : ! [v3: % 7.48/1.80 int] : (v1 = v0 | ~ (in(v3, v2) = v1) | ~ (in(v3, v2) = v0)) & ! [v0: % 7.48/1.80 list] : ! [v1: list] : ! [v2: list] : ! [v3: int] : (v1 = v0 | ~ % 7.48/1.80 (cons(v3, v2) = v1) | ~ (cons(v3, v2) = v0)) & ! [v0: int] : ! [v1: int] % 7.48/1.80 : ! [v2: list] : (v1 = v0 | ~ (length(v2) = v1) | ~ (length(v2) = v0)) & ! % 7.48/1.80 [v0: list] : ! [v1: list] : ! [v2: list] : (v1 = v0 | ~ (tail(v2) = v1) | % 7.48/1.80 ~ (tail(v2) = v0)) & ! [v0: int] : ! [v1: int] : ! [v2: list] : (v1 = v0 % 7.48/1.80 | ~ (head(v2) = v1) | ~ (head(v2) = v0)) % 7.48/1.80 % 7.48/1.80 Further assumptions not needed in the proof: % 7.48/1.80 -------------------------------------------- % 7.48/1.80 a, a_3, a_4, a_8, inRange, in_conv, l1, l2, l3, l4, l_6, l_7 % 7.48/1.80 % 7.48/1.80 Those formulas are unsatisfiable: % 7.48/1.80 --------------------------------- % 7.48/1.80 % 7.48/1.80 Begin of proof % 7.48/1.80 | % 7.48/1.80 | ALPHA: (l) implies: % 7.48/1.81 | (1) length(nil) = 0 % 7.48/1.81 | % 7.48/1.81 | ALPHA: (c) implies: % 7.48/1.81 | (2) list(nil) % 7.48/1.81 | (3) ? [v0: list] : ? [v1: list] : (length(v1) = 3 & cons(2, nil) = v0 & % 7.48/1.81 | cons(1, v0) = v1 & list(v1) & list(v0)) % 7.48/1.81 | % 7.48/1.81 | ALPHA: (function-axioms) implies: % 7.48/1.81 | (4) ! [v0: int] : ! [v1: int] : ! [v2: list] : (v1 = v0 | ~ (length(v2) % 7.48/1.81 | = v1) | ~ (length(v2) = v0)) % 7.48/1.81 | % 7.48/1.81 | DELTA: instantiating (3) with fresh symbols all_19_0, all_19_1 gives: % 7.48/1.81 | (5) length(all_19_0) = 3 & cons(2, nil) = all_19_1 & cons(1, all_19_1) = % 7.48/1.81 | all_19_0 & list(all_19_0) & list(all_19_1) % 7.48/1.81 | % 7.48/1.81 | ALPHA: (5) implies: % 7.48/1.81 | (6) list(all_19_1) % 7.48/1.81 | (7) cons(1, all_19_1) = all_19_0 % 7.48/1.81 | (8) cons(2, nil) = all_19_1 % 7.48/1.81 | (9) length(all_19_0) = 3 % 7.48/1.82 | % 7.48/1.82 | GROUND_INST: instantiating (l_1) with 1, all_19_1, all_19_0, simplifying with % 7.48/1.82 | (6), (7) gives: % 7.48/1.82 | (10) ? [v0: int] : (length(all_19_0) = v0 & length(all_19_1) = $sum(v0, % 7.48/1.82 | -1)) % 7.48/1.82 | % 7.48/1.82 | GROUND_INST: instantiating (l_1) with 2, nil, all_19_1, simplifying with (2), % 7.48/1.82 | (8) gives: % 7.48/1.82 | (11) ? [v0: int] : (length(all_19_1) = v0 & length(nil) = $sum(v0, -1)) % 7.48/1.82 | % 7.48/1.82 | DELTA: instantiating (10) with fresh symbol all_27_0 gives: % 7.48/1.82 | (12) length(all_19_0) = all_27_0 & length(all_19_1) = $sum(all_27_0, -1) % 7.48/1.82 | % 7.48/1.82 | ALPHA: (12) implies: % 7.48/1.82 | (13) length(all_19_1) = $sum(all_27_0, -1) % 7.48/1.82 | (14) length(all_19_0) = all_27_0 % 7.48/1.82 | % 7.48/1.82 | DELTA: instantiating (11) with fresh symbol all_29_0 gives: % 7.48/1.82 | (15) length(all_19_1) = all_29_0 & length(nil) = $sum(all_29_0, -1) % 7.48/1.82 | % 7.48/1.82 | ALPHA: (15) implies: % 7.48/1.82 | (16) length(nil) = $sum(all_29_0, -1) % 7.48/1.82 | (17) length(all_19_1) = all_29_0 % 7.48/1.82 | % 7.48/1.82 | GROUND_INST: instantiating (4) with 0, $sum(all_29_0, -1), nil, simplifying % 7.48/1.82 | with (1), (16) gives: % 7.48/1.82 | (18) all_29_0 = 1 % 7.48/1.82 | % 7.48/1.82 | GROUND_INST: instantiating (4) with $sum(all_27_0, -1), all_29_0, all_19_1, % 7.48/1.82 | simplifying with (13), (17) gives: % 7.48/1.82 | (19) $difference(all_29_0, all_27_0) = -1 % 7.48/1.82 | % 7.48/1.83 | GROUND_INST: instantiating (4) with 3, all_27_0, all_19_0, simplifying with % 7.48/1.83 | (9), (14) gives: % 7.48/1.83 | (20) all_27_0 = 3 % 7.48/1.83 | % 7.48/1.83 | COMBINE_EQS: (18), (19) imply: % 7.48/1.83 | (21) all_27_0 = 2 % 7.48/1.83 | % 7.48/1.83 | SIMP: (21) implies: % 7.48/1.83 | (22) all_27_0 = 2 % 7.48/1.83 | % 7.48/1.83 | COMBINE_EQS: (20), (22) imply: % 7.48/1.83 | (23) $false % 7.48/1.83 | % 7.48/1.83 | CLOSE: (23) is inconsistent. % 7.48/1.83 | % 7.48/1.83 End of proof % 7.48/1.83 % SZS output end Proof for theBenchmark % 7.48/1.83 % 7.48/1.83 1225ms %------------------------------------------------------------------------------