%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : KRS067+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 : n026.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 3.91s 1.31s % Output : Proof 4.85s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : KRS067+1 : TPTP v8.1.2. Released v3.1.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.34 % Computer : n026.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 300 % 0.12/0.34 % DateTime : Mon Aug 28 02:37:04 EDT 2023 % 0.12/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.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.19/0.62 Running up to 7 provers in parallel. % 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 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 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 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 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 % 1.98/0.97 Prover 4: Preprocessing ... % 1.98/0.97 Prover 1: Preprocessing ... % 1.98/1.02 Prover 3: Preprocessing ... % 1.98/1.02 Prover 2: Preprocessing ... % 1.98/1.02 Prover 5: Preprocessing ... % 1.98/1.02 Prover 0: Preprocessing ... % 1.98/1.02 Prover 6: Preprocessing ... % 3.44/1.19 Prover 6: Constructing countermodel ... % 3.44/1.20 Prover 1: Constructing countermodel ... % 3.44/1.20 Prover 3: Constructing countermodel ... % 3.44/1.20 Prover 5: Proving ... % 3.44/1.20 Prover 2: Proving ... % 3.91/1.25 Prover 4: Constructing countermodel ... % 3.91/1.30 Prover 5: proved (664ms) % 3.91/1.31 % 3.91/1.31 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 3.91/1.31 % 3.91/1.31 Prover 3: stopped % 3.91/1.32 Prover 6: stopped % 3.91/1.32 Prover 2: stopped % 4.46/1.34 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 4.46/1.34 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 4.46/1.34 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 4.46/1.34 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 4.46/1.34 Prover 7: Preprocessing ... % 4.46/1.34 Prover 10: Preprocessing ... % 4.46/1.34 Prover 0: Proving ... % 4.46/1.35 Prover 8: Preprocessing ... % 4.46/1.35 Prover 0: stopped % 4.46/1.36 Prover 11: Preprocessing ... % 4.46/1.36 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 4.46/1.37 Prover 7: Warning: ignoring some quantifiers % 4.46/1.37 Prover 7: Constructing countermodel ... % 4.85/1.39 Prover 10: Warning: ignoring some quantifiers % 4.85/1.39 Prover 10: Constructing countermodel ... % 4.85/1.41 Prover 13: Preprocessing ... % 4.85/1.42 Prover 8: Warning: ignoring some quantifiers % 4.85/1.43 Prover 1: Found proof (size 33) % 4.85/1.43 Prover 1: proved (803ms) % 4.85/1.43 Prover 8: Constructing countermodel ... % 4.85/1.43 Prover 13: Warning: ignoring some quantifiers % 4.85/1.43 Prover 7: stopped % 4.85/1.43 Prover 4: stopped % 4.85/1.43 Prover 10: stopped % 4.85/1.43 Prover 13: Constructing countermodel ... % 4.85/1.44 Prover 8: stopped % 4.85/1.44 Prover 13: stopped % 4.85/1.49 Prover 11: Constructing countermodel ... % 4.85/1.50 Prover 11: stopped % 4.85/1.50 % 4.85/1.50 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 4.85/1.50 % 4.85/1.50 % SZS output start Proof for theBenchmark % 4.85/1.51 Assumptions after simplification: % 4.85/1.51 --------------------------------- % 4.85/1.51 % 4.85/1.51 (axiom_2) % 4.85/1.54 ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (cUnsatisfiable(v0) = v1) | ~ % 4.85/1.54 $i(v0) | ? [v2: any] : ? [v3: any] : ? [v4: any] : (cc(v0) = v2 & cb(v0) % 4.85/1.54 = v3 & ca(v0) = v4 & ( ~ (v4 = 0) | ~ (v2 = 0)) & ( ~ (v3 = 0) | ( ~ (v4 % 4.85/1.54 = 0) & ~ (v2 = 0))))) & ! [v0: $i] : ( ~ (cUnsatisfiable(v0) = 0) % 4.85/1.54 | ~ $i(v0) | ? [v1: any] : ? [v2: any] : ? [v3: any] : (cc(v0) = v1 & % 4.85/1.54 cb(v0) = v2 & ca(v0) = v3 & ((v3 = 0 & v1 = 0) | (v2 = 0 & (v3 = 0 | v1 = % 4.85/1.54 0))))) % 4.85/1.54 % 4.85/1.54 (axiom_3) % 4.85/1.55 ! [v0: $i] : ( ~ (ca(v0) = 0) | ~ $i(v0) | ? [v1: int] : ? [v2: int] : ( ~ % 4.85/1.55 (v2 = 0) & ~ (v1 = 0) & cc(v0) = v1 & cb(v0) = v2)) % 4.85/1.55 % 4.85/1.55 (axiom_4) % 4.85/1.55 ! [v0: $i] : ( ~ (cc(v0) = 0) | ~ $i(v0) | ? [v1: int] : ( ~ (v1 = 0) & % 4.85/1.55 cb(v0) = v1)) % 4.85/1.55 % 4.85/1.55 (axiom_5) % 4.85/1.55 cUnsatisfiable(i2003_11_14_17_18_1956) = 0 & $i(i2003_11_14_17_18_1956) % 4.85/1.55 % 4.85/1.55 (function-axioms) % 4.85/1.55 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = % 4.85/1.55 v0 | ~ (cUnsatisfiable(v2) = v1) | ~ (cUnsatisfiable(v2) = v0)) & ! [v0: % 4.85/1.55 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 4.85/1.56 ~ (cc(v2) = v1) | ~ (cc(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 4.85/1.56 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (cb(v2) = v1) | ~ (cb(v2) % 4.85/1.56 = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 4.85/1.56 $i] : (v1 = v0 | ~ (ca(v2) = v1) | ~ (ca(v2) = v0)) & ! [v0: % 4.85/1.56 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 4.85/1.56 ~ (xsd_string(v2) = v1) | ~ (xsd_string(v2) = v0)) & ! [v0: % 4.85/1.56 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 4.85/1.56 ~ (xsd_integer(v2) = v1) | ~ (xsd_integer(v2) = v0)) & ! [v0: % 4.85/1.56 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 4.85/1.56 ~ (cowlNothing(v2) = v1) | ~ (cowlNothing(v2) = v0)) & ! [v0: % 4.85/1.56 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 4.85/1.56 ~ (cowlThing(v2) = v1) | ~ (cowlThing(v2) = v0)) % 4.85/1.56 % 4.85/1.56 Further assumptions not needed in the proof: % 4.85/1.56 -------------------------------------------- % 4.85/1.56 axiom_0, axiom_1 % 4.85/1.56 % 4.85/1.56 Those formulas are unsatisfiable: % 4.85/1.56 --------------------------------- % 4.85/1.56 % 4.85/1.56 Begin of proof % 4.85/1.56 | % 4.85/1.56 | ALPHA: (axiom_2) implies: % 4.85/1.56 | (1) ! [v0: $i] : ( ~ (cUnsatisfiable(v0) = 0) | ~ $i(v0) | ? [v1: any] : % 4.85/1.56 | ? [v2: any] : ? [v3: any] : (cc(v0) = v1 & cb(v0) = v2 & ca(v0) = % 4.85/1.56 | v3 & ((v3 = 0 & v1 = 0) | (v2 = 0 & (v3 = 0 | v1 = 0))))) % 4.85/1.56 | % 4.85/1.56 | ALPHA: (axiom_5) implies: % 4.85/1.56 | (2) $i(i2003_11_14_17_18_1956) % 4.85/1.56 | (3) cUnsatisfiable(i2003_11_14_17_18_1956) = 0 % 4.85/1.56 | % 4.85/1.56 | ALPHA: (function-axioms) implies: % 4.85/1.56 | (4) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 4.85/1.56 | (v1 = v0 | ~ (cb(v2) = v1) | ~ (cb(v2) = v0)) % 4.85/1.56 | (5) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 4.85/1.56 | (v1 = v0 | ~ (cc(v2) = v1) | ~ (cc(v2) = v0)) % 4.85/1.56 | % 4.85/1.57 | GROUND_INST: instantiating (1) with i2003_11_14_17_18_1956, simplifying with % 4.85/1.57 | (2), (3) gives: % 4.85/1.57 | (6) ? [v0: any] : ? [v1: any] : ? [v2: any] : % 4.85/1.57 | (cc(i2003_11_14_17_18_1956) = v0 & cb(i2003_11_14_17_18_1956) = v1 & % 4.85/1.57 | ca(i2003_11_14_17_18_1956) = v2 & ((v2 = 0 & v0 = 0) | (v1 = 0 & (v2 % 4.85/1.57 | = 0 | v0 = 0)))) % 4.85/1.57 | % 4.85/1.57 | DELTA: instantiating (6) with fresh symbols all_14_0, all_14_1, all_14_2 % 4.85/1.57 | gives: % 4.85/1.57 | (7) cc(i2003_11_14_17_18_1956) = all_14_2 & cb(i2003_11_14_17_18_1956) = % 4.85/1.57 | all_14_1 & ca(i2003_11_14_17_18_1956) = all_14_0 & ((all_14_0 = 0 & % 4.85/1.57 | all_14_2 = 0) | (all_14_1 = 0 & (all_14_0 = 0 | all_14_2 = 0))) % 4.85/1.57 | % 4.85/1.57 | ALPHA: (7) implies: % 4.85/1.57 | (8) ca(i2003_11_14_17_18_1956) = all_14_0 % 4.85/1.57 | (9) cb(i2003_11_14_17_18_1956) = all_14_1 % 4.85/1.57 | (10) cc(i2003_11_14_17_18_1956) = all_14_2 % 4.85/1.57 | (11) (all_14_0 = 0 & all_14_2 = 0) | (all_14_1 = 0 & (all_14_0 = 0 | % 4.85/1.57 | all_14_2 = 0)) % 4.85/1.57 | % 4.85/1.57 | BETA: splitting (11) gives: % 4.85/1.57 | % 4.85/1.57 | Case 1: % 4.85/1.57 | | % 4.85/1.57 | | (12) all_14_0 = 0 & all_14_2 = 0 % 4.85/1.57 | | % 4.85/1.57 | | ALPHA: (12) implies: % 4.85/1.57 | | (13) all_14_2 = 0 % 4.85/1.57 | | (14) all_14_0 = 0 % 4.85/1.57 | | % 4.85/1.57 | | REDUCE: (10), (13) imply: % 4.85/1.57 | | (15) cc(i2003_11_14_17_18_1956) = 0 % 4.85/1.57 | | % 4.85/1.57 | | REDUCE: (8), (14) imply: % 4.85/1.57 | | (16) ca(i2003_11_14_17_18_1956) = 0 % 4.85/1.57 | | % 4.85/1.57 | | GROUND_INST: instantiating (axiom_3) with i2003_11_14_17_18_1956, % 4.85/1.57 | | simplifying with (2), (16) gives: % 4.85/1.58 | | (17) ? [v0: int] : ? [v1: int] : ( ~ (v1 = 0) & ~ (v0 = 0) & % 4.85/1.58 | | cc(i2003_11_14_17_18_1956) = v0 & cb(i2003_11_14_17_18_1956) = v1) % 4.85/1.58 | | % 4.85/1.58 | | DELTA: instantiating (17) with fresh symbols all_30_0, all_30_1 gives: % 4.85/1.58 | | (18) ~ (all_30_0 = 0) & ~ (all_30_1 = 0) & cc(i2003_11_14_17_18_1956) = % 4.85/1.58 | | all_30_1 & cb(i2003_11_14_17_18_1956) = all_30_0 % 4.85/1.58 | | % 4.85/1.58 | | ALPHA: (18) implies: % 4.85/1.58 | | (19) ~ (all_30_1 = 0) % 4.85/1.58 | | (20) cc(i2003_11_14_17_18_1956) = all_30_1 % 4.85/1.58 | | % 4.85/1.58 | | GROUND_INST: instantiating (5) with 0, all_30_1, i2003_11_14_17_18_1956, % 4.85/1.58 | | simplifying with (15), (20) gives: % 4.85/1.58 | | (21) all_30_1 = 0 % 4.85/1.58 | | % 4.85/1.58 | | REDUCE: (19), (21) imply: % 4.85/1.58 | | (22) $false % 4.85/1.58 | | % 4.85/1.58 | | CLOSE: (22) is inconsistent. % 4.85/1.58 | | % 4.85/1.58 | Case 2: % 4.85/1.58 | | % 4.85/1.58 | | (23) all_14_1 = 0 & (all_14_0 = 0 | all_14_2 = 0) % 4.85/1.58 | | % 4.85/1.58 | | ALPHA: (23) implies: % 4.85/1.58 | | (24) all_14_1 = 0 % 4.85/1.58 | | (25) all_14_0 = 0 | all_14_2 = 0 % 4.85/1.58 | | % 4.85/1.58 | | REDUCE: (9), (24) imply: % 4.85/1.58 | | (26) cb(i2003_11_14_17_18_1956) = 0 % 4.85/1.58 | | % 4.85/1.58 | | BETA: splitting (25) gives: % 4.85/1.58 | | % 4.85/1.58 | | Case 1: % 4.85/1.58 | | | % 4.85/1.58 | | | (27) all_14_0 = 0 % 4.85/1.58 | | | % 4.85/1.58 | | | REDUCE: (8), (27) imply: % 4.85/1.58 | | | (28) ca(i2003_11_14_17_18_1956) = 0 % 4.85/1.58 | | | % 4.85/1.58 | | | GROUND_INST: instantiating (axiom_3) with i2003_11_14_17_18_1956, % 4.85/1.58 | | | simplifying with (2), (28) gives: % 4.85/1.58 | | | (29) ? [v0: int] : ? [v1: int] : ( ~ (v1 = 0) & ~ (v0 = 0) & % 4.85/1.58 | | | cc(i2003_11_14_17_18_1956) = v0 & cb(i2003_11_14_17_18_1956) = % 4.85/1.58 | | | v1) % 4.85/1.58 | | | % 4.85/1.58 | | | DELTA: instantiating (29) with fresh symbols all_35_0, all_35_1 gives: % 4.85/1.58 | | | (30) ~ (all_35_0 = 0) & ~ (all_35_1 = 0) & cc(i2003_11_14_17_18_1956) % 4.85/1.58 | | | = all_35_1 & cb(i2003_11_14_17_18_1956) = all_35_0 % 4.85/1.58 | | | % 4.85/1.58 | | | ALPHA: (30) implies: % 4.85/1.58 | | | (31) ~ (all_35_0 = 0) % 4.85/1.58 | | | (32) cb(i2003_11_14_17_18_1956) = all_35_0 % 4.85/1.58 | | | % 4.85/1.58 | | | GROUND_INST: instantiating (4) with 0, all_35_0, i2003_11_14_17_18_1956, % 4.85/1.58 | | | simplifying with (26), (32) gives: % 4.85/1.58 | | | (33) all_35_0 = 0 % 4.85/1.58 | | | % 4.85/1.58 | | | REDUCE: (31), (33) imply: % 4.85/1.58 | | | (34) $false % 4.85/1.58 | | | % 4.85/1.58 | | | CLOSE: (34) is inconsistent. % 4.85/1.58 | | | % 4.85/1.58 | | Case 2: % 4.85/1.58 | | | % 4.85/1.58 | | | (35) all_14_2 = 0 % 4.85/1.58 | | | % 4.85/1.59 | | | REDUCE: (10), (35) imply: % 4.85/1.59 | | | (36) cc(i2003_11_14_17_18_1956) = 0 % 4.85/1.59 | | | % 4.85/1.59 | | | GROUND_INST: instantiating (axiom_4) with i2003_11_14_17_18_1956, % 4.85/1.59 | | | simplifying with (2), (36) gives: % 4.85/1.59 | | | (37) ? [v0: int] : ( ~ (v0 = 0) & cb(i2003_11_14_17_18_1956) = v0) % 4.85/1.59 | | | % 4.85/1.59 | | | DELTA: instantiating (37) with fresh symbol all_35_0 gives: % 4.85/1.59 | | | (38) ~ (all_35_0 = 0) & cb(i2003_11_14_17_18_1956) = all_35_0 % 4.85/1.59 | | | % 4.85/1.59 | | | ALPHA: (38) implies: % 4.85/1.59 | | | (39) ~ (all_35_0 = 0) % 4.85/1.59 | | | (40) cb(i2003_11_14_17_18_1956) = all_35_0 % 4.85/1.59 | | | % 4.85/1.59 | | | GROUND_INST: instantiating (4) with 0, all_35_0, i2003_11_14_17_18_1956, % 4.85/1.59 | | | simplifying with (26), (40) gives: % 4.85/1.59 | | | (41) all_35_0 = 0 % 4.85/1.59 | | | % 4.85/1.59 | | | REDUCE: (39), (41) imply: % 4.85/1.59 | | | (42) $false % 4.85/1.59 | | | % 4.85/1.59 | | | CLOSE: (42) is inconsistent. % 4.85/1.59 | | | % 4.85/1.59 | | End of split % 4.85/1.59 | | % 4.85/1.59 | End of split % 4.85/1.59 | % 4.85/1.59 End of proof % 4.85/1.59 % SZS output end Proof for theBenchmark % 4.85/1.59 % 4.85/1.59 983ms %------------------------------------------------------------------------------