TSTP Solution File: KRS088+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : KRS088+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 : n003.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 5.50s 1.50s
% Output : Proof 7.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS088+1 : TPTP v8.1.2. Released v3.1.0.
% 0.12/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.35 % Computer : n003.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:26:55 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.62 ________ _____
% 0.20/0.62 ___ __ \_________(_)________________________________
% 0.20/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.62
% 0.20/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.62 (2023-06-19)
% 0.20/0.62
% 0.20/0.62 (c) Philipp Rümmer, 2009-2023
% 0.20/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.62 Amanda Stjerna.
% 0.20/0.62 Free software under BSD-3-Clause.
% 0.20/0.62
% 0.20/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.62
% 0.20/0.62 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.20/0.63 Running up to 7 provers in parallel.
% 0.20/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.64/1.10 Prover 4: Preprocessing ...
% 2.64/1.10 Prover 1: Preprocessing ...
% 2.89/1.13 Prover 0: Preprocessing ...
% 2.89/1.13 Prover 5: Preprocessing ...
% 2.89/1.13 Prover 6: Preprocessing ...
% 2.89/1.13 Prover 3: Preprocessing ...
% 2.89/1.13 Prover 2: Preprocessing ...
% 3.66/1.37 Prover 2: Proving ...
% 4.59/1.38 Prover 5: Proving ...
% 4.59/1.43 Prover 1: Constructing countermodel ...
% 4.59/1.45 Prover 3: Constructing countermodel ...
% 5.39/1.47 Prover 6: Proving ...
% 5.50/1.48 Prover 4: Constructing countermodel ...
% 5.50/1.50 Prover 3: gave up
% 5.50/1.50 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 5.50/1.50 Prover 5: proved (857ms)
% 5.50/1.50
% 5.50/1.50 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.50/1.50
% 5.50/1.50 Prover 6: stopped
% 5.50/1.50 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 5.50/1.50 Prover 2: stopped
% 5.50/1.51 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 5.50/1.51 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 5.82/1.52 Prover 1: gave up
% 5.82/1.52 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 5.82/1.53 Prover 0: Proving ...
% 5.82/1.53 Prover 0: stopped
% 5.82/1.54 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683
% 5.82/1.54 Prover 8: Preprocessing ...
% 6.02/1.55 Prover 7: Preprocessing ...
% 6.02/1.55 Prover 10: Preprocessing ...
% 6.02/1.56 Prover 11: Preprocessing ...
% 6.02/1.57 Prover 13: Preprocessing ...
% 6.02/1.59 Prover 16: Preprocessing ...
% 6.02/1.61 Prover 7: Warning: ignoring some quantifiers
% 6.02/1.61 Prover 10: Warning: ignoring some quantifiers
% 6.02/1.61 Prover 7: Constructing countermodel ...
% 6.02/1.62 Prover 10: Constructing countermodel ...
% 6.02/1.62 Prover 13: Warning: ignoring some quantifiers
% 6.66/1.63 Prover 13: Constructing countermodel ...
% 6.66/1.63 Prover 4: Found proof (size 16)
% 6.66/1.63 Prover 4: proved (995ms)
% 6.66/1.63 Prover 7: stopped
% 6.66/1.64 Prover 13: stopped
% 6.66/1.64 Prover 16: Warning: ignoring some quantifiers
% 6.66/1.64 Prover 10: stopped
% 6.66/1.64 Prover 16: Constructing countermodel ...
% 6.66/1.65 Prover 16: stopped
% 6.66/1.66 Prover 8: Warning: ignoring some quantifiers
% 6.66/1.66 Prover 8: Constructing countermodel ...
% 6.66/1.67 Prover 8: stopped
% 7.02/1.69 Prover 11: Constructing countermodel ...
% 7.02/1.70 Prover 11: stopped
% 7.02/1.70
% 7.02/1.70 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.02/1.70
% 7.02/1.70 % SZS output start Proof for theBenchmark
% 7.02/1.71 Assumptions after simplification:
% 7.02/1.71 ---------------------------------
% 7.02/1.71
% 7.02/1.71 (axiom_2)
% 7.02/1.74 ! [v0: $i] : ! [v1: int] : ! [v2: $i] : (v1 = 0 | ~ (rf(v0, v2) = 0) | ~
% 7.02/1.74 (cUnsatisfiable(v0) = v1) | ~ $i(v2) | ~ $i(v0) | ? [v3: int] : ? [v4:
% 7.02/1.74 $i] : ? [v5: int] : ($i(v4) & ((v5 = 0 & rinvF(v2, v4) = 0 & ! [v6: $i]
% 7.02/1.74 : ! [v7: int] : (v7 = 0 | ~ (cp1(v6) = v7) | ~ $i(v6) | ? [v8:
% 7.02/1.74 int] : ( ~ (v8 = 0) & rf(v4, v6) = v8)) & ! [v6: $i] : ( ~
% 7.02/1.74 (rf(v4, v6) = 0) | ~ $i(v6) | cp1(v6) = 0)) | ( ~ (v3 = 0) &
% 7.02/1.74 cp1(v2) = v3)))) & ! [v0: $i] : ! [v1: int] : ! [v2: $i] : (v1 = 0
% 7.02/1.74 | ~ (cp1(v2) = 0) | ~ (cUnsatisfiable(v0) = v1) | ~ $i(v2) | ~ $i(v0) |
% 7.02/1.74 ? [v3: int] : ? [v4: $i] : ? [v5: int] : ($i(v4) & ((v5 = 0 & rinvF(v2,
% 7.02/1.74 v4) = 0 & ! [v6: $i] : ! [v7: int] : (v7 = 0 | ~ (cp1(v6) = v7) |
% 7.02/1.74 ~ $i(v6) | ? [v8: int] : ( ~ (v8 = 0) & rf(v4, v6) = v8)) & !
% 7.02/1.74 [v6: $i] : ( ~ (rf(v4, v6) = 0) | ~ $i(v6) | cp1(v6) = 0)) | ( ~ (v3
% 7.02/1.74 = 0) & rf(v0, v2) = v3)))) & ! [v0: $i] : ( ~ (cUnsatisfiable(v0) =
% 7.02/1.74 0) | ~ $i(v0) | ? [v1: $i] : (rf(v0, v1) = 0 & cp1(v1) = 0 & $i(v1) & !
% 7.02/1.74 [v2: $i] : ( ~ (rinvF(v1, v2) = 0) | ~ $i(v2) | ? [v3: $i] : ? [v4:
% 7.02/1.74 int] : ( ~ (v4 = 0) & rf(v2, v3) = 0 & cp1(v3) = v4 & $i(v3)))))
% 7.02/1.74
% 7.02/1.74 (axiom_3)
% 7.02/1.75 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v1 | ~ (rf(v0, v2) = 0) | ~
% 7.02/1.75 (rf(v0, v1) = 0) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0))
% 7.02/1.75
% 7.02/1.75 (axiom_4)
% 7.02/1.75 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (rinvF(v0, v1) = v2) |
% 7.02/1.75 ~ $i(v1) | ~ $i(v0) | ? [v3: int] : ( ~ (v3 = 0) & rf(v1, v0) = v3)) & !
% 7.02/1.75 [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (rf(v1, v0) = v2) | ~
% 7.02/1.75 $i(v1) | ~ $i(v0) | ? [v3: int] : ( ~ (v3 = 0) & rinvF(v0, v1) = v3)) & !
% 7.02/1.75 [v0: $i] : ! [v1: $i] : ( ~ (rinvF(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0) |
% 7.02/1.75 rf(v1, v0) = 0) & ! [v0: $i] : ! [v1: $i] : ( ~ (rf(v1, v0) = 0) | ~
% 7.02/1.75 $i(v1) | ~ $i(v0) | rinvF(v0, v1) = 0)
% 7.02/1.75
% 7.02/1.75 (axiom_7)
% 7.02/1.75 cUnsatisfiable(i2003_11_14_17_19_49673) = 0 & $i(i2003_11_14_17_19_49673)
% 7.02/1.75
% 7.02/1.75 (function-axioms)
% 7.37/1.76 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : !
% 7.37/1.76 [v3: $i] : (v1 = v0 | ~ (rr(v3, v2) = v1) | ~ (rr(v3, v2) = v0)) & ! [v0:
% 7.37/1.76 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i]
% 7.37/1.76 : (v1 = v0 | ~ (rinvR(v3, v2) = v1) | ~ (rinvR(v3, v2) = v0)) & ! [v0:
% 7.37/1.76 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i]
% 7.37/1.76 : (v1 = v0 | ~ (rinvF(v3, v2) = v1) | ~ (rinvF(v3, v2) = v0)) & ! [v0:
% 7.37/1.76 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i]
% 7.37/1.76 : (v1 = v0 | ~ (rf(v3, v2) = v1) | ~ (rf(v3, v2) = v0)) & ! [v0:
% 7.37/1.76 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 |
% 7.37/1.76 ~ (xsd_string(v2) = v1) | ~ (xsd_string(v2) = v0)) & ! [v0:
% 7.37/1.76 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 |
% 7.37/1.76 ~ (xsd_integer(v2) = v1) | ~ (xsd_integer(v2) = v0)) & ! [v0:
% 7.37/1.76 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 |
% 7.37/1.76 ~ (cp1(v2) = v1) | ~ (cp1(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 7.37/1.76 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cowlThing(v2) = v1) | ~
% 7.37/1.76 (cowlThing(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 7.37/1.76 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cowlNothing(v2) = v1) | ~
% 7.37/1.76 (cowlNothing(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 7.37/1.76 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cUnsatisfiable(v2) = v1) |
% 7.37/1.76 ~ (cUnsatisfiable(v2) = v0))
% 7.37/1.76
% 7.37/1.76 Further assumptions not needed in the proof:
% 7.37/1.76 --------------------------------------------
% 7.37/1.76 axiom_0, axiom_1, axiom_5, axiom_6, cUnsatisfiable_substitution_1,
% 7.37/1.76 cowlNothing_substitution_1, cowlThing_substitution_1, cp1_substitution_1,
% 7.37/1.76 rf_substitution_1, rf_substitution_2, rinvF_substitution_1,
% 7.37/1.76 rinvF_substitution_2, rinvR_substitution_1, rinvR_substitution_2,
% 7.37/1.76 rr_substitution_1, rr_substitution_2, xsd_integer_substitution_1,
% 7.37/1.76 xsd_string_substitution_1
% 7.37/1.76
% 7.37/1.76 Those formulas are unsatisfiable:
% 7.37/1.76 ---------------------------------
% 7.37/1.76
% 7.37/1.76 Begin of proof
% 7.37/1.76 |
% 7.37/1.76 | ALPHA: (axiom_2) implies:
% 7.37/1.76 | (1) ! [v0: $i] : ( ~ (cUnsatisfiable(v0) = 0) | ~ $i(v0) | ? [v1: $i] :
% 7.37/1.76 | (rf(v0, v1) = 0 & cp1(v1) = 0 & $i(v1) & ! [v2: $i] : ( ~ (rinvF(v1,
% 7.37/1.76 | v2) = 0) | ~ $i(v2) | ? [v3: $i] : ? [v4: int] : ( ~ (v4 =
% 7.37/1.76 | 0) & rf(v2, v3) = 0 & cp1(v3) = v4 & $i(v3)))))
% 7.37/1.76 |
% 7.37/1.76 | ALPHA: (axiom_4) implies:
% 7.37/1.76 | (2) ! [v0: $i] : ! [v1: $i] : ( ~ (rf(v1, v0) = 0) | ~ $i(v1) | ~
% 7.37/1.76 | $i(v0) | rinvF(v0, v1) = 0)
% 7.37/1.76 |
% 7.37/1.76 | ALPHA: (axiom_7) implies:
% 7.37/1.77 | (3) $i(i2003_11_14_17_19_49673)
% 7.37/1.77 | (4) cUnsatisfiable(i2003_11_14_17_19_49673) = 0
% 7.37/1.77 |
% 7.37/1.77 | ALPHA: (function-axioms) implies:
% 7.37/1.77 | (5) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] :
% 7.37/1.77 | (v1 = v0 | ~ (cp1(v2) = v1) | ~ (cp1(v2) = v0))
% 7.37/1.77 |
% 7.44/1.77 | GROUND_INST: instantiating (1) with i2003_11_14_17_19_49673, simplifying with
% 7.44/1.77 | (3), (4) gives:
% 7.44/1.77 | (6) ? [v0: $i] : (rf(i2003_11_14_17_19_49673, v0) = 0 & cp1(v0) = 0 &
% 7.44/1.77 | $i(v0) & ! [v1: $i] : ( ~ (rinvF(v0, v1) = 0) | ~ $i(v1) | ? [v2:
% 7.44/1.77 | $i] : ? [v3: int] : ( ~ (v3 = 0) & rf(v1, v2) = 0 & cp1(v2) = v3
% 7.44/1.77 | & $i(v2))))
% 7.44/1.77 |
% 7.44/1.77 | DELTA: instantiating (6) with fresh symbol all_16_0 gives:
% 7.44/1.77 | (7) rf(i2003_11_14_17_19_49673, all_16_0) = 0 & cp1(all_16_0) = 0 &
% 7.44/1.77 | $i(all_16_0) & ! [v0: $i] : ( ~ (rinvF(all_16_0, v0) = 0) | ~ $i(v0)
% 7.44/1.77 | | ? [v1: $i] : ? [v2: int] : ( ~ (v2 = 0) & rf(v0, v1) = 0 &
% 7.44/1.77 | cp1(v1) = v2 & $i(v1)))
% 7.44/1.77 |
% 7.44/1.77 | ALPHA: (7) implies:
% 7.44/1.77 | (8) $i(all_16_0)
% 7.44/1.77 | (9) cp1(all_16_0) = 0
% 7.44/1.77 | (10) rf(i2003_11_14_17_19_49673, all_16_0) = 0
% 7.44/1.77 | (11) ! [v0: $i] : ( ~ (rinvF(all_16_0, v0) = 0) | ~ $i(v0) | ? [v1: $i]
% 7.44/1.77 | : ? [v2: int] : ( ~ (v2 = 0) & rf(v0, v1) = 0 & cp1(v1) = v2 &
% 7.44/1.77 | $i(v1)))
% 7.44/1.77 |
% 7.44/1.77 | GROUND_INST: instantiating (2) with all_16_0, i2003_11_14_17_19_49673,
% 7.44/1.77 | simplifying with (3), (8), (10) gives:
% 7.44/1.77 | (12) rinvF(all_16_0, i2003_11_14_17_19_49673) = 0
% 7.44/1.77 |
% 7.44/1.77 | GROUND_INST: instantiating (11) with i2003_11_14_17_19_49673, simplifying with
% 7.44/1.77 | (3), (12) gives:
% 7.44/1.77 | (13) ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) &
% 7.44/1.77 | rf(i2003_11_14_17_19_49673, v0) = 0 & cp1(v0) = v1 & $i(v0))
% 7.44/1.77 |
% 7.44/1.77 | DELTA: instantiating (13) with fresh symbols all_30_0, all_30_1 gives:
% 7.44/1.78 | (14) ~ (all_30_0 = 0) & rf(i2003_11_14_17_19_49673, all_30_1) = 0 &
% 7.44/1.78 | cp1(all_30_1) = all_30_0 & $i(all_30_1)
% 7.44/1.78 |
% 7.44/1.78 | ALPHA: (14) implies:
% 7.44/1.78 | (15) ~ (all_30_0 = 0)
% 7.44/1.78 | (16) $i(all_30_1)
% 7.44/1.78 | (17) cp1(all_30_1) = all_30_0
% 7.44/1.78 | (18) rf(i2003_11_14_17_19_49673, all_30_1) = 0
% 7.44/1.78 |
% 7.44/1.78 | GROUND_INST: instantiating (axiom_3) with i2003_11_14_17_19_49673, all_16_0,
% 7.44/1.78 | all_30_1, simplifying with (3), (8), (10), (16), (18) gives:
% 7.44/1.78 | (19) all_30_1 = all_16_0
% 7.44/1.78 |
% 7.44/1.78 | REDUCE: (17), (19) imply:
% 7.44/1.78 | (20) cp1(all_16_0) = all_30_0
% 7.44/1.78 |
% 7.44/1.78 | GROUND_INST: instantiating (5) with 0, all_30_0, all_16_0, simplifying with
% 7.44/1.78 | (9), (20) gives:
% 7.44/1.78 | (21) all_30_0 = 0
% 7.44/1.78 |
% 7.44/1.78 | REDUCE: (15), (21) imply:
% 7.44/1.78 | (22) $false
% 7.44/1.78 |
% 7.44/1.78 | CLOSE: (22) is inconsistent.
% 7.44/1.78 |
% 7.44/1.78 End of proof
% 7.44/1.78 % SZS output end Proof for theBenchmark
% 7.44/1.78
% 7.44/1.78 1163ms
%------------------------------------------------------------------------------