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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : KRS087+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 : n007.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:11 EDT 2023

% Result   : Unsatisfiable 6.11s 1.61s
% Output   : Proof 7.87s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14  % Problem  : KRS087+1 : TPTP v8.1.2. Released v3.1.0.
% 0.13/0.15  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.15/0.36  % Computer : n007.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 300
% 0.15/0.36  % DateTime : Mon Aug 28 00:52:42 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 0.23/0.63  ________       _____
% 0.23/0.63  ___  __ \_________(_)________________________________
% 0.23/0.63  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.23/0.63  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.23/0.63  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.23/0.63  
% 0.23/0.63  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.23/0.63  (2023-06-19)
% 0.23/0.63  
% 0.23/0.63  (c) Philipp Rümmer, 2009-2023
% 0.23/0.63  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.23/0.63                Amanda Stjerna.
% 0.23/0.63  Free software under BSD-3-Clause.
% 0.23/0.63  
% 0.23/0.63  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.23/0.63  
% 0.23/0.63  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.23/0.65  Running up to 7 provers in parallel.
% 0.23/0.66  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.23/0.66  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.23/0.66  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.23/0.66  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.23/0.66  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.23/0.66  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.23/0.66  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.68/1.09  Prover 1: Preprocessing ...
% 2.68/1.09  Prover 4: Preprocessing ...
% 3.01/1.14  Prover 0: Preprocessing ...
% 3.01/1.14  Prover 2: Preprocessing ...
% 3.01/1.14  Prover 6: Preprocessing ...
% 3.01/1.14  Prover 3: Preprocessing ...
% 3.01/1.14  Prover 5: Preprocessing ...
% 4.32/1.38  Prover 5: Proving ...
% 4.32/1.38  Prover 2: Proving ...
% 5.14/1.45  Prover 1: Constructing countermodel ...
% 5.14/1.45  Prover 6: Proving ...
% 5.37/1.48  Prover 3: Constructing countermodel ...
% 5.37/1.50  Prover 4: Constructing countermodel ...
% 5.86/1.56  Prover 3: gave up
% 5.86/1.56  Prover 1: gave up
% 6.11/1.57  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 6.11/1.57  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 6.11/1.60  Prover 8: Preprocessing ...
% 6.11/1.60  Prover 0: Proving ...
% 6.11/1.60  Prover 7: Preprocessing ...
% 6.11/1.61  Prover 2: proved (949ms)
% 6.11/1.61  
% 6.11/1.61  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.11/1.61  
% 6.11/1.61  Prover 5: proved (948ms)
% 6.11/1.61  
% 6.11/1.61  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.11/1.61  
% 6.11/1.61  Prover 6: stopped
% 6.11/1.61  Prover 0: stopped
% 6.62/1.63  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 6.62/1.63  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 6.62/1.63  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 6.62/1.63  Prover 16: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683
% 6.62/1.65  Prover 13: Preprocessing ...
% 6.62/1.65  Prover 10: Preprocessing ...
% 6.62/1.66  Prover 11: Preprocessing ...
% 6.62/1.66  Prover 7: Warning: ignoring some quantifiers
% 6.62/1.67  Prover 7: Constructing countermodel ...
% 6.88/1.67  Prover 16: Preprocessing ...
% 6.88/1.69  Prover 13: Warning: ignoring some quantifiers
% 6.88/1.70  Prover 13: Constructing countermodel ...
% 6.88/1.71  Prover 10: Warning: ignoring some quantifiers
% 6.88/1.72  Prover 10: Constructing countermodel ...
% 6.88/1.73  Prover 8: Warning: ignoring some quantifiers
% 6.88/1.73  Prover 7: Found proof (size 12)
% 6.88/1.73  Prover 7: proved (170ms)
% 6.88/1.73  Prover 13: stopped
% 6.88/1.73  Prover 4: stopped
% 7.38/1.73  Prover 16: Warning: ignoring some quantifiers
% 7.38/1.73  Prover 10: stopped
% 7.38/1.74  Prover 16: Constructing countermodel ...
% 7.38/1.74  Prover 16: stopped
% 7.38/1.74  Prover 8: Constructing countermodel ...
% 7.38/1.75  Prover 8: stopped
% 7.54/1.79  Prover 11: Constructing countermodel ...
% 7.54/1.80  Prover 11: stopped
% 7.54/1.80  
% 7.54/1.80  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.54/1.80  
% 7.54/1.80  % SZS output start Proof for theBenchmark
% 7.54/1.81  Assumptions after simplification:
% 7.54/1.81  ---------------------------------
% 7.54/1.81  
% 7.54/1.81    (axiom_2)
% 7.54/1.81     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : ( ~ $i(v2) |  ~ $i(v1) |  ~ $i(v0) |
% 7.54/1.81       ~ rr(v1, v2) |  ~ rr(v0, v1) |  ~ cp1(v2) |  ~ cp1(v0) | cUnsatisfiable(v0)
% 7.54/1.81      |  ? [v3: $i] : ($i(v3) & rinvR(v2, v3) & cp1(v3))) &  ! [v0: $i] : ( ~
% 7.54/1.81      $i(v0) |  ~ cUnsatisfiable(v0) | cp1(v0)) &  ! [v0: $i] : ( ~ $i(v0) |  ~
% 7.54/1.81      cUnsatisfiable(v0) |  ? [v1: $i] :  ? [v2: $i] : ($i(v2) & $i(v1) & rr(v1,
% 7.54/1.81          v2) & rr(v0, v1) & cp1(v2) &  ! [v3: $i] : ( ~ $i(v3) |  ~ rinvR(v2, v3)
% 7.54/1.81          |  ~ cp1(v3))))
% 7.54/1.81  
% 7.54/1.81    (axiom_5)
% 7.54/1.82     ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~ rr(v1, v0) | rinvR(v0,
% 7.54/1.82        v1)) &  ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~ rinvR(v0,
% 7.54/1.82        v1) | rr(v1, v0))
% 7.54/1.82  
% 7.54/1.82    (axiom_6)
% 7.54/1.82     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : ( ~ $i(v2) |  ~ $i(v1) |  ~ $i(v0) |
% 7.54/1.82       ~ rr(v1, v2) |  ~ rr(v0, v1) | rr(v0, v2))
% 7.54/1.82  
% 7.54/1.82    (axiom_7)
% 7.54/1.82    $i(i2003_11_14_17_19_46763) & cUnsatisfiable(i2003_11_14_17_19_46763)
% 7.54/1.82  
% 7.54/1.82  Further assumptions not needed in the proof:
% 7.54/1.82  --------------------------------------------
% 7.54/1.82  axiom_0, axiom_1, axiom_3, axiom_4, cUnsatisfiable_substitution_1,
% 7.54/1.82  cowlNothing_substitution_1, cowlThing_substitution_1, cp1_substitution_1,
% 7.54/1.82  rf_substitution_1, rf_substitution_2, rinvF_substitution_1,
% 7.54/1.82  rinvF_substitution_2, rinvR_substitution_1, rinvR_substitution_2,
% 7.54/1.82  rr_substitution_1, rr_substitution_2, xsd_integer_substitution_1,
% 7.54/1.82  xsd_string_substitution_1
% 7.54/1.82  
% 7.54/1.82  Those formulas are unsatisfiable:
% 7.54/1.82  ---------------------------------
% 7.54/1.82  
% 7.54/1.82  Begin of proof
% 7.54/1.82  | 
% 7.54/1.82  | ALPHA: (axiom_7) implies:
% 7.54/1.82  |   (1)  cUnsatisfiable(i2003_11_14_17_19_46763)
% 7.54/1.82  |   (2)  $i(i2003_11_14_17_19_46763)
% 7.54/1.82  | 
% 7.54/1.82  | ALPHA: (axiom_5) implies:
% 7.54/1.82  |   (3)   ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~ rr(v1, v0) |
% 7.54/1.82  |          rinvR(v0, v1))
% 7.54/1.82  | 
% 7.54/1.82  | ALPHA: (axiom_2) implies:
% 7.54/1.82  |   (4)   ! [v0: $i] : ( ~ $i(v0) |  ~ cUnsatisfiable(v0) |  ? [v1: $i] :  ?
% 7.54/1.82  |          [v2: $i] : ($i(v2) & $i(v1) & rr(v1, v2) & rr(v0, v1) & cp1(v2) &  !
% 7.54/1.82  |            [v3: $i] : ( ~ $i(v3) |  ~ rinvR(v2, v3) |  ~ cp1(v3))))
% 7.54/1.82  |   (5)   ! [v0: $i] : ( ~ $i(v0) |  ~ cUnsatisfiable(v0) | cp1(v0))
% 7.54/1.82  | 
% 7.87/1.83  | GROUND_INST: instantiating (5) with i2003_11_14_17_19_46763, simplifying with
% 7.87/1.83  |              (1), (2) gives:
% 7.87/1.83  |   (6)  cp1(i2003_11_14_17_19_46763)
% 7.87/1.83  | 
% 7.87/1.83  | GROUND_INST: instantiating (4) with i2003_11_14_17_19_46763, simplifying with
% 7.87/1.83  |              (1), (2) gives:
% 7.87/1.83  |   (7)   ? [v0: $i] :  ? [v1: $i] : ($i(v1) & $i(v0) & rr(v0, v1) &
% 7.87/1.83  |          rr(i2003_11_14_17_19_46763, v0) & cp1(v1) &  ! [v2: $i] : ( ~ $i(v2)
% 7.87/1.83  |            |  ~ rinvR(v1, v2) |  ~ cp1(v2)))
% 7.87/1.83  | 
% 7.87/1.83  | DELTA: instantiating (7) with fresh symbols all_18_0, all_18_1 gives:
% 7.87/1.83  |   (8)  $i(all_18_0) & $i(all_18_1) & rr(all_18_1, all_18_0) &
% 7.87/1.83  |        rr(i2003_11_14_17_19_46763, all_18_1) & cp1(all_18_0) &  ! [v0: $i] : (
% 7.87/1.83  |          ~ $i(v0) |  ~ rinvR(all_18_0, v0) |  ~ cp1(v0))
% 7.87/1.83  | 
% 7.87/1.83  | ALPHA: (8) implies:
% 7.87/1.83  |   (9)  rr(i2003_11_14_17_19_46763, all_18_1)
% 7.87/1.83  |   (10)  rr(all_18_1, all_18_0)
% 7.87/1.83  |   (11)  $i(all_18_1)
% 7.87/1.83  |   (12)  $i(all_18_0)
% 7.87/1.83  |   (13)   ! [v0: $i] : ( ~ $i(v0) |  ~ rinvR(all_18_0, v0) |  ~ cp1(v0))
% 7.87/1.83  | 
% 7.87/1.83  | GROUND_INST: instantiating (axiom_6) with i2003_11_14_17_19_46763, all_18_1,
% 7.87/1.83  |              all_18_0, simplifying with (2), (9), (10), (11), (12) gives:
% 7.87/1.83  |   (14)  rr(i2003_11_14_17_19_46763, all_18_0)
% 7.87/1.83  | 
% 7.87/1.83  | GROUND_INST: instantiating (13) with i2003_11_14_17_19_46763, simplifying with
% 7.87/1.83  |              (2), (6) gives:
% 7.87/1.83  |   (15)   ~ rinvR(all_18_0, i2003_11_14_17_19_46763)
% 7.87/1.83  | 
% 7.87/1.83  | GROUND_INST: instantiating (3) with all_18_0, i2003_11_14_17_19_46763,
% 7.87/1.83  |              simplifying with (2), (12), (14) gives:
% 7.87/1.83  |   (16)  rinvR(all_18_0, i2003_11_14_17_19_46763)
% 7.87/1.83  | 
% 7.87/1.83  | PRED_UNIFY: (15), (16) imply:
% 7.87/1.83  |   (17)  $false
% 7.87/1.83  | 
% 7.87/1.83  | CLOSE: (17) is inconsistent.
% 7.87/1.83  | 
% 7.87/1.83  End of proof
% 7.87/1.83  % SZS output end Proof for theBenchmark
% 7.87/1.84  
% 7.87/1.84  1201ms
%------------------------------------------------------------------------------