%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SYN981+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 : n024.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:27 EDT 2023 % Result : Theorem 2.69s 1.11s % Output : Proof 3.77s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SYN981+1 : TPTP v8.1.2. Released v3.1.0. % 0.06/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n024.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 : Sat Aug 26 18:09:24 EDT 2023 % 0.13/0.34 % CPUTime : % 0.20/0.61 ________ _____ % 0.20/0.61 ___ __ \_________(_)________________________________ % 0.20/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.61 % 0.20/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.61 (2023-06-19) % 0.20/0.61 % 0.20/0.61 (c) Philipp Rümmer, 2009-2023 % 0.20/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.61 Amanda Stjerna. % 0.20/0.61 Free software under BSD-3-Clause. % 0.20/0.61 % 0.20/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.61 % 0.20/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.63 Running up to 7 provers in parallel. % 0.20/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.82/0.90 Prover 1: Preprocessing ... % 1.82/0.90 Prover 4: Preprocessing ... % 1.82/0.94 Prover 6: Preprocessing ... % 1.82/0.94 Prover 3: Preprocessing ... % 1.82/0.94 Prover 0: Preprocessing ... % 1.82/0.94 Prover 2: Preprocessing ... % 1.82/0.94 Prover 5: Preprocessing ... % 2.38/1.00 Prover 5: Proving ... % 2.38/1.00 Prover 6: Proving ... % 2.59/1.01 Prover 2: Proving ... % 2.59/1.01 Prover 1: Constructing countermodel ... % 2.59/1.01 Prover 3: Constructing countermodel ... % 2.59/1.01 Prover 0: Proving ... % 2.59/1.01 Prover 4: Constructing countermodel ... % 2.69/1.10 Prover 5: proved (467ms) % 2.69/1.10 Prover 2: proved (470ms) % 2.69/1.10 % 2.69/1.11 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.69/1.11 % 2.69/1.11 % 2.69/1.11 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.69/1.11 % 2.69/1.11 Prover 6: stopped % 3.34/1.12 Prover 0: stopped % 3.34/1.12 Prover 3: stopped % 3.34/1.12 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.34/1.12 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.34/1.12 Prover 7: Preprocessing ... % 3.34/1.12 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.34/1.12 Prover 8: Preprocessing ... % 3.34/1.12 Prover 10: Preprocessing ... % 3.34/1.13 Prover 7: Warning: ignoring some quantifiers % 3.34/1.13 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 3.34/1.13 Prover 7: Constructing countermodel ... % 3.34/1.13 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.34/1.13 Prover 4: Found proof (size 15) % 3.34/1.13 Prover 1: Found proof (size 16) % 3.34/1.14 Prover 11: Preprocessing ... % 3.34/1.14 Prover 4: proved (501ms) % 3.34/1.14 Prover 1: proved (502ms) % 3.34/1.14 Prover 7: stopped % 3.34/1.14 Prover 10: Warning: ignoring some quantifiers % 3.34/1.14 Prover 10: Constructing countermodel ... % 3.34/1.14 Prover 10: stopped % 3.34/1.14 Prover 8: Warning: ignoring some quantifiers % 3.34/1.15 Prover 13: Preprocessing ... % 3.34/1.15 Prover 8: Constructing countermodel ... % 3.34/1.15 Prover 8: stopped % 3.34/1.16 Prover 13: Warning: ignoring some quantifiers % 3.34/1.16 Prover 13: Constructing countermodel ... % 3.34/1.16 Prover 13: stopped % 3.34/1.16 Prover 11: Constructing countermodel ... % 3.34/1.17 Prover 11: stopped % 3.34/1.17 % 3.34/1.17 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.34/1.17 % 3.34/1.17 % SZS output start Proof for theBenchmark % 3.34/1.17 Assumptions after simplification: % 3.34/1.17 --------------------------------- % 3.34/1.17 % 3.34/1.17 (prove_this) % 3.77/1.20 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (q(v0) = v1) | ~ $i(v0) | ? [v2: % 3.77/1.20 int] : ( ~ (v2 = 0) & p(v0) = v2)) & ! [v0: $i] : ! [v1: int] : (v1 = 0 % 3.77/1.20 | ~ (p(v0) = v1) | ~ $i(v0)) & ! [v0: $i] : ( ~ (r(v0) = 0) | ~ $i(v0)) % 3.77/1.20 & ? [v0: $i] : ? [v1: any] : ? [v2: any] : (r(v0) = v2 & q(v0) = v1 & % 3.77/1.20 $i(v0) & ( ~ (v1 = 0) | v2 = 0)) % 3.77/1.20 % 3.77/1.20 Those formulas are unsatisfiable: % 3.77/1.20 --------------------------------- % 3.77/1.20 % 3.77/1.20 Begin of proof % 3.77/1.21 | % 3.77/1.21 | ALPHA: (prove_this) implies: % 3.77/1.21 | (1) ! [v0: $i] : ( ~ (r(v0) = 0) | ~ $i(v0)) % 3.77/1.21 | (2) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (p(v0) = v1) | ~ $i(v0)) % 3.77/1.21 | (3) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (q(v0) = v1) | ~ $i(v0) | ? % 3.77/1.21 | [v2: int] : ( ~ (v2 = 0) & p(v0) = v2)) % 3.77/1.21 | (4) ? [v0: $i] : ? [v1: any] : ? [v2: any] : (r(v0) = v2 & q(v0) = v1 & % 3.77/1.21 | $i(v0) & ( ~ (v1 = 0) | v2 = 0)) % 3.77/1.21 | % 3.77/1.21 | DELTA: instantiating (4) with fresh symbols all_4_0, all_4_1, all_4_2 gives: % 3.77/1.21 | (5) r(all_4_2) = all_4_0 & q(all_4_2) = all_4_1 & $i(all_4_2) & ( ~ % 3.77/1.21 | (all_4_1 = 0) | all_4_0 = 0) % 3.77/1.21 | % 3.77/1.21 | ALPHA: (5) implies: % 3.77/1.21 | (6) $i(all_4_2) % 3.77/1.21 | (7) q(all_4_2) = all_4_1 % 3.77/1.21 | (8) r(all_4_2) = all_4_0 % 3.77/1.21 | (9) ~ (all_4_1 = 0) | all_4_0 = 0 % 3.77/1.21 | % 3.77/1.21 | GROUND_INST: instantiating (3) with all_4_2, all_4_1, simplifying with (6), % 3.77/1.21 | (7) gives: % 3.77/1.22 | (10) all_4_1 = 0 | ? [v0: int] : ( ~ (v0 = 0) & p(all_4_2) = v0) % 3.77/1.22 | % 3.77/1.22 | BETA: splitting (9) gives: % 3.77/1.22 | % 3.77/1.22 | Case 1: % 3.77/1.22 | | % 3.77/1.22 | | (11) ~ (all_4_1 = 0) % 3.77/1.22 | | % 3.77/1.22 | | BETA: splitting (10) gives: % 3.77/1.22 | | % 3.77/1.22 | | Case 1: % 3.77/1.22 | | | % 3.77/1.22 | | | (12) all_4_1 = 0 % 3.77/1.22 | | | % 3.77/1.22 | | | REDUCE: (11), (12) imply: % 3.77/1.22 | | | (13) $false % 3.77/1.22 | | | % 3.77/1.22 | | | CLOSE: (13) is inconsistent. % 3.77/1.22 | | | % 3.77/1.22 | | Case 2: % 3.77/1.22 | | | % 3.77/1.22 | | | (14) ? [v0: int] : ( ~ (v0 = 0) & p(all_4_2) = v0) % 3.77/1.22 | | | % 3.77/1.22 | | | DELTA: instantiating (14) with fresh symbol all_17_0 gives: % 3.77/1.22 | | | (15) ~ (all_17_0 = 0) & p(all_4_2) = all_17_0 % 3.77/1.22 | | | % 3.77/1.22 | | | ALPHA: (15) implies: % 3.77/1.22 | | | (16) ~ (all_17_0 = 0) % 3.77/1.22 | | | (17) p(all_4_2) = all_17_0 % 3.77/1.22 | | | % 3.77/1.22 | | | GROUND_INST: instantiating (2) with all_4_2, all_17_0, simplifying with % 3.77/1.22 | | | (6), (17) gives: % 3.77/1.22 | | | (18) all_17_0 = 0 % 3.77/1.22 | | | % 3.77/1.22 | | | REDUCE: (16), (18) imply: % 3.77/1.22 | | | (19) $false % 3.77/1.22 | | | % 3.77/1.22 | | | CLOSE: (19) is inconsistent. % 3.77/1.22 | | | % 3.77/1.22 | | End of split % 3.77/1.22 | | % 3.77/1.22 | Case 2: % 3.77/1.22 | | % 3.77/1.22 | | (20) all_4_0 = 0 % 3.77/1.22 | | % 3.77/1.22 | | REDUCE: (8), (20) imply: % 3.77/1.22 | | (21) r(all_4_2) = 0 % 3.77/1.22 | | % 3.77/1.22 | | GROUND_INST: instantiating (1) with all_4_2, simplifying with (6), (21) % 3.77/1.22 | | gives: % 3.77/1.22 | | (22) $false % 3.77/1.22 | | % 3.77/1.22 | | CLOSE: (22) is inconsistent. % 3.77/1.22 | | % 3.77/1.22 | End of split % 3.77/1.22 | % 3.77/1.22 End of proof % 3.77/1.22 % SZS output end Proof for theBenchmark % 3.77/1.22 % 3.77/1.22 608ms %------------------------------------------------------------------------------