%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SYN929+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 : n026.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:15 EDT 2023 % Result : Theorem 2.92s 1.15s % Output : Proof 3.35s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SYN929+1 : TPTP v8.1.2. Released v3.1.0. % 0.00/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.33 % Computer : n026.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 300 % 0.13/0.33 % DateTime : Sat Aug 26 19:44:33 EDT 2023 % 0.13/0.33 % CPUTime : % 0.18/0.60 ________ _____ % 0.18/0.60 ___ __ \_________(_)________________________________ % 0.18/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.18/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.18/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.18/0.60 % 0.18/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.18/0.60 (2023-06-19) % 0.18/0.60 % 0.18/0.60 (c) Philipp Rümmer, 2009-2023 % 0.18/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.18/0.60 Amanda Stjerna. % 0.18/0.60 Free software under BSD-3-Clause. % 0.18/0.60 % 0.18/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.18/0.60 % 0.18/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.18/0.62 Running up to 7 provers in parallel. % 0.18/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.18/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.18/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.18/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.18/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.18/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.18/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.69/0.97 Prover 1: Preprocessing ... % 1.69/0.97 Prover 4: Preprocessing ... % 2.04/1.03 Prover 3: Preprocessing ... % 2.04/1.03 Prover 0: Preprocessing ... % 2.04/1.03 Prover 6: Preprocessing ... % 2.04/1.03 Prover 5: Preprocessing ... % 2.04/1.03 Prover 2: Preprocessing ... % 2.46/1.07 Prover 4: Constructing countermodel ... % 2.46/1.07 Prover 5: Constructing countermodel ... % 2.46/1.07 Prover 3: Constructing countermodel ... % 2.46/1.07 Prover 2: Constructing countermodel ... % 2.46/1.07 Prover 1: Constructing countermodel ... % 2.46/1.08 Prover 6: Proving ... % 2.46/1.08 Prover 0: Proving ... % 2.92/1.14 Prover 3: proved (508ms) % 2.92/1.15 % 2.92/1.15 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.92/1.15 % 2.92/1.15 Prover 5: proved (508ms) % 2.92/1.15 % 2.92/1.15 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.92/1.15 % 2.92/1.15 Prover 2: proved (515ms) % 2.92/1.15 % 2.92/1.15 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.92/1.15 % 2.92/1.15 Prover 0: stopped % 2.92/1.15 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 2.92/1.15 Prover 6: stopped % 2.92/1.16 Prover 1: Found proof (size 7) % 2.92/1.16 Prover 4: Found proof (size 4) % 2.92/1.16 Prover 1: proved (528ms) % 2.92/1.16 Prover 4: proved (519ms) % 2.92/1.16 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 2.92/1.16 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 2.92/1.16 Prover 7: Preprocessing ... % 2.92/1.16 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 2.92/1.16 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 2.92/1.16 Prover 8: Preprocessing ... % 2.92/1.16 Prover 10: Preprocessing ... % 2.92/1.16 Prover 11: Preprocessing ... % 2.92/1.17 Prover 13: Preprocessing ... % 2.92/1.17 Prover 7: Constructing countermodel ... % 2.92/1.17 Prover 10: Constructing countermodel ... % 2.92/1.17 Prover 10: stopped % 2.92/1.17 Prover 7: stopped % 2.92/1.17 Prover 8: Warning: ignoring some quantifiers % 2.92/1.18 Prover 13: Constructing countermodel ... % 2.92/1.18 Prover 8: Constructing countermodel ... % 2.92/1.18 Prover 13: stopped % 2.92/1.18 Prover 8: stopped % 2.92/1.18 Prover 11: Constructing countermodel ... % 2.92/1.18 Prover 11: stopped % 2.92/1.18 % 2.92/1.18 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.92/1.18 % 2.92/1.18 % SZS output start Proof for theBenchmark % 2.92/1.19 Assumptions after simplification: % 2.92/1.19 --------------------------------- % 2.92/1.19 % 2.92/1.19 (prove_this) % 3.35/1.23 ! [v0: $i] : ( ~ (p(v0) = 0) | ~ $i(v0)) & ? [v0: $i] : ? [v1: int] : ( ~ % 3.35/1.23 (v1 = 0) & p(v0) = v1 & $i(v0) & ? [v2: $i] : (p(v2) = 0 & $i(v2))) % 3.35/1.23 % 3.35/1.23 Those formulas are unsatisfiable: % 3.35/1.23 --------------------------------- % 3.35/1.23 % 3.35/1.23 Begin of proof % 3.35/1.23 | % 3.35/1.23 | ALPHA: (prove_this) implies: % 3.35/1.23 | (1) ! [v0: $i] : ( ~ (p(v0) = 0) | ~ $i(v0)) % 3.35/1.24 | (2) ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & p(v0) = v1 & $i(v0) & ? % 3.35/1.24 | [v2: $i] : (p(v2) = 0 & $i(v2))) % 3.35/1.24 | % 3.35/1.24 | DELTA: instantiating (2) with fresh symbols all_4_0, all_4_1 gives: % 3.35/1.24 | (3) ~ (all_4_0 = 0) & p(all_4_1) = all_4_0 & $i(all_4_1) & ? [v0: $i] : % 3.35/1.24 | (p(v0) = 0 & $i(v0)) % 3.35/1.24 | % 3.35/1.24 | ALPHA: (3) implies: % 3.35/1.24 | (4) ? [v0: $i] : (p(v0) = 0 & $i(v0)) % 3.35/1.24 | % 3.35/1.24 | DELTA: instantiating (4) with fresh symbol all_6_0 gives: % 3.35/1.24 | (5) p(all_6_0) = 0 & $i(all_6_0) % 3.35/1.24 | % 3.35/1.24 | ALPHA: (5) implies: % 3.35/1.24 | (6) $i(all_6_0) % 3.35/1.24 | (7) p(all_6_0) = 0 % 3.35/1.24 | % 3.35/1.24 | GROUND_INST: instantiating (1) with all_6_0, simplifying with (6), (7) gives: % 3.35/1.24 | (8) $false % 3.35/1.24 | % 3.35/1.24 | CLOSE: (8) is inconsistent. % 3.35/1.24 | % 3.35/1.24 End of proof % 3.35/1.24 % SZS output end Proof for theBenchmark % 3.35/1.24 % 3.35/1.24 638ms %------------------------------------------------------------------------------