TSTP Solution File: KRS065+1 by Princess---230619

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : KRS065+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm  : none
% Format   : tptp
% Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s

% Computer : n017.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 05:51:07 EDT 2023

% Result   : Unsatisfiable 3.36s 1.18s
% Output   : Proof 4.07s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : KRS065+1 : TPTP v8.1.2. Released v3.1.0.
% 0.11/0.13  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.12/0.34  % Computer : n017.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Mon Aug 28 00:36:12 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.19/0.60  ________       _____
% 0.19/0.60  ___  __ \_________(_)________________________________
% 0.19/0.60  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.19/0.60  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.19/0.60  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.19/0.60  
% 0.19/0.60  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.19/0.60  (2023-06-19)
% 0.19/0.60  
% 0.19/0.60  (c) Philipp Rümmer, 2009-2023
% 0.19/0.60  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.19/0.60                Amanda Stjerna.
% 0.19/0.60  Free software under BSD-3-Clause.
% 0.19/0.60  
% 0.19/0.60  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.19/0.60  
% 0.19/0.60  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.19/0.61  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 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 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 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 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 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 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
% 1.59/0.98  Prover 4: Preprocessing ...
% 1.59/0.99  Prover 1: Preprocessing ...
% 2.13/1.03  Prover 6: Preprocessing ...
% 2.13/1.03  Prover 0: Preprocessing ...
% 2.13/1.03  Prover 5: Preprocessing ...
% 2.13/1.03  Prover 2: Preprocessing ...
% 2.13/1.04  Prover 3: Preprocessing ...
% 2.66/1.11  Prover 2: Proving ...
% 2.66/1.11  Prover 5: Proving ...
% 2.66/1.12  Prover 6: Constructing countermodel ...
% 2.66/1.12  Prover 1: Constructing countermodel ...
% 2.66/1.12  Prover 3: Constructing countermodel ...
% 2.66/1.13  Prover 4: Constructing countermodel ...
% 2.66/1.17  Prover 0: Proving ...
% 2.66/1.18  Prover 2: proved (560ms)
% 2.66/1.18  Prover 5: proved (555ms)
% 3.36/1.18  
% 3.36/1.18  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.36/1.18  
% 3.36/1.18  
% 3.36/1.18  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.36/1.18  
% 3.36/1.19  Prover 6: stopped
% 3.36/1.19  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 3.36/1.19  Prover 0: stopped
% 3.36/1.19  Prover 3: proved (557ms)
% 3.36/1.19  
% 3.36/1.19  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.36/1.19  
% 3.36/1.19  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 3.36/1.19  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 3.36/1.19  Prover 4: Found proof (size 6)
% 3.36/1.19  Prover 1: Found proof (size 6)
% 3.36/1.19  Prover 4: proved (558ms)
% 3.36/1.19  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 3.36/1.19  Prover 1: proved (578ms)
% 3.36/1.19  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 3.36/1.20  Prover 7: Preprocessing ...
% 3.47/1.20  Prover 10: Preprocessing ...
% 3.47/1.20  Prover 11: Preprocessing ...
% 3.47/1.21  Prover 8: Preprocessing ...
% 3.47/1.21  Prover 13: Preprocessing ...
% 3.47/1.21  Prover 7: Warning: ignoring some quantifiers
% 3.47/1.21  Prover 7: Constructing countermodel ...
% 3.58/1.21  Prover 10: Warning: ignoring some quantifiers
% 3.58/1.22  Prover 7: stopped
% 3.58/1.22  Prover 10: Constructing countermodel ...
% 3.58/1.22  Prover 11: stopped
% 3.58/1.22  Prover 10: stopped
% 3.58/1.22  Prover 13: Warning: ignoring some quantifiers
% 3.58/1.22  Prover 13: Constructing countermodel ...
% 3.58/1.23  Prover 13: stopped
% 3.58/1.24  Prover 8: Warning: ignoring some quantifiers
% 3.58/1.25  Prover 8: Constructing countermodel ...
% 3.58/1.25  Prover 8: stopped
% 3.58/1.25  
% 3.58/1.26  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.58/1.26  
% 3.58/1.26  % SZS output start Proof for theBenchmark
% 3.58/1.26  Assumptions after simplification:
% 3.58/1.26  ---------------------------------
% 3.58/1.26  
% 3.58/1.26    (axiom_0)
% 3.58/1.30     ! [v0: $i] :  ! [v1: int] : (v1 = 0 |  ~ (cowlThing(v0) = v1) |  ~ $i(v0)) & 
% 3.58/1.30    ! [v0: $i] : ( ~ (cowlNothing(v0) = 0) |  ~ $i(v0))
% 3.58/1.30  
% 3.58/1.30    (axiom_3)
% 3.58/1.30    $i(ib) &  ? [v0: $i] : (rop(ib, v0) = 0 & cowlNothing(v0) = 0 & $i(v0))
% 3.58/1.30  
% 3.58/1.30  Further assumptions not needed in the proof:
% 3.58/1.30  --------------------------------------------
% 3.58/1.30  axiom_1, axiom_2
% 3.58/1.30  
% 3.58/1.30  Those formulas are unsatisfiable:
% 3.58/1.30  ---------------------------------
% 3.58/1.30  
% 3.58/1.30  Begin of proof
% 3.58/1.30  | 
% 3.58/1.30  | ALPHA: (axiom_0) implies:
% 3.58/1.30  |   (1)   ! [v0: $i] : ( ~ (cowlNothing(v0) = 0) |  ~ $i(v0))
% 3.58/1.30  | 
% 3.58/1.30  | ALPHA: (axiom_3) implies:
% 3.58/1.31  |   (2)   ? [v0: $i] : (rop(ib, v0) = 0 & cowlNothing(v0) = 0 & $i(v0))
% 3.58/1.31  | 
% 3.58/1.31  | DELTA: instantiating (2) with fresh symbol all_8_0 gives:
% 3.58/1.31  |   (3)  rop(ib, all_8_0) = 0 & cowlNothing(all_8_0) = 0 & $i(all_8_0)
% 3.58/1.31  | 
% 3.58/1.31  | ALPHA: (3) implies:
% 3.58/1.31  |   (4)  $i(all_8_0)
% 3.58/1.31  |   (5)  cowlNothing(all_8_0) = 0
% 3.58/1.31  | 
% 4.07/1.31  | GROUND_INST: instantiating (1) with all_8_0, simplifying with (4), (5) gives:
% 4.07/1.31  |   (6)  $false
% 4.07/1.31  | 
% 4.07/1.31  | CLOSE: (6) is inconsistent.
% 4.07/1.31  | 
% 4.07/1.31  End of proof
% 4.07/1.31  % SZS output end Proof for theBenchmark
% 4.07/1.31  
% 4.07/1.31  715ms
%------------------------------------------------------------------------------