TSTP Solution File: KRS063+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : KRS063+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 : n028.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 5.30s 1.48s
% Output : Proof 6.95s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : KRS063+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34 % Computer : n028.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:09:09 EDT 2023
% 0.13/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/sandbox2/benchmark/theBenchmark.p ...
% 0.19/0.62 Running up to 7 provers in parallel.
% 0.19/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.19/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.19/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.19/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.19/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.19/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 0.19/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 2.28/1.06 Prover 1: Preprocessing ...
% 2.28/1.06 Prover 4: Preprocessing ...
% 2.78/1.10 Prover 0: Preprocessing ...
% 2.78/1.10 Prover 5: Preprocessing ...
% 2.78/1.10 Prover 2: Preprocessing ...
% 2.78/1.10 Prover 6: Preprocessing ...
% 2.78/1.10 Prover 3: Preprocessing ...
% 4.44/1.35 Prover 5: Proving ...
% 4.44/1.36 Prover 2: Proving ...
% 4.44/1.37 Prover 3: Constructing countermodel ...
% 4.44/1.39 Prover 1: Constructing countermodel ...
% 4.44/1.39 Prover 6: Proving ...
% 4.44/1.41 Prover 4: Constructing countermodel ...
% 4.44/1.43 Prover 0: Proving ...
% 5.30/1.48 Prover 2: proved (848ms)
% 5.30/1.48
% 5.30/1.48 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.30/1.48
% 5.30/1.49 Prover 3: stopped
% 5.30/1.49 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 5.30/1.49 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 5.30/1.49 Prover 0: stopped
% 5.30/1.49 Prover 5: stopped
% 5.30/1.49 Prover 6: stopped
% 5.30/1.49 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 5.74/1.50 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 5.74/1.50 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 5.74/1.54 Prover 8: Preprocessing ...
% 5.74/1.54 Prover 10: Preprocessing ...
% 5.74/1.55 Prover 7: Preprocessing ...
% 5.74/1.55 Prover 1: gave up
% 5.74/1.55 Prover 13: Preprocessing ...
% 5.74/1.56 Prover 11: Preprocessing ...
% 5.74/1.56 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683
% 6.16/1.58 Prover 4: Found proof (size 17)
% 6.16/1.58 Prover 4: proved (942ms)
% 6.16/1.60 Prover 10: Warning: ignoring some quantifiers
% 6.16/1.60 Prover 16: Preprocessing ...
% 6.16/1.60 Prover 10: Constructing countermodel ...
% 6.16/1.60 Prover 13: Warning: ignoring some quantifiers
% 6.16/1.61 Prover 11: stopped
% 6.16/1.61 Prover 10: stopped
% 6.16/1.61 Prover 13: Constructing countermodel ...
% 6.16/1.61 Prover 7: Warning: ignoring some quantifiers
% 6.16/1.61 Prover 7: Constructing countermodel ...
% 6.16/1.61 Prover 13: stopped
% 6.16/1.62 Prover 16: stopped
% 6.16/1.62 Prover 7: stopped
% 6.16/1.65 Prover 8: Warning: ignoring some quantifiers
% 6.16/1.65 Prover 8: Constructing countermodel ...
% 6.16/1.66 Prover 8: stopped
% 6.16/1.66
% 6.16/1.66 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.16/1.66
% 6.78/1.67 % SZS output start Proof for theBenchmark
% 6.78/1.67 Assumptions after simplification:
% 6.78/1.67 ---------------------------------
% 6.78/1.67
% 6.78/1.67 (axiom_0)
% 6.78/1.69 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cowlThing(v0) = v1) | ~ $i(v0)) &
% 6.78/1.69 ! [v0: $i] : ( ~ (cowlNothing(v0) = 0) | ~ $i(v0))
% 6.78/1.69
% 6.78/1.69 (axiom_10)
% 6.78/1.69 $i(iKinnock) & ? [v0: int] : ( ~ (v0 = 0) & cEuroMP(iKinnock) = v0)
% 6.78/1.69
% 6.78/1.69 (axiom_14)
% 6.78/1.70 rhasEuroMP(iUK, iKinnock) = 0 & $i(iKinnock) & $i(iUK)
% 6.78/1.70
% 6.78/1.70 (axiom_3)
% 6.95/1.70 ! [v0: $i] : ! [v1: int] : ! [v2: $i] : (v1 = 0 | ~ (risEuroMPFrom(v0, v2)
% 6.95/1.70 = 0) | ~ (cEuroMP(v0) = v1) | ~ $i(v2) | ~ $i(v0) | ? [v3: int] : ( ~
% 6.95/1.70 (v3 = 0) & cowlThing(v2) = v3)) & ! [v0: $i] : ! [v1: int] : ! [v2: $i]
% 6.95/1.70 : (v1 = 0 | ~ (cowlThing(v2) = 0) | ~ (cEuroMP(v0) = v1) | ~ $i(v2) | ~
% 6.95/1.70 $i(v0) | ? [v3: int] : ( ~ (v3 = 0) & risEuroMPFrom(v0, v2) = v3)) & !
% 6.95/1.70 [v0: $i] : ( ~ (cEuroMP(v0) = 0) | ~ $i(v0) | ? [v1: $i] :
% 6.95/1.70 (risEuroMPFrom(v0, v1) = 0 & cowlThing(v1) = 0 & $i(v1)))
% 6.95/1.70
% 6.95/1.70 (axiom_5)
% 6.95/1.70 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (risEuroMPFrom(v0, v1)
% 6.95/1.70 = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: int] : ( ~ (v3 = 0) &
% 6.95/1.70 rhasEuroMP(v1, v0) = v3)) & ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2
% 6.95/1.70 = 0 | ~ (rhasEuroMP(v1, v0) = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: int] :
% 6.95/1.70 ( ~ (v3 = 0) & risEuroMPFrom(v0, v1) = v3)) & ! [v0: $i] : ! [v1: $i] : (
% 6.95/1.70 ~ (risEuroMPFrom(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0) | rhasEuroMP(v1, v0) =
% 6.95/1.70 0) & ! [v0: $i] : ! [v1: $i] : ( ~ (rhasEuroMP(v1, v0) = 0) | ~ $i(v1) |
% 6.95/1.70 ~ $i(v0) | risEuroMPFrom(v0, v1) = 0)
% 6.95/1.70
% 6.95/1.70 Further assumptions not needed in the proof:
% 6.95/1.70 --------------------------------------------
% 6.95/1.71 axiom_1, axiom_11, axiom_12, axiom_13, axiom_2, axiom_4, axiom_6, axiom_7,
% 6.95/1.71 axiom_8, axiom_9, cEUCountry_substitution_1, cEuroMP_substitution_1,
% 6.95/1.71 cEuropeanCountry_substitution_1, cPerson_substitution_1,
% 6.95/1.71 cowlNothing_substitution_1, cowlThing_substitution_1, rhasEuroMP_substitution_1,
% 6.95/1.71 rhasEuroMP_substitution_2, risEuroMPFrom_substitution_1,
% 6.95/1.71 risEuroMPFrom_substitution_2, xsd_integer_substitution_1,
% 6.95/1.71 xsd_string_substitution_1
% 6.95/1.71
% 6.95/1.71 Those formulas are unsatisfiable:
% 6.95/1.71 ---------------------------------
% 6.95/1.71
% 6.95/1.71 Begin of proof
% 6.95/1.71 |
% 6.95/1.71 | ALPHA: (axiom_0) implies:
% 6.95/1.71 | (1) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cowlThing(v0) = v1) | ~
% 6.95/1.71 | $i(v0))
% 6.95/1.71 |
% 6.95/1.71 | ALPHA: (axiom_3) implies:
% 6.95/1.71 | (2) ! [v0: $i] : ! [v1: int] : ! [v2: $i] : (v1 = 0 | ~
% 6.95/1.71 | (risEuroMPFrom(v0, v2) = 0) | ~ (cEuroMP(v0) = v1) | ~ $i(v2) | ~
% 6.95/1.71 | $i(v0) | ? [v3: int] : ( ~ (v3 = 0) & cowlThing(v2) = v3))
% 6.95/1.71 |
% 6.95/1.71 | ALPHA: (axiom_5) implies:
% 6.95/1.71 | (3) ! [v0: $i] : ! [v1: $i] : ( ~ (rhasEuroMP(v1, v0) = 0) | ~ $i(v1) |
% 6.95/1.71 | ~ $i(v0) | risEuroMPFrom(v0, v1) = 0)
% 6.95/1.71 |
% 6.95/1.71 | ALPHA: (axiom_10) implies:
% 6.95/1.71 | (4) ? [v0: int] : ( ~ (v0 = 0) & cEuroMP(iKinnock) = v0)
% 6.95/1.71 |
% 6.95/1.71 | ALPHA: (axiom_14) implies:
% 6.95/1.71 | (5) $i(iUK)
% 6.95/1.71 | (6) $i(iKinnock)
% 6.95/1.71 | (7) rhasEuroMP(iUK, iKinnock) = 0
% 6.95/1.71 |
% 6.95/1.71 | DELTA: instantiating (4) with fresh symbol all_10_0 gives:
% 6.95/1.71 | (8) ~ (all_10_0 = 0) & cEuroMP(iKinnock) = all_10_0
% 6.95/1.71 |
% 6.95/1.71 | ALPHA: (8) implies:
% 6.95/1.71 | (9) ~ (all_10_0 = 0)
% 6.95/1.71 | (10) cEuroMP(iKinnock) = all_10_0
% 6.95/1.71 |
% 6.95/1.72 | GROUND_INST: instantiating (3) with iKinnock, iUK, simplifying with (5), (6),
% 6.95/1.72 | (7) gives:
% 6.95/1.72 | (11) risEuroMPFrom(iKinnock, iUK) = 0
% 6.95/1.72 |
% 6.95/1.72 | GROUND_INST: instantiating (2) with iKinnock, all_10_0, iUK, simplifying with
% 6.95/1.72 | (5), (6), (10), (11) gives:
% 6.95/1.72 | (12) all_10_0 = 0 | ? [v0: int] : ( ~ (v0 = 0) & cowlThing(iUK) = v0)
% 6.95/1.72 |
% 6.95/1.72 | BETA: splitting (12) gives:
% 6.95/1.72 |
% 6.95/1.72 | Case 1:
% 6.95/1.72 | |
% 6.95/1.72 | | (13) all_10_0 = 0
% 6.95/1.72 | |
% 6.95/1.72 | | REDUCE: (9), (13) imply:
% 6.95/1.72 | | (14) $false
% 6.95/1.72 | |
% 6.95/1.72 | | CLOSE: (14) is inconsistent.
% 6.95/1.72 | |
% 6.95/1.72 | Case 2:
% 6.95/1.72 | |
% 6.95/1.72 | | (15) ? [v0: int] : ( ~ (v0 = 0) & cowlThing(iUK) = v0)
% 6.95/1.72 | |
% 6.95/1.72 | | DELTA: instantiating (15) with fresh symbol all_25_0 gives:
% 6.95/1.72 | | (16) ~ (all_25_0 = 0) & cowlThing(iUK) = all_25_0
% 6.95/1.72 | |
% 6.95/1.72 | | ALPHA: (16) implies:
% 6.95/1.72 | | (17) ~ (all_25_0 = 0)
% 6.95/1.72 | | (18) cowlThing(iUK) = all_25_0
% 6.95/1.72 | |
% 6.95/1.72 | | GROUND_INST: instantiating (1) with iUK, all_25_0, simplifying with (5),
% 6.95/1.72 | | (18) gives:
% 6.95/1.72 | | (19) all_25_0 = 0
% 6.95/1.72 | |
% 6.95/1.72 | | REDUCE: (17), (19) imply:
% 6.95/1.72 | | (20) $false
% 6.95/1.72 | |
% 6.95/1.72 | | CLOSE: (20) is inconsistent.
% 6.95/1.72 | |
% 6.95/1.72 | End of split
% 6.95/1.72 |
% 6.95/1.72 End of proof
% 6.95/1.72 % SZS output end Proof for theBenchmark
% 6.95/1.72
% 6.95/1.72 1117ms
%------------------------------------------------------------------------------