%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWW469+1 : TPTP v8.1.2. Released v5.3.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n016.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 00:50:09 EDT 2023 % Result : Theorem 3.40s 1.19s % Output : Proof 4.12s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SWW469+1 : TPTP v8.1.2. Released v5.3.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.18/0.35 % Computer : n016.cluster.edu % 0.18/0.35 % Model : x86_64 x86_64 % 0.18/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.18/0.35 % Memory : 8042.1875MB % 0.18/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.18/0.35 % CPULimit : 300 % 0.18/0.35 % WCLimit : 300 % 0.18/0.35 % DateTime : Sun Aug 27 18:34:59 EDT 2023 % 0.18/0.35 % CPUTime : % 0.20/0.62 ________ _____ % 0.20/0.62 ___ __ \_________(_)________________________________ % 0.20/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.62 % 0.20/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.62 (2023-06-19) % 0.20/0.62 % 0.20/0.62 (c) Philipp Rümmer, 2009-2023 % 0.20/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.62 Amanda Stjerna. % 0.20/0.62 Free software under BSD-3-Clause. % 0.20/0.62 % 0.20/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.62 % 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.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.90/0.97 Prover 1: Preprocessing ... % 1.90/0.97 Prover 4: Preprocessing ... % 2.15/1.01 Prover 3: Preprocessing ... % 2.15/1.01 Prover 5: Preprocessing ... % 2.15/1.01 Prover 6: Preprocessing ... % 2.15/1.01 Prover 0: Preprocessing ... % 2.15/1.01 Prover 2: Preprocessing ... % 2.69/1.10 Prover 4: Constructing countermodel ... % 2.69/1.10 Prover 1: Constructing countermodel ... % 2.69/1.10 Prover 5: Constructing countermodel ... % 2.69/1.10 Prover 2: Proving ... % 2.69/1.11 Prover 0: Proving ... % 2.69/1.11 Prover 3: Constructing countermodel ... % 2.69/1.11 Prover 6: Proving ... % 3.40/1.19 Prover 3: proved (545ms) % 3.40/1.19 % 3.40/1.19 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.40/1.19 % 3.40/1.19 Prover 5: stopped % 3.40/1.19 Prover 6: stopped % 3.40/1.19 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.40/1.19 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.40/1.19 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.40/1.20 Prover 0: proved (562ms) % 3.40/1.20 Prover 2: proved (561ms) % 3.40/1.20 % 3.40/1.20 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.40/1.20 % 3.40/1.20 % 3.40/1.20 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.40/1.20 % 3.40/1.20 Prover 7: Preprocessing ... % 3.40/1.20 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.40/1.20 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 3.40/1.21 Prover 13: Preprocessing ... % 3.40/1.22 Prover 8: Preprocessing ... % 3.40/1.22 Prover 1: Found proof (size 19) % 3.40/1.22 Prover 1: proved (576ms) % 3.40/1.22 Prover 4: Found proof (size 19) % 3.40/1.22 Prover 4: proved (574ms) % 3.40/1.22 Prover 10: Preprocessing ... % 3.40/1.22 Prover 7: Constructing countermodel ... % 3.40/1.22 Prover 7: stopped % 3.40/1.23 Prover 11: Preprocessing ... % 3.40/1.23 Prover 13: Constructing countermodel ... % 3.91/1.23 Prover 13: stopped % 3.91/1.24 Prover 10: Constructing countermodel ... % 3.91/1.24 Prover 10: stopped % 3.91/1.25 Prover 8: Warning: ignoring some quantifiers % 3.91/1.25 Prover 8: Constructing countermodel ... % 3.91/1.26 Prover 8: stopped % 3.91/1.26 Prover 11: Constructing countermodel ... % 3.91/1.26 Prover 11: stopped % 3.91/1.26 % 3.91/1.26 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.91/1.26 % 3.91/1.26 % SZS output start Proof for theBenchmark % 3.91/1.26 Assumptions after simplification: % 3.91/1.26 --------------------------------- % 3.91/1.27 % 3.91/1.27 (conj_0) % 3.91/1.27 hoare_165779456gleton % 3.91/1.27 % 3.91/1.27 (conj_1) % 4.12/1.29 ? [v0: $i] : (is_state(v0) = 0 & $i(v0) & ! [v1: $i] : (v1 = v0 | ~ % 4.12/1.29 (is_state(v1) = 0) | ~ $i(v1))) % 4.12/1.29 % 4.12/1.29 (fact_0_state__not__singleton__def) % 4.12/1.30 (hoare_165779456gleton & ? [v0: $i] : ? [v1: $i] : ( ~ (v1 = v0) & % 4.12/1.30 is_state(v1) = 0 & is_state(v0) = 0 & $i(v1) & $i(v0))) | ( ~ % 4.12/1.30 hoare_165779456gleton & ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ % 4.12/1.30 (is_state(v1) = 0) | ~ (is_state(v0) = 0) | ~ $i(v1) | ~ $i(v0))) % 4.12/1.30 % 4.12/1.30 (gsy_c_HOL_Oundefined_000tc__Com__Ostate) % 4.12/1.30 $i(state) & ? [v0: $i] : (undefined_state(state) = v0 & is_state(v0) = 0 & % 4.12/1.30 $i(v0)) % 4.12/1.30 % 4.12/1.30 Further assumptions not needed in the proof: % 4.12/1.30 -------------------------------------------- % 4.12/1.30 fact_1_induct__false__def, fact_2_induct__trueI, fact_3_induct__true__def % 4.12/1.30 % 4.12/1.30 Those formulas are unsatisfiable: % 4.12/1.30 --------------------------------- % 4.12/1.30 % 4.12/1.30 Begin of proof % 4.12/1.30 | % 4.12/1.30 | ALPHA: (gsy_c_HOL_Oundefined_000tc__Com__Ostate) implies: % 4.12/1.30 | (1) ? [v0: $i] : (undefined_state(state) = v0 & is_state(v0) = 0 & $i(v0)) % 4.12/1.30 | % 4.12/1.30 | DELTA: instantiating (1) with fresh symbol all_4_0 gives: % 4.12/1.30 | (2) undefined_state(state) = all_4_0 & is_state(all_4_0) = 0 & $i(all_4_0) % 4.12/1.30 | % 4.12/1.30 | ALPHA: (2) implies: % 4.12/1.30 | (3) $i(all_4_0) % 4.12/1.30 | (4) is_state(all_4_0) = 0 % 4.12/1.30 | % 4.12/1.30 | DELTA: instantiating (conj_1) with fresh symbol all_6_0 gives: % 4.12/1.31 | (5) is_state(all_6_0) = 0 & $i(all_6_0) & ! [v0: any] : (v0 = all_6_0 | ~ % 4.12/1.31 | (is_state(v0) = 0) | ~ $i(v0)) % 4.12/1.31 | % 4.12/1.31 | ALPHA: (5) implies: % 4.12/1.31 | (6) ! [v0: any] : (v0 = all_6_0 | ~ (is_state(v0) = 0) | ~ $i(v0)) % 4.12/1.31 | % 4.12/1.31 | BETA: splitting (fact_0_state__not__singleton__def) gives: % 4.12/1.31 | % 4.12/1.31 | Case 1: % 4.12/1.31 | | % 4.12/1.31 | | (7) hoare_165779456gleton & ? [v0: $i] : ? [v1: $i] : ( ~ (v1 = v0) & % 4.12/1.31 | | is_state(v1) = 0 & is_state(v0) = 0 & $i(v1) & $i(v0)) % 4.12/1.31 | | % 4.12/1.31 | | ALPHA: (7) implies: % 4.12/1.31 | | (8) ? [v0: $i] : ? [v1: $i] : ( ~ (v1 = v0) & is_state(v1) = 0 & % 4.12/1.31 | | is_state(v0) = 0 & $i(v1) & $i(v0)) % 4.12/1.31 | | % 4.12/1.31 | | DELTA: instantiating (8) with fresh symbols all_13_0, all_13_1 gives: % 4.12/1.31 | | (9) ~ (all_13_0 = all_13_1) & is_state(all_13_0) = 0 & % 4.12/1.31 | | is_state(all_13_1) = 0 & $i(all_13_0) & $i(all_13_1) % 4.12/1.31 | | % 4.12/1.31 | | ALPHA: (9) implies: % 4.12/1.31 | | (10) ~ (all_13_0 = all_13_1) % 4.12/1.31 | | (11) $i(all_13_1) % 4.12/1.31 | | (12) $i(all_13_0) % 4.12/1.31 | | (13) is_state(all_13_1) = 0 % 4.12/1.31 | | (14) is_state(all_13_0) = 0 % 4.12/1.31 | | % 4.12/1.31 | | GROUND_INST: instantiating (6) with all_4_0, simplifying with (3), (4) % 4.12/1.31 | | gives: % 4.12/1.31 | | (15) all_6_0 = all_4_0 % 4.12/1.31 | | % 4.12/1.31 | | GROUND_INST: instantiating (6) with all_13_1, simplifying with (11), (13) % 4.12/1.31 | | gives: % 4.12/1.31 | | (16) all_13_1 = all_6_0 % 4.12/1.31 | | % 4.12/1.31 | | GROUND_INST: instantiating (6) with all_13_0, simplifying with (12), (14) % 4.12/1.31 | | gives: % 4.12/1.32 | | (17) all_13_0 = all_6_0 % 4.12/1.32 | | % 4.12/1.32 | | COMBINE_EQS: (15), (16) imply: % 4.12/1.32 | | (18) all_13_1 = all_4_0 % 4.12/1.32 | | % 4.12/1.32 | | COMBINE_EQS: (15), (17) imply: % 4.12/1.32 | | (19) all_13_0 = all_4_0 % 4.12/1.32 | | % 4.12/1.32 | | REDUCE: (10), (18), (19) imply: % 4.12/1.32 | | (20) $false % 4.12/1.32 | | % 4.12/1.32 | | CLOSE: (20) is inconsistent. % 4.12/1.32 | | % 4.12/1.32 | Case 2: % 4.12/1.32 | | % 4.12/1.32 | | (21) ~ hoare_165779456gleton & ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ % 4.12/1.32 | | (is_state(v1) = 0) | ~ (is_state(v0) = 0) | ~ $i(v1) | ~ % 4.12/1.32 | | $i(v0)) % 4.12/1.32 | | % 4.12/1.32 | | ALPHA: (21) implies: % 4.12/1.32 | | (22) ~ hoare_165779456gleton % 4.12/1.32 | | % 4.12/1.32 | | PRED_UNIFY: (22), (conj_0) imply: % 4.12/1.32 | | (23) $false % 4.12/1.32 | | % 4.12/1.32 | | CLOSE: (23) is inconsistent. % 4.12/1.32 | | % 4.12/1.32 | End of split % 4.12/1.32 | % 4.12/1.32 End of proof % 4.12/1.32 % SZS output end Proof for theBenchmark % 4.12/1.32 % 4.12/1.32 699ms %------------------------------------------------------------------------------