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