%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SYO893_11 : TPTP v8.2.0. Released v8.2.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n032.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 04:54:08 EDT 2023 % Result : Theorem 3.26s 1.13s % Output : Proof 4.33s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.09 % Problem : SYO893_11 : TPTP v8.2.0. Released v8.2.0. % 0.00/0.09 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.09/0.28 % Computer : n032.cluster.edu % 0.09/0.28 % Model : x86_64 x86_64 % 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.28 % Memory : 8042.1875MB % 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64 % 0.09/0.28 % CPULimit : 300 % 0.09/0.28 % WCLimit : 300 % 0.09/0.28 % DateTime : Sat Aug 26 04:07:13 EDT 2023 % 0.09/0.29 % CPUTime : % 0.14/0.51 ________ _____ % 0.14/0.52 ___ __ \_________(_)________________________________ % 0.14/0.52 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.14/0.52 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.14/0.52 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.14/0.52 % 0.14/0.52 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.14/0.52 (2023-06-19) % 0.14/0.52 % 0.14/0.52 (c) Philipp Rümmer, 2009-2023 % 0.14/0.52 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.14/0.52 Amanda Stjerna. % 0.14/0.52 Free software under BSD-3-Clause. % 0.14/0.52 % 0.14/0.52 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.14/0.52 % 0.14/0.52 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.14/0.53 Running up to 7 provers in parallel. % 0.14/0.54 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.14/0.54 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.14/0.54 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.14/0.54 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.14/0.54 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.14/0.54 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.14/0.54 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.78/0.88 Prover 4: Preprocessing ... % 1.78/0.88 Prover 1: Preprocessing ... % 2.09/0.92 Prover 2: Preprocessing ... % 2.09/0.92 Prover 3: Preprocessing ... % 2.09/0.92 Prover 6: Preprocessing ... % 2.09/0.92 Prover 5: Preprocessing ... % 2.09/0.92 Prover 0: Preprocessing ... % 2.36/1.01 Prover 5: Proving ... % 2.36/1.01 Prover 2: Proving ... % 2.36/1.02 Prover 1: Constructing countermodel ... % 2.36/1.03 Prover 3: Constructing countermodel ... % 2.99/1.04 Prover 6: Proving ... % 2.99/1.04 Prover 4: Constructing countermodel ... % 2.99/1.05 Prover 0: Proving ... % 3.26/1.13 Prover 3: proved (590ms) % 3.26/1.13 % 3.26/1.13 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.26/1.13 % 3.26/1.14 Prover 6: stopped % 3.26/1.14 Prover 0: stopped % 3.26/1.14 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.26/1.14 Prover 2: stopped % 3.26/1.14 Prover 5: stopped % 3.26/1.14 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.26/1.14 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.26/1.14 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.26/1.14 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 3.70/1.15 Prover 7: Preprocessing ... % 3.79/1.16 Prover 10: Preprocessing ... % 3.79/1.17 Prover 11: Preprocessing ... % 3.79/1.17 Prover 13: Preprocessing ... % 3.79/1.17 Prover 8: Preprocessing ... % 3.79/1.18 Prover 10: Warning: ignoring some quantifiers % 3.79/1.19 Prover 7: Warning: ignoring some quantifiers % 3.79/1.19 Prover 4: Found proof (size 15) % 3.79/1.19 Prover 10: Constructing countermodel ... % 3.79/1.19 Prover 4: proved (649ms) % 3.79/1.19 Prover 1: Found proof (size 19) % 3.79/1.19 Prover 13: Warning: ignoring some quantifiers % 3.79/1.19 Prover 1: proved (653ms) % 3.79/1.19 Prover 10: stopped % 3.79/1.19 Prover 13: Constructing countermodel ... % 3.79/1.19 Prover 7: Constructing countermodel ... % 3.79/1.19 Prover 13: stopped % 3.79/1.19 Prover 7: stopped % 4.15/1.21 Prover 11: Constructing countermodel ... % 4.15/1.21 Prover 11: stopped % 4.15/1.22 Prover 8: Warning: ignoring some quantifiers % 4.15/1.23 Prover 8: Constructing countermodel ... % 4.15/1.23 Prover 8: stopped % 4.15/1.23 % 4.15/1.23 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.15/1.23 % 4.15/1.24 % SZS output start Proof for theBenchmark % 4.15/1.24 Assumptions after simplification: % 4.15/1.24 --------------------------------- % 4.15/1.24 % 4.15/1.24 (verify) % 4.33/1.29 $ki_world($ki_local_world) & ? [v0: $ki_world] : % 4.33/1.29 ($ki_accessible($ki_local_world, v0) = 0 & $ki_world(v0) & ! [v1: $ki_world] % 4.33/1.29 : ( ~ ($ki_accessible(v0, v1) = 0) | ~ $ki_world(v1) | ? [v2: $ki_world] : % 4.33/1.29 ? [v3: int] : ( ~ (v3 = 0) & p(v2) = v3 & $ki_accessible(v1, v2) = 0 & % 4.33/1.29 $ki_world(v2))) & ! [v1: $ki_world] : ( ~ % 4.33/1.29 ($ki_accessible($ki_local_world, v1) = 0) | ~ $ki_world(v1) | ? [v2: % 4.33/1.29 $ki_world] : ($ki_accessible(v1, v2) = 0 & $ki_world(v2) & ! [v3: % 4.33/1.29 $ki_world] : ! [v4: int] : (v4 = 0 | ~ (p(v3) = v4) | ~ % 4.33/1.29 $ki_world(v3) | ? [v5: int] : ( ~ (v5 = 0) & $ki_accessible(v2, v3) = % 4.33/1.29 v5)) & ! [v3: $ki_world] : ( ~ ($ki_accessible(v2, v3) = 0) | ~ % 4.33/1.29 $ki_world(v3) | p(v3) = 0)))) % 4.33/1.29 % 4.33/1.29 (function-axioms) % 4.33/1.30 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $ki_world] : % 4.33/1.30 ! [v3: $ki_world] : (v1 = v0 | ~ ($ki_accessible(v3, v2) = v1) | ~ % 4.33/1.30 ($ki_accessible(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 4.33/1.30 MultipleValueBool] : ! [v2: $ki_world] : (v1 = v0 | ~ (p(v2) = v1) | ~ % 4.33/1.30 (p(v2) = v0)) % 4.33/1.30 % 4.33/1.30 Further assumptions not needed in the proof: % 4.33/1.30 -------------------------------------------- % 4.33/1.30 mrel_universal % 4.33/1.30 % 4.33/1.30 Those formulas are unsatisfiable: % 4.33/1.30 --------------------------------- % 4.33/1.30 % 4.33/1.30 Begin of proof % 4.33/1.30 | % 4.33/1.30 | ALPHA: (verify) implies: % 4.33/1.30 | (1) ? [v0: $ki_world] : ($ki_accessible($ki_local_world, v0) = 0 & % 4.33/1.30 | $ki_world(v0) & ! [v1: $ki_world] : ( ~ ($ki_accessible(v0, v1) = 0) % 4.33/1.30 | | ~ $ki_world(v1) | ? [v2: $ki_world] : ? [v3: int] : ( ~ (v3 = % 4.33/1.30 | 0) & p(v2) = v3 & $ki_accessible(v1, v2) = 0 & $ki_world(v2))) % 4.33/1.30 | & ! [v1: $ki_world] : ( ~ ($ki_accessible($ki_local_world, v1) = 0) % 4.33/1.30 | | ~ $ki_world(v1) | ? [v2: $ki_world] : ($ki_accessible(v1, v2) = % 4.33/1.30 | 0 & $ki_world(v2) & ! [v3: $ki_world] : ! [v4: int] : (v4 = 0 | % 4.33/1.30 | ~ (p(v3) = v4) | ~ $ki_world(v3) | ? [v5: int] : ( ~ (v5 = % 4.33/1.30 | 0) & $ki_accessible(v2, v3) = v5)) & ! [v3: $ki_world] : ( % 4.33/1.30 | ~ ($ki_accessible(v2, v3) = 0) | ~ $ki_world(v3) | p(v3) = % 4.33/1.30 | 0)))) % 4.33/1.30 | % 4.33/1.30 | ALPHA: (function-axioms) implies: % 4.33/1.30 | (2) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 4.33/1.30 | $ki_world] : (v1 = v0 | ~ (p(v2) = v1) | ~ (p(v2) = v0)) % 4.33/1.30 | % 4.33/1.31 | DELTA: instantiating (1) with fresh symbol all_7_0 gives: % 4.33/1.31 | (3) $ki_accessible($ki_local_world, all_7_0) = 0 & $ki_world(all_7_0) & ! % 4.33/1.31 | [v0: $ki_world] : ( ~ ($ki_accessible(all_7_0, v0) = 0) | ~ % 4.33/1.31 | $ki_world(v0) | ? [v1: $ki_world] : ? [v2: int] : ( ~ (v2 = 0) & % 4.33/1.31 | p(v1) = v2 & $ki_accessible(v0, v1) = 0 & $ki_world(v1))) & ! [v0: % 4.33/1.31 | $ki_world] : ( ~ ($ki_accessible($ki_local_world, v0) = 0) | ~ % 4.33/1.31 | $ki_world(v0) | ? [v1: $ki_world] : ($ki_accessible(v0, v1) = 0 & % 4.33/1.31 | $ki_world(v1) & ! [v2: $ki_world] : ! [v3: int] : (v3 = 0 | ~ % 4.33/1.31 | (p(v2) = v3) | ~ $ki_world(v2) | ? [v4: int] : ( ~ (v4 = 0) & % 4.33/1.31 | $ki_accessible(v1, v2) = v4)) & ! [v2: $ki_world] : ( ~ % 4.33/1.31 | ($ki_accessible(v1, v2) = 0) | ~ $ki_world(v2) | p(v2) = 0))) % 4.33/1.31 | % 4.33/1.31 | ALPHA: (3) implies: % 4.33/1.31 | (4) $ki_world(all_7_0) % 4.33/1.31 | (5) $ki_accessible($ki_local_world, all_7_0) = 0 % 4.33/1.31 | (6) ! [v0: $ki_world] : ( ~ ($ki_accessible($ki_local_world, v0) = 0) | ~ % 4.33/1.31 | $ki_world(v0) | ? [v1: $ki_world] : ($ki_accessible(v0, v1) = 0 & % 4.33/1.31 | $ki_world(v1) & ! [v2: $ki_world] : ! [v3: int] : (v3 = 0 | ~ % 4.33/1.31 | (p(v2) = v3) | ~ $ki_world(v2) | ? [v4: int] : ( ~ (v4 = 0) & % 4.33/1.31 | $ki_accessible(v1, v2) = v4)) & ! [v2: $ki_world] : ( ~ % 4.33/1.31 | ($ki_accessible(v1, v2) = 0) | ~ $ki_world(v2) | p(v2) = 0))) % 4.33/1.32 | (7) ! [v0: $ki_world] : ( ~ ($ki_accessible(all_7_0, v0) = 0) | ~ % 4.33/1.32 | $ki_world(v0) | ? [v1: $ki_world] : ? [v2: int] : ( ~ (v2 = 0) & % 4.33/1.32 | p(v1) = v2 & $ki_accessible(v0, v1) = 0 & $ki_world(v1))) % 4.33/1.32 | % 4.33/1.32 | GROUND_INST: instantiating (6) with all_7_0, simplifying with (4), (5) gives: % 4.33/1.32 | (8) ? [v0: $ki_world] : ($ki_accessible(all_7_0, v0) = 0 & $ki_world(v0) & % 4.33/1.32 | ! [v1: $ki_world] : ! [v2: int] : (v2 = 0 | ~ (p(v1) = v2) | ~ % 4.33/1.32 | $ki_world(v1) | ? [v3: int] : ( ~ (v3 = 0) & $ki_accessible(v0, % 4.33/1.32 | v1) = v3)) & ! [v1: $ki_world] : ( ~ ($ki_accessible(v0, v1) = % 4.33/1.32 | 0) | ~ $ki_world(v1) | p(v1) = 0)) % 4.33/1.32 | % 4.33/1.32 | DELTA: instantiating (8) with fresh symbol all_15_0 gives: % 4.33/1.32 | (9) $ki_accessible(all_7_0, all_15_0) = 0 & $ki_world(all_15_0) & ! [v0: % 4.33/1.32 | $ki_world] : ! [v1: int] : (v1 = 0 | ~ (p(v0) = v1) | ~ % 4.33/1.32 | $ki_world(v0) | ? [v2: int] : ( ~ (v2 = 0) & % 4.33/1.32 | $ki_accessible(all_15_0, v0) = v2)) & ! [v0: $ki_world] : ( ~ % 4.33/1.32 | ($ki_accessible(all_15_0, v0) = 0) | ~ $ki_world(v0) | p(v0) = 0) % 4.33/1.32 | % 4.33/1.32 | ALPHA: (9) implies: % 4.33/1.32 | (10) $ki_world(all_15_0) % 4.33/1.32 | (11) $ki_accessible(all_7_0, all_15_0) = 0 % 4.33/1.32 | (12) ! [v0: $ki_world] : ( ~ ($ki_accessible(all_15_0, v0) = 0) | ~ % 4.33/1.32 | $ki_world(v0) | p(v0) = 0) % 4.33/1.32 | % 4.33/1.32 | GROUND_INST: instantiating (7) with all_15_0, simplifying with (10), (11) % 4.33/1.32 | gives: % 4.33/1.32 | (13) ? [v0: $ki_world] : ? [v1: int] : ( ~ (v1 = 0) & p(v0) = v1 & % 4.33/1.32 | $ki_accessible(all_15_0, v0) = 0 & $ki_world(v0)) % 4.33/1.32 | % 4.33/1.32 | DELTA: instantiating (13) with fresh symbols all_23_0, all_23_1 gives: % 4.33/1.32 | (14) ~ (all_23_0 = 0) & p(all_23_1) = all_23_0 & $ki_accessible(all_15_0, % 4.33/1.32 | all_23_1) = 0 & $ki_world(all_23_1) % 4.33/1.32 | % 4.33/1.32 | ALPHA: (14) implies: % 4.33/1.33 | (15) ~ (all_23_0 = 0) % 4.33/1.33 | (16) $ki_world(all_23_1) % 4.33/1.33 | (17) $ki_accessible(all_15_0, all_23_1) = 0 % 4.33/1.33 | (18) p(all_23_1) = all_23_0 % 4.33/1.33 | % 4.33/1.33 | GROUND_INST: instantiating (12) with all_23_1, simplifying with (16), (17) % 4.33/1.33 | gives: % 4.33/1.33 | (19) p(all_23_1) = 0 % 4.33/1.33 | % 4.33/1.33 | GROUND_INST: instantiating (2) with all_23_0, 0, all_23_1, simplifying with % 4.33/1.33 | (18), (19) gives: % 4.33/1.33 | (20) all_23_0 = 0 % 4.33/1.33 | % 4.33/1.33 | REDUCE: (15), (20) imply: % 4.33/1.33 | (21) $false % 4.33/1.33 | % 4.33/1.33 | CLOSE: (21) is inconsistent. % 4.33/1.33 | % 4.33/1.33 End of proof % 4.33/1.33 % SZS output end Proof for theBenchmark % 4.33/1.33 % 4.33/1.33 812ms %------------------------------------------------------------------------------