TSTP Solution File: NLP267_5 by Princess---230619

View Problem - Process Solution

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

% Computer : n009.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 : Thu Aug 31 10:05:02 EDT 2023

% Result   : Theorem 4.14s 1.28s
% Output   : Proof 6.02s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : NLP267_5 : TPTP v8.2.0. Released v8.2.0.
% 0.00/0.13  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.33  % Computer : n009.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 300
% 0.13/0.33  % DateTime : Thu Aug 24 10:39:21 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.19/0.61  ________       _____
% 0.19/0.61  ___  __ \_________(_)________________________________
% 0.19/0.61  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.19/0.61  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.19/0.61  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.19/0.61  
% 0.19/0.61  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.19/0.61  (2023-06-19)
% 0.19/0.61  
% 0.19/0.61  (c) Philipp Rümmer, 2009-2023
% 0.19/0.61  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.19/0.61                Amanda Stjerna.
% 0.19/0.61  Free software under BSD-3-Clause.
% 0.19/0.61  
% 0.19/0.61  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.19/0.61  
% 0.19/0.61  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.19/0.62  Running up to 7 provers in parallel.
% 0.19/0.63  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.19/0.63  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.19/0.63  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.19/0.63  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.19/0.63  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.19/0.63  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.19/0.63  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.96/1.00  Prover 4: Preprocessing ...
% 2.45/1.00  Prover 1: Preprocessing ...
% 2.45/1.03  Prover 0: Preprocessing ...
% 2.45/1.03  Prover 3: Preprocessing ...
% 2.45/1.03  Prover 5: Preprocessing ...
% 2.45/1.03  Prover 6: Preprocessing ...
% 2.45/1.03  Prover 2: Preprocessing ...
% 3.66/1.17  Prover 6: Constructing countermodel ...
% 3.66/1.17  Prover 3: Constructing countermodel ...
% 3.66/1.18  Prover 1: Constructing countermodel ...
% 3.66/1.18  Prover 2: Proving ...
% 3.66/1.18  Prover 5: Proving ...
% 4.14/1.25  Prover 4: Constructing countermodel ...
% 4.14/1.28  Prover 1: gave up
% 4.14/1.28  Prover 6: gave up
% 4.14/1.28  Prover 3: gave up
% 4.14/1.28  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 4.14/1.28  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 4.14/1.28  Prover 9: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allMinimal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1423531889
% 4.14/1.28  Prover 2: proved (656ms)
% 4.14/1.28  
% 4.14/1.28  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.14/1.28  
% 4.14/1.29  Prover 5: proved (652ms)
% 4.14/1.29  
% 4.14/1.29  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.14/1.29  
% 4.14/1.30  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 4.14/1.30  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 4.14/1.31  Prover 9: Preprocessing ...
% 4.14/1.32  Prover 8: Preprocessing ...
% 4.86/1.33  Prover 11: Preprocessing ...
% 4.86/1.34  Prover 7: Preprocessing ...
% 4.86/1.34  Prover 10: Preprocessing ...
% 4.86/1.35  Prover 0: Proving ...
% 4.86/1.36  Prover 0: stopped
% 4.86/1.36  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 4.86/1.37  Prover 8: Warning: ignoring some quantifiers
% 4.86/1.38  Prover 8: Constructing countermodel ...
% 4.86/1.38  Prover 7: Warning: ignoring some quantifiers
% 4.86/1.38  Prover 13: Preprocessing ...
% 4.86/1.39  Prover 10: Warning: ignoring some quantifiers
% 4.86/1.39  Prover 10: Constructing countermodel ...
% 4.86/1.40  Prover 7: Constructing countermodel ...
% 5.37/1.40  Prover 13: Warning: ignoring some quantifiers
% 5.37/1.42  Prover 13: Constructing countermodel ...
% 5.37/1.43  Prover 9: Constructing countermodel ...
% 5.37/1.44  Prover 9: stopped
% 5.37/1.44  Prover 16: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683
% 5.37/1.44  Prover 8: gave up
% 5.37/1.44  Prover 19: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=-1780594085
% 5.37/1.45  Prover 10: Found proof (size 10)
% 5.37/1.45  Prover 10: proved (151ms)
% 5.37/1.45  Prover 7: Found proof (size 10)
% 5.37/1.45  Prover 7: proved (177ms)
% 5.37/1.45  Prover 16: Preprocessing ...
% 5.37/1.45  Prover 4: stopped
% 5.37/1.46  Prover 13: stopped
% 5.37/1.46  Prover 19: Preprocessing ...
% 5.37/1.47  Prover 16: Warning: ignoring some quantifiers
% 5.37/1.48  Prover 16: Constructing countermodel ...
% 5.37/1.48  Prover 16: stopped
% 5.37/1.50  Prover 11: Constructing countermodel ...
% 5.37/1.51  Prover 11: stopped
% 5.37/1.51  Prover 19: Warning: ignoring some quantifiers
% 6.02/1.52  Prover 19: Constructing countermodel ...
% 6.02/1.53  Prover 19: stopped
% 6.02/1.53  
% 6.02/1.53  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.02/1.53  
% 6.02/1.53  % SZS output start Proof for theBenchmark
% 6.02/1.53  Assumptions after simplification:
% 6.02/1.53  ---------------------------------
% 6.02/1.53  
% 6.02/1.53    (belief1)
% 6.02/1.54    $ki_world($ki_local_world) & $i(paris) &  ! [v0: $ki_world] : ( ~
% 6.02/1.54      $ki_world(v0) |  ~ $ki_accessible($ki_local_world, v0) | dest(v0, paris))
% 6.02/1.54  
% 6.02/1.54    (belief2)
% 6.02/1.54    $ki_world($ki_local_world) & $i(second) &  ! [v0: $ki_world] : ( ~
% 6.02/1.54      $ki_world(v0) |  ~ $ki_accessible($ki_local_world, v0) | class(v0, second))
% 6.02/1.54  
% 6.02/1.54    (law2)
% 6.02/1.54    $ki_world($ki_local_world) & $i(paris) & $i(second) & $i(seventy) &  ! [v0:
% 6.02/1.54      $ki_world] : ( ~ $ki_world(v0) |  ~ class(v0, second) |  ~ dest(v0, paris) |
% 6.02/1.54       ~ $ki_accessible($ki_local_world, v0) | price(v0, seventy))
% 6.02/1.54  
% 6.02/1.54    (verify)
% 6.02/1.54    $ki_world($ki_local_world) & $i(seventy) &  ? [v0: $ki_world] : ($ki_world(v0)
% 6.02/1.54      & $ki_accessible($ki_local_world, v0) &  ~ price(v0, seventy))
% 6.02/1.54  
% 6.02/1.54  Further assumptions not needed in the proof:
% 6.02/1.54  --------------------------------------------
% 6.02/1.54  law1, law3, law4, mrel_universal
% 6.02/1.54  
% 6.02/1.54  Those formulas are unsatisfiable:
% 6.02/1.54  ---------------------------------
% 6.02/1.54  
% 6.02/1.54  Begin of proof
% 6.02/1.54  | 
% 6.02/1.54  | ALPHA: (verify) implies:
% 6.02/1.54  |   (1)   ? [v0: $ki_world] : ($ki_world(v0) & $ki_accessible($ki_local_world,
% 6.02/1.54  |            v0) &  ~ price(v0, seventy))
% 6.02/1.54  | 
% 6.02/1.54  | ALPHA: (belief2) implies:
% 6.02/1.55  |   (2)   ! [v0: $ki_world] : ( ~ $ki_world(v0) |  ~
% 6.02/1.55  |          $ki_accessible($ki_local_world, v0) | class(v0, second))
% 6.02/1.55  | 
% 6.02/1.55  | ALPHA: (belief1) implies:
% 6.02/1.55  |   (3)   ! [v0: $ki_world] : ( ~ $ki_world(v0) |  ~
% 6.02/1.55  |          $ki_accessible($ki_local_world, v0) | dest(v0, paris))
% 6.02/1.55  | 
% 6.02/1.55  | ALPHA: (law2) implies:
% 6.02/1.55  |   (4)   ! [v0: $ki_world] : ( ~ $ki_world(v0) |  ~ class(v0, second) |  ~
% 6.02/1.55  |          dest(v0, paris) |  ~ $ki_accessible($ki_local_world, v0) | price(v0,
% 6.02/1.55  |            seventy))
% 6.02/1.55  | 
% 6.02/1.55  | DELTA: instantiating (1) with fresh symbol all_11_0 gives:
% 6.02/1.55  |   (5)  $ki_world(all_11_0) & $ki_accessible($ki_local_world, all_11_0) &  ~
% 6.02/1.55  |        price(all_11_0, seventy)
% 6.02/1.55  | 
% 6.02/1.55  | ALPHA: (5) implies:
% 6.02/1.55  |   (6)   ~ price(all_11_0, seventy)
% 6.02/1.55  |   (7)  $ki_accessible($ki_local_world, all_11_0)
% 6.02/1.55  |   (8)  $ki_world(all_11_0)
% 6.02/1.55  | 
% 6.02/1.55  | GROUND_INST: instantiating (2) with all_11_0, simplifying with (7), (8) gives:
% 6.02/1.55  |   (9)  class(all_11_0, second)
% 6.02/1.55  | 
% 6.02/1.55  | GROUND_INST: instantiating (3) with all_11_0, simplifying with (7), (8) gives:
% 6.02/1.55  |   (10)  dest(all_11_0, paris)
% 6.02/1.55  | 
% 6.02/1.56  | GROUND_INST: instantiating (4) with all_11_0, simplifying with (6), (7), (8),
% 6.02/1.56  |              (9), (10) gives:
% 6.02/1.56  |   (11)  $false
% 6.02/1.56  | 
% 6.02/1.56  | CLOSE: (11) is inconsistent.
% 6.02/1.56  | 
% 6.02/1.56  End of proof
% 6.02/1.56  % SZS output end Proof for theBenchmark
% 6.02/1.56  
% 6.02/1.56  950ms
%------------------------------------------------------------------------------