%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SYN919+1 : TPTP v8.1.2. Released v3.1.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n008.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 : Fri Sep 1 03:29:13 EDT 2023 % Result : Theorem 3.21s 1.17s % Output : Proof 4.02s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SYN919+1 : TPTP v8.1.2. Released v3.1.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.15/0.34 % Computer : n008.cluster.edu % 0.15/0.34 % Model : x86_64 x86_64 % 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.34 % Memory : 8042.1875MB % 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.34 % CPULimit : 300 % 0.15/0.34 % WCLimit : 300 % 0.15/0.34 % DateTime : Sat Aug 26 20:47:02 EDT 2023 % 0.15/0.34 % CPUTime : % 0.19/0.62 ________ _____ % 0.19/0.62 ___ __ \_________(_)________________________________ % 0.19/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.62 % 0.19/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.62 (2023-06-19) % 0.19/0.62 % 0.19/0.62 (c) Philipp Rümmer, 2009-2023 % 0.19/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.62 Amanda Stjerna. % 0.19/0.62 Free software under BSD-3-Clause. % 0.19/0.62 % 0.19/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.62 % 0.19/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.19/0.63 Running up to 7 provers in parallel. % 0.19/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 0.19/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 1.74/0.96 Prover 4: Preprocessing ... % 1.74/0.96 Prover 1: Preprocessing ... % 2.14/1.00 Prover 3: Preprocessing ... % 2.14/1.00 Prover 0: Preprocessing ... % 2.14/1.00 Prover 2: Preprocessing ... % 2.14/1.00 Prover 5: Preprocessing ... % 2.14/1.00 Prover 6: Preprocessing ... % 2.69/1.06 Prover 6: Proving ... % 2.69/1.06 Prover 1: Constructing countermodel ... % 2.69/1.07 Prover 5: Constructing countermodel ... % 2.69/1.07 Prover 2: Constructing countermodel ... % 2.69/1.08 Prover 3: Constructing countermodel ... % 2.83/1.09 Prover 4: Constructing countermodel ... % 2.83/1.10 Prover 0: Proving ... % 3.21/1.17 Prover 0: proved (527ms) % 3.21/1.17 % 3.21/1.17 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.21/1.17 % 3.21/1.17 Prover 5: proved (520ms) % 3.21/1.17 % 3.21/1.17 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.21/1.17 % 3.21/1.17 Prover 3: proved (527ms) % 3.21/1.17 Prover 2: proved (526ms) % 3.21/1.17 % 3.21/1.17 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.21/1.17 % 3.21/1.17 % 3.21/1.17 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.21/1.17 % 3.21/1.17 Prover 6: stopped % 3.21/1.17 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.21/1.17 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.21/1.17 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.21/1.17 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 3.21/1.17 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.21/1.18 Prover 7: Preprocessing ... % 3.21/1.19 Prover 4: Found proof (size 12) % 3.21/1.19 Prover 8: Preprocessing ... % 3.21/1.19 Prover 4: proved (547ms) % 3.21/1.19 Prover 11: Preprocessing ... % 3.21/1.19 Prover 1: stopped % 3.21/1.19 Prover 7: Constructing countermodel ... % 3.21/1.20 Prover 7: stopped % 3.21/1.20 Prover 10: Preprocessing ... % 3.21/1.20 Prover 13: Preprocessing ... % 3.21/1.21 Prover 10: Constructing countermodel ... % 3.21/1.21 Prover 10: stopped % 3.21/1.21 Prover 13: Constructing countermodel ... % 3.21/1.21 Prover 13: stopped % 3.21/1.21 Prover 8: Warning: ignoring some quantifiers % 3.21/1.21 Prover 8: Constructing countermodel ... % 3.79/1.22 Prover 8: stopped % 3.79/1.24 Prover 11: Constructing countermodel ... % 3.79/1.24 Prover 11: stopped % 3.79/1.24 % 3.79/1.24 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.79/1.24 % 3.79/1.24 % SZS output start Proof for theBenchmark % 3.79/1.24 Assumptions after simplification: % 3.79/1.24 --------------------------------- % 3.79/1.24 % 3.79/1.24 (prove_this) % 3.79/1.28 ? [v0: $i] : ? [v1: $i] : ? [v2: int] : ( ~ (v2 = 0) & r(v0, v1) = 0 & % 3.79/1.28 r(v0, v0) = v2 & $i(v1) & $i(v0) & ! [v3: $i] : ! [v4: $i] : ! [v5: $i] : % 3.79/1.28 ! [v6: int] : (v6 = 0 | ~ (r(v4, v5) = 0) | ~ (r(v3, v5) = v6) | ~ % 3.79/1.28 $i(v5) | ~ $i(v4) | ~ $i(v3) | ? [v7: int] : ( ~ (v7 = 0) & r(v3, v4) = % 3.79/1.28 v7)) & ! [v3: $i] : ! [v4: $i] : ! [v5: $i] : ! [v6: int] : (v6 = 0 % 3.79/1.28 | ~ (r(v3, v5) = v6) | ~ (r(v3, v4) = 0) | ~ $i(v5) | ~ $i(v4) | ~ % 4.02/1.28 $i(v3) | ? [v7: int] : ( ~ (v7 = 0) & r(v4, v5) = v7)) & ! [v3: $i] : ! % 4.02/1.28 [v4: $i] : ! [v5: int] : (v5 = 0 | ~ (r(v4, v3) = v5) | ~ $i(v4) | ~ % 4.02/1.28 $i(v3) | ? [v6: int] : ( ~ (v6 = 0) & r(v3, v4) = v6)) & ! [v3: $i] : ! % 4.02/1.28 [v4: $i] : ! [v5: $i] : ( ~ (r(v4, v5) = 0) | ~ (r(v3, v4) = 0) | ~ % 4.02/1.28 $i(v5) | ~ $i(v4) | ~ $i(v3) | r(v3, v5) = 0) & ! [v3: $i] : ! [v4: % 4.02/1.28 $i] : ( ~ (r(v3, v4) = 0) | ~ $i(v4) | ~ $i(v3) | r(v4, v3) = 0)) % 4.02/1.28 % 4.02/1.28 (function-axioms) % 4.02/1.28 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 4.02/1.28 [v3: $i] : (v1 = v0 | ~ (r(v3, v2) = v1) | ~ (r(v3, v2) = v0)) % 4.02/1.28 % 4.02/1.28 Those formulas are unsatisfiable: % 4.02/1.28 --------------------------------- % 4.02/1.28 % 4.02/1.28 Begin of proof % 4.02/1.28 | % 4.02/1.28 | DELTA: instantiating (prove_this) with fresh symbols all_3_0, all_3_1, all_3_2 % 4.02/1.28 | gives: % 4.02/1.29 | (1) ~ (all_3_0 = 0) & r(all_3_2, all_3_1) = 0 & r(all_3_2, all_3_2) = % 4.02/1.29 | all_3_0 & $i(all_3_1) & $i(all_3_2) & ! [v0: $i] : ! [v1: $i] : ! % 4.02/1.29 | [v2: $i] : ! [v3: int] : (v3 = 0 | ~ (r(v1, v2) = 0) | ~ (r(v0, v2) % 4.02/1.29 | = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v4: int] : ( ~ (v4 % 4.02/1.29 | = 0) & r(v0, v1) = v4)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] % 4.02/1.29 | : ! [v3: int] : (v3 = 0 | ~ (r(v0, v2) = v3) | ~ (r(v0, v1) = 0) | % 4.02/1.29 | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v4: int] : ( ~ (v4 = 0) & % 4.02/1.29 | r(v1, v2) = v4)) & ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = % 4.02/1.29 | 0 | ~ (r(v1, v0) = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: int] : ( ~ % 4.02/1.29 | (v3 = 0) & r(v0, v1) = v3)) & ! [v0: $i] : ! [v1: $i] : ! [v2: % 4.02/1.29 | $i] : ( ~ (r(v1, v2) = 0) | ~ (r(v0, v1) = 0) | ~ $i(v2) | ~ % 4.02/1.29 | $i(v1) | ~ $i(v0) | r(v0, v2) = 0) & ! [v0: $i] : ! [v1: $i] : ( ~ % 4.02/1.29 | (r(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0) | r(v1, v0) = 0) % 4.02/1.29 | % 4.02/1.29 | ALPHA: (1) implies: % 4.02/1.29 | (2) ~ (all_3_0 = 0) % 4.02/1.29 | (3) $i(all_3_2) % 4.02/1.29 | (4) $i(all_3_1) % 4.02/1.29 | (5) r(all_3_2, all_3_2) = all_3_0 % 4.02/1.29 | (6) r(all_3_2, all_3_1) = 0 % 4.02/1.29 | (7) ! [v0: $i] : ! [v1: $i] : ( ~ (r(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0) % 4.02/1.29 | | r(v1, v0) = 0) % 4.02/1.29 | (8) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ % 4.02/1.29 | (r(v0, v2) = v3) | ~ (r(v0, v1) = 0) | ~ $i(v2) | ~ $i(v1) | ~ % 4.02/1.29 | $i(v0) | ? [v4: int] : ( ~ (v4 = 0) & r(v1, v2) = v4)) % 4.02/1.29 | % 4.02/1.29 | GROUND_INST: instantiating (8) with all_3_2, all_3_1, all_3_2, all_3_0, % 4.02/1.30 | simplifying with (3), (4), (5), (6) gives: % 4.02/1.30 | (9) all_3_0 = 0 | ? [v0: int] : ( ~ (v0 = 0) & r(all_3_1, all_3_2) = v0) % 4.02/1.30 | % 4.02/1.30 | GROUND_INST: instantiating (7) with all_3_2, all_3_1, simplifying with (3), % 4.02/1.30 | (4), (6) gives: % 4.02/1.30 | (10) r(all_3_1, all_3_2) = 0 % 4.02/1.30 | % 4.02/1.30 | BETA: splitting (9) gives: % 4.02/1.30 | % 4.02/1.30 | Case 1: % 4.02/1.30 | | % 4.02/1.30 | | (11) all_3_0 = 0 % 4.02/1.30 | | % 4.02/1.30 | | REDUCE: (2), (11) imply: % 4.02/1.30 | | (12) $false % 4.02/1.30 | | % 4.02/1.30 | | CLOSE: (12) is inconsistent. % 4.02/1.30 | | % 4.02/1.30 | Case 2: % 4.02/1.30 | | % 4.02/1.30 | | (13) ? [v0: int] : ( ~ (v0 = 0) & r(all_3_1, all_3_2) = v0) % 4.02/1.30 | | % 4.02/1.30 | | DELTA: instantiating (13) with fresh symbol all_16_0 gives: % 4.02/1.30 | | (14) ~ (all_16_0 = 0) & r(all_3_1, all_3_2) = all_16_0 % 4.02/1.30 | | % 4.02/1.30 | | ALPHA: (14) implies: % 4.02/1.30 | | (15) ~ (all_16_0 = 0) % 4.02/1.30 | | (16) r(all_3_1, all_3_2) = all_16_0 % 4.02/1.30 | | % 4.02/1.30 | | GROUND_INST: instantiating (function-axioms) with 0, all_16_0, all_3_2, % 4.02/1.30 | | all_3_1, simplifying with (10), (16) gives: % 4.02/1.30 | | (17) all_16_0 = 0 % 4.02/1.30 | | % 4.02/1.30 | | REDUCE: (15), (17) imply: % 4.02/1.30 | | (18) $false % 4.02/1.30 | | % 4.02/1.30 | | CLOSE: (18) is inconsistent. % 4.02/1.30 | | % 4.02/1.30 | End of split % 4.02/1.30 | % 4.02/1.30 End of proof % 4.02/1.30 % SZS output end Proof for theBenchmark % 4.02/1.30 % 4.02/1.30 682ms %------------------------------------------------------------------------------