TSTP Solution File: SYO896_7 by Princess---230619

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : SYO896_7 : TPTP v8.2.0. Released v8.2.0.
% Transfm  : none
% Format   : tptp
% Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s

% Computer : n024.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 4.29s 1.44s
% Output   : Proof 5.32s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SYO896_7 : TPTP v8.2.0. Released v8.2.0.
% 0.07/0.13  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.35  % Computer : n024.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Sat Aug 26 06:36:39 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.19/0.67  ________       _____
% 0.19/0.67  ___  __ \_________(_)________________________________
% 0.19/0.67  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.19/0.67  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.19/0.67  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.19/0.67  
% 0.19/0.67  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.19/0.67  (2023-06-19)
% 0.19/0.67  
% 0.19/0.67  (c) Philipp Rümmer, 2009-2023
% 0.19/0.67  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.19/0.67                Amanda Stjerna.
% 0.19/0.67  Free software under BSD-3-Clause.
% 0.19/0.67  
% 0.19/0.67  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.19/0.67  
% 0.19/0.68  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.77/0.69  Running up to 7 provers in parallel.
% 0.77/0.72  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.77/0.72  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.77/0.72  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.77/0.72  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.77/0.72  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.77/0.72  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.77/0.72  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.33/1.16  Prover 1: Preprocessing ...
% 2.33/1.17  Prover 4: Preprocessing ...
% 2.77/1.23  Prover 6: Preprocessing ...
% 2.77/1.23  Prover 5: Preprocessing ...
% 2.77/1.23  Prover 3: Preprocessing ...
% 2.77/1.23  Prover 0: Preprocessing ...
% 2.77/1.23  Prover 2: Preprocessing ...
% 3.42/1.31  Prover 2: Constructing countermodel ...
% 3.42/1.31  Prover 5: Constructing countermodel ...
% 3.42/1.33  Prover 3: Constructing countermodel ...
% 3.42/1.34  Prover 1: Constructing countermodel ...
% 3.42/1.35  Prover 6: Proving ...
% 3.42/1.37  Prover 4: Constructing countermodel ...
% 4.19/1.42  Prover 0: Proving ...
% 4.29/1.44  Prover 5: proved (722ms)
% 4.29/1.44  
% 4.29/1.44  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.29/1.44  
% 4.29/1.44  Prover 2: proved (741ms)
% 4.29/1.44  
% 4.29/1.44  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.29/1.44  
% 4.29/1.44  Prover 0: stopped
% 4.29/1.44  Prover 6: stopped
% 4.29/1.45  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 4.29/1.45  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 4.29/1.45  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 4.29/1.45  Prover 3: stopped
% 4.29/1.46  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 4.29/1.46  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 4.29/1.47  Prover 8: Preprocessing ...
% 4.29/1.47  Prover 10: Preprocessing ...
% 4.29/1.48  Prover 7: Preprocessing ...
% 4.29/1.48  Prover 13: Preprocessing ...
% 4.29/1.49  Prover 10: Constructing countermodel ...
% 4.29/1.49  Prover 7: Constructing countermodel ...
% 4.29/1.50  Prover 13: Constructing countermodel ...
% 4.29/1.50  Prover 11: Preprocessing ...
% 4.29/1.51  Prover 8: Warning: ignoring some quantifiers
% 4.95/1.51  Prover 8: Constructing countermodel ...
% 4.95/1.53  Prover 13: Found proof (size 6)
% 4.95/1.54  Prover 13: proved (78ms)
% 4.95/1.54  Prover 4: stopped
% 4.95/1.54  Prover 1: stopped
% 4.95/1.54  Prover 7: stopped
% 4.95/1.54  Prover 10: stopped
% 4.95/1.54  Prover 8: stopped
% 5.32/1.59  Prover 11: Constructing countermodel ...
% 5.32/1.60  Prover 11: stopped
% 5.32/1.60  
% 5.32/1.60  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.32/1.60  
% 5.32/1.60  % SZS output start Proof for theBenchmark
% 5.32/1.61  Assumptions after simplification:
% 5.32/1.61  ---------------------------------
% 5.32/1.61  
% 5.32/1.61    (verify)
% 5.32/1.62    $ki_world($ki_local_world) &  ? [v0: $ki_world] : ($ki_world(v0) & p(v0) &
% 5.32/1.62      $ki_accessible($ki_local_world, v0) &  ! [v1: $ki_world] : ( ~ $ki_world(v1)
% 5.32/1.62        |  ~ q(v1) |  ~ p(v1) |  ~ $ki_accessible($ki_local_world, v1)) &  ! [v1:
% 5.32/1.62        $ki_world] : ( ~ $ki_world(v1) |  ~ p(v1) |  ~
% 5.32/1.62        $ki_accessible($ki_local_world, v1) | q(v1)))
% 5.32/1.62  
% 5.32/1.62  Those formulas are unsatisfiable:
% 5.32/1.62  ---------------------------------
% 5.32/1.62  
% 5.32/1.62  Begin of proof
% 5.32/1.62  | 
% 5.32/1.62  | ALPHA: (verify) implies:
% 5.32/1.63  |   (1)   ? [v0: $ki_world] : ($ki_world(v0) & p(v0) &
% 5.32/1.63  |          $ki_accessible($ki_local_world, v0) &  ! [v1: $ki_world] : ( ~
% 5.32/1.63  |            $ki_world(v1) |  ~ q(v1) |  ~ p(v1) |  ~
% 5.32/1.63  |            $ki_accessible($ki_local_world, v1)) &  ! [v1: $ki_world] : ( ~
% 5.32/1.63  |            $ki_world(v1) |  ~ p(v1) |  ~ $ki_accessible($ki_local_world, v1) |
% 5.32/1.63  |            q(v1)))
% 5.32/1.63  | 
% 5.32/1.63  | DELTA: instantiating (1) with fresh symbol all_5_0 gives:
% 5.32/1.63  |   (2)  $ki_world(all_5_0) & p(all_5_0) & $ki_accessible($ki_local_world,
% 5.32/1.63  |          all_5_0) &  ! [v0: $ki_world] : ( ~ $ki_world(v0) |  ~ q(v0) |  ~
% 5.32/1.63  |          p(v0) |  ~ $ki_accessible($ki_local_world, v0)) &  ! [v0: $ki_world]
% 5.32/1.63  |        : ( ~ $ki_world(v0) |  ~ p(v0) |  ~ $ki_accessible($ki_local_world, v0)
% 5.32/1.63  |          | q(v0))
% 5.32/1.63  | 
% 5.32/1.63  | ALPHA: (2) implies:
% 5.32/1.64  |   (3)  $ki_accessible($ki_local_world, all_5_0)
% 5.32/1.64  |   (4)  p(all_5_0)
% 5.32/1.64  |   (5)  $ki_world(all_5_0)
% 5.32/1.64  |   (6)   ! [v0: $ki_world] : ( ~ $ki_world(v0) |  ~ p(v0) |  ~
% 5.32/1.64  |          $ki_accessible($ki_local_world, v0) | q(v0))
% 5.32/1.64  |   (7)   ! [v0: $ki_world] : ( ~ $ki_world(v0) |  ~ q(v0) |  ~ p(v0) |  ~
% 5.32/1.64  |          $ki_accessible($ki_local_world, v0))
% 5.32/1.64  | 
% 5.32/1.64  | GROUND_INST: instantiating (6) with all_5_0, simplifying with (3), (4), (5)
% 5.32/1.64  |              gives:
% 5.32/1.64  |   (8)  q(all_5_0)
% 5.32/1.64  | 
% 5.32/1.64  | GROUND_INST: instantiating (7) with all_5_0, simplifying with (3), (4), (5),
% 5.32/1.64  |              (8) gives:
% 5.32/1.64  |   (9)  $false
% 5.32/1.65  | 
% 5.32/1.65  | CLOSE: (9) is inconsistent.
% 5.32/1.65  | 
% 5.32/1.65  End of proof
% 5.32/1.65  % SZS output end Proof for theBenchmark
% 5.32/1.65  
% 5.32/1.65  970ms
%------------------------------------------------------------------------------