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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : KRS075+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 : n020.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:09 EDT 2023

% Result   : Unsatisfiable 5.77s 1.54s
% Output   : Proof 8.03s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : KRS075+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.13  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34  % Computer : n020.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % 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 : Mon Aug 28 02:12:59 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.20/0.58  ________       _____
% 0.20/0.58  ___  __ \_________(_)________________________________
% 0.20/0.58  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.20/0.58  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.20/0.58  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.20/0.58  
% 0.20/0.58  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.58  (2023-06-19)
% 0.20/0.58  
% 0.20/0.58  (c) Philipp Rümmer, 2009-2023
% 0.20/0.58  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.58                Amanda Stjerna.
% 0.20/0.58  Free software under BSD-3-Clause.
% 0.20/0.58  
% 0.20/0.58  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.58  
% 0.20/0.58  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.20/0.59  Running up to 7 provers in parallel.
% 0.20/0.61  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.61  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.61  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.61  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.61  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.61  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.61  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.57/1.08  Prover 1: Preprocessing ...
% 2.57/1.09  Prover 4: Preprocessing ...
% 2.57/1.12  Prover 3: Preprocessing ...
% 2.57/1.12  Prover 6: Preprocessing ...
% 2.57/1.12  Prover 2: Preprocessing ...
% 2.57/1.12  Prover 0: Preprocessing ...
% 2.57/1.12  Prover 5: Preprocessing ...
% 4.68/1.37  Prover 5: Proving ...
% 4.68/1.37  Prover 2: Proving ...
% 4.68/1.42  Prover 3: Constructing countermodel ...
% 4.68/1.44  Prover 6: Proving ...
% 4.68/1.44  Prover 1: Constructing countermodel ...
% 4.68/1.52  Prover 6: gave up
% 4.68/1.52  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 5.77/1.53  Prover 0: Proving ...
% 5.77/1.53  Prover 2: proved (936ms)
% 5.77/1.53  Prover 5: proved (931ms)
% 5.77/1.54  
% 5.77/1.54  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.77/1.54  
% 5.77/1.54  
% 5.77/1.54  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.77/1.54  
% 5.77/1.54  Prover 3: stopped
% 5.77/1.54  Prover 0: stopped
% 5.77/1.54  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 5.77/1.54  Prover 1: gave up
% 5.77/1.54  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 5.77/1.54  Prover 4: Constructing countermodel ...
% 5.77/1.54  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 5.77/1.54  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 5.77/1.55  Prover 16: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683
% 5.77/1.58  Prover 7: Preprocessing ...
% 6.53/1.59  Prover 13: Preprocessing ...
% 6.53/1.59  Prover 11: Preprocessing ...
% 6.53/1.59  Prover 10: Preprocessing ...
% 6.53/1.59  Prover 16: Preprocessing ...
% 6.53/1.61  Prover 8: Preprocessing ...
% 6.53/1.63  Prover 13: Warning: ignoring some quantifiers
% 6.53/1.63  Prover 7: Warning: ignoring some quantifiers
% 6.53/1.64  Prover 13: Constructing countermodel ...
% 6.53/1.64  Prover 10: Warning: ignoring some quantifiers
% 6.53/1.64  Prover 16: Warning: ignoring some quantifiers
% 6.53/1.64  Prover 7: Constructing countermodel ...
% 6.53/1.64  Prover 10: Constructing countermodel ...
% 6.53/1.64  Prover 16: Constructing countermodel ...
% 7.62/1.73  Prover 10: Found proof (size 20)
% 7.62/1.73  Prover 7: Found proof (size 20)
% 7.62/1.73  Prover 10: proved (192ms)
% 7.62/1.73  Prover 7: proved (210ms)
% 7.62/1.74  Prover 8: Warning: ignoring some quantifiers
% 7.62/1.74  Prover 16: stopped
% 7.62/1.74  Prover 8: Constructing countermodel ...
% 7.62/1.74  Prover 13: Found proof (size 20)
% 7.62/1.74  Prover 13: proved (201ms)
% 7.62/1.74  Prover 4: stopped
% 7.62/1.75  Prover 8: stopped
% 7.62/1.78  Prover 11: Constructing countermodel ...
% 7.62/1.79  Prover 11: stopped
% 7.62/1.79  
% 7.62/1.79  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.62/1.79  
% 7.62/1.80  % SZS output start Proof for theBenchmark
% 7.62/1.80  Assumptions after simplification:
% 7.62/1.80  ---------------------------------
% 7.62/1.80  
% 7.62/1.80    (axiom_10)
% 7.62/1.80     ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~ rs(v0, v1) | rf1(v0,
% 7.62/1.81        v1))
% 7.62/1.81  
% 7.62/1.81    (axiom_11)
% 7.62/1.81     ! [v0: $i] :  ! [v1: $i] : ( ~ $i(v1) |  ~ $i(v0) |  ~ rs(v0, v1) | rf(v0,
% 7.62/1.81        v1))
% 7.62/1.81  
% 7.62/1.81    (axiom_2)
% 7.62/1.81     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] :  ! [v3: $i] : ( ~ $i(v3) |  ~ $i(v2)
% 7.62/1.81      |  ~ $i(v1) |  ~ $i(v0) |  ~ rs(v0, v2) |  ~ rf1(v0, v3) |  ~ rf(v0, v1) | 
% 7.62/1.81      ~ cp(v1) |  ~ cowlThing(v2) | cp(v3) | cUnsatisfiable(v0)) &  ! [v0: $i] : (
% 7.62/1.81      ~ $i(v0) |  ~ cUnsatisfiable(v0) |  ? [v1: $i] : ($i(v1) & rs(v0, v1) &
% 7.62/1.81        cowlThing(v1))) &  ! [v0: $i] : ( ~ $i(v0) |  ~ cUnsatisfiable(v0) |  ?
% 7.62/1.81      [v1: $i] : ($i(v1) & rf1(v0, v1) &  ~ cp(v1))) &  ! [v0: $i] : ( ~ $i(v0) | 
% 7.62/1.81      ~ cUnsatisfiable(v0) |  ? [v1: $i] : ($i(v1) & rf(v0, v1) & cp(v1)))
% 7.62/1.81  
% 7.62/1.81    (axiom_3)
% 7.62/1.81     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : (v2 = v1 |  ~ $i(v2) |  ~ $i(v1) | 
% 7.62/1.81      ~ $i(v0) |  ~ rf(v0, v2) |  ~ rf(v0, v1))
% 7.62/1.81  
% 7.62/1.81    (axiom_4)
% 7.62/1.82     ! [v0: $i] :  ! [v1: $i] :  ! [v2: $i] : (v2 = v1 |  ~ $i(v2) |  ~ $i(v1) | 
% 7.62/1.82      ~ $i(v0) |  ~ rf1(v0, v2) |  ~ rf1(v0, v1))
% 7.62/1.82  
% 7.62/1.82    (axiom_9)
% 7.62/1.82    $i(i2003_11_14_17_19_02584) & cUnsatisfiable(i2003_11_14_17_19_02584)
% 7.62/1.82  
% 7.62/1.82  Further assumptions not needed in the proof:
% 7.62/1.82  --------------------------------------------
% 7.62/1.82  axiom_0, axiom_1, axiom_5, axiom_6, axiom_7, axiom_8,
% 7.62/1.82  cUnsatisfiable_substitution_1, cowlNothing_substitution_1,
% 7.62/1.82  cowlThing_substitution_1, cp_substitution_1, rf1_substitution_1,
% 7.62/1.82  rf1_substitution_2, rf_substitution_1, rf_substitution_2, rinvF1_substitution_1,
% 7.62/1.82  rinvF1_substitution_2, rinvF_substitution_1, rinvF_substitution_2,
% 7.62/1.82  rinvS_substitution_1, rinvS_substitution_2, rs_substitution_1,
% 7.62/1.82  rs_substitution_2, xsd_integer_substitution_1, xsd_string_substitution_1
% 7.62/1.82  
% 7.62/1.82  Those formulas are unsatisfiable:
% 7.62/1.82  ---------------------------------
% 7.62/1.82  
% 7.62/1.82  Begin of proof
% 7.62/1.82  | 
% 7.62/1.82  | ALPHA: (axiom_9) implies:
% 7.62/1.82  |   (1)  cUnsatisfiable(i2003_11_14_17_19_02584)
% 7.62/1.82  |   (2)  $i(i2003_11_14_17_19_02584)
% 7.62/1.82  | 
% 7.62/1.82  | ALPHA: (axiom_2) implies:
% 7.62/1.82  |   (3)   ! [v0: $i] : ( ~ $i(v0) |  ~ cUnsatisfiable(v0) |  ? [v1: $i] :
% 7.62/1.82  |          ($i(v1) & rf(v0, v1) & cp(v1)))
% 7.62/1.82  |   (4)   ! [v0: $i] : ( ~ $i(v0) |  ~ cUnsatisfiable(v0) |  ? [v1: $i] :
% 7.62/1.82  |          ($i(v1) & rf1(v0, v1) &  ~ cp(v1)))
% 8.03/1.83  |   (5)   ! [v0: $i] : ( ~ $i(v0) |  ~ cUnsatisfiable(v0) |  ? [v1: $i] :
% 8.03/1.83  |          ($i(v1) & rs(v0, v1) & cowlThing(v1)))
% 8.03/1.83  | 
% 8.03/1.83  | GROUND_INST: instantiating (5) with i2003_11_14_17_19_02584, simplifying with
% 8.03/1.83  |              (1), (2) gives:
% 8.03/1.83  |   (6)   ? [v0: $i] : ($i(v0) & rs(i2003_11_14_17_19_02584, v0) &
% 8.03/1.83  |          cowlThing(v0))
% 8.03/1.83  | 
% 8.03/1.83  | GROUND_INST: instantiating (4) with i2003_11_14_17_19_02584, simplifying with
% 8.03/1.83  |              (1), (2) gives:
% 8.03/1.83  |   (7)   ? [v0: $i] : ($i(v0) & rf1(i2003_11_14_17_19_02584, v0) &  ~ cp(v0))
% 8.03/1.83  | 
% 8.03/1.83  | GROUND_INST: instantiating (3) with i2003_11_14_17_19_02584, simplifying with
% 8.03/1.83  |              (1), (2) gives:
% 8.03/1.83  |   (8)   ? [v0: $i] : ($i(v0) & rf(i2003_11_14_17_19_02584, v0) & cp(v0))
% 8.03/1.83  | 
% 8.03/1.83  | DELTA: instantiating (8) with fresh symbol all_21_0 gives:
% 8.03/1.83  |   (9)  $i(all_21_0) & rf(i2003_11_14_17_19_02584, all_21_0) & cp(all_21_0)
% 8.03/1.83  | 
% 8.03/1.83  | ALPHA: (9) implies:
% 8.03/1.83  |   (10)  cp(all_21_0)
% 8.03/1.83  |   (11)  rf(i2003_11_14_17_19_02584, all_21_0)
% 8.03/1.83  |   (12)  $i(all_21_0)
% 8.03/1.83  | 
% 8.03/1.83  | DELTA: instantiating (7) with fresh symbol all_23_0 gives:
% 8.03/1.83  |   (13)  $i(all_23_0) & rf1(i2003_11_14_17_19_02584, all_23_0) &  ~
% 8.03/1.83  |         cp(all_23_0)
% 8.03/1.83  | 
% 8.03/1.83  | ALPHA: (13) implies:
% 8.03/1.83  |   (14)   ~ cp(all_23_0)
% 8.03/1.83  |   (15)  rf1(i2003_11_14_17_19_02584, all_23_0)
% 8.03/1.83  |   (16)  $i(all_23_0)
% 8.03/1.83  | 
% 8.03/1.83  | DELTA: instantiating (6) with fresh symbol all_25_0 gives:
% 8.03/1.83  |   (17)  $i(all_25_0) & rs(i2003_11_14_17_19_02584, all_25_0) &
% 8.03/1.83  |         cowlThing(all_25_0)
% 8.03/1.83  | 
% 8.03/1.83  | ALPHA: (17) implies:
% 8.03/1.84  |   (18)  rs(i2003_11_14_17_19_02584, all_25_0)
% 8.03/1.84  |   (19)  $i(all_25_0)
% 8.03/1.84  | 
% 8.03/1.84  | GROUND_INST: instantiating (axiom_10) with i2003_11_14_17_19_02584, all_25_0,
% 8.03/1.84  |              simplifying with (2), (18), (19) gives:
% 8.03/1.84  |   (20)  rf1(i2003_11_14_17_19_02584, all_25_0)
% 8.03/1.84  | 
% 8.03/1.84  | GROUND_INST: instantiating (axiom_11) with i2003_11_14_17_19_02584, all_25_0,
% 8.03/1.84  |              simplifying with (2), (18), (19) gives:
% 8.03/1.84  |   (21)  rf(i2003_11_14_17_19_02584, all_25_0)
% 8.03/1.84  | 
% 8.03/1.84  | GROUND_INST: instantiating (axiom_3) with i2003_11_14_17_19_02584, all_21_0,
% 8.03/1.84  |              all_25_0, simplifying with (2), (11), (12), (19), (21) gives:
% 8.03/1.84  |   (22)  all_25_0 = all_21_0
% 8.03/1.84  | 
% 8.03/1.84  | GROUND_INST: instantiating (axiom_4) with i2003_11_14_17_19_02584, all_23_0,
% 8.03/1.84  |              all_25_0, simplifying with (2), (15), (16), (19), (20) gives:
% 8.03/1.84  |   (23)  all_25_0 = all_23_0
% 8.03/1.84  | 
% 8.03/1.84  | COMBINE_EQS: (22), (23) imply:
% 8.03/1.84  |   (24)  all_23_0 = all_21_0
% 8.03/1.84  | 
% 8.03/1.84  | SIMP: (24) implies:
% 8.03/1.84  |   (25)  all_23_0 = all_21_0
% 8.03/1.84  | 
% 8.03/1.84  | REDUCE: (14), (25) imply:
% 8.03/1.84  |   (26)   ~ cp(all_21_0)
% 8.03/1.84  | 
% 8.03/1.84  | PRED_UNIFY: (10), (26) imply:
% 8.03/1.84  |   (27)  $false
% 8.03/1.84  | 
% 8.03/1.84  | CLOSE: (27) is inconsistent.
% 8.03/1.84  | 
% 8.03/1.84  End of proof
% 8.03/1.84  % SZS output end Proof for theBenchmark
% 8.03/1.84  
% 8.03/1.84  1265ms
%------------------------------------------------------------------------------