%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : KRS140+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 : n032.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:24 EDT 2023 % Result : Theorem 5.08s 1.34s % Output : Proof 7.05s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.10 % Problem : KRS140+1 : TPTP v8.1.2. Released v3.1.0. % 0.00/0.10 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.10/0.30 % Computer : n032.cluster.edu % 0.10/0.30 % Model : x86_64 x86_64 % 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.30 % Memory : 8042.1875MB % 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64 % 0.10/0.30 % CPULimit : 300 % 0.10/0.30 % WCLimit : 300 % 0.10/0.30 % DateTime : Mon Aug 28 01:59:45 EDT 2023 % 0.10/0.30 % CPUTime : % 0.15/0.52 ________ _____ % 0.15/0.52 ___ __ \_________(_)________________________________ % 0.15/0.52 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.15/0.52 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.15/0.52 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.15/0.52 % 0.15/0.52 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.15/0.52 (2023-06-19) % 0.15/0.52 % 0.15/0.52 (c) Philipp Rümmer, 2009-2023 % 0.15/0.52 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.15/0.52 Amanda Stjerna. % 0.15/0.52 Free software under BSD-3-Clause. % 0.15/0.52 % 0.15/0.52 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.15/0.52 % 0.15/0.52 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.15/0.53 Running up to 7 provers in parallel. % 0.15/0.54 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.15/0.54 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.15/0.54 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.15/0.54 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.15/0.54 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.15/0.54 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.15/0.54 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 1.06/0.88 Prover 1: Preprocessing ... % 1.06/0.89 Prover 4: Preprocessing ... % 2.11/0.92 Prover 5: Preprocessing ... % 2.11/0.92 Prover 3: Preprocessing ... % 2.11/0.92 Prover 6: Preprocessing ... % 2.11/0.92 Prover 0: Preprocessing ... % 2.11/0.92 Prover 2: Preprocessing ... % 3.32/1.10 Prover 5: Proving ... % 3.32/1.11 Prover 2: Proving ... % 3.32/1.13 Prover 3: Constructing countermodel ... % 3.32/1.13 Prover 6: Proving ... % 3.32/1.15 Prover 0: Proving ... % 3.79/1.16 Prover 1: Constructing countermodel ... % 3.87/1.16 Prover 4: Constructing countermodel ... % 5.08/1.34 Prover 2: proved (800ms) % 5.08/1.34 % 5.08/1.34 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.08/1.34 % 5.08/1.34 Prover 3: stopped % 5.08/1.34 Prover 6: stopped % 5.08/1.34 Prover 5: stopped % 5.08/1.34 Prover 0: stopped % 5.08/1.34 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 5.08/1.36 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 5.08/1.36 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 5.08/1.36 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 5.08/1.37 Prover 8: Preprocessing ... % 5.08/1.38 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 5.08/1.38 Prover 7: Preprocessing ... % 5.47/1.39 Prover 11: Preprocessing ... % 5.47/1.41 Prover 10: Preprocessing ... % 5.47/1.42 Prover 7: Warning: ignoring some quantifiers % 5.47/1.42 Prover 13: Preprocessing ... % 5.47/1.44 Prover 7: Constructing countermodel ... % 5.47/1.44 Prover 8: Warning: ignoring some quantifiers % 5.47/1.44 Prover 8: Constructing countermodel ... % 5.47/1.44 Prover 10: Warning: ignoring some quantifiers % 5.47/1.46 Prover 10: Constructing countermodel ... % 5.47/1.46 Prover 13: Warning: ignoring some quantifiers % 5.47/1.46 Prover 13: Constructing countermodel ... % 5.47/1.47 Prover 1: Found proof (size 98) % 5.47/1.47 Prover 1: proved (932ms) % 5.47/1.47 Prover 13: stopped % 5.47/1.47 Prover 10: stopped % 5.47/1.47 Prover 4: stopped % 5.47/1.47 Prover 7: stopped % 5.47/1.47 Prover 8: stopped % 5.47/1.51 Prover 11: Constructing countermodel ... % 5.47/1.52 Prover 11: stopped % 5.47/1.52 % 5.47/1.52 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 5.47/1.52 % 5.47/1.54 % SZS output start Proof for theBenchmark % 5.47/1.55 Assumptions after simplification: % 5.47/1.55 --------------------------------- % 5.47/1.55 % 5.47/1.55 (axiom_0) % 5.47/1.59 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cowlThing(v0) = v1) | ~ $i(v0)) & % 5.47/1.59 ! [v0: $i] : ( ~ (cowlNothing(v0) = 0) | ~ $i(v0)) % 5.47/1.59 % 5.47/1.59 (axiom_1) % 5.47/1.59 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (xsd_string(v0) = v1) | ~ $i(v0) | % 5.47/1.59 xsd_integer(v0) = 0) & ! [v0: $i] : ( ~ (xsd_string(v0) = 0) | ~ $i(v0) | % 5.47/1.59 ? [v1: int] : ( ~ (v1 = 0) & xsd_integer(v0) = v1)) % 5.47/1.59 % 5.47/1.59 (axiom_2) % 5.47/1.59 $i(ib) & $i(ia) & ! [v0: $i] : ! [v1: $i] : (v1 = ib | v1 = ia | ~ % 5.47/1.59 (rsymProp(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0)) % 5.47/1.59 % 5.47/1.59 (axiom_3) % 5.47/1.60 ! [v0: $i] : ! [v1: $i] : ( ~ (rsymProp(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0) % 5.47/1.60 | rsymProp(v1, v0) = 0) % 5.47/1.60 % 5.47/1.60 (axiom_4) % 5.47/1.60 cowlThing(ia) = 0 & $i(ia) % 5.47/1.60 % 5.47/1.60 (axiom_5) % 5.47/1.60 rsymProp(ia, ia) = 0 & $i(ia) % 5.47/1.60 % 5.47/1.60 (axiom_7) % 5.47/1.60 rsymProp(ib, ib) = 0 & $i(ib) % 5.47/1.60 % 5.47/1.60 (the_axiom) % 5.47/1.60 $i(ia) & ( ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: int] : ( ~ (v3 = % 5.47/1.60 0) & rsymProp(v1, v2) = 0 & rsymProp(v0, v2) = v3 & rsymProp(v0, v1) = 0 % 5.47/1.60 & $i(v2) & $i(v1) & $i(v0)) | ? [v0: $i] : ? [v1: any] : ? [v2: any] : % 5.47/1.61 (xsd_string(v0) = v1 & xsd_integer(v0) = v2 & $i(v0) & ((v2 = 0 & v1 = 0) | % 5.47/1.61 ( ~ (v2 = 0) & ~ (v1 = 0)))) | ? [v0: $i] : ? [v1: any] : ? [v2: % 5.47/1.61 any] : (cowlThing(v0) = v1 & cowlNothing(v0) = v2 & $i(v0) & ( ~ (v1 = 0) % 5.47/1.61 | v2 = 0)) | ! [v0: $i] : ( ~ (rsymProp(ia, v0) = 0) | ~ $i(v0) | ? % 5.47/1.61 [v1: int] : ( ~ (v1 = 0) & cowlThing(v0) = v1))) % 5.47/1.61 % 5.47/1.61 (function-axioms) % 5.47/1.61 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 5.47/1.61 [v3: $i] : (v1 = v0 | ~ (rsymProp(v3, v2) = v1) | ~ (rsymProp(v3, v2) = v0)) % 5.47/1.61 & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 % 5.47/1.61 = v0 | ~ (xsd_string(v2) = v1) | ~ (xsd_string(v2) = v0)) & ! [v0: % 5.47/1.61 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 5.47/1.61 ~ (xsd_integer(v2) = v1) | ~ (xsd_integer(v2) = v0)) & ! [v0: % 5.47/1.61 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 5.47/1.61 ~ (cowlThing(v2) = v1) | ~ (cowlThing(v2) = v0)) & ! [v0: % 5.47/1.61 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 5.47/1.61 ~ (cowlNothing(v2) = v1) | ~ (cowlNothing(v2) = v0)) % 5.47/1.61 % 5.47/1.61 Further assumptions not needed in the proof: % 5.47/1.61 -------------------------------------------- % 5.47/1.61 axiom_6, cowlNothing_substitution_1, cowlThing_substitution_1, % 5.47/1.61 rsymProp_substitution_1, rsymProp_substitution_2, xsd_integer_substitution_1, % 5.47/1.61 xsd_string_substitution_1 % 5.47/1.61 % 5.47/1.61 Those formulas are unsatisfiable: % 5.47/1.61 --------------------------------- % 5.47/1.61 % 5.47/1.61 Begin of proof % 5.47/1.61 | % 5.47/1.61 | ALPHA: (axiom_0) implies: % 5.47/1.62 | (1) ! [v0: $i] : ( ~ (cowlNothing(v0) = 0) | ~ $i(v0)) % 5.47/1.62 | (2) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cowlThing(v0) = v1) | ~ % 5.47/1.62 | $i(v0)) % 5.47/1.62 | % 5.47/1.62 | ALPHA: (axiom_1) implies: % 5.47/1.62 | (3) ! [v0: $i] : ( ~ (xsd_string(v0) = 0) | ~ $i(v0) | ? [v1: int] : ( ~ % 5.47/1.62 | (v1 = 0) & xsd_integer(v0) = v1)) % 5.47/1.62 | (4) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (xsd_string(v0) = v1) | ~ % 5.47/1.62 | $i(v0) | xsd_integer(v0) = 0) % 5.47/1.62 | % 5.47/1.62 | ALPHA: (axiom_2) implies: % 6.26/1.62 | (5) ! [v0: $i] : ! [v1: $i] : (v1 = ib | v1 = ia | ~ (rsymProp(v0, v1) = % 6.26/1.62 | 0) | ~ $i(v1) | ~ $i(v0)) % 6.26/1.62 | % 6.26/1.62 | ALPHA: (axiom_4) implies: % 6.26/1.62 | (6) cowlThing(ia) = 0 % 6.26/1.62 | % 6.26/1.62 | ALPHA: (axiom_5) implies: % 6.26/1.62 | (7) rsymProp(ia, ia) = 0 % 6.26/1.62 | % 6.26/1.62 | ALPHA: (axiom_7) implies: % 6.26/1.62 | (8) rsymProp(ib, ib) = 0 % 6.26/1.62 | % 6.26/1.62 | ALPHA: (the_axiom) implies: % 6.26/1.62 | (9) $i(ia) % 6.26/1.63 | (10) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: int] : ( ~ (v3 = 0) % 6.26/1.63 | & rsymProp(v1, v2) = 0 & rsymProp(v0, v2) = v3 & rsymProp(v0, v1) = % 6.26/1.63 | 0 & $i(v2) & $i(v1) & $i(v0)) | ? [v0: $i] : ? [v1: any] : ? [v2: % 6.26/1.63 | any] : (xsd_string(v0) = v1 & xsd_integer(v0) = v2 & $i(v0) & ((v2 = % 6.26/1.63 | 0 & v1 = 0) | ( ~ (v2 = 0) & ~ (v1 = 0)))) | ? [v0: $i] : ? % 6.26/1.63 | [v1: any] : ? [v2: any] : (cowlThing(v0) = v1 & cowlNothing(v0) = v2 % 6.26/1.63 | & $i(v0) & ( ~ (v1 = 0) | v2 = 0)) | ! [v0: $i] : ( ~ (rsymProp(ia, % 6.26/1.63 | v0) = 0) | ~ $i(v0) | ? [v1: int] : ( ~ (v1 = 0) & % 6.26/1.63 | cowlThing(v0) = v1)) % 6.26/1.63 | % 6.26/1.63 | ALPHA: (function-axioms) implies: % 6.26/1.63 | (11) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] % 6.83/1.63 | : (v1 = v0 | ~ (cowlThing(v2) = v1) | ~ (cowlThing(v2) = v0)) % 6.83/1.63 | (12) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] % 6.83/1.63 | : (v1 = v0 | ~ (xsd_integer(v2) = v1) | ~ (xsd_integer(v2) = v0)) % 6.83/1.63 | (13) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] % 6.83/1.63 | : ! [v3: $i] : (v1 = v0 | ~ (rsymProp(v3, v2) = v1) | ~ % 6.83/1.63 | (rsymProp(v3, v2) = v0)) % 6.83/1.63 | % 6.83/1.63 | BETA: splitting (10) gives: % 6.83/1.63 | % 6.83/1.63 | Case 1: % 6.83/1.63 | | % 6.83/1.63 | | (14) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: int] : ( ~ (v3 = % 6.83/1.63 | | 0) & rsymProp(v1, v2) = 0 & rsymProp(v0, v2) = v3 & rsymProp(v0, % 6.83/1.63 | | v1) = 0 & $i(v2) & $i(v1) & $i(v0)) | ? [v0: $i] : ? [v1: any] % 6.83/1.63 | | : ? [v2: any] : (xsd_string(v0) = v1 & xsd_integer(v0) = v2 & % 6.83/1.63 | | $i(v0) & ((v2 = 0 & v1 = 0) | ( ~ (v2 = 0) & ~ (v1 = 0)))) % 6.83/1.63 | | % 6.83/1.63 | | BETA: splitting (14) gives: % 6.83/1.63 | | % 6.83/1.63 | | Case 1: % 6.83/1.63 | | | % 6.83/1.63 | | | (15) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: int] : ( ~ (v3 = % 6.83/1.63 | | | 0) & rsymProp(v1, v2) = 0 & rsymProp(v0, v2) = v3 & % 6.83/1.63 | | | rsymProp(v0, v1) = 0 & $i(v2) & $i(v1) & $i(v0)) % 6.83/1.64 | | | % 6.83/1.64 | | | DELTA: instantiating (15) with fresh symbols all_14_0, all_14_1, all_14_2, % 6.83/1.64 | | | all_14_3 gives: % 6.83/1.64 | | | (16) ~ (all_14_0 = 0) & rsymProp(all_14_2, all_14_1) = 0 & % 6.83/1.64 | | | rsymProp(all_14_3, all_14_1) = all_14_0 & rsymProp(all_14_3, % 6.83/1.64 | | | all_14_2) = 0 & $i(all_14_1) & $i(all_14_2) & $i(all_14_3) % 6.83/1.64 | | | % 6.83/1.64 | | | ALPHA: (16) implies: % 6.83/1.64 | | | (17) ~ (all_14_0 = 0) % 6.83/1.64 | | | (18) $i(all_14_3) % 6.83/1.64 | | | (19) $i(all_14_2) % 6.83/1.64 | | | (20) $i(all_14_1) % 6.83/1.64 | | | (21) rsymProp(all_14_3, all_14_2) = 0 % 6.83/1.64 | | | (22) rsymProp(all_14_3, all_14_1) = all_14_0 % 6.83/1.64 | | | (23) rsymProp(all_14_2, all_14_1) = 0 % 6.83/1.64 | | | % 6.83/1.64 | | | GROUND_INST: instantiating (axiom_3) with all_14_3, all_14_2, simplifying % 6.83/1.64 | | | with (18), (19), (21) gives: % 6.83/1.64 | | | (24) rsymProp(all_14_2, all_14_3) = 0 % 6.83/1.64 | | | % 6.83/1.64 | | | GROUND_INST: instantiating (5) with all_14_2, all_14_1, simplifying with % 6.83/1.64 | | | (19), (20), (23) gives: % 6.83/1.64 | | | (25) all_14_1 = ib | all_14_1 = ia % 6.83/1.64 | | | % 6.83/1.64 | | | GROUND_INST: instantiating (axiom_3) with all_14_2, all_14_1, simplifying % 6.83/1.64 | | | with (19), (20), (23) gives: % 6.83/1.64 | | | (26) rsymProp(all_14_1, all_14_2) = 0 % 6.83/1.64 | | | % 6.83/1.64 | | | BETA: splitting (25) gives: % 6.83/1.64 | | | % 6.83/1.64 | | | Case 1: % 6.83/1.64 | | | | % 6.83/1.64 | | | | (27) all_14_1 = ia % 6.83/1.64 | | | | % 6.83/1.64 | | | | REDUCE: (26), (27) imply: % 6.83/1.64 | | | | (28) rsymProp(ia, all_14_2) = 0 % 6.83/1.64 | | | | % 6.83/1.64 | | | | REDUCE: (23), (27) imply: % 6.83/1.64 | | | | (29) rsymProp(all_14_2, ia) = 0 % 6.83/1.64 | | | | % 6.83/1.64 | | | | REDUCE: (22), (27) imply: % 6.83/1.64 | | | | (30) rsymProp(all_14_3, ia) = all_14_0 % 6.83/1.64 | | | | % 6.83/1.64 | | | | GROUND_INST: instantiating (5) with ia, all_14_2, simplifying with (9), % 6.83/1.64 | | | | (19), (28) gives: % 6.83/1.64 | | | | (31) all_14_2 = ib | all_14_2 = ia % 6.83/1.64 | | | | % 6.83/1.64 | | | | BETA: splitting (31) gives: % 6.83/1.64 | | | | % 6.83/1.64 | | | | Case 1: % 6.83/1.64 | | | | | % 6.83/1.64 | | | | | (32) all_14_2 = ia % 6.83/1.64 | | | | | % 6.83/1.64 | | | | | REDUCE: (21), (32) imply: % 6.83/1.64 | | | | | (33) rsymProp(all_14_3, ia) = 0 % 6.83/1.64 | | | | | % 6.83/1.64 | | | | | GROUND_INST: instantiating (13) with all_14_0, 0, ia, all_14_3, % 6.83/1.64 | | | | | simplifying with (30), (33) gives: % 6.83/1.64 | | | | | (34) all_14_0 = 0 % 6.83/1.64 | | | | | % 6.83/1.64 | | | | | REDUCE: (17), (34) imply: % 6.83/1.64 | | | | | (35) $false % 6.83/1.65 | | | | | % 6.83/1.65 | | | | | CLOSE: (35) is inconsistent. % 6.83/1.65 | | | | | % 6.83/1.65 | | | | Case 2: % 6.83/1.65 | | | | | % 6.83/1.65 | | | | | (36) all_14_2 = ib % 6.83/1.65 | | | | | % 6.83/1.65 | | | | | REDUCE: (24), (36) imply: % 6.83/1.65 | | | | | (37) rsymProp(ib, all_14_3) = 0 % 6.83/1.65 | | | | | % 6.83/1.65 | | | | | REDUCE: (29), (36) imply: % 6.83/1.65 | | | | | (38) rsymProp(ib, ia) = 0 % 6.83/1.65 | | | | | % 6.83/1.65 | | | | | REDUCE: (19), (36) imply: % 6.83/1.65 | | | | | (39) $i(ib) % 6.83/1.65 | | | | | % 6.83/1.65 | | | | | GROUND_INST: instantiating (5) with ib, all_14_3, simplifying with % 6.83/1.65 | | | | | (18), (37), (39) gives: % 6.83/1.65 | | | | | (40) all_14_3 = ib | all_14_3 = ia % 6.83/1.65 | | | | | % 6.83/1.65 | | | | | BETA: splitting (40) gives: % 6.83/1.65 | | | | | % 6.83/1.65 | | | | | Case 1: % 6.83/1.65 | | | | | | % 6.83/1.65 | | | | | | (41) all_14_3 = ia % 6.83/1.65 | | | | | | % 6.83/1.65 | | | | | | REDUCE: (30), (41) imply: % 6.83/1.65 | | | | | | (42) rsymProp(ia, ia) = all_14_0 % 6.83/1.65 | | | | | | % 6.83/1.65 | | | | | | GROUND_INST: instantiating (13) with 0, all_14_0, ia, ia, % 6.83/1.65 | | | | | | simplifying with (7), (42) gives: % 6.83/1.65 | | | | | | (43) all_14_0 = 0 % 6.83/1.65 | | | | | | % 6.83/1.65 | | | | | | REDUCE: (17), (43) imply: % 6.83/1.65 | | | | | | (44) $false % 6.83/1.65 | | | | | | % 6.83/1.65 | | | | | | CLOSE: (44) is inconsistent. % 6.83/1.65 | | | | | | % 6.83/1.65 | | | | | Case 2: % 6.83/1.65 | | | | | | % 6.83/1.65 | | | | | | (45) all_14_3 = ib % 6.83/1.65 | | | | | | % 6.83/1.65 | | | | | | REDUCE: (30), (45) imply: % 6.83/1.65 | | | | | | (46) rsymProp(ib, ia) = all_14_0 % 6.83/1.65 | | | | | | % 6.83/1.65 | | | | | | GROUND_INST: instantiating (13) with 0, all_14_0, ia, ib, % 6.83/1.65 | | | | | | simplifying with (38), (46) gives: % 6.83/1.65 | | | | | | (47) all_14_0 = 0 % 6.83/1.65 | | | | | | % 6.83/1.65 | | | | | | REDUCE: (17), (47) imply: % 6.83/1.65 | | | | | | (48) $false % 6.83/1.65 | | | | | | % 6.83/1.65 | | | | | | CLOSE: (48) is inconsistent. % 6.83/1.65 | | | | | | % 6.83/1.65 | | | | | End of split % 6.83/1.65 | | | | | % 6.83/1.65 | | | | End of split % 6.83/1.65 | | | | % 6.83/1.65 | | | Case 2: % 6.83/1.65 | | | | % 6.83/1.65 | | | | (49) all_14_1 = ib % 6.83/1.65 | | | | % 6.83/1.65 | | | | REDUCE: (26), (49) imply: % 6.83/1.65 | | | | (50) rsymProp(ib, all_14_2) = 0 % 6.83/1.65 | | | | % 6.83/1.65 | | | | REDUCE: (23), (49) imply: % 6.83/1.65 | | | | (51) rsymProp(all_14_2, ib) = 0 % 6.83/1.65 | | | | % 6.83/1.65 | | | | REDUCE: (22), (49) imply: % 6.83/1.65 | | | | (52) rsymProp(all_14_3, ib) = all_14_0 % 6.83/1.65 | | | | % 6.83/1.65 | | | | REDUCE: (20), (49) imply: % 6.83/1.65 | | | | (53) $i(ib) % 6.83/1.65 | | | | % 6.83/1.65 | | | | GROUND_INST: instantiating (5) with ib, all_14_2, simplifying with (19), % 6.83/1.65 | | | | (50), (53) gives: % 6.83/1.65 | | | | (54) all_14_2 = ib | all_14_2 = ia % 6.83/1.65 | | | | % 6.83/1.65 | | | | BETA: splitting (54) gives: % 6.83/1.65 | | | | % 6.83/1.65 | | | | Case 1: % 6.83/1.65 | | | | | % 6.83/1.65 | | | | | (55) all_14_2 = ia % 6.83/1.65 | | | | | % 6.83/1.65 | | | | | REDUCE: (24), (55) imply: % 6.83/1.65 | | | | | (56) rsymProp(ia, all_14_3) = 0 % 6.83/1.65 | | | | | % 6.83/1.65 | | | | | REDUCE: (51), (55) imply: % 6.83/1.65 | | | | | (57) rsymProp(ia, ib) = 0 % 6.83/1.65 | | | | | % 6.83/1.65 | | | | | GROUND_INST: instantiating (5) with ia, all_14_3, simplifying with % 6.83/1.65 | | | | | (9), (18), (56) gives: % 6.83/1.65 | | | | | (58) all_14_3 = ib | all_14_3 = ia % 6.83/1.65 | | | | | % 6.83/1.65 | | | | | BETA: splitting (58) gives: % 6.83/1.65 | | | | | % 6.83/1.65 | | | | | Case 1: % 6.83/1.65 | | | | | | % 6.83/1.65 | | | | | | (59) all_14_3 = ia % 6.83/1.65 | | | | | | % 6.83/1.65 | | | | | | REDUCE: (52), (59) imply: % 6.83/1.65 | | | | | | (60) rsymProp(ia, ib) = all_14_0 % 6.83/1.65 | | | | | | % 6.83/1.65 | | | | | | GROUND_INST: instantiating (13) with 0, all_14_0, ib, ia, % 6.83/1.65 | | | | | | simplifying with (57), (60) gives: % 6.83/1.65 | | | | | | (61) all_14_0 = 0 % 6.83/1.65 | | | | | | % 6.83/1.65 | | | | | | REDUCE: (17), (61) imply: % 6.83/1.65 | | | | | | (62) $false % 6.83/1.65 | | | | | | % 6.83/1.65 | | | | | | CLOSE: (62) is inconsistent. % 6.83/1.65 | | | | | | % 6.83/1.65 | | | | | Case 2: % 6.83/1.65 | | | | | | % 6.83/1.66 | | | | | | (63) all_14_3 = ib % 6.83/1.66 | | | | | | % 6.83/1.66 | | | | | | REDUCE: (52), (63) imply: % 6.83/1.66 | | | | | | (64) rsymProp(ib, ib) = all_14_0 % 6.83/1.66 | | | | | | % 6.83/1.66 | | | | | | GROUND_INST: instantiating (13) with 0, all_14_0, ib, ib, % 6.83/1.66 | | | | | | simplifying with (8), (64) gives: % 6.83/1.66 | | | | | | (65) all_14_0 = 0 % 6.83/1.66 | | | | | | % 6.83/1.66 | | | | | | REDUCE: (17), (65) imply: % 6.83/1.66 | | | | | | (66) $false % 6.83/1.66 | | | | | | % 6.83/1.66 | | | | | | CLOSE: (66) is inconsistent. % 6.83/1.66 | | | | | | % 6.83/1.66 | | | | | End of split % 6.83/1.66 | | | | | % 6.83/1.66 | | | | Case 2: % 6.83/1.66 | | | | | % 6.83/1.66 | | | | | (67) all_14_2 = ib % 6.83/1.66 | | | | | % 6.83/1.66 | | | | | REDUCE: (21), (67) imply: % 6.83/1.66 | | | | | (68) rsymProp(all_14_3, ib) = 0 % 6.83/1.66 | | | | | % 6.83/1.66 | | | | | GROUND_INST: instantiating (13) with all_14_0, 0, ib, all_14_3, % 6.83/1.66 | | | | | simplifying with (52), (68) gives: % 6.83/1.66 | | | | | (69) all_14_0 = 0 % 6.83/1.66 | | | | | % 6.83/1.66 | | | | | REDUCE: (17), (69) imply: % 6.83/1.66 | | | | | (70) $false % 6.83/1.66 | | | | | % 6.83/1.66 | | | | | CLOSE: (70) is inconsistent. % 6.83/1.66 | | | | | % 6.83/1.66 | | | | End of split % 6.83/1.66 | | | | % 6.83/1.66 | | | End of split % 6.83/1.66 | | | % 6.83/1.66 | | Case 2: % 6.83/1.66 | | | % 6.83/1.66 | | | (71) ? [v0: $i] : ? [v1: any] : ? [v2: any] : (xsd_string(v0) = v1 & % 6.83/1.66 | | | xsd_integer(v0) = v2 & $i(v0) & ((v2 = 0 & v1 = 0) | ( ~ (v2 = % 6.83/1.66 | | | 0) & ~ (v1 = 0)))) % 6.83/1.66 | | | % 6.83/1.66 | | | DELTA: instantiating (71) with fresh symbols all_14_0, all_14_1, all_14_2 % 6.83/1.66 | | | gives: % 6.83/1.66 | | | (72) xsd_string(all_14_2) = all_14_1 & xsd_integer(all_14_2) = all_14_0 % 6.83/1.66 | | | & $i(all_14_2) & ((all_14_0 = 0 & all_14_1 = 0) | ( ~ (all_14_0 = % 6.83/1.66 | | | 0) & ~ (all_14_1 = 0))) % 6.83/1.66 | | | % 6.83/1.66 | | | ALPHA: (72) implies: % 6.83/1.66 | | | (73) $i(all_14_2) % 6.83/1.66 | | | (74) xsd_integer(all_14_2) = all_14_0 % 6.83/1.66 | | | (75) xsd_string(all_14_2) = all_14_1 % 6.83/1.66 | | | (76) (all_14_0 = 0 & all_14_1 = 0) | ( ~ (all_14_0 = 0) & ~ (all_14_1 % 6.83/1.66 | | | = 0)) % 6.83/1.66 | | | % 6.83/1.66 | | | GROUND_INST: instantiating (4) with all_14_2, all_14_1, simplifying with % 6.83/1.66 | | | (73), (75) gives: % 6.83/1.66 | | | (77) all_14_1 = 0 | xsd_integer(all_14_2) = 0 % 6.83/1.66 | | | % 6.83/1.66 | | | BETA: splitting (76) gives: % 6.83/1.66 | | | % 6.83/1.66 | | | Case 1: % 6.83/1.66 | | | | % 6.83/1.66 | | | | (78) all_14_0 = 0 & all_14_1 = 0 % 6.83/1.66 | | | | % 6.83/1.66 | | | | ALPHA: (78) implies: % 6.83/1.66 | | | | (79) all_14_1 = 0 % 6.83/1.66 | | | | (80) all_14_0 = 0 % 6.83/1.66 | | | | % 6.83/1.66 | | | | REDUCE: (75), (79) imply: % 6.83/1.66 | | | | (81) xsd_string(all_14_2) = 0 % 6.83/1.66 | | | | % 6.83/1.66 | | | | REDUCE: (74), (80) imply: % 6.83/1.66 | | | | (82) xsd_integer(all_14_2) = 0 % 6.83/1.66 | | | | % 6.83/1.66 | | | | GROUND_INST: instantiating (3) with all_14_2, simplifying with (73), % 6.83/1.66 | | | | (81) gives: % 6.83/1.66 | | | | (83) ? [v0: int] : ( ~ (v0 = 0) & xsd_integer(all_14_2) = v0) % 6.83/1.66 | | | | % 6.83/1.66 | | | | DELTA: instantiating (83) with fresh symbol all_28_0 gives: % 6.83/1.66 | | | | (84) ~ (all_28_0 = 0) & xsd_integer(all_14_2) = all_28_0 % 6.83/1.66 | | | | % 6.83/1.66 | | | | ALPHA: (84) implies: % 6.83/1.66 | | | | (85) ~ (all_28_0 = 0) % 6.83/1.66 | | | | (86) xsd_integer(all_14_2) = all_28_0 % 6.83/1.66 | | | | % 6.83/1.66 | | | | GROUND_INST: instantiating (12) with 0, all_28_0, all_14_2, simplifying % 6.83/1.66 | | | | with (82), (86) gives: % 6.83/1.66 | | | | (87) all_28_0 = 0 % 6.83/1.66 | | | | % 6.83/1.66 | | | | REDUCE: (85), (87) imply: % 6.83/1.66 | | | | (88) $false % 6.83/1.66 | | | | % 6.83/1.66 | | | | CLOSE: (88) is inconsistent. % 6.83/1.66 | | | | % 6.83/1.66 | | | Case 2: % 6.83/1.66 | | | | % 6.83/1.66 | | | | (89) ~ (all_14_0 = 0) & ~ (all_14_1 = 0) % 6.83/1.66 | | | | % 6.83/1.66 | | | | ALPHA: (89) implies: % 6.83/1.66 | | | | (90) ~ (all_14_1 = 0) % 6.83/1.66 | | | | (91) ~ (all_14_0 = 0) % 6.83/1.66 | | | | % 6.83/1.67 | | | | BETA: splitting (77) gives: % 6.83/1.67 | | | | % 6.83/1.67 | | | | Case 1: % 6.83/1.67 | | | | | % 6.83/1.67 | | | | | (92) xsd_integer(all_14_2) = 0 % 6.83/1.67 | | | | | % 6.83/1.67 | | | | | GROUND_INST: instantiating (12) with all_14_0, 0, all_14_2, % 6.83/1.67 | | | | | simplifying with (74), (92) gives: % 6.83/1.67 | | | | | (93) all_14_0 = 0 % 6.83/1.67 | | | | | % 6.83/1.67 | | | | | REDUCE: (91), (93) imply: % 6.83/1.67 | | | | | (94) $false % 6.83/1.67 | | | | | % 6.83/1.67 | | | | | CLOSE: (94) is inconsistent. % 6.83/1.67 | | | | | % 6.83/1.67 | | | | Case 2: % 6.83/1.67 | | | | | % 6.83/1.67 | | | | | (95) all_14_1 = 0 % 6.83/1.67 | | | | | % 6.83/1.67 | | | | | REDUCE: (90), (95) imply: % 6.83/1.67 | | | | | (96) $false % 6.83/1.67 | | | | | % 6.83/1.67 | | | | | CLOSE: (96) is inconsistent. % 6.83/1.67 | | | | | % 6.83/1.67 | | | | End of split % 6.83/1.67 | | | | % 6.83/1.67 | | | End of split % 6.83/1.67 | | | % 6.83/1.67 | | End of split % 6.83/1.67 | | % 6.83/1.67 | Case 2: % 6.83/1.67 | | % 6.83/1.67 | | (97) ? [v0: $i] : ? [v1: any] : ? [v2: any] : (cowlThing(v0) = v1 & % 6.83/1.67 | | cowlNothing(v0) = v2 & $i(v0) & ( ~ (v1 = 0) | v2 = 0)) | ! [v0: % 6.83/1.67 | | $i] : ( ~ (rsymProp(ia, v0) = 0) | ~ $i(v0) | ? [v1: int] : ( ~ % 6.83/1.67 | | (v1 = 0) & cowlThing(v0) = v1)) % 6.83/1.67 | | % 6.83/1.67 | | BETA: splitting (97) gives: % 6.83/1.67 | | % 6.83/1.67 | | Case 1: % 6.83/1.67 | | | % 6.83/1.67 | | | (98) ? [v0: $i] : ? [v1: any] : ? [v2: any] : (cowlThing(v0) = v1 & % 6.83/1.67 | | | cowlNothing(v0) = v2 & $i(v0) & ( ~ (v1 = 0) | v2 = 0)) % 6.83/1.67 | | | % 6.83/1.67 | | | DELTA: instantiating (98) with fresh symbols all_14_0, all_14_1, all_14_2 % 6.83/1.67 | | | gives: % 6.83/1.67 | | | (99) cowlThing(all_14_2) = all_14_1 & cowlNothing(all_14_2) = all_14_0 % 6.83/1.67 | | | & $i(all_14_2) & ( ~ (all_14_1 = 0) | all_14_0 = 0) % 6.83/1.67 | | | % 6.83/1.67 | | | ALPHA: (99) implies: % 6.83/1.67 | | | (100) $i(all_14_2) % 6.83/1.67 | | | (101) cowlNothing(all_14_2) = all_14_0 % 6.83/1.67 | | | (102) cowlThing(all_14_2) = all_14_1 % 6.83/1.67 | | | (103) ~ (all_14_1 = 0) | all_14_0 = 0 % 6.83/1.67 | | | % 6.83/1.67 | | | GROUND_INST: instantiating (2) with all_14_2, all_14_1, simplifying with % 6.83/1.67 | | | (100), (102) gives: % 6.83/1.67 | | | (104) all_14_1 = 0 % 6.83/1.67 | | | % 6.83/1.67 | | | BETA: splitting (103) gives: % 6.83/1.67 | | | % 6.83/1.67 | | | Case 1: % 6.83/1.67 | | | | % 6.83/1.67 | | | | (105) ~ (all_14_1 = 0) % 6.83/1.67 | | | | % 6.83/1.67 | | | | REDUCE: (104), (105) imply: % 6.83/1.67 | | | | (106) $false % 6.83/1.67 | | | | % 6.83/1.67 | | | | CLOSE: (106) is inconsistent. % 6.83/1.67 | | | | % 6.83/1.67 | | | Case 2: % 6.83/1.67 | | | | % 6.83/1.67 | | | | (107) all_14_0 = 0 % 6.83/1.67 | | | | % 6.83/1.67 | | | | REDUCE: (101), (107) imply: % 6.83/1.67 | | | | (108) cowlNothing(all_14_2) = 0 % 6.83/1.67 | | | | % 6.83/1.67 | | | | GROUND_INST: instantiating (1) with all_14_2, simplifying with (100), % 6.83/1.67 | | | | (108) gives: % 6.83/1.67 | | | | (109) $false % 6.83/1.67 | | | | % 6.83/1.67 | | | | CLOSE: (109) is inconsistent. % 6.83/1.67 | | | | % 6.83/1.67 | | | End of split % 6.83/1.67 | | | % 6.83/1.67 | | Case 2: % 6.83/1.67 | | | % 6.83/1.67 | | | (110) ! [v0: $i] : ( ~ (rsymProp(ia, v0) = 0) | ~ $i(v0) | ? [v1: % 6.83/1.67 | | | int] : ( ~ (v1 = 0) & cowlThing(v0) = v1)) % 6.83/1.67 | | | % 6.83/1.67 | | | GROUND_INST: instantiating (110) with ia, simplifying with (7), (9) gives: % 6.83/1.67 | | | (111) ? [v0: int] : ( ~ (v0 = 0) & cowlThing(ia) = v0) % 6.83/1.67 | | | % 6.83/1.67 | | | DELTA: instantiating (111) with fresh symbol all_15_0 gives: % 6.83/1.67 | | | (112) ~ (all_15_0 = 0) & cowlThing(ia) = all_15_0 % 6.83/1.67 | | | % 6.83/1.67 | | | ALPHA: (112) implies: % 6.83/1.67 | | | (113) ~ (all_15_0 = 0) % 6.83/1.67 | | | (114) cowlThing(ia) = all_15_0 % 6.83/1.67 | | | % 7.05/1.67 | | | GROUND_INST: instantiating (11) with 0, all_15_0, ia, simplifying with % 7.05/1.67 | | | (6), (114) gives: % 7.05/1.67 | | | (115) all_15_0 = 0 % 7.05/1.67 | | | % 7.05/1.67 | | | REDUCE: (113), (115) imply: % 7.05/1.67 | | | (116) $false % 7.05/1.67 | | | % 7.05/1.67 | | | CLOSE: (116) is inconsistent. % 7.05/1.67 | | | % 7.05/1.67 | | End of split % 7.05/1.67 | | % 7.05/1.67 | End of split % 7.05/1.67 | % 7.05/1.67 End of proof % 7.05/1.68 % SZS output end Proof for theBenchmark % 7.05/1.68 % 7.05/1.68 1154ms %------------------------------------------------------------------------------