%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : KRS143+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 : n019.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 4.85s 1.48s % Output : Proof 6.72s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : KRS143+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.15/0.35 % Computer : n019.cluster.edu % 0.15/0.35 % Model : x86_64 x86_64 % 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.35 % Memory : 8042.1875MB % 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.35 % CPULimit : 300 % 0.15/0.35 % WCLimit : 300 % 0.15/0.35 % DateTime : Mon Aug 28 01:03:43 EDT 2023 % 0.15/0.36 % CPUTime : % 0.22/0.61 ________ _____ % 0.22/0.61 ___ __ \_________(_)________________________________ % 0.22/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.22/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.22/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.22/0.61 % 0.22/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.22/0.61 (2023-06-19) % 0.22/0.61 % 0.22/0.61 (c) Philipp Rümmer, 2009-2023 % 0.22/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.22/0.61 Amanda Stjerna. % 0.22/0.61 Free software under BSD-3-Clause. % 0.22/0.61 % 0.22/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.22/0.61 % 0.22/0.61 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.22/0.62 Running up to 7 provers in parallel. % 0.22/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.22/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.22/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.22/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.22/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.22/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.22/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.32/1.02 Prover 1: Preprocessing ... % 2.32/1.02 Prover 4: Preprocessing ... % 2.32/1.06 Prover 3: Preprocessing ... % 2.32/1.06 Prover 0: Preprocessing ... % 2.32/1.06 Prover 6: Preprocessing ... % 2.32/1.06 Prover 2: Preprocessing ... % 2.32/1.06 Prover 5: Preprocessing ... % 3.37/1.25 Prover 2: Proving ... % 3.37/1.26 Prover 5: Proving ... % 3.37/1.26 Prover 6: Proving ... % 4.01/1.28 Prover 3: Constructing countermodel ... % 4.11/1.29 Prover 1: Constructing countermodel ... % 4.11/1.30 Prover 0: Proving ... % 4.11/1.31 Prover 4: Constructing countermodel ... % 4.85/1.47 Prover 5: proved (840ms) % 4.85/1.47 Prover 3: proved (841ms) % 4.85/1.48 % 4.85/1.48 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.85/1.48 % 4.85/1.48 Prover 0: proved (845ms) % 4.85/1.48 % 4.85/1.48 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.85/1.48 % 4.85/1.48 % 4.85/1.48 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.85/1.48 % 4.85/1.48 Prover 2: stopped % 4.85/1.48 Prover 6: stopped % 4.85/1.50 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 4.85/1.50 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 4.85/1.50 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 4.85/1.50 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 4.85/1.50 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 4.85/1.51 Prover 10: Preprocessing ... % 4.85/1.52 Prover 7: Preprocessing ... % 4.85/1.53 Prover 11: Preprocessing ... % 4.85/1.53 Prover 8: Preprocessing ... % 4.85/1.53 Prover 13: Preprocessing ... % 4.85/1.54 Prover 10: Warning: ignoring some quantifiers % 4.85/1.55 Prover 10: Constructing countermodel ... % 4.85/1.56 Prover 4: Found proof (size 48) % 4.85/1.56 Prover 4: proved (929ms) % 4.85/1.56 Prover 10: stopped % 4.85/1.56 Prover 1: Found proof (size 51) % 4.85/1.56 Prover 1: proved (936ms) % 4.85/1.57 Prover 7: Warning: ignoring some quantifiers % 4.85/1.58 Prover 7: Constructing countermodel ... % 4.85/1.58 Prover 11: stopped % 4.85/1.58 Prover 7: stopped % 4.85/1.59 Prover 13: Warning: ignoring some quantifiers % 4.85/1.60 Prover 13: Constructing countermodel ... % 4.85/1.60 Prover 13: stopped % 4.85/1.60 Prover 8: Warning: ignoring some quantifiers % 4.85/1.61 Prover 8: Constructing countermodel ... % 4.85/1.62 Prover 8: stopped % 4.85/1.62 % 4.85/1.62 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 4.85/1.62 % 4.85/1.62 % SZS output start Proof for theBenchmark % 5.96/1.62 Assumptions after simplification: % 5.96/1.62 --------------------------------- % 5.96/1.63 % 5.96/1.63 (axiom_0) % 5.96/1.65 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cowlThing(v0) = v1) | ~ $i(v0)) & % 5.96/1.65 ! [v0: $i] : ( ~ (cowlNothing(v0) = 0) | ~ $i(v0)) % 5.96/1.65 % 5.96/1.65 (axiom_1) % 5.96/1.66 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (xsd_string(v0) = v1) | ~ $i(v0) | % 5.96/1.66 xsd_integer(v0) = 0) & ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ % 5.96/1.66 (xsd_integer(v0) = v1) | ~ $i(v0) | xsd_string(v0) = 0) & ! [v0: $i] : ( ~ % 5.96/1.66 (xsd_string(v0) = 0) | ~ $i(v0) | ? [v1: int] : ( ~ (v1 = 0) & % 5.96/1.66 xsd_integer(v0) = v1)) & ! [v0: $i] : ( ~ (xsd_integer(v0) = 0) | ~ % 5.96/1.66 $i(v0) | ? [v1: int] : ( ~ (v1 = 0) & xsd_string(v0) = v1)) % 5.96/1.66 % 5.96/1.66 (axiom_2) % 5.96/1.66 ! [v0: $i] : ( ~ (cc(v0) = 0) | ~ $i(v0) | ? [v1: $i] : (rp(v0, v1) = 0 & % 5.96/1.66 $i(v1))) % 5.96/1.66 % 5.96/1.66 (axiom_3) % 5.96/1.66 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v1 | ~ (rp(v0, v2) = 0) | ~ % 5.96/1.66 (rp(v0, v1) = 0) | ~ (cc(v0) = 0) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0)) % 5.96/1.66 % 5.96/1.66 (the_axiom) % 5.96/1.67 ? [v0: $i] : ? [v1: int] : ? [v2: $i] : ? [v3: $i] : ? [v4: int] : ? % 5.96/1.67 [v5: int] : ? [v6: $i] : ? [v7: any] : ? [v8: any] : ? [v9: $i] : ? [v10: % 5.96/1.67 any] : ? [v11: any] : ($i(v9) & $i(v6) & $i(v3) & $i(v2) & $i(v0) & ((v1 = % 5.96/1.67 0 & cc(v0) = 0 & ( ! [v12: $i] : ( ~ (rp(v0, v12) = 0) | ~ $i(v12)) | % 5.96/1.67 (v5 = 0 & v4 = 0 & ~ (v3 = v2) & rp(v0, v3) = 0 & rp(v0, v2) = 0))) | % 5.96/1.67 (xsd_string(v6) = v7 & xsd_integer(v6) = v8 & ((v8 = 0 & v7 = 0) | ( ~ (v8 % 5.96/1.67 = 0) & ~ (v7 = 0)))) | (cowlThing(v9) = v10 & cowlNothing(v9) = % 5.96/1.67 v11 & ( ~ (v10 = 0) | v11 = 0)))) % 5.96/1.67 % 5.96/1.67 (function-axioms) % 5.96/1.67 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 5.96/1.67 [v3: $i] : (v1 = v0 | ~ (rp(v3, v2) = v1) | ~ (rp(v3, v2) = v0)) & ! [v0: % 5.96/1.67 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 5.96/1.67 ~ (xsd_string(v2) = v1) | ~ (xsd_string(v2) = v0)) & ! [v0: % 5.96/1.67 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 5.96/1.67 ~ (xsd_integer(v2) = v1) | ~ (xsd_integer(v2) = v0)) & ! [v0: % 5.96/1.67 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 5.96/1.67 ~ (cowlThing(v2) = v1) | ~ (cowlThing(v2) = v0)) & ! [v0: % 5.96/1.67 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 5.96/1.67 ~ (cowlNothing(v2) = v1) | ~ (cowlNothing(v2) = v0)) & ! [v0: % 5.96/1.67 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 5.96/1.67 ~ (cc(v2) = v1) | ~ (cc(v2) = v0)) % 5.96/1.67 % 5.96/1.67 Further assumptions not needed in the proof: % 5.96/1.67 -------------------------------------------- % 5.96/1.67 cc_substitution_1, cowlNothing_substitution_1, cowlThing_substitution_1, % 5.96/1.67 rp_substitution_1, rp_substitution_2, xsd_integer_substitution_1, % 5.96/1.67 xsd_string_substitution_1 % 5.96/1.67 % 5.96/1.67 Those formulas are unsatisfiable: % 5.96/1.67 --------------------------------- % 5.96/1.67 % 5.96/1.67 Begin of proof % 5.96/1.67 | % 5.96/1.67 | ALPHA: (axiom_0) implies: % 5.96/1.68 | (1) ! [v0: $i] : ( ~ (cowlNothing(v0) = 0) | ~ $i(v0)) % 5.96/1.68 | (2) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cowlThing(v0) = v1) | ~ % 5.96/1.68 | $i(v0)) % 5.96/1.68 | % 5.96/1.68 | ALPHA: (axiom_1) implies: % 5.96/1.68 | (3) ! [v0: $i] : ( ~ (xsd_string(v0) = 0) | ~ $i(v0) | ? [v1: int] : ( ~ % 5.96/1.68 | (v1 = 0) & xsd_integer(v0) = v1)) % 5.96/1.68 | (4) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (xsd_integer(v0) = v1) | ~ % 5.96/1.68 | $i(v0) | xsd_string(v0) = 0) % 5.96/1.68 | % 5.96/1.68 | ALPHA: (function-axioms) implies: % 5.96/1.68 | (5) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 5.96/1.68 | (v1 = v0 | ~ (xsd_integer(v2) = v1) | ~ (xsd_integer(v2) = v0)) % 5.96/1.68 | (6) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 5.96/1.68 | (v1 = v0 | ~ (xsd_string(v2) = v1) | ~ (xsd_string(v2) = v0)) % 5.96/1.68 | % 5.96/1.68 | DELTA: instantiating (the_axiom) with fresh symbols all_7_0, all_7_1, all_7_2, % 5.96/1.68 | all_7_3, all_7_4, all_7_5, all_7_6, all_7_7, all_7_8, all_7_9, % 5.96/1.68 | all_7_10, all_7_11 gives: % 5.96/1.69 | (7) $i(all_7_2) & $i(all_7_5) & $i(all_7_8) & $i(all_7_9) & $i(all_7_11) & % 5.96/1.69 | ((all_7_10 = 0 & cc(all_7_11) = 0 & ( ! [v0: $i] : ( ~ (rp(all_7_11, % 5.96/1.69 | v0) = 0) | ~ $i(v0)) | (all_7_6 = 0 & all_7_7 = 0 & ~ % 5.96/1.69 | (all_7_8 = all_7_9) & rp(all_7_11, all_7_8) = 0 & rp(all_7_11, % 5.96/1.69 | all_7_9) = 0))) | (xsd_string(all_7_5) = all_7_4 & % 5.96/1.69 | xsd_integer(all_7_5) = all_7_3 & ((all_7_3 = 0 & all_7_4 = 0) | ( ~ % 5.96/1.69 | (all_7_3 = 0) & ~ (all_7_4 = 0)))) | (cowlThing(all_7_2) = % 5.96/1.69 | all_7_1 & cowlNothing(all_7_2) = all_7_0 & ( ~ (all_7_1 = 0) | % 5.96/1.69 | all_7_0 = 0))) % 5.96/1.69 | % 5.96/1.69 | ALPHA: (7) implies: % 5.96/1.69 | (8) $i(all_7_11) % 5.96/1.69 | (9) $i(all_7_9) % 5.96/1.69 | (10) $i(all_7_8) % 5.96/1.69 | (11) $i(all_7_5) % 5.96/1.69 | (12) $i(all_7_2) % 5.96/1.69 | (13) (all_7_10 = 0 & cc(all_7_11) = 0 & ( ! [v0: $i] : ( ~ (rp(all_7_11, % 5.96/1.69 | v0) = 0) | ~ $i(v0)) | (all_7_6 = 0 & all_7_7 = 0 & ~ % 5.96/1.69 | (all_7_8 = all_7_9) & rp(all_7_11, all_7_8) = 0 & rp(all_7_11, % 5.96/1.69 | all_7_9) = 0))) | (xsd_string(all_7_5) = all_7_4 & % 5.96/1.69 | xsd_integer(all_7_5) = all_7_3 & ((all_7_3 = 0 & all_7_4 = 0) | ( ~ % 5.96/1.69 | (all_7_3 = 0) & ~ (all_7_4 = 0)))) | (cowlThing(all_7_2) = % 5.96/1.69 | all_7_1 & cowlNothing(all_7_2) = all_7_0 & ( ~ (all_7_1 = 0) | % 5.96/1.69 | all_7_0 = 0)) % 5.96/1.69 | % 5.96/1.69 | BETA: splitting (13) gives: % 5.96/1.69 | % 5.96/1.69 | Case 1: % 5.96/1.69 | | % 5.96/1.69 | | (14) all_7_10 = 0 & cc(all_7_11) = 0 & ( ! [v0: $i] : ( ~ (rp(all_7_11, % 5.96/1.69 | | v0) = 0) | ~ $i(v0)) | (all_7_6 = 0 & all_7_7 = 0 & ~ % 5.96/1.69 | | (all_7_8 = all_7_9) & rp(all_7_11, all_7_8) = 0 & rp(all_7_11, % 5.96/1.69 | | all_7_9) = 0)) % 5.96/1.69 | | % 5.96/1.69 | | ALPHA: (14) implies: % 5.96/1.69 | | (15) cc(all_7_11) = 0 % 5.96/1.69 | | (16) ! [v0: $i] : ( ~ (rp(all_7_11, v0) = 0) | ~ $i(v0)) | (all_7_6 = 0 % 5.96/1.69 | | & all_7_7 = 0 & ~ (all_7_8 = all_7_9) & rp(all_7_11, all_7_8) = 0 % 5.96/1.69 | | & rp(all_7_11, all_7_9) = 0) % 5.96/1.69 | | % 5.96/1.69 | | GROUND_INST: instantiating (axiom_2) with all_7_11, simplifying with (8), % 5.96/1.69 | | (15) gives: % 5.96/1.69 | | (17) ? [v0: $i] : (rp(all_7_11, v0) = 0 & $i(v0)) % 5.96/1.69 | | % 5.96/1.69 | | DELTA: instantiating (17) with fresh symbol all_21_0 gives: % 5.96/1.70 | | (18) rp(all_7_11, all_21_0) = 0 & $i(all_21_0) % 5.96/1.70 | | % 5.96/1.70 | | ALPHA: (18) implies: % 5.96/1.70 | | (19) $i(all_21_0) % 5.96/1.70 | | (20) rp(all_7_11, all_21_0) = 0 % 5.96/1.70 | | % 5.96/1.70 | | BETA: splitting (16) gives: % 5.96/1.70 | | % 5.96/1.70 | | Case 1: % 5.96/1.70 | | | % 5.96/1.70 | | | (21) ! [v0: $i] : ( ~ (rp(all_7_11, v0) = 0) | ~ $i(v0)) % 5.96/1.70 | | | % 5.96/1.70 | | | GROUND_INST: instantiating (21) with all_21_0, simplifying with (19), (20) % 5.96/1.70 | | | gives: % 5.96/1.70 | | | (22) $false % 5.96/1.70 | | | % 5.96/1.70 | | | CLOSE: (22) is inconsistent. % 5.96/1.70 | | | % 5.96/1.70 | | Case 2: % 5.96/1.70 | | | % 5.96/1.70 | | | (23) all_7_6 = 0 & all_7_7 = 0 & ~ (all_7_8 = all_7_9) & rp(all_7_11, % 5.96/1.70 | | | all_7_8) = 0 & rp(all_7_11, all_7_9) = 0 % 5.96/1.70 | | | % 5.96/1.70 | | | ALPHA: (23) implies: % 5.96/1.70 | | | (24) ~ (all_7_8 = all_7_9) % 5.96/1.70 | | | (25) rp(all_7_11, all_7_9) = 0 % 5.96/1.70 | | | (26) rp(all_7_11, all_7_8) = 0 % 5.96/1.70 | | | % 5.96/1.70 | | | GROUND_INST: instantiating (axiom_3) with all_7_11, all_21_0, all_7_9, % 5.96/1.70 | | | simplifying with (8), (9), (15), (19), (20), (25) gives: % 5.96/1.70 | | | (27) all_21_0 = all_7_9 % 5.96/1.70 | | | % 5.96/1.70 | | | GROUND_INST: instantiating (axiom_3) with all_7_11, all_21_0, all_7_8, % 5.96/1.70 | | | simplifying with (8), (10), (15), (19), (20), (26) gives: % 5.96/1.70 | | | (28) all_21_0 = all_7_8 % 5.96/1.70 | | | % 5.96/1.70 | | | COMBINE_EQS: (27), (28) imply: % 5.96/1.70 | | | (29) all_7_8 = all_7_9 % 5.96/1.70 | | | % 5.96/1.70 | | | REDUCE: (24), (29) imply: % 5.96/1.70 | | | (30) $false % 5.96/1.70 | | | % 5.96/1.70 | | | CLOSE: (30) is inconsistent. % 5.96/1.70 | | | % 5.96/1.70 | | End of split % 5.96/1.70 | | % 5.96/1.70 | Case 2: % 5.96/1.70 | | % 5.96/1.70 | | (31) (xsd_string(all_7_5) = all_7_4 & xsd_integer(all_7_5) = all_7_3 & % 5.96/1.70 | | ((all_7_3 = 0 & all_7_4 = 0) | ( ~ (all_7_3 = 0) & ~ (all_7_4 = % 5.96/1.70 | | 0)))) | (cowlThing(all_7_2) = all_7_1 & cowlNothing(all_7_2) % 5.96/1.70 | | = all_7_0 & ( ~ (all_7_1 = 0) | all_7_0 = 0)) % 5.96/1.70 | | % 5.96/1.70 | | BETA: splitting (31) gives: % 5.96/1.70 | | % 5.96/1.70 | | Case 1: % 5.96/1.70 | | | % 5.96/1.70 | | | (32) xsd_string(all_7_5) = all_7_4 & xsd_integer(all_7_5) = all_7_3 & % 5.96/1.70 | | | ((all_7_3 = 0 & all_7_4 = 0) | ( ~ (all_7_3 = 0) & ~ (all_7_4 = % 5.96/1.70 | | | 0))) % 5.96/1.70 | | | % 5.96/1.70 | | | ALPHA: (32) implies: % 5.96/1.70 | | | (33) xsd_integer(all_7_5) = all_7_3 % 5.96/1.70 | | | (34) xsd_string(all_7_5) = all_7_4 % 5.96/1.70 | | | (35) (all_7_3 = 0 & all_7_4 = 0) | ( ~ (all_7_3 = 0) & ~ (all_7_4 = % 5.96/1.70 | | | 0)) % 5.96/1.70 | | | % 5.96/1.70 | | | GROUND_INST: instantiating (4) with all_7_5, all_7_3, simplifying with % 5.96/1.70 | | | (11), (33) gives: % 5.96/1.71 | | | (36) all_7_3 = 0 | xsd_string(all_7_5) = 0 % 5.96/1.71 | | | % 5.96/1.71 | | | BETA: splitting (35) gives: % 5.96/1.71 | | | % 5.96/1.71 | | | Case 1: % 5.96/1.71 | | | | % 5.96/1.71 | | | | (37) all_7_3 = 0 & all_7_4 = 0 % 5.96/1.71 | | | | % 5.96/1.71 | | | | ALPHA: (37) implies: % 5.96/1.71 | | | | (38) all_7_4 = 0 % 5.96/1.71 | | | | (39) all_7_3 = 0 % 5.96/1.71 | | | | % 5.96/1.71 | | | | REDUCE: (34), (38) imply: % 5.96/1.71 | | | | (40) xsd_string(all_7_5) = 0 % 5.96/1.71 | | | | % 5.96/1.71 | | | | REDUCE: (33), (39) imply: % 5.96/1.71 | | | | (41) xsd_integer(all_7_5) = 0 % 5.96/1.71 | | | | % 5.96/1.71 | | | | GROUND_INST: instantiating (3) with all_7_5, simplifying with (11), (40) % 5.96/1.71 | | | | gives: % 5.96/1.71 | | | | (42) ? [v0: int] : ( ~ (v0 = 0) & xsd_integer(all_7_5) = v0) % 5.96/1.71 | | | | % 5.96/1.71 | | | | DELTA: instantiating (42) with fresh symbol all_28_0 gives: % 5.96/1.71 | | | | (43) ~ (all_28_0 = 0) & xsd_integer(all_7_5) = all_28_0 % 5.96/1.71 | | | | % 5.96/1.71 | | | | ALPHA: (43) implies: % 5.96/1.71 | | | | (44) ~ (all_28_0 = 0) % 5.96/1.71 | | | | (45) xsd_integer(all_7_5) = all_28_0 % 5.96/1.71 | | | | % 5.96/1.71 | | | | GROUND_INST: instantiating (5) with 0, all_28_0, all_7_5, simplifying % 5.96/1.71 | | | | with (41), (45) gives: % 5.96/1.71 | | | | (46) all_28_0 = 0 % 5.96/1.71 | | | | % 5.96/1.71 | | | | REDUCE: (44), (46) imply: % 5.96/1.71 | | | | (47) $false % 5.96/1.71 | | | | % 5.96/1.71 | | | | CLOSE: (47) is inconsistent. % 5.96/1.71 | | | | % 5.96/1.71 | | | Case 2: % 5.96/1.71 | | | | % 5.96/1.71 | | | | (48) ~ (all_7_3 = 0) & ~ (all_7_4 = 0) % 5.96/1.71 | | | | % 5.96/1.71 | | | | ALPHA: (48) implies: % 5.96/1.71 | | | | (49) ~ (all_7_4 = 0) % 5.96/1.71 | | | | (50) ~ (all_7_3 = 0) % 5.96/1.71 | | | | % 5.96/1.71 | | | | BETA: splitting (36) gives: % 5.96/1.71 | | | | % 5.96/1.71 | | | | Case 1: % 5.96/1.71 | | | | | % 5.96/1.71 | | | | | (51) xsd_string(all_7_5) = 0 % 5.96/1.71 | | | | | % 5.96/1.71 | | | | | GROUND_INST: instantiating (6) with all_7_4, 0, all_7_5, simplifying % 5.96/1.71 | | | | | with (34), (51) gives: % 5.96/1.71 | | | | | (52) all_7_4 = 0 % 5.96/1.71 | | | | | % 5.96/1.71 | | | | | REDUCE: (49), (52) imply: % 5.96/1.71 | | | | | (53) $false % 5.96/1.71 | | | | | % 5.96/1.71 | | | | | CLOSE: (53) is inconsistent. % 5.96/1.71 | | | | | % 5.96/1.71 | | | | Case 2: % 5.96/1.71 | | | | | % 5.96/1.71 | | | | | (54) all_7_3 = 0 % 5.96/1.71 | | | | | % 5.96/1.71 | | | | | REDUCE: (50), (54) imply: % 5.96/1.71 | | | | | (55) $false % 5.96/1.71 | | | | | % 5.96/1.71 | | | | | CLOSE: (55) is inconsistent. % 5.96/1.71 | | | | | % 5.96/1.71 | | | | End of split % 5.96/1.71 | | | | % 5.96/1.71 | | | End of split % 5.96/1.71 | | | % 5.96/1.71 | | Case 2: % 5.96/1.71 | | | % 5.96/1.71 | | | (56) cowlThing(all_7_2) = all_7_1 & cowlNothing(all_7_2) = all_7_0 & ( % 5.96/1.71 | | | ~ (all_7_1 = 0) | all_7_0 = 0) % 5.96/1.71 | | | % 5.96/1.71 | | | ALPHA: (56) implies: % 5.96/1.71 | | | (57) cowlNothing(all_7_2) = all_7_0 % 5.96/1.71 | | | (58) cowlThing(all_7_2) = all_7_1 % 5.96/1.71 | | | (59) ~ (all_7_1 = 0) | all_7_0 = 0 % 5.96/1.71 | | | % 5.96/1.71 | | | GROUND_INST: instantiating (2) with all_7_2, all_7_1, simplifying with % 5.96/1.71 | | | (12), (58) gives: % 5.96/1.71 | | | (60) all_7_1 = 0 % 5.96/1.71 | | | % 5.96/1.71 | | | BETA: splitting (59) gives: % 5.96/1.71 | | | % 5.96/1.71 | | | Case 1: % 5.96/1.71 | | | | % 5.96/1.71 | | | | (61) ~ (all_7_1 = 0) % 5.96/1.71 | | | | % 5.96/1.71 | | | | REDUCE: (60), (61) imply: % 5.96/1.71 | | | | (62) $false % 5.96/1.71 | | | | % 5.96/1.71 | | | | CLOSE: (62) is inconsistent. % 5.96/1.71 | | | | % 5.96/1.71 | | | Case 2: % 5.96/1.71 | | | | % 5.96/1.71 | | | | (63) all_7_0 = 0 % 5.96/1.71 | | | | % 5.96/1.71 | | | | REDUCE: (57), (63) imply: % 5.96/1.71 | | | | (64) cowlNothing(all_7_2) = 0 % 5.96/1.71 | | | | % 5.96/1.71 | | | | GROUND_INST: instantiating (1) with all_7_2, simplifying with (12), (64) % 6.72/1.71 | | | | gives: % 6.72/1.71 | | | | (65) $false % 6.72/1.71 | | | | % 6.72/1.71 | | | | CLOSE: (65) is inconsistent. % 6.72/1.71 | | | | % 6.72/1.71 | | | End of split % 6.72/1.71 | | | % 6.72/1.71 | | End of split % 6.72/1.71 | | % 6.72/1.71 | End of split % 6.72/1.71 | % 6.72/1.71 End of proof % 6.72/1.72 % SZS output end Proof for theBenchmark % 6.72/1.72 % 6.72/1.72 1107ms %------------------------------------------------------------------------------