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