%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SYO900_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 : n023.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:10 EDT 2023 % Result : Theorem 3.74s 1.31s % Output : Proof 4.77s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : SYO900_11 : TPTP v8.2.0. Released v8.2.0. % 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.35 % Computer : n023.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 300 % 0.14/0.35 % DateTime : Sat Aug 26 05:56:56 EDT 2023 % 0.14/0.35 % CPUTime : % 0.66/0.65 ________ _____ % 0.66/0.65 ___ __ \_________(_)________________________________ % 0.66/0.65 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.66/0.65 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.66/0.65 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.66/0.65 % 0.66/0.65 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.66/0.65 (2023-06-19) % 0.66/0.65 % 0.66/0.65 (c) Philipp Rümmer, 2009-2023 % 0.66/0.65 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.66/0.65 Amanda Stjerna. % 0.66/0.65 Free software under BSD-3-Clause. % 0.66/0.65 % 0.66/0.65 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.66/0.65 % 0.66/0.66 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.66/0.68 Running up to 7 provers in parallel. % 0.66/0.69 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.66/0.69 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.66/0.69 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.66/0.69 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.66/0.69 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.66/0.69 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 0.66/0.70 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 2.26/1.03 Prover 4: Preprocessing ... % 2.26/1.03 Prover 1: Preprocessing ... % 2.26/1.07 Prover 5: Preprocessing ... % 2.26/1.07 Prover 0: Preprocessing ... % 2.26/1.07 Prover 3: Preprocessing ... % 2.26/1.07 Prover 6: Preprocessing ... % 2.26/1.07 Prover 2: Preprocessing ... % 2.75/1.16 Prover 2: Proving ... % 2.75/1.16 Prover 5: Proving ... % 3.44/1.18 Prover 0: Proving ... % 3.44/1.19 Prover 6: Proving ... % 3.44/1.19 Prover 3: Constructing countermodel ... % 3.44/1.19 Prover 1: Constructing countermodel ... % 3.44/1.19 Prover 4: Constructing countermodel ... % 3.74/1.30 Prover 0: proved (619ms) % 3.74/1.30 % 3.74/1.31 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.74/1.31 % 3.74/1.31 Prover 3: proved (617ms) % 3.74/1.31 % 3.74/1.31 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.74/1.31 % 3.74/1.31 Prover 6: stopped % 3.74/1.31 Prover 5: stopped % 3.74/1.31 Prover 2: stopped % 4.30/1.31 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 4.30/1.31 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 4.30/1.31 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 4.30/1.31 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 4.30/1.31 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 4.30/1.33 Prover 4: Found proof (size 13) % 4.30/1.33 Prover 4: proved (639ms) % 4.30/1.33 Prover 1: stopped % 4.30/1.33 Prover 8: Preprocessing ... % 4.30/1.34 Prover 13: Preprocessing ... % 4.30/1.34 Prover 10: Preprocessing ... % 4.30/1.34 Prover 7: Preprocessing ... % 4.30/1.35 Prover 11: Preprocessing ... % 4.30/1.35 Prover 10: Warning: ignoring some quantifiers % 4.30/1.35 Prover 7: Warning: ignoring some quantifiers % 4.30/1.35 Prover 10: Constructing countermodel ... % 4.30/1.35 Prover 7: Constructing countermodel ... % 4.30/1.36 Prover 7: stopped % 4.30/1.36 Prover 10: stopped % 4.30/1.36 Prover 13: Warning: ignoring some quantifiers % 4.30/1.36 Prover 13: Constructing countermodel ... % 4.30/1.36 Prover 13: stopped % 4.30/1.37 Prover 8: Warning: ignoring some quantifiers % 4.30/1.37 Prover 8: Constructing countermodel ... % 4.30/1.37 Prover 8: stopped % 4.77/1.38 Prover 11: Constructing countermodel ... % 4.77/1.39 Prover 11: stopped % 4.77/1.39 % 4.77/1.39 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.77/1.39 % 4.77/1.39 % SZS output start Proof for theBenchmark % 4.77/1.39 Assumptions after simplification: % 4.77/1.39 --------------------------------- % 4.77/1.39 % 4.77/1.39 (mrel_universal) % 4.77/1.42 ! [v0: $ki_world] : ! [v1: $ki_world] : ! [v2: int] : (v2 = 0 | ~ % 4.77/1.42 ($ki_accessible(v0, v1) = v2) | ~ $ki_world(v1) | ~ $ki_world(v0)) % 4.77/1.42 % 4.77/1.42 (verify) % 4.77/1.43 $ki_world($ki_local_world) & ? [v0: $ki_world] : ? [v1: $ki_world] : ? [v2: % 4.77/1.43 int] : ? [v3: $ki_world] : ? [v4: $ki_world] : ? [v5: int] : ( ~ (v5 = 0) % 4.77/1.43 & ~ (v2 = 0) & q(v4) = v5 & p(v1) = v2 & $ki_accessible(v3, v4) = 0 & % 4.77/1.43 $ki_accessible(v0, v1) = 0 & $ki_accessible($ki_local_world, v3) = 0 & % 4.77/1.43 $ki_accessible($ki_local_world, v0) = 0 & $ki_world(v4) & $ki_world(v3) & % 4.77/1.43 $ki_world(v1) & $ki_world(v0) & ! [v6: $ki_world] : ! [v7: int] : (v7 = 0 % 4.77/1.43 | ~ (q(v6) = v7) | ~ $ki_world(v6) | ? [v8: int] : ( ~ (v8 = 0) & % 4.77/1.43 $ki_accessible(v0, v6) = v8)) & ! [v6: $ki_world] : ! [v7: int] : (v7 % 4.77/1.43 = 0 | ~ (p(v6) = v7) | ~ $ki_world(v6) | ? [v8: int] : ( ~ (v8 = 0) & % 4.77/1.43 $ki_accessible(v3, v6) = v8)) & ! [v6: $ki_world] : ( ~ % 4.77/1.43 ($ki_accessible(v3, v6) = 0) | ~ $ki_world(v6) | p(v6) = 0) & ! [v6: % 4.77/1.43 $ki_world] : ( ~ ($ki_accessible(v0, v6) = 0) | ~ $ki_world(v6) | q(v6) = % 4.77/1.43 0)) % 4.77/1.43 % 4.77/1.43 Those formulas are unsatisfiable: % 4.77/1.43 --------------------------------- % 4.77/1.43 % 4.77/1.43 Begin of proof % 4.77/1.43 | % 4.77/1.43 | ALPHA: (verify) implies: % 4.77/1.44 | (1) ? [v0: $ki_world] : ? [v1: $ki_world] : ? [v2: int] : ? [v3: % 4.77/1.44 | $ki_world] : ? [v4: $ki_world] : ? [v5: int] : ( ~ (v5 = 0) & ~ % 4.77/1.44 | (v2 = 0) & q(v4) = v5 & p(v1) = v2 & $ki_accessible(v3, v4) = 0 & % 4.77/1.44 | $ki_accessible(v0, v1) = 0 & $ki_accessible($ki_local_world, v3) = 0 % 4.77/1.44 | & $ki_accessible($ki_local_world, v0) = 0 & $ki_world(v4) & % 4.77/1.44 | $ki_world(v3) & $ki_world(v1) & $ki_world(v0) & ! [v6: $ki_world] : % 4.77/1.44 | ! [v7: int] : (v7 = 0 | ~ (q(v6) = v7) | ~ $ki_world(v6) | ? [v8: % 4.77/1.44 | int] : ( ~ (v8 = 0) & $ki_accessible(v0, v6) = v8)) & ! [v6: % 4.77/1.44 | $ki_world] : ! [v7: int] : (v7 = 0 | ~ (p(v6) = v7) | ~ % 4.77/1.44 | $ki_world(v6) | ? [v8: int] : ( ~ (v8 = 0) & $ki_accessible(v3, % 4.77/1.44 | v6) = v8)) & ! [v6: $ki_world] : ( ~ ($ki_accessible(v3, v6) = % 4.77/1.44 | 0) | ~ $ki_world(v6) | p(v6) = 0) & ! [v6: $ki_world] : ( ~ % 4.77/1.44 | ($ki_accessible(v0, v6) = 0) | ~ $ki_world(v6) | q(v6) = 0)) % 4.77/1.44 | % 4.77/1.44 | DELTA: instantiating (1) with fresh symbols all_7_0, all_7_1, all_7_2, % 4.77/1.44 | all_7_3, all_7_4, all_7_5 gives: % 4.77/1.44 | (2) ~ (all_7_0 = 0) & ~ (all_7_3 = 0) & q(all_7_1) = all_7_0 & p(all_7_4) % 4.77/1.44 | = all_7_3 & $ki_accessible(all_7_2, all_7_1) = 0 & % 4.77/1.44 | $ki_accessible(all_7_5, all_7_4) = 0 & $ki_accessible($ki_local_world, % 4.77/1.44 | all_7_2) = 0 & $ki_accessible($ki_local_world, all_7_5) = 0 & % 4.77/1.44 | $ki_world(all_7_1) & $ki_world(all_7_2) & $ki_world(all_7_4) & % 4.77/1.44 | $ki_world(all_7_5) & ! [v0: $ki_world] : ! [v1: int] : (v1 = 0 | ~ % 4.77/1.44 | (q(v0) = v1) | ~ $ki_world(v0) | ? [v2: int] : ( ~ (v2 = 0) & % 4.77/1.44 | $ki_accessible(all_7_5, v0) = v2)) & ! [v0: $ki_world] : ! [v1: % 4.77/1.44 | int] : (v1 = 0 | ~ (p(v0) = v1) | ~ $ki_world(v0) | ? [v2: int] : % 4.77/1.44 | ( ~ (v2 = 0) & $ki_accessible(all_7_2, v0) = v2)) & ! [v0: % 4.77/1.44 | $ki_world] : ( ~ ($ki_accessible(all_7_2, v0) = 0) | ~ $ki_world(v0) % 4.77/1.44 | | p(v0) = 0) & ! [v0: $ki_world] : ( ~ ($ki_accessible(all_7_5, v0) % 4.77/1.44 | = 0) | ~ $ki_world(v0) | q(v0) = 0) % 4.77/1.44 | % 4.77/1.44 | ALPHA: (2) implies: % 4.77/1.44 | (3) ~ (all_7_0 = 0) % 4.77/1.44 | (4) $ki_world(all_7_5) % 4.77/1.44 | (5) $ki_world(all_7_1) % 4.77/1.45 | (6) q(all_7_1) = all_7_0 % 4.77/1.45 | (7) ! [v0: $ki_world] : ! [v1: int] : (v1 = 0 | ~ (q(v0) = v1) | ~ % 4.77/1.45 | $ki_world(v0) | ? [v2: int] : ( ~ (v2 = 0) & $ki_accessible(all_7_5, % 4.77/1.45 | v0) = v2)) % 4.77/1.45 | % 4.77/1.45 | GROUND_INST: instantiating (7) with all_7_1, all_7_0, simplifying with (5), % 4.77/1.45 | (6) gives: % 4.77/1.45 | (8) all_7_0 = 0 | ? [v0: int] : ( ~ (v0 = 0) & $ki_accessible(all_7_5, % 4.77/1.45 | all_7_1) = v0) % 4.77/1.45 | % 4.77/1.45 | BETA: splitting (8) gives: % 4.77/1.45 | % 4.77/1.45 | Case 1: % 4.77/1.45 | | % 4.77/1.45 | | (9) all_7_0 = 0 % 4.77/1.45 | | % 4.77/1.45 | | REDUCE: (3), (9) imply: % 4.77/1.45 | | (10) $false % 4.77/1.45 | | % 4.77/1.45 | | CLOSE: (10) is inconsistent. % 4.77/1.45 | | % 4.77/1.45 | Case 2: % 4.77/1.45 | | % 4.77/1.45 | | (11) ? [v0: int] : ( ~ (v0 = 0) & $ki_accessible(all_7_5, all_7_1) = v0) % 4.77/1.45 | | % 4.77/1.45 | | DELTA: instantiating (11) with fresh symbol all_20_0 gives: % 4.77/1.45 | | (12) ~ (all_20_0 = 0) & $ki_accessible(all_7_5, all_7_1) = all_20_0 % 4.77/1.45 | | % 4.77/1.45 | | ALPHA: (12) implies: % 4.77/1.45 | | (13) ~ (all_20_0 = 0) % 4.77/1.45 | | (14) $ki_accessible(all_7_5, all_7_1) = all_20_0 % 4.77/1.45 | | % 4.77/1.45 | | GROUND_INST: instantiating (mrel_universal) with all_7_5, all_7_1, all_20_0, % 4.77/1.45 | | simplifying with (4), (5), (14) gives: % 4.77/1.45 | | (15) all_20_0 = 0 % 4.77/1.45 | | % 4.77/1.45 | | REDUCE: (13), (15) imply: % 4.77/1.45 | | (16) $false % 4.77/1.45 | | % 4.77/1.45 | | CLOSE: (16) is inconsistent. % 4.77/1.45 | | % 4.77/1.45 | End of split % 4.77/1.45 | % 4.77/1.45 End of proof % 4.77/1.45 % SZS output end Proof for theBenchmark % 4.77/1.45 % 4.77/1.45 798ms %------------------------------------------------------------------------------