%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : KRS097+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 : n002.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:14 EDT 2023 % Result : Unsatisfiable 6.61s 1.71s % Output : Proof 8.61s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : KRS097+1 : TPTP v8.1.2. Released v3.1.0. % 0.07/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.35 % Computer : n002.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 300 % 0.14/0.36 % DateTime : Mon Aug 28 02:46:04 EDT 2023 % 0.14/0.36 % CPUTime : % 0.21/0.63 ________ _____ % 0.21/0.63 ___ __ \_________(_)________________________________ % 0.21/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.63 % 0.21/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.63 (2023-06-19) % 0.21/0.63 % 0.21/0.63 (c) Philipp Rümmer, 2009-2023 % 0.21/0.63 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.63 Amanda Stjerna. % 0.21/0.63 Free software under BSD-3-Clause. % 0.21/0.63 % 0.21/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.63 % 0.21/0.63 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.21/0.65 Running up to 7 provers in parallel. % 0.21/0.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.07/1.12 Prover 1: Preprocessing ... % 3.07/1.12 Prover 4: Preprocessing ... % 3.07/1.16 Prover 3: Preprocessing ... % 3.07/1.16 Prover 5: Preprocessing ... % 3.07/1.16 Prover 0: Preprocessing ... % 3.07/1.16 Prover 6: Preprocessing ... % 3.07/1.16 Prover 2: Preprocessing ... % 4.89/1.54 Prover 2: Proving ... % 4.89/1.54 Prover 5: Proving ... % 6.26/1.60 Prover 6: Proving ... % 6.49/1.63 Prover 1: Constructing countermodel ... % 6.61/1.64 Prover 3: Constructing countermodel ... % 6.61/1.69 Prover 4: Constructing countermodel ... % 6.61/1.71 Prover 5: proved (1053ms) % 6.61/1.71 % 6.61/1.71 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 6.61/1.71 % 6.61/1.71 Prover 3: stopped % 6.61/1.71 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 6.61/1.71 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 6.61/1.71 Prover 6: stopped % 7.21/1.72 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 7.21/1.72 Prover 2: stopped % 7.21/1.72 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 7.21/1.73 Prover 0: Proving ... % 7.21/1.73 Prover 0: stopped % 7.21/1.74 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 7.69/1.79 Prover 1: Found proof (size 23) % 7.69/1.79 Prover 1: proved (1133ms) % 7.69/1.79 Prover 4: stopped % 7.69/1.80 Prover 8: Preprocessing ... % 7.69/1.81 Prover 7: Preprocessing ... % 7.69/1.81 Prover 10: Preprocessing ... % 7.69/1.83 Prover 10: stopped % 7.69/1.83 Prover 7: stopped % 7.69/1.83 Prover 13: Preprocessing ... % 7.69/1.83 Prover 11: Preprocessing ... % 7.69/1.85 Prover 13: stopped % 8.25/1.87 Prover 11: stopped % 8.52/1.91 Prover 8: Warning: ignoring some quantifiers % 8.52/1.92 Prover 8: Constructing countermodel ... % 8.52/1.93 Prover 8: stopped % 8.52/1.93 % 8.52/1.93 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 8.52/1.93 % 8.52/1.93 % SZS output start Proof for theBenchmark % 8.61/1.93 Assumptions after simplification: % 8.61/1.93 --------------------------------- % 8.61/1.94 % 8.61/1.94 (axiom_2) % 8.61/1.97 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cUnsatisfiable(v0) = v1) | ~ % 8.61/1.97 $i(v0) | ? [v2: $i] : ? [v3: $i] : ( ~ (v3 = v2) & rr(v0, v3) = 0 & rr(v0, % 8.61/1.97 v2) = 0 & $i(v3) & $i(v2)) | ! [v2: $i] : ( ~ (rr(v0, v2) = 0) | ~ % 8.61/1.97 $i(v2)) | ! [v2: $i] : ( ~ (cd(v2) = 0) | ~ $i(v2) | ? [v3: int] : ( ~ % 8.61/1.97 (v3 = 0) & rr(v0, v2) = v3)) | ! [v2: $i] : ( ~ (cc(v2) = 0) | ~ % 8.61/1.97 $i(v2) | ? [v3: int] : ( ~ (v3 = 0) & rr(v0, v2) = v3))) & ! [v0: $i] : % 8.61/1.97 ( ~ (cUnsatisfiable(v0) = 0) | ~ $i(v0) | ( ! [v1: $i] : ! [v2: $i] : (v2 = % 8.61/1.97 v1 | ~ (rr(v0, v2) = 0) | ~ (rr(v0, v1) = 0) | ~ $i(v2) | ~ $i(v1)) % 8.61/1.97 & ? [v1: $i] : (rr(v0, v1) = 0 & cd(v1) = 0 & $i(v1)) & ? [v1: $i] : % 8.61/1.97 (rr(v0, v1) = 0 & cc(v1) = 0 & $i(v1)) & ? [v1: $i] : (rr(v0, v1) = 0 & % 8.61/1.97 $i(v1)))) % 8.61/1.97 % 8.61/1.97 (axiom_4) % 8.61/1.97 cUnsatisfiable(i2003_11_14_17_20_21603) = 0 & $i(i2003_11_14_17_20_21603) % 8.61/1.97 % 8.61/1.97 (axiom_6) % 8.61/1.97 ! [v0: $i] : ( ~ (cd(v0) = 0) | ~ $i(v0) | ? [v1: int] : ( ~ (v1 = 0) & % 8.61/1.97 cc(v0) = v1)) % 8.61/1.97 % 8.61/1.97 (function-axioms) % 8.61/1.98 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 8.61/1.98 [v3: $i] : (v1 = v0 | ~ (rtt(v3, v2) = v1) | ~ (rtt(v3, v2) = v0)) & ! [v0: % 8.61/1.98 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 8.61/1.98 : (v1 = v0 | ~ (rt3(v3, v2) = v1) | ~ (rt3(v3, v2) = v0)) & ! [v0: % 8.61/1.98 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 8.61/1.98 : (v1 = v0 | ~ (rt2(v3, v2) = v1) | ~ (rt2(v3, v2) = v0)) & ! [v0: % 8.61/1.98 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 8.61/1.98 : (v1 = v0 | ~ (rt1(v3, v2) = v1) | ~ (rt1(v3, v2) = v0)) & ! [v0: % 8.61/1.98 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 8.61/1.98 : (v1 = v0 | ~ (rr3(v3, v2) = v1) | ~ (rr3(v3, v2) = v0)) & ! [v0: % 8.61/1.98 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 8.61/1.98 : (v1 = v0 | ~ (rr2(v3, v2) = v1) | ~ (rr2(v3, v2) = v0)) & ! [v0: % 8.61/1.98 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 8.61/1.98 : (v1 = v0 | ~ (rr1(v3, v2) = v1) | ~ (rr1(v3, v2) = v0)) & ! [v0: % 8.61/1.98 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 8.61/1.98 : (v1 = v0 | ~ (rr(v3, v2) = v1) | ~ (rr(v3, v2) = v0)) & ! [v0: % 8.61/1.98 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 8.61/1.98 ~ (xsd_string(v2) = v1) | ~ (xsd_string(v2) = v0)) & ! [v0: % 8.61/1.98 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 8.61/1.98 ~ (xsd_integer(v2) = v1) | ~ (xsd_integer(v2) = v0)) & ! [v0: % 8.61/1.98 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 8.61/1.98 ~ (cowlThing(v2) = v1) | ~ (cowlThing(v2) = v0)) & ! [v0: % 8.61/1.98 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 8.61/1.98 ~ (cowlNothing(v2) = v1) | ~ (cowlNothing(v2) = v0)) & ! [v0: % 8.61/1.98 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 8.61/1.98 ~ (ce(v2) = v1) | ~ (ce(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 8.61/1.98 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cd(v2) = v1) | ~ (cd(v2) % 8.61/1.98 = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 8.61/1.98 $i] : (v1 = v0 | ~ (cc(v2) = v1) | ~ (cc(v2) = v0)) & ! [v0: % 8.61/1.98 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 8.61/1.98 ~ (ca(v2) = v1) | ~ (ca(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 8.61/1.98 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cUnsatisfiable(v2) = v1) | % 8.61/1.98 ~ (cUnsatisfiable(v2) = v0)) % 8.61/1.98 % 8.61/1.98 Further assumptions not needed in the proof: % 8.61/1.98 -------------------------------------------- % 8.61/1.98 axiom_0, axiom_1, axiom_10, axiom_11, axiom_12, axiom_13, axiom_3, axiom_5, % 8.61/1.98 axiom_7, axiom_8, axiom_9, cUnsatisfiable_substitution_1, ca_substitution_1, % 8.61/1.98 cc_substitution_1, cd_substitution_1, ce_substitution_1, % 8.61/1.98 cowlNothing_substitution_1, cowlThing_substitution_1, rr1_substitution_1, % 8.61/1.98 rr1_substitution_2, rr2_substitution_1, rr2_substitution_2, rr3_substitution_1, % 8.61/1.98 rr3_substitution_2, rr_substitution_1, rr_substitution_2, rt1_substitution_1, % 8.61/1.98 rt1_substitution_2, rt2_substitution_1, rt2_substitution_2, rt3_substitution_1, % 8.61/1.98 rt3_substitution_2, rtt_substitution_1, rtt_substitution_2, % 8.61/1.98 xsd_integer_substitution_1, xsd_string_substitution_1 % 8.61/1.98 % 8.61/1.98 Those formulas are unsatisfiable: % 8.61/1.98 --------------------------------- % 8.61/1.98 % 8.61/1.98 Begin of proof % 8.61/1.98 | % 8.61/1.98 | ALPHA: (axiom_2) implies: % 8.61/1.98 | (1) ! [v0: $i] : ( ~ (cUnsatisfiable(v0) = 0) | ~ $i(v0) | ( ! [v1: $i] : % 8.61/1.98 | ! [v2: $i] : (v2 = v1 | ~ (rr(v0, v2) = 0) | ~ (rr(v0, v1) = 0) % 8.61/1.98 | | ~ $i(v2) | ~ $i(v1)) & ? [v1: $i] : (rr(v0, v1) = 0 & cd(v1) % 8.61/1.98 | = 0 & $i(v1)) & ? [v1: $i] : (rr(v0, v1) = 0 & cc(v1) = 0 & % 8.61/1.98 | $i(v1)) & ? [v1: $i] : (rr(v0, v1) = 0 & $i(v1)))) % 8.61/1.98 | % 8.61/1.98 | ALPHA: (axiom_4) implies: % 8.61/1.99 | (2) $i(i2003_11_14_17_20_21603) % 8.61/1.99 | (3) cUnsatisfiable(i2003_11_14_17_20_21603) = 0 % 8.61/1.99 | % 8.61/1.99 | ALPHA: (function-axioms) implies: % 8.61/1.99 | (4) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 8.61/1.99 | (v1 = v0 | ~ (cc(v2) = v1) | ~ (cc(v2) = v0)) % 8.61/1.99 | % 8.61/1.99 | GROUND_INST: instantiating (1) with i2003_11_14_17_20_21603, simplifying with % 8.61/1.99 | (2), (3) gives: % 8.61/1.99 | (5) ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ (rr(i2003_11_14_17_20_21603, % 8.61/1.99 | v1) = 0) | ~ (rr(i2003_11_14_17_20_21603, v0) = 0) | ~ $i(v1) | % 8.61/1.99 | ~ $i(v0)) & ? [v0: $i] : (rr(i2003_11_14_17_20_21603, v0) = 0 & % 8.61/1.99 | cd(v0) = 0 & $i(v0)) & ? [v0: $i] : (rr(i2003_11_14_17_20_21603, v0) % 8.61/1.99 | = 0 & cc(v0) = 0 & $i(v0)) & ? [v0: $i] : % 8.61/1.99 | (rr(i2003_11_14_17_20_21603, v0) = 0 & $i(v0)) % 8.61/1.99 | % 8.61/1.99 | ALPHA: (5) implies: % 8.61/1.99 | (6) ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ (rr(i2003_11_14_17_20_21603, % 8.61/1.99 | v1) = 0) | ~ (rr(i2003_11_14_17_20_21603, v0) = 0) | ~ $i(v1) | % 8.61/1.99 | ~ $i(v0)) % 8.61/1.99 | (7) ? [v0: $i] : (rr(i2003_11_14_17_20_21603, v0) = 0 & $i(v0)) % 8.61/1.99 | (8) ? [v0: $i] : (rr(i2003_11_14_17_20_21603, v0) = 0 & cc(v0) = 0 & % 8.61/1.99 | $i(v0)) % 8.61/1.99 | (9) ? [v0: $i] : (rr(i2003_11_14_17_20_21603, v0) = 0 & cd(v0) = 0 & % 8.61/1.99 | $i(v0)) % 8.61/1.99 | % 8.61/1.99 | DELTA: instantiating (7) with fresh symbol all_23_0 gives: % 8.61/1.99 | (10) rr(i2003_11_14_17_20_21603, all_23_0) = 0 & $i(all_23_0) % 8.61/1.99 | % 8.61/1.99 | ALPHA: (10) implies: % 8.61/1.99 | (11) $i(all_23_0) % 8.61/1.99 | (12) rr(i2003_11_14_17_20_21603, all_23_0) = 0 % 8.61/1.99 | % 8.61/1.99 | DELTA: instantiating (8) with fresh symbol all_25_0 gives: % 8.61/1.99 | (13) rr(i2003_11_14_17_20_21603, all_25_0) = 0 & cc(all_25_0) = 0 & % 8.61/1.99 | $i(all_25_0) % 8.61/1.99 | % 8.61/1.99 | ALPHA: (13) implies: % 8.61/1.99 | (14) $i(all_25_0) % 8.61/1.99 | (15) cc(all_25_0) = 0 % 8.61/1.99 | (16) rr(i2003_11_14_17_20_21603, all_25_0) = 0 % 8.61/1.99 | % 8.61/2.00 | DELTA: instantiating (9) with fresh symbol all_27_0 gives: % 8.61/2.00 | (17) rr(i2003_11_14_17_20_21603, all_27_0) = 0 & cd(all_27_0) = 0 & % 8.61/2.00 | $i(all_27_0) % 8.61/2.00 | % 8.61/2.00 | ALPHA: (17) implies: % 8.61/2.00 | (18) $i(all_27_0) % 8.61/2.00 | (19) cd(all_27_0) = 0 % 8.61/2.00 | (20) rr(i2003_11_14_17_20_21603, all_27_0) = 0 % 8.61/2.00 | % 8.61/2.00 | GROUND_INST: instantiating (axiom_6) with all_27_0, simplifying with (18), % 8.61/2.00 | (19) gives: % 8.61/2.00 | (21) ? [v0: int] : ( ~ (v0 = 0) & cc(all_27_0) = v0) % 8.61/2.00 | % 8.61/2.00 | GROUND_INST: instantiating (6) with all_25_0, all_27_0, simplifying with (14), % 8.61/2.00 | (16), (18), (20) gives: % 8.61/2.00 | (22) all_27_0 = all_25_0 % 8.61/2.00 | % 8.61/2.00 | GROUND_INST: instantiating (6) with all_23_0, all_27_0, simplifying with (11), % 8.61/2.00 | (12), (18), (20) gives: % 8.61/2.00 | (23) all_27_0 = all_23_0 % 8.61/2.00 | % 8.61/2.00 | COMBINE_EQS: (22), (23) imply: % 8.61/2.00 | (24) all_25_0 = all_23_0 % 8.61/2.00 | % 8.61/2.00 | SIMP: (24) implies: % 8.61/2.00 | (25) all_25_0 = all_23_0 % 8.61/2.00 | % 8.61/2.00 | DELTA: instantiating (21) with fresh symbol all_35_0 gives: % 8.61/2.00 | (26) ~ (all_35_0 = 0) & cc(all_27_0) = all_35_0 % 8.61/2.00 | % 8.61/2.00 | ALPHA: (26) implies: % 8.61/2.00 | (27) ~ (all_35_0 = 0) % 8.61/2.00 | (28) cc(all_27_0) = all_35_0 % 8.61/2.00 | % 8.61/2.00 | REDUCE: (23), (28) imply: % 8.61/2.00 | (29) cc(all_23_0) = all_35_0 % 8.61/2.00 | % 8.61/2.00 | REDUCE: (15), (25) imply: % 8.61/2.00 | (30) cc(all_23_0) = 0 % 8.61/2.00 | % 8.61/2.00 | GROUND_INST: instantiating (4) with 0, all_35_0, all_23_0, simplifying with % 8.61/2.00 | (29), (30) gives: % 8.61/2.00 | (31) all_35_0 = 0 % 8.61/2.00 | % 8.61/2.00 | REDUCE: (27), (31) imply: % 8.61/2.00 | (32) $false % 8.61/2.00 | % 8.61/2.00 | CLOSE: (32) is inconsistent. % 8.61/2.00 | % 8.61/2.00 End of proof % 8.61/2.00 % SZS output end Proof for theBenchmark % 8.61/2.00 % 8.61/2.00 1367ms %------------------------------------------------------------------------------