TSTP Solution File: SYO895_9 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SYO895_9 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n006.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:09 EDT 2023
% Result : Theorem 3.12s 1.18s
% Output : Proof 4.30s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYO895_9 : 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.34 % Computer : n006.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 06:33:37 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.61 ________ _____
% 0.20/0.61 ___ __ \_________(_)________________________________
% 0.20/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.61
% 0.20/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.61 (2023-06-19)
% 0.20/0.61
% 0.20/0.61 (c) Philipp Rümmer, 2009-2023
% 0.20/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.61 Amanda Stjerna.
% 0.20/0.61 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/sandbox/benchmark/theBenchmark.p ...
% 0.20/0.63 Running up to 7 provers in parallel.
% 0.20/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 0.20/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 1.74/0.98 Prover 4: Preprocessing ...
% 1.74/0.98 Prover 1: Preprocessing ...
% 2.41/1.03 Prover 3: Preprocessing ...
% 2.41/1.03 Prover 5: Preprocessing ...
% 2.41/1.03 Prover 2: Preprocessing ...
% 2.41/1.03 Prover 6: Preprocessing ...
% 2.41/1.03 Prover 0: Preprocessing ...
% 2.41/1.10 Prover 5: Proving ...
% 3.12/1.10 Prover 2: Proving ...
% 3.12/1.10 Prover 1: Warning: ignoring some quantifiers
% 3.12/1.10 Prover 3: Warning: ignoring some quantifiers
% 3.12/1.11 Prover 1: Constructing countermodel ...
% 3.12/1.12 Prover 3: Constructing countermodel ...
% 3.12/1.12 Prover 6: Proving ...
% 3.12/1.12 Prover 4: Warning: ignoring some quantifiers
% 3.12/1.13 Prover 4: Constructing countermodel ...
% 3.12/1.13 Prover 0: Proving ...
% 3.12/1.18 Prover 5: proved (536ms)
% 3.12/1.18 Prover 0: proved (541ms)
% 3.12/1.18
% 3.12/1.18 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.12/1.18
% 3.12/1.18
% 3.12/1.18 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.12/1.18
% 3.12/1.18 Prover 2: proved (541ms)
% 3.12/1.18
% 3.12/1.18 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.12/1.18
% 3.12/1.18 Prover 6: stopped
% 3.12/1.18 Prover 3: proved (543ms)
% 3.12/1.18
% 3.12/1.18 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.12/1.18
% 3.12/1.18 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 3.12/1.18 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 3.12/1.18 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 3.12/1.18 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 3.12/1.18 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 3.81/1.20 Prover 7: Preprocessing ...
% 3.81/1.20 Prover 8: Preprocessing ...
% 3.81/1.21 Prover 13: Preprocessing ...
% 3.81/1.21 Prover 10: Preprocessing ...
% 3.81/1.21 Prover 7: Warning: ignoring some quantifiers
% 3.81/1.21 Prover 7: Constructing countermodel ...
% 3.81/1.22 Prover 11: Preprocessing ...
% 3.81/1.22 Prover 13: Warning: ignoring some quantifiers
% 3.81/1.22 Prover 13: Constructing countermodel ...
% 3.81/1.23 Prover 8: Warning: ignoring some quantifiers
% 3.81/1.24 Prover 10: Warning: ignoring some quantifiers
% 3.81/1.24 Prover 10: Constructing countermodel ...
% 3.81/1.24 Prover 1: Found proof (size 13)
% 3.81/1.24 Prover 1: proved (604ms)
% 3.81/1.24 Prover 8: Constructing countermodel ...
% 3.81/1.24 Prover 10: stopped
% 3.81/1.24 Prover 4: stopped
% 3.81/1.24 Prover 7: stopped
% 3.81/1.24 Prover 13: stopped
% 3.81/1.24 Prover 8: stopped
% 3.81/1.26 Prover 11: Warning: ignoring some quantifiers
% 3.81/1.26 Prover 11: Constructing countermodel ...
% 3.81/1.26 Prover 11: stopped
% 3.81/1.26
% 3.81/1.26 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.81/1.26
% 3.81/1.27 % SZS output start Proof for theBenchmark
% 3.81/1.27 Assumptions after simplification:
% 3.81/1.27 ---------------------------------
% 3.81/1.27
% 3.81/1.27 (verify)
% 4.30/1.31 $ki_world($ki_local_world) & ! [v0: $ki_world] : ( ~
% 4.30/1.31 ($ki_accessible($ki_local_world, v0) = 0) | ~ $ki_world(v0) | q(v0) = 0) &
% 4.30/1.31 ! [v0: $ki_world] : ( ~ ($ki_accessible($ki_local_world, v0) = 0) | ~
% 4.30/1.31 $ki_world(v0) | p(v0) = 0) & ? [v0: $ki_world] : ? [v1: any] : ? [v2:
% 4.30/1.31 any] : (q(v0) = v2 & p(v0) = v1 & $ki_accessible($ki_local_world, v0) = 0 &
% 4.30/1.31 $ki_world(v0) & ( ~ (v2 = 0) | ~ (v1 = 0)))
% 4.30/1.31
% 4.30/1.31 (function-axioms)
% 4.30/1.31 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $ki_world] :
% 4.30/1.31 ! [v3: $ki_world] : (v1 = v0 | ~ ($ki_accessible(v3, v2) = v1) | ~
% 4.30/1.31 ($ki_accessible(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 4.30/1.31 MultipleValueBool] : ! [v2: $ki_world] : (v1 = v0 | ~ (q(v2) = v1) | ~
% 4.30/1.31 (q(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : !
% 4.30/1.31 [v2: $ki_world] : (v1 = v0 | ~ (p(v2) = v1) | ~ (p(v2) = v0))
% 4.30/1.31
% 4.30/1.31 Further assumptions not needed in the proof:
% 4.30/1.31 --------------------------------------------
% 4.30/1.31 mrel_serial
% 4.30/1.31
% 4.30/1.31 Those formulas are unsatisfiable:
% 4.30/1.31 ---------------------------------
% 4.30/1.31
% 4.30/1.31 Begin of proof
% 4.30/1.31 |
% 4.30/1.31 | ALPHA: (verify) implies:
% 4.30/1.32 | (1) ! [v0: $ki_world] : ( ~ ($ki_accessible($ki_local_world, v0) = 0) | ~
% 4.30/1.32 | $ki_world(v0) | p(v0) = 0)
% 4.30/1.32 | (2) ! [v0: $ki_world] : ( ~ ($ki_accessible($ki_local_world, v0) = 0) | ~
% 4.30/1.32 | $ki_world(v0) | q(v0) = 0)
% 4.30/1.32 | (3) ? [v0: $ki_world] : ? [v1: any] : ? [v2: any] : (q(v0) = v2 & p(v0)
% 4.30/1.32 | = v1 & $ki_accessible($ki_local_world, v0) = 0 & $ki_world(v0) & ( ~
% 4.30/1.32 | (v2 = 0) | ~ (v1 = 0)))
% 4.30/1.32 |
% 4.30/1.32 | ALPHA: (function-axioms) implies:
% 4.30/1.32 | (4) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2:
% 4.30/1.32 | $ki_world] : (v1 = v0 | ~ (p(v2) = v1) | ~ (p(v2) = v0))
% 4.30/1.32 | (5) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2:
% 4.30/1.32 | $ki_world] : (v1 = v0 | ~ (q(v2) = v1) | ~ (q(v2) = v0))
% 4.30/1.32 |
% 4.30/1.32 | DELTA: instantiating (3) with fresh symbols all_8_0, all_8_1, all_8_2 gives:
% 4.30/1.32 | (6) q(all_8_2) = all_8_0 & p(all_8_2) = all_8_1 &
% 4.30/1.32 | $ki_accessible($ki_local_world, all_8_2) = 0 & $ki_world(all_8_2) & ( ~
% 4.30/1.32 | (all_8_0 = 0) | ~ (all_8_1 = 0))
% 4.30/1.32 |
% 4.30/1.32 | ALPHA: (6) implies:
% 4.30/1.32 | (7) $ki_world(all_8_2)
% 4.30/1.32 | (8) $ki_accessible($ki_local_world, all_8_2) = 0
% 4.30/1.32 | (9) p(all_8_2) = all_8_1
% 4.30/1.32 | (10) q(all_8_2) = all_8_0
% 4.30/1.32 | (11) ~ (all_8_0 = 0) | ~ (all_8_1 = 0)
% 4.30/1.32 |
% 4.30/1.33 | GROUND_INST: instantiating (2) with all_8_2, simplifying with (7), (8) gives:
% 4.30/1.33 | (12) q(all_8_2) = 0
% 4.30/1.33 |
% 4.30/1.33 | GROUND_INST: instantiating (1) with all_8_2, simplifying with (7), (8) gives:
% 4.30/1.33 | (13) p(all_8_2) = 0
% 4.30/1.33 |
% 4.30/1.33 | GROUND_INST: instantiating (4) with all_8_1, 0, all_8_2, simplifying with (9),
% 4.30/1.33 | (13) gives:
% 4.30/1.33 | (14) all_8_1 = 0
% 4.30/1.33 |
% 4.30/1.33 | GROUND_INST: instantiating (5) with all_8_0, 0, all_8_2, simplifying with
% 4.30/1.33 | (10), (12) gives:
% 4.30/1.33 | (15) all_8_0 = 0
% 4.30/1.33 |
% 4.30/1.33 | BETA: splitting (11) gives:
% 4.30/1.33 |
% 4.30/1.33 | Case 1:
% 4.30/1.33 | |
% 4.30/1.33 | | (16) ~ (all_8_0 = 0)
% 4.30/1.33 | |
% 4.30/1.33 | | REDUCE: (15), (16) imply:
% 4.30/1.33 | | (17) $false
% 4.30/1.33 | |
% 4.30/1.33 | | CLOSE: (17) is inconsistent.
% 4.30/1.33 | |
% 4.30/1.33 | Case 2:
% 4.30/1.33 | |
% 4.30/1.33 | | (18) ~ (all_8_1 = 0)
% 4.30/1.33 | |
% 4.30/1.33 | | REDUCE: (14), (18) imply:
% 4.30/1.33 | | (19) $false
% 4.30/1.33 | |
% 4.30/1.33 | | CLOSE: (19) is inconsistent.
% 4.30/1.33 | |
% 4.30/1.33 | End of split
% 4.30/1.33 |
% 4.30/1.33 End of proof
% 4.30/1.33 % SZS output end Proof for theBenchmark
% 4.30/1.33
% 4.30/1.33 714ms
%------------------------------------------------------------------------------