%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : DAT079_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 : 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 : Wed Aug 30 22:19:07 EDT 2023 % Result : Theorem 6.48s 1.63s % Output : Proof 8.15s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : DAT079_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 : 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 : Thu Aug 24 14:04:30 EDT 2023 % 0.13/0.34 % CPUTime : % 0.19/0.58 ________ _____ % 0.19/0.58 ___ __ \_________(_)________________________________ % 0.19/0.58 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.58 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.58 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.58 % 0.19/0.58 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.58 (2023-06-19) % 0.19/0.58 % 0.19/0.58 (c) Philipp Rümmer, 2009-2023 % 0.19/0.58 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.58 Amanda Stjerna. % 0.19/0.58 Free software under BSD-3-Clause. % 0.19/0.58 % 0.19/0.58 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.58 % 0.19/0.58 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.19/0.59 Running up to 7 provers in parallel. % 0.19/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.09/1.04 Prover 1: Preprocessing ... % 2.09/1.04 Prover 4: Preprocessing ... % 2.77/1.08 Prover 6: Preprocessing ... % 2.77/1.08 Prover 3: Preprocessing ... % 2.77/1.08 Prover 0: Preprocessing ... % 2.77/1.08 Prover 5: Preprocessing ... % 2.77/1.08 Prover 2: Preprocessing ... % 4.92/1.42 Prover 1: Constructing countermodel ... % 4.92/1.43 Prover 4: Constructing countermodel ... % 4.92/1.44 Prover 3: Constructing countermodel ... % 4.92/1.45 Prover 5: Proving ... % 4.92/1.45 Prover 6: Proving ... % 4.92/1.45 Prover 0: Proving ... % 4.92/1.47 Prover 2: Proving ... % 6.48/1.63 Prover 3: proved (1018ms) % 6.48/1.63 % 6.48/1.63 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.48/1.63 % 6.48/1.64 Prover 2: stopped % 6.48/1.64 Prover 0: stopped % 6.48/1.64 Prover 5: stopped % 6.48/1.64 Prover 6: stopped % 6.48/1.65 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 6.48/1.65 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 6.48/1.65 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 6.48/1.65 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 6.48/1.65 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 6.48/1.70 Prover 11: Preprocessing ... % 6.48/1.70 Prover 7: Preprocessing ... % 6.48/1.71 Prover 10: Preprocessing ... % 6.48/1.71 Prover 13: Preprocessing ... % 7.13/1.72 Prover 8: Preprocessing ... % 7.13/1.76 Prover 4: Found proof (size 14) % 7.13/1.76 Prover 4: proved (1155ms) % 7.13/1.77 Prover 1: stopped % 7.63/1.80 Prover 7: Warning: ignoring some quantifiers % 7.63/1.80 Prover 7: Constructing countermodel ... % 7.63/1.81 Prover 13: Warning: ignoring some quantifiers % 7.63/1.81 Prover 7: stopped % 7.63/1.82 Prover 13: Constructing countermodel ... % 7.63/1.82 Prover 10: Warning: ignoring some quantifiers % 7.63/1.83 Prover 8: Warning: ignoring some quantifiers % 7.63/1.83 Prover 13: stopped % 7.63/1.83 Prover 10: Constructing countermodel ... % 7.63/1.83 Prover 8: Constructing countermodel ... % 7.63/1.83 Prover 10: stopped % 7.63/1.84 Prover 8: stopped % 7.63/1.84 Prover 11: Constructing countermodel ... % 7.63/1.85 Prover 11: stopped % 7.63/1.85 % 7.63/1.85 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 7.63/1.85 % 7.63/1.85 % SZS output start Proof for theBenchmark % 7.63/1.86 Assumptions after simplification: % 7.63/1.86 --------------------------------- % 7.63/1.86 % 7.63/1.86 (c) % 8.15/1.88 list(nil) & ? [v0: list] : ? [v1: list] : ? [v2: list] : ? [v3: int] : ( ~ % 8.15/1.88 (v3 = 0) & in(2, v2) = v3 & cons(3, nil) = v0 & cons(2, v0) = v1 & cons(1, % 8.15/1.88 v1) = v2 & list(v2) & list(v1) & list(v0)) % 8.15/1.88 % 8.15/1.88 (in_conv) % 8.15/1.88 ! [v0: int] : ! [v1: list] : ! [v2: int] : ! [v3: int] : ! [v4: list] : % 8.15/1.88 (v2 = 0 | ~ (in(v0, v1) = v2) | ~ (cons(v3, v4) = v1) | ~ list(v4) | ~ % 8.15/1.88 list(v1) | ? [v5: int] : ( ~ (v5 = 0) & in(v0, v4) = v5)) & ! [v0: int] : % 8.15/1.88 ! [v1: list] : ! [v2: int] : ! [v3: list] : (v2 = 0 | ~ (in(v0, v1) = v2) | % 8.15/1.88 ~ (cons(v0, v3) = v1) | ~ list(v3) | ~ list(v1)) & ! [v0: int] : ! [v1: % 8.15/1.88 list] : ( ~ (in(v0, v1) = 0) | ~ list(v1) | ? [v2: int] : ? [v3: list] : % 8.15/1.88 ? [v4: list] : ? [v5: int] : ? [v6: int] : ? [v7: list] : ? [v8: list] : % 8.15/1.88 (list(v7) & list(v3) & ((v8 = v1 & v6 = v0 & cons(v0, v7) = v1) | (v5 = 0 & % 8.15/1.88 v4 = v1 & in(v0, v3) = 0 & cons(v2, v3) = v1)))) % 8.15/1.88 % 8.15/1.88 Further assumptions not needed in the proof: % 8.15/1.88 -------------------------------------------- % 8.15/1.88 a, a_3, a_4, a_8, inRange, l, l1, l2, l3, l4, l_1, l_6, l_7 % 8.15/1.88 % 8.15/1.88 Those formulas are unsatisfiable: % 8.15/1.88 --------------------------------- % 8.15/1.88 % 8.15/1.88 Begin of proof % 8.15/1.88 | % 8.15/1.88 | ALPHA: (in_conv) implies: % 8.15/1.89 | (1) ! [v0: int] : ! [v1: list] : ! [v2: int] : ! [v3: list] : (v2 = 0 | % 8.15/1.89 | ~ (in(v0, v1) = v2) | ~ (cons(v0, v3) = v1) | ~ list(v3) | ~ % 8.15/1.89 | list(v1)) % 8.15/1.89 | (2) ! [v0: int] : ! [v1: list] : ! [v2: int] : ! [v3: int] : ! [v4: % 8.15/1.89 | list] : (v2 = 0 | ~ (in(v0, v1) = v2) | ~ (cons(v3, v4) = v1) | ~ % 8.15/1.89 | list(v4) | ~ list(v1) | ? [v5: int] : ( ~ (v5 = 0) & in(v0, v4) = % 8.15/1.89 | v5)) % 8.15/1.89 | % 8.15/1.89 | ALPHA: (c) implies: % 8.15/1.89 | (3) ? [v0: list] : ? [v1: list] : ? [v2: list] : ? [v3: int] : ( ~ (v3 % 8.15/1.89 | = 0) & in(2, v2) = v3 & cons(3, nil) = v0 & cons(2, v0) = v1 & % 8.15/1.89 | cons(1, v1) = v2 & list(v2) & list(v1) & list(v0)) % 8.15/1.89 | % 8.15/1.89 | DELTA: instantiating (3) with fresh symbols all_19_0, all_19_1, all_19_2, % 8.15/1.89 | all_19_3 gives: % 8.15/1.89 | (4) ~ (all_19_0 = 0) & in(2, all_19_1) = all_19_0 & cons(3, nil) = % 8.15/1.89 | all_19_3 & cons(2, all_19_3) = all_19_2 & cons(1, all_19_2) = all_19_1 % 8.15/1.89 | & list(all_19_1) & list(all_19_2) & list(all_19_3) % 8.15/1.89 | % 8.15/1.89 | ALPHA: (4) implies: % 8.15/1.89 | (5) ~ (all_19_0 = 0) % 8.15/1.89 | (6) list(all_19_3) % 8.15/1.89 | (7) list(all_19_2) % 8.15/1.89 | (8) list(all_19_1) % 8.15/1.89 | (9) cons(1, all_19_2) = all_19_1 % 8.15/1.89 | (10) cons(2, all_19_3) = all_19_2 % 8.15/1.89 | (11) in(2, all_19_1) = all_19_0 % 8.15/1.89 | % 8.15/1.89 | GROUND_INST: instantiating (2) with 2, all_19_1, all_19_0, 1, all_19_2, % 8.15/1.90 | simplifying with (7), (8), (9), (11) gives: % 8.15/1.90 | (12) all_19_0 = 0 | ? [v0: int] : ( ~ (v0 = 0) & in(2, all_19_2) = v0) % 8.15/1.90 | % 8.15/1.90 | BETA: splitting (12) gives: % 8.15/1.90 | % 8.15/1.90 | Case 1: % 8.15/1.90 | | % 8.15/1.90 | | (13) all_19_0 = 0 % 8.15/1.90 | | % 8.15/1.90 | | REDUCE: (5), (13) imply: % 8.15/1.90 | | (14) $false % 8.15/1.90 | | % 8.15/1.90 | | CLOSE: (14) is inconsistent. % 8.15/1.90 | | % 8.15/1.90 | Case 2: % 8.15/1.90 | | % 8.15/1.90 | | (15) ? [v0: int] : ( ~ (v0 = 0) & in(2, all_19_2) = v0) % 8.15/1.90 | | % 8.15/1.90 | | DELTA: instantiating (15) with fresh symbol all_43_0 gives: % 8.15/1.90 | | (16) ~ (all_43_0 = 0) & in(2, all_19_2) = all_43_0 % 8.15/1.90 | | % 8.15/1.90 | | ALPHA: (16) implies: % 8.15/1.90 | | (17) ~ (all_43_0 = 0) % 8.15/1.90 | | (18) in(2, all_19_2) = all_43_0 % 8.15/1.90 | | % 8.15/1.90 | | GROUND_INST: instantiating (1) with 2, all_19_2, all_43_0, all_19_3, % 8.15/1.90 | | simplifying with (6), (7), (10), (18) gives: % 8.15/1.90 | | (19) all_43_0 = 0 % 8.15/1.90 | | % 8.15/1.90 | | REDUCE: (17), (19) imply: % 8.15/1.90 | | (20) $false % 8.15/1.90 | | % 8.15/1.90 | | CLOSE: (20) is inconsistent. % 8.15/1.90 | | % 8.15/1.90 | End of split % 8.15/1.90 | % 8.15/1.90 End of proof % 8.15/1.90 % SZS output end Proof for theBenchmark % 8.15/1.90 % 8.15/1.90 1317ms %------------------------------------------------------------------------------