TSTP Solution File: KRS096+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : KRS096+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 : n011.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:13 EDT 2023
% Result : Unsatisfiable 4.19s 1.43s
% Output : Proof 6.35s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KRS096+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.13/0.34 % Computer : n011.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Aug 28 02:02:10 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 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 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 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 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
% 2.20/1.03 Prover 4: Preprocessing ...
% 2.20/1.03 Prover 1: Preprocessing ...
% 2.61/1.07 Prover 5: Preprocessing ...
% 2.61/1.07 Prover 2: Preprocessing ...
% 2.61/1.07 Prover 3: Preprocessing ...
% 2.61/1.07 Prover 6: Preprocessing ...
% 2.61/1.07 Prover 0: Preprocessing ...
% 3.79/1.27 Prover 2: Proving ...
% 3.79/1.27 Prover 5: Proving ...
% 4.19/1.32 Prover 6: Proving ...
% 4.19/1.34 Prover 1: Constructing countermodel ...
% 4.19/1.34 Prover 3: Constructing countermodel ...
% 4.19/1.37 Prover 4: Constructing countermodel ...
% 4.19/1.39 Prover 0: Proving ...
% 4.19/1.43 Prover 5: proved (800ms)
% 4.19/1.43
% 4.19/1.43 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.19/1.43
% 4.78/1.44 Prover 3: stopped
% 4.78/1.44 Prover 0: stopped
% 5.16/1.44 Prover 2: stopped
% 5.16/1.44 Prover 6: stopped
% 5.16/1.46 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 5.16/1.46 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 5.16/1.46 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 5.16/1.46 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 5.16/1.47 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 5.16/1.47 Prover 7: Preprocessing ...
% 5.16/1.48 Prover 8: Preprocessing ...
% 5.45/1.49 Prover 11: Preprocessing ...
% 5.45/1.49 Prover 13: Preprocessing ...
% 5.45/1.50 Prover 10: Preprocessing ...
% 5.45/1.52 Prover 1: Found proof (size 17)
% 5.45/1.52 Prover 1: proved (890ms)
% 5.45/1.52 Prover 4: stopped
% 5.45/1.52 Prover 7: Warning: ignoring some quantifiers
% 5.45/1.53 Prover 13: stopped
% 5.45/1.53 Prover 10: stopped
% 5.45/1.53 Prover 7: Constructing countermodel ...
% 5.45/1.53 Prover 11: stopped
% 5.45/1.53 Prover 7: stopped
% 5.87/1.58 Prover 8: Warning: ignoring some quantifiers
% 5.87/1.59 Prover 8: Constructing countermodel ...
% 5.87/1.59 Prover 8: stopped
% 5.87/1.59
% 5.87/1.59 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.87/1.59
% 5.87/1.59 % SZS output start Proof for theBenchmark
% 5.87/1.60 Assumptions after simplification:
% 5.87/1.60 ---------------------------------
% 5.87/1.60
% 5.87/1.60 (axiom_2)
% 6.14/1.63 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cUnsatisfiable(v0) = v1) | ~
% 6.14/1.63 $i(v0) | ? [v2: $i] : ? [v3: $i] : ( ~ (v3 = v2) & rr(v0, v3) = 0 & rr(v0,
% 6.14/1.63 v2) = 0 & $i(v3) & $i(v2)) | ! [v2: $i] : ( ~ (cd(v2) = 0) | ~ $i(v2)
% 6.14/1.63 | ? [v3: int] : ( ~ (v3 = 0) & rr(v0, v2) = v3)) | ! [v2: $i] : ( ~
% 6.14/1.63 (cc(v2) = 0) | ~ $i(v2) | ? [v3: int] : ( ~ (v3 = 0) & rr(v0, v2) =
% 6.14/1.63 v3))) & ! [v0: $i] : ( ~ (cUnsatisfiable(v0) = 0) | ~ $i(v0) | ( !
% 6.14/1.63 [v1: $i] : ! [v2: $i] : (v2 = v1 | ~ (rr(v0, v2) = 0) | ~ (rr(v0, v1) =
% 6.14/1.63 0) | ~ $i(v2) | ~ $i(v1)) & ? [v1: $i] : (rr(v0, v1) = 0 & cd(v1) =
% 6.14/1.63 0 & $i(v1)) & ? [v1: $i] : (rr(v0, v1) = 0 & cc(v1) = 0 & $i(v1))))
% 6.14/1.63
% 6.14/1.63 (axiom_3)
% 6.14/1.63 ! [v0: $i] : ( ~ (cd(v0) = 0) | ~ $i(v0) | ? [v1: int] : ( ~ (v1 = 0) &
% 6.14/1.63 cc(v0) = v1))
% 6.14/1.63
% 6.14/1.63 (axiom_4)
% 6.14/1.63 cUnsatisfiable(i2003_11_14_17_20_18265) = 0 & $i(i2003_11_14_17_20_18265)
% 6.14/1.63
% 6.14/1.63 (function-axioms)
% 6.14/1.64 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : !
% 6.14/1.64 [v3: $i] : (v1 = v0 | ~ (rr(v3, v2) = v1) | ~ (rr(v3, v2) = v0)) & ! [v0:
% 6.14/1.64 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 |
% 6.14/1.64 ~ (xsd_string(v2) = v1) | ~ (xsd_string(v2) = v0)) & ! [v0:
% 6.14/1.64 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 |
% 6.14/1.64 ~ (xsd_integer(v2) = v1) | ~ (xsd_integer(v2) = v0)) & ! [v0:
% 6.14/1.64 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 |
% 6.14/1.64 ~ (cowlThing(v2) = v1) | ~ (cowlThing(v2) = v0)) & ! [v0:
% 6.14/1.64 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 |
% 6.14/1.64 ~ (cowlNothing(v2) = v1) | ~ (cowlNothing(v2) = v0)) & ! [v0:
% 6.14/1.64 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 |
% 6.14/1.64 ~ (cd(v2) = v1) | ~ (cd(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 6.14/1.64 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cc(v2) = v1) | ~ (cc(v2)
% 6.14/1.64 = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2:
% 6.14/1.64 $i] : (v1 = v0 | ~ (cUnsatisfiable(v2) = v1) | ~ (cUnsatisfiable(v2) =
% 6.14/1.64 v0))
% 6.14/1.64
% 6.14/1.64 Further assumptions not needed in the proof:
% 6.14/1.64 --------------------------------------------
% 6.14/1.64 axiom_0, axiom_1, cUnsatisfiable_substitution_1, cc_substitution_1,
% 6.14/1.64 cd_substitution_1, cowlNothing_substitution_1, cowlThing_substitution_1,
% 6.14/1.64 rr_substitution_1, rr_substitution_2, xsd_integer_substitution_1,
% 6.14/1.64 xsd_string_substitution_1
% 6.14/1.64
% 6.14/1.64 Those formulas are unsatisfiable:
% 6.14/1.64 ---------------------------------
% 6.14/1.64
% 6.14/1.64 Begin of proof
% 6.14/1.64 |
% 6.14/1.64 | ALPHA: (axiom_2) implies:
% 6.14/1.64 | (1) ! [v0: $i] : ( ~ (cUnsatisfiable(v0) = 0) | ~ $i(v0) | ( ! [v1: $i] :
% 6.14/1.64 | ! [v2: $i] : (v2 = v1 | ~ (rr(v0, v2) = 0) | ~ (rr(v0, v1) = 0)
% 6.14/1.64 | | ~ $i(v2) | ~ $i(v1)) & ? [v1: $i] : (rr(v0, v1) = 0 & cd(v1)
% 6.14/1.64 | = 0 & $i(v1)) & ? [v1: $i] : (rr(v0, v1) = 0 & cc(v1) = 0 &
% 6.14/1.64 | $i(v1))))
% 6.14/1.64 |
% 6.14/1.64 | ALPHA: (axiom_4) implies:
% 6.14/1.65 | (2) $i(i2003_11_14_17_20_18265)
% 6.14/1.65 | (3) cUnsatisfiable(i2003_11_14_17_20_18265) = 0
% 6.14/1.65 |
% 6.14/1.65 | ALPHA: (function-axioms) implies:
% 6.14/1.65 | (4) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] :
% 6.14/1.65 | (v1 = v0 | ~ (cc(v2) = v1) | ~ (cc(v2) = v0))
% 6.14/1.65 |
% 6.14/1.65 | GROUND_INST: instantiating (1) with i2003_11_14_17_20_18265, simplifying with
% 6.14/1.65 | (2), (3) gives:
% 6.35/1.65 | (5) ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ (rr(i2003_11_14_17_20_18265,
% 6.35/1.65 | v1) = 0) | ~ (rr(i2003_11_14_17_20_18265, v0) = 0) | ~ $i(v1) |
% 6.35/1.65 | ~ $i(v0)) & ? [v0: $i] : (rr(i2003_11_14_17_20_18265, v0) = 0 &
% 6.35/1.65 | cd(v0) = 0 & $i(v0)) & ? [v0: $i] : (rr(i2003_11_14_17_20_18265, v0)
% 6.35/1.65 | = 0 & cc(v0) = 0 & $i(v0))
% 6.35/1.65 |
% 6.35/1.65 | ALPHA: (5) implies:
% 6.35/1.65 | (6) ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ (rr(i2003_11_14_17_20_18265,
% 6.35/1.65 | v1) = 0) | ~ (rr(i2003_11_14_17_20_18265, v0) = 0) | ~ $i(v1) |
% 6.35/1.65 | ~ $i(v0))
% 6.35/1.65 | (7) ? [v0: $i] : (rr(i2003_11_14_17_20_18265, v0) = 0 & cc(v0) = 0 &
% 6.35/1.65 | $i(v0))
% 6.35/1.65 | (8) ? [v0: $i] : (rr(i2003_11_14_17_20_18265, v0) = 0 & cd(v0) = 0 &
% 6.35/1.65 | $i(v0))
% 6.35/1.65 |
% 6.35/1.65 | DELTA: instantiating (7) with fresh symbol all_14_0 gives:
% 6.35/1.65 | (9) rr(i2003_11_14_17_20_18265, all_14_0) = 0 & cc(all_14_0) = 0 &
% 6.35/1.65 | $i(all_14_0)
% 6.35/1.66 |
% 6.35/1.66 | ALPHA: (9) implies:
% 6.35/1.66 | (10) $i(all_14_0)
% 6.35/1.66 | (11) cc(all_14_0) = 0
% 6.35/1.66 | (12) rr(i2003_11_14_17_20_18265, all_14_0) = 0
% 6.35/1.66 |
% 6.35/1.66 | DELTA: instantiating (8) with fresh symbol all_16_0 gives:
% 6.35/1.66 | (13) rr(i2003_11_14_17_20_18265, all_16_0) = 0 & cd(all_16_0) = 0 &
% 6.35/1.66 | $i(all_16_0)
% 6.35/1.66 |
% 6.35/1.66 | ALPHA: (13) implies:
% 6.35/1.66 | (14) $i(all_16_0)
% 6.35/1.66 | (15) cd(all_16_0) = 0
% 6.35/1.66 | (16) rr(i2003_11_14_17_20_18265, all_16_0) = 0
% 6.35/1.66 |
% 6.35/1.66 | GROUND_INST: instantiating (axiom_3) with all_16_0, simplifying with (14),
% 6.35/1.66 | (15) gives:
% 6.35/1.66 | (17) ? [v0: int] : ( ~ (v0 = 0) & cc(all_16_0) = v0)
% 6.35/1.66 |
% 6.35/1.66 | GROUND_INST: instantiating (6) with all_14_0, all_16_0, simplifying with (10),
% 6.35/1.66 | (12), (14), (16) gives:
% 6.35/1.66 | (18) all_16_0 = all_14_0
% 6.35/1.66 |
% 6.35/1.66 | DELTA: instantiating (17) with fresh symbol all_24_0 gives:
% 6.35/1.66 | (19) ~ (all_24_0 = 0) & cc(all_16_0) = all_24_0
% 6.35/1.66 |
% 6.35/1.66 | ALPHA: (19) implies:
% 6.35/1.66 | (20) ~ (all_24_0 = 0)
% 6.35/1.66 | (21) cc(all_16_0) = all_24_0
% 6.35/1.66 |
% 6.35/1.66 | REDUCE: (18), (21) imply:
% 6.35/1.66 | (22) cc(all_14_0) = all_24_0
% 6.35/1.66 |
% 6.35/1.66 | GROUND_INST: instantiating (4) with 0, all_24_0, all_14_0, simplifying with
% 6.35/1.66 | (11), (22) gives:
% 6.35/1.66 | (23) all_24_0 = 0
% 6.35/1.66 |
% 6.35/1.66 | REDUCE: (20), (23) imply:
% 6.35/1.66 | (24) $false
% 6.35/1.66 |
% 6.35/1.66 | CLOSE: (24) is inconsistent.
% 6.35/1.66 |
% 6.35/1.66 End of proof
% 6.35/1.66 % SZS output end Proof for theBenchmark
% 6.35/1.66
% 6.35/1.66 1053ms
%------------------------------------------------------------------------------