TSTP Solution File: KRS091+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : KRS091+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 : n023.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:12 EDT 2023
% Result : Unsatisfiable 4.40s 1.36s
% Output : Proof 5.65s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : KRS091+1 : TPTP v8.1.2. Released v3.1.0.
% 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.35 % Computer : n023.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % 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:15:25 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.67/0.63 ________ _____
% 0.67/0.63 ___ __ \_________(_)________________________________
% 0.67/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.67/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.67/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.67/0.63
% 0.67/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.67/0.63 (2023-06-19)
% 0.67/0.63
% 0.67/0.63 (c) Philipp Rümmer, 2009-2023
% 0.67/0.63 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.67/0.63 Amanda Stjerna.
% 0.67/0.63 Free software under BSD-3-Clause.
% 0.67/0.63
% 0.67/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.67/0.63
% 0.67/0.63 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.68/0.65 Running up to 7 provers in parallel.
% 0.68/0.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.68/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.68/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.68/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.68/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.68/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.68/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.14/1.02 Prover 1: Preprocessing ...
% 2.14/1.02 Prover 4: Preprocessing ...
% 2.52/1.07 Prover 6: Preprocessing ...
% 2.52/1.07 Prover 3: Preprocessing ...
% 2.52/1.07 Prover 2: Preprocessing ...
% 2.52/1.07 Prover 0: Preprocessing ...
% 2.52/1.07 Prover 5: Preprocessing ...
% 3.45/1.24 Prover 2: Proving ...
% 3.76/1.24 Prover 5: Proving ...
% 3.76/1.25 Prover 1: Constructing countermodel ...
% 3.76/1.25 Prover 6: Constructing countermodel ...
% 3.76/1.26 Prover 3: Constructing countermodel ...
% 3.76/1.31 Prover 4: Constructing countermodel ...
% 4.40/1.35 Prover 5: proved (696ms)
% 4.40/1.36
% 4.40/1.36 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.40/1.36
% 4.40/1.36 Prover 2: proved (700ms)
% 4.40/1.36
% 4.40/1.36 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.40/1.36
% 4.40/1.36 Prover 3: stopped
% 4.40/1.37 Prover 6: stopped
% 4.40/1.38 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 4.40/1.38 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 4.40/1.38 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 4.40/1.38 Prover 7: Preprocessing ...
% 4.40/1.38 Prover 0: Proving ...
% 4.40/1.38 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 4.40/1.38 Prover 0: stopped
% 4.82/1.39 Prover 8: Preprocessing ...
% 4.82/1.39 Prover 4: Found proof (size 12)
% 4.82/1.39 Prover 4: proved (735ms)
% 4.82/1.39 Prover 7: Warning: ignoring some quantifiers
% 4.82/1.39 Prover 11: Preprocessing ...
% 4.82/1.39 Prover 10: Preprocessing ...
% 4.82/1.40 Prover 7: Constructing countermodel ...
% 4.82/1.40 Prover 1: Found proof (size 11)
% 4.82/1.40 Prover 1: proved (747ms)
% 4.82/1.40 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 4.82/1.41 Prover 7: stopped
% 4.82/1.41 Prover 10: Warning: ignoring some quantifiers
% 4.82/1.41 Prover 13: Preprocessing ...
% 4.82/1.42 Prover 10: Constructing countermodel ...
% 4.82/1.42 Prover 10: stopped
% 4.82/1.42 Prover 11: stopped
% 4.82/1.43 Prover 13: Warning: ignoring some quantifiers
% 4.82/1.44 Prover 13: Constructing countermodel ...
% 4.82/1.44 Prover 13: stopped
% 5.25/1.47 Prover 8: Warning: ignoring some quantifiers
% 5.25/1.48 Prover 8: Constructing countermodel ...
% 5.25/1.49 Prover 8: stopped
% 5.25/1.49
% 5.25/1.49 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.25/1.49
% 5.25/1.49 % SZS output start Proof for theBenchmark
% 5.25/1.49 Assumptions after simplification:
% 5.25/1.49 ---------------------------------
% 5.25/1.49
% 5.25/1.50 (axiom_2)
% 5.46/1.53 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cUnsatisfiable(v0) = v1) | ~
% 5.46/1.53 $i(v0) | ? [v2: any] : ? [v3: any] : (cd(v0) = v2 & cc(v0) = v3 & ( ~ (v3
% 5.46/1.53 = 0) | ~ (v2 = 0)))) & ! [v0: $i] : ! [v1: any] : ( ~ (cd(v0) = v1)
% 5.46/1.53 | ~ $i(v0) | ? [v2: any] : ? [v3: any] : (cUnsatisfiable(v0) = v2 &
% 5.46/1.53 cc(v0) = v3 & ( ~ (v2 = 0) | (v3 = 0 & v1 = 0)))) & ! [v0: $i] : ! [v1:
% 5.46/1.53 any] : ( ~ (cc(v0) = v1) | ~ $i(v0) | ? [v2: any] : ? [v3: any] : (cd(v0)
% 5.46/1.53 = v3 & cUnsatisfiable(v0) = v2 & ( ~ (v2 = 0) | (v3 = 0 & v1 = 0)))) & !
% 5.46/1.53 [v0: $i] : ( ~ (cd(v0) = 0) | ~ $i(v0) | ? [v1: any] : ? [v2: any] :
% 5.46/1.53 (cUnsatisfiable(v0) = v2 & cc(v0) = v1 & ( ~ (v1 = 0) | v2 = 0))) & ! [v0:
% 5.46/1.53 $i] : ( ~ (cUnsatisfiable(v0) = 0) | ~ $i(v0) | (cd(v0) = 0 & cc(v0) = 0))
% 5.46/1.54 & ! [v0: $i] : ( ~ (cc(v0) = 0) | ~ $i(v0) | ? [v1: any] : ? [v2: any] :
% 5.46/1.54 (cd(v0) = v1 & cUnsatisfiable(v0) = v2 & ( ~ (v1 = 0) | v2 = 0)))
% 5.46/1.54
% 5.46/1.54 (axiom_3)
% 5.46/1.54 ! [v0: $i] : ( ~ (cd(v0) = 0) | ~ $i(v0) | ? [v1: int] : ( ~ (v1 = 0) &
% 5.46/1.54 cc(v0) = v1)) & ! [v0: $i] : ( ~ (cc(v0) = 0) | ~ $i(v0) | ? [v1: int]
% 5.46/1.54 : ( ~ (v1 = 0) & cd(v0) = v1))
% 5.46/1.54
% 5.46/1.54 (axiom_8)
% 5.46/1.54 cUnsatisfiable(i2003_11_14_17_20_00819) = 0 & $i(i2003_11_14_17_20_00819)
% 5.46/1.54
% 5.46/1.54 (function-axioms)
% 5.65/1.55 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 =
% 5.65/1.55 v0 | ~ (cf(v2) = v1) | ~ (cf(v2) = v0)) & ! [v0: MultipleValueBool] : !
% 5.65/1.55 [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (ce3(v2) = v1) | ~
% 5.65/1.55 (ce3(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] :
% 5.65/1.55 ! [v2: $i] : (v1 = v0 | ~ (cd1(v2) = v1) | ~ (cd1(v2) = v0)) & ! [v0:
% 5.65/1.55 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 |
% 5.65/1.55 ~ (cc1(v2) = v1) | ~ (cc1(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 5.65/1.55 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cd(v2) = v1) | ~ (cd(v2)
% 5.65/1.55 = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2:
% 5.65/1.55 $i] : (v1 = v0 | ~ (cUnsatisfiable(v2) = v1) | ~ (cUnsatisfiable(v2) =
% 5.65/1.55 v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2:
% 5.65/1.55 $i] : (v1 = v0 | ~ (cc(v2) = v1) | ~ (cc(v2) = v0)) & ! [v0:
% 5.65/1.55 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 |
% 5.65/1.55 ~ (xsd_integer(v2) = v1) | ~ (xsd_integer(v2) = v0)) & ! [v0:
% 5.65/1.55 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 |
% 5.65/1.55 ~ (xsd_string(v2) = v1) | ~ (xsd_string(v2) = v0)) & ! [v0:
% 5.65/1.55 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 |
% 5.65/1.55 ~ (cowlNothing(v2) = v1) | ~ (cowlNothing(v2) = v0)) & ! [v0:
% 5.65/1.55 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 |
% 5.65/1.55 ~ (cowlThing(v2) = v1) | ~ (cowlThing(v2) = v0))
% 5.65/1.55
% 5.65/1.55 Further assumptions not needed in the proof:
% 5.65/1.55 --------------------------------------------
% 5.65/1.55 axiom_0, axiom_1, axiom_4, axiom_5, axiom_6, axiom_7
% 5.65/1.55
% 5.65/1.55 Those formulas are unsatisfiable:
% 5.65/1.55 ---------------------------------
% 5.65/1.55
% 5.65/1.55 Begin of proof
% 5.65/1.55 |
% 5.65/1.55 | ALPHA: (axiom_2) implies:
% 5.65/1.55 | (1) ! [v0: $i] : ( ~ (cUnsatisfiable(v0) = 0) | ~ $i(v0) | (cd(v0) = 0 &
% 5.65/1.55 | cc(v0) = 0))
% 5.65/1.55 |
% 5.65/1.55 | ALPHA: (axiom_3) implies:
% 5.65/1.56 | (2) ! [v0: $i] : ( ~ (cd(v0) = 0) | ~ $i(v0) | ? [v1: int] : ( ~ (v1 =
% 5.65/1.56 | 0) & cc(v0) = v1))
% 5.65/1.56 |
% 5.65/1.56 | ALPHA: (axiom_8) implies:
% 5.65/1.56 | (3) $i(i2003_11_14_17_20_00819)
% 5.65/1.56 | (4) cUnsatisfiable(i2003_11_14_17_20_00819) = 0
% 5.65/1.56 |
% 5.65/1.56 | ALPHA: (function-axioms) implies:
% 5.65/1.56 | (5) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] :
% 5.65/1.56 | (v1 = v0 | ~ (cc(v2) = v1) | ~ (cc(v2) = v0))
% 5.65/1.56 |
% 5.65/1.56 | GROUND_INST: instantiating (1) with i2003_11_14_17_20_00819, simplifying with
% 5.65/1.56 | (3), (4) gives:
% 5.65/1.56 | (6) cd(i2003_11_14_17_20_00819) = 0 & cc(i2003_11_14_17_20_00819) = 0
% 5.65/1.56 |
% 5.65/1.56 | ALPHA: (6) implies:
% 5.65/1.56 | (7) cc(i2003_11_14_17_20_00819) = 0
% 5.65/1.56 | (8) cd(i2003_11_14_17_20_00819) = 0
% 5.65/1.56 |
% 5.65/1.56 | GROUND_INST: instantiating (2) with i2003_11_14_17_20_00819, simplifying with
% 5.65/1.56 | (3), (8) gives:
% 5.65/1.56 | (9) ? [v0: int] : ( ~ (v0 = 0) & cc(i2003_11_14_17_20_00819) = v0)
% 5.65/1.56 |
% 5.65/1.56 | DELTA: instantiating (9) with fresh symbol all_23_0 gives:
% 5.65/1.56 | (10) ~ (all_23_0 = 0) & cc(i2003_11_14_17_20_00819) = all_23_0
% 5.65/1.56 |
% 5.65/1.56 | ALPHA: (10) implies:
% 5.65/1.56 | (11) ~ (all_23_0 = 0)
% 5.65/1.56 | (12) cc(i2003_11_14_17_20_00819) = all_23_0
% 5.65/1.56 |
% 5.65/1.56 | GROUND_INST: instantiating (5) with 0, all_23_0, i2003_11_14_17_20_00819,
% 5.65/1.56 | simplifying with (7), (12) gives:
% 5.65/1.57 | (13) all_23_0 = 0
% 5.65/1.57 |
% 5.65/1.57 | REDUCE: (11), (13) imply:
% 5.65/1.57 | (14) $false
% 5.65/1.57 |
% 5.65/1.57 | CLOSE: (14) is inconsistent.
% 5.65/1.57 |
% 5.65/1.57 End of proof
% 5.65/1.57 % SZS output end Proof for theBenchmark
% 5.65/1.57
% 5.65/1.57 933ms
%------------------------------------------------------------------------------