%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SYO894_8 : TPTP v8.2.0. Released v8.2.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n012.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.46s 1.20s % Output : Proof 4.33s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : SYO894_8 : TPTP v8.2.0. Released v8.2.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.35 % Computer : n012.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 07:50:10 EDT 2023 % 0.14/0.35 % 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/sandbox/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 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 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 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 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 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.25/1.01 Prover 4: Preprocessing ... % 2.25/1.01 Prover 1: Preprocessing ... % 2.50/1.05 Prover 3: Preprocessing ... % 2.50/1.05 Prover 6: Preprocessing ... % 2.50/1.05 Prover 0: Preprocessing ... % 2.50/1.05 Prover 2: Preprocessing ... % 2.50/1.05 Prover 5: Preprocessing ... % 2.50/1.11 Prover 5: Proving ... % 2.50/1.11 Prover 2: Proving ... % 2.50/1.13 Prover 6: Proving ... % 2.50/1.13 Prover 3: Constructing countermodel ... % 3.12/1.14 Prover 1: Constructing countermodel ... % 3.12/1.14 Prover 4: Constructing countermodel ... % 3.12/1.15 Prover 0: Proving ... % 3.46/1.19 Prover 5: proved (542ms) % 3.46/1.20 % 3.46/1.20 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.46/1.20 % 3.46/1.22 Prover 2: proved (541ms) % 3.46/1.22 % 3.46/1.22 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.46/1.22 % 3.46/1.22 Prover 3: proved (556ms) % 3.46/1.22 % 3.46/1.22 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.46/1.22 % 3.46/1.22 Prover 0: stopped % 3.46/1.22 Prover 6: stopped % 3.46/1.23 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 3.46/1.23 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 3.46/1.23 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 3.46/1.23 Prover 1: Found proof (size 10) % 3.46/1.23 Prover 1: proved (583ms) % 3.46/1.23 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 3.46/1.23 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 3.46/1.23 Prover 4: stopped % 3.46/1.23 Prover 7: Preprocessing ... % 3.46/1.23 Prover 8: Preprocessing ... % 3.46/1.23 Prover 10: Preprocessing ... % 3.46/1.24 Prover 13: Preprocessing ... % 3.46/1.24 Prover 11: Preprocessing ... % 3.46/1.25 Prover 7: Warning: ignoring some quantifiers % 3.88/1.25 Prover 7: Constructing countermodel ... % 3.88/1.25 Prover 10: Warning: ignoring some quantifiers % 3.88/1.25 Prover 10: Constructing countermodel ... % 3.88/1.25 Prover 7: stopped % 3.88/1.25 Prover 10: stopped % 3.88/1.26 Prover 13: Warning: ignoring some quantifiers % 3.88/1.26 Prover 13: Constructing countermodel ... % 3.96/1.26 Prover 13: stopped % 3.96/1.27 Prover 8: Warning: ignoring some quantifiers % 3.96/1.27 Prover 8: Constructing countermodel ... % 3.96/1.28 Prover 8: stopped % 3.96/1.30 Prover 11: Constructing countermodel ... % 3.96/1.31 Prover 11: stopped % 3.96/1.31 % 3.96/1.31 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 3.96/1.31 % 4.20/1.31 % SZS output start Proof for theBenchmark % 4.20/1.31 Assumptions after simplification: % 4.20/1.31 --------------------------------- % 4.20/1.31 % 4.20/1.31 (verify) % 4.33/1.35 $ki_world($ki_local_world) & ! [v0: $ki_world] : ( ~ % 4.33/1.35 ($ki_accessible($ki_local_world, v0) = 0) | ~ $ki_world(v0) | ? [v1: int] % 4.33/1.35 : ( ~ (v1 = 0) & p(v0) = v1)) & ? [v0: $ki_world] : (p(v0) = 0 & % 4.33/1.35 $ki_accessible($ki_local_world, v0) = 0 & $ki_world(v0)) % 4.33/1.35 % 4.33/1.35 (function-axioms) % 4.33/1.35 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $ki_world] : % 4.33/1.35 ! [v3: $ki_world] : (v1 = v0 | ~ ($ki_accessible(v3, v2) = v1) | ~ % 4.33/1.35 ($ki_accessible(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 4.33/1.35 MultipleValueBool] : ! [v2: $ki_world] : (v1 = v0 | ~ (p(v2) = v1) | ~ % 4.33/1.35 (p(v2) = v0)) % 4.33/1.35 % 4.33/1.35 Further assumptions not needed in the proof: % 4.33/1.35 -------------------------------------------- % 4.33/1.35 mrel_reflexive % 4.33/1.35 % 4.33/1.35 Those formulas are unsatisfiable: % 4.33/1.35 --------------------------------- % 4.33/1.35 % 4.33/1.35 Begin of proof % 4.33/1.36 | % 4.33/1.36 | ALPHA: (verify) implies: % 4.33/1.36 | (1) ! [v0: $ki_world] : ( ~ ($ki_accessible($ki_local_world, v0) = 0) | ~ % 4.33/1.36 | $ki_world(v0) | ? [v1: int] : ( ~ (v1 = 0) & p(v0) = v1)) % 4.33/1.36 | (2) ? [v0: $ki_world] : (p(v0) = 0 & $ki_accessible($ki_local_world, v0) = % 4.33/1.36 | 0 & $ki_world(v0)) % 4.33/1.36 | % 4.33/1.36 | ALPHA: (function-axioms) implies: % 4.33/1.36 | (3) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 4.33/1.36 | $ki_world] : (v1 = v0 | ~ (p(v2) = v1) | ~ (p(v2) = v0)) % 4.33/1.36 | % 4.33/1.36 | DELTA: instantiating (2) with fresh symbol all_8_0 gives: % 4.33/1.36 | (4) p(all_8_0) = 0 & $ki_accessible($ki_local_world, all_8_0) = 0 & % 4.33/1.36 | $ki_world(all_8_0) % 4.33/1.36 | % 4.33/1.36 | ALPHA: (4) implies: % 4.33/1.36 | (5) $ki_world(all_8_0) % 4.33/1.36 | (6) $ki_accessible($ki_local_world, all_8_0) = 0 % 4.33/1.36 | (7) p(all_8_0) = 0 % 4.33/1.36 | % 4.33/1.36 | GROUND_INST: instantiating (1) with all_8_0, simplifying with (5), (6) gives: % 4.33/1.37 | (8) ? [v0: int] : ( ~ (v0 = 0) & p(all_8_0) = v0) % 4.33/1.37 | % 4.33/1.37 | DELTA: instantiating (8) with fresh symbol all_15_0 gives: % 4.33/1.37 | (9) ~ (all_15_0 = 0) & p(all_8_0) = all_15_0 % 4.33/1.37 | % 4.33/1.37 | ALPHA: (9) implies: % 4.33/1.37 | (10) ~ (all_15_0 = 0) % 4.33/1.37 | (11) p(all_8_0) = all_15_0 % 4.33/1.37 | % 4.33/1.37 | GROUND_INST: instantiating (3) with 0, all_15_0, all_8_0, simplifying with % 4.33/1.37 | (7), (11) gives: % 4.33/1.37 | (12) all_15_0 = 0 % 4.33/1.37 | % 4.33/1.37 | REDUCE: (10), (12) imply: % 4.33/1.37 | (13) $false % 4.33/1.37 | % 4.33/1.37 | CLOSE: (13) is inconsistent. % 4.33/1.37 | % 4.33/1.37 End of proof % 4.33/1.37 % SZS output end Proof for theBenchmark % 4.33/1.37 % 4.33/1.37 749ms %------------------------------------------------------------------------------