%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SYN945+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 : n009.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:19 EDT 2023 % Result : Theorem 2.87s 1.09s % Output : Proof 3.40s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SYN945+1 : TPTP v8.1.2. Released v3.1.0. % 0.06/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.33 % Computer : n009.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 300 % 0.12/0.33 % DateTime : Sat Aug 26 19:21:05 EDT 2023 % 0.12/0.33 % CPUTime : % 0.19/0.59 ________ _____ % 0.19/0.59 ___ __ \_________(_)________________________________ % 0.19/0.59 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.59 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.59 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.59 % 0.19/0.59 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.59 (2023-06-19) % 0.19/0.59 % 0.19/0.59 (c) Philipp Rümmer, 2009-2023 % 0.19/0.59 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.59 Amanda Stjerna. % 0.19/0.59 Free software under BSD-3-Clause. % 0.19/0.59 % 0.19/0.59 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.59 % 0.19/0.59 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.19/0.61 Running up to 7 provers in parallel. % 0.67/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.67/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.67/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.67/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.67/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.67/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.67/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.78/0.91 Prover 4: Preprocessing ... % 1.78/0.91 Prover 1: Preprocessing ... % 1.97/0.97 Prover 2: Preprocessing ... % 1.97/0.97 Prover 5: Preprocessing ... % 1.97/0.97 Prover 3: Preprocessing ... % 1.97/0.97 Prover 6: Preprocessing ... % 1.97/0.97 Prover 0: Preprocessing ... % 1.97/0.98 Prover 1: Constructing countermodel ... % 1.97/0.98 Prover 4: Constructing countermodel ... % 1.97/0.99 Prover 5: Proving ... % 1.97/0.99 Prover 2: Proving ... % 1.97/0.99 Prover 3: Constructing countermodel ... % 2.41/1.00 Prover 0: Proving ... % 2.41/1.00 Prover 6: Proving ... % 2.87/1.08 Prover 0: proved (472ms) % 2.87/1.08 % 2.87/1.09 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.87/1.09 % 2.87/1.09 Prover 2: proved (471ms) % 2.87/1.09 % 2.87/1.09 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.87/1.09 % 2.87/1.09 Prover 6: stopped % 2.87/1.09 Prover 3: proved (470ms) % 2.87/1.09 % 2.87/1.09 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.87/1.09 % 2.87/1.09 Prover 5: stopped % 2.87/1.09 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 2.87/1.09 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 2.87/1.09 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 2.87/1.09 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 2.87/1.09 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 2.87/1.10 Prover 1: Found proof (size 10) % 2.87/1.10 Prover 1: proved (484ms) % 2.87/1.10 Prover 4: Found proof (size 9) % 2.87/1.10 Prover 4: proved (481ms) % 2.87/1.10 Prover 13: Preprocessing ... % 2.87/1.10 Prover 11: Preprocessing ... % 2.87/1.10 Prover 7: Preprocessing ... % 2.87/1.11 Prover 10: Preprocessing ... % 2.87/1.11 Prover 13: Warning: ignoring some quantifiers % 2.87/1.11 Prover 8: Preprocessing ... % 2.87/1.11 Prover 13: Constructing countermodel ... % 2.87/1.11 Prover 7: Warning: ignoring some quantifiers % 2.87/1.11 Prover 13: stopped % 2.87/1.11 Prover 7: Constructing countermodel ... % 2.87/1.11 Prover 7: stopped % 2.87/1.11 Prover 10: Warning: ignoring some quantifiers % 2.87/1.11 Prover 10: Constructing countermodel ... % 2.87/1.11 Prover 10: stopped % 2.87/1.12 Prover 8: Warning: ignoring some quantifiers % 2.87/1.12 Prover 8: Constructing countermodel ... % 2.87/1.12 Prover 11: Constructing countermodel ... % 2.87/1.12 Prover 11: stopped % 2.87/1.12 Prover 8: stopped % 2.87/1.12 % 2.87/1.12 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 2.87/1.12 % 2.87/1.13 % SZS output start Proof for theBenchmark % 2.87/1.13 Assumptions after simplification: % 2.87/1.13 --------------------------------- % 2.87/1.13 % 2.87/1.13 (prove_this) % 2.87/1.17 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (p(v0) = v1) | ~ $i(v0)) & ? [v0: % 2.87/1.17 $i] : ? [v1: $i] : ? [v2: any] : ? [v3: any] : (p(v1) = v3 & p(v0) = v2 & % 2.87/1.17 $i(v1) & $i(v0) & ( ~ (v3 = 0) | ~ (v2 = 0))) % 2.87/1.17 % 2.87/1.17 Those formulas are unsatisfiable: % 2.87/1.17 --------------------------------- % 2.87/1.17 % 2.87/1.17 Begin of proof % 3.40/1.17 | % 3.40/1.18 | ALPHA: (prove_this) implies: % 3.40/1.18 | (1) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (p(v0) = v1) | ~ $i(v0)) % 3.40/1.18 | (2) ? [v0: $i] : ? [v1: $i] : ? [v2: any] : ? [v3: any] : (p(v1) = v3 & % 3.40/1.18 | p(v0) = v2 & $i(v1) & $i(v0) & ( ~ (v3 = 0) | ~ (v2 = 0))) % 3.40/1.18 | % 3.40/1.18 | DELTA: instantiating (2) with fresh symbols all_4_0, all_4_1, all_4_2, all_4_3 % 3.40/1.18 | gives: % 3.40/1.18 | (3) p(all_4_2) = all_4_0 & p(all_4_3) = all_4_1 & $i(all_4_2) & $i(all_4_3) % 3.40/1.18 | & ( ~ (all_4_0 = 0) | ~ (all_4_1 = 0)) % 3.40/1.18 | % 3.40/1.18 | ALPHA: (3) implies: % 3.40/1.18 | (4) $i(all_4_3) % 3.40/1.18 | (5) $i(all_4_2) % 3.40/1.18 | (6) p(all_4_3) = all_4_1 % 3.40/1.18 | (7) p(all_4_2) = all_4_0 % 3.40/1.18 | (8) ~ (all_4_0 = 0) | ~ (all_4_1 = 0) % 3.40/1.18 | % 3.40/1.19 | GROUND_INST: instantiating (1) with all_4_3, all_4_1, simplifying with (4), % 3.40/1.19 | (6) gives: % 3.40/1.19 | (9) all_4_1 = 0 % 3.40/1.19 | % 3.40/1.19 | GROUND_INST: instantiating (1) with all_4_2, all_4_0, simplifying with (5), % 3.40/1.19 | (7) gives: % 3.40/1.19 | (10) all_4_0 = 0 % 3.40/1.19 | % 3.40/1.19 | BETA: splitting (8) gives: % 3.40/1.19 | % 3.40/1.19 | Case 1: % 3.40/1.19 | | % 3.40/1.19 | | (11) ~ (all_4_0 = 0) % 3.40/1.19 | | % 3.40/1.19 | | REDUCE: (10), (11) imply: % 3.40/1.19 | | (12) $false % 3.40/1.19 | | % 3.40/1.19 | | CLOSE: (12) is inconsistent. % 3.40/1.19 | | % 3.40/1.19 | Case 2: % 3.40/1.19 | | % 3.40/1.19 | | (13) ~ (all_4_1 = 0) % 3.40/1.19 | | % 3.40/1.19 | | REDUCE: (9), (13) imply: % 3.40/1.19 | | (14) $false % 3.40/1.19 | | % 3.40/1.19 | | CLOSE: (14) is inconsistent. % 3.40/1.19 | | % 3.40/1.19 | End of split % 3.40/1.19 | % 3.40/1.19 End of proof % 3.40/1.19 % SZS output end Proof for theBenchmark % 3.40/1.19 % 3.40/1.19 596ms %------------------------------------------------------------------------------