%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWX000_1 : TPTP v9.1.0. Released v9.1.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n023.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 : Sun Apr 6 10:08:50 AM UTC 2025 % Result : Theorem 7.80s 1.79s % Output : Proof 12.17s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SWX000_1 : TPTP v9.1.0. Released v9.1.0. % 0.06/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n023.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 300 % 0.13/0.34 % DateTime : Sun Apr 6 03:04:39 EDT 2025 % 0.13/0.34 % CPUTime : % 0.20/0.60 ________ _____ % 0.20/0.60 ___ __ \_________(_)________________________________ % 0.20/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.60 % 0.20/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.60 (2023-06-19) % 0.20/0.60 % 0.20/0.60 (c) Philipp Rümmer, 2009-2023 % 0.20/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.60 Amanda Stjerna. % 0.20/0.60 Free software under BSD-3-Clause. % 0.20/0.60 % 0.20/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.60 % 0.20/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.20/0.62 Running up to 7 provers in parallel. % 0.20/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.21/1.10 Prover 4: Preprocessing ... % 3.21/1.10 Prover 1: Preprocessing ... % 3.43/1.13 Prover 5: Preprocessing ... % 3.43/1.13 Prover 3: Preprocessing ... % 3.43/1.13 Prover 0: Preprocessing ... % 3.43/1.13 Prover 2: Preprocessing ... % 3.43/1.14 Prover 6: Preprocessing ... % 5.67/1.48 Prover 2: Proving ... % 5.67/1.49 Prover 5: Proving ... % 5.67/1.49 Prover 6: Proving ... % 5.67/1.51 Prover 3: Constructing countermodel ... % 5.67/1.52 Prover 1: Constructing countermodel ... % 6.32/1.53 Prover 4: Constructing countermodel ... % 6.32/1.54 Prover 0: Proving ... % 7.80/1.78 Prover 3: gave up % 7.80/1.78 Prover 1: gave up % 7.80/1.79 Prover 5: proved (1155ms) % 7.80/1.79 % 7.80/1.79 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 7.80/1.79 % 7.80/1.79 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 7.80/1.79 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 7.80/1.79 Prover 0: stopped % 7.80/1.80 Prover 6: stopped % 7.80/1.80 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 7.80/1.80 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 7.80/1.80 Prover 2: stopped % 7.80/1.80 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 7.80/1.80 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 8.75/1.89 Prover 8: Preprocessing ... % 8.75/1.90 Prover 10: Preprocessing ... % 8.75/1.91 Prover 7: Preprocessing ... % 8.75/1.91 Prover 11: Preprocessing ... % 8.75/1.91 Prover 13: Preprocessing ... % 8.75/1.92 Prover 16: Preprocessing ... % 9.46/1.99 Prover 7: Warning: ignoring some quantifiers % 9.46/1.99 Prover 7: Constructing countermodel ... % 9.46/2.00 Prover 4: gave up % 9.46/2.00 Prover 19: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=-1780594085 % 9.46/2.00 Prover 10: Warning: ignoring some quantifiers % 9.46/2.01 Prover 13: Warning: ignoring some quantifiers % 9.79/2.02 Prover 13: Constructing countermodel ... % 9.79/2.02 Prover 10: Constructing countermodel ... % 9.79/2.03 Prover 19: Preprocessing ... % 9.79/2.04 Prover 16: Warning: ignoring some quantifiers % 9.79/2.04 Prover 16: Constructing countermodel ... % 9.96/2.06 Prover 8: Warning: ignoring some quantifiers % 9.96/2.07 Prover 8: Constructing countermodel ... % 9.96/2.09 Prover 11: Constructing countermodel ... % 10.56/2.12 Prover 19: Warning: ignoring some quantifiers % 10.56/2.14 Prover 19: Constructing countermodel ... % 11.62/2.26 Prover 8: gave up % 11.78/2.30 Prover 7: Found proof (size 36) % 11.78/2.30 Prover 7: proved (509ms) % 11.78/2.30 Prover 16: stopped % 11.78/2.30 Prover 11: stopped % 11.78/2.30 Prover 19: stopped % 11.78/2.30 Prover 13: stopped % 11.78/2.31 Prover 10: stopped % 11.78/2.31 % 11.78/2.31 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 11.78/2.31 % 11.78/2.31 % SZS output start Proof for theBenchmark % 11.78/2.32 Assumptions after simplification: % 11.78/2.32 --------------------------------- % 11.78/2.32 % 11.78/2.32 (f__integer__def_ax) % 12.06/2.34 ! [v0: int] : ! [v1: general] : ! [v2: general] : (v2 = v1 | ~ % 12.06/2.34 (f__integer__(v0) = v2) | ~ (f__integer__(v0) = v1)) & ! [v0: int] : ! % 12.06/2.34 [v1: int] : ! [v2: general] : (v1 = v0 | ~ (f__integer__(v1) = v2) | ~ % 12.06/2.34 (f__integer__(v0) = v2)) % 12.06/2.34 % 12.06/2.34 (formula_1_left_0) % 12.06/2.34 ? [v0: general] : ? [v1: general] : (f__integer__(5) = v1 & f__integer__(3) % 12.06/2.34 = v0 & general(v1) & general(v0) & ! [v2: general] : ( ~ general(v2) | ~ % 12.06/2.34 p__greater__(v2, v0) | ~ p__less__(v2, v1) | tp(v2)) & ! [v2: general] : % 12.06/2.34 ( ~ general(v2) | ~ p__greater__(v2, v0) | ~ p__less__(v2, v1) | hp(v2))) % 12.06/2.34 % 12.06/2.34 (formula_2_right_0) % 12.06/2.34 ? [v0: general] : (f__integer__(4) = v0 & general(v0) & ( ~ tp(v0) | ~ % 12.06/2.34 hp(v0))) % 12.06/2.34 % 12.17/2.34 (numeral_ordering_ax) % 12.17/2.34 ! [v0: int] : ! [v1: int] : ! [v2: general] : ! [v3: general] : ( ~ % 12.17/2.34 ($lesseq(1, $difference(v0, v1))) | ~ (f__integer__(v1) = v3) | ~ % 12.17/2.34 (f__integer__(v0) = v2) | ~ p__less_equal__(v2, v3)) & ! [v0: int] : ! % 12.17/2.34 [v1: int] : ! [v2: general] : ! [v3: general] : ( ~ ($lesseq(v0, v1)) | ~ % 12.17/2.34 (f__integer__(v1) = v3) | ~ (f__integer__(v0) = v2) | p__less_equal__(v2, % 12.17/2.34 v3)) % 12.17/2.34 % 12.17/2.34 (p__greater__def_ax) % 12.17/2.34 ! [v0: general] : ! [v1: general] : (v1 = v0 | ~ general(v1) | ~ % 12.17/2.34 general(v0) | ~ p__less_equal__(v1, v0) | p__greater__(v0, v1)) & ! [v0: % 12.17/2.34 general] : ! [v1: general] : ( ~ general(v1) | ~ general(v0) | ~ % 12.17/2.34 p__greater__(v0, v1) | p__less_equal__(v1, v0)) & ! [v0: general] : ( ~ % 12.17/2.34 general(v0) | ~ p__greater__(v0, v0)) % 12.17/2.34 % 12.17/2.34 (p__less__def_ax) % 12.17/2.35 ! [v0: general] : ! [v1: general] : (v1 = v0 | ~ general(v1) | ~ % 12.17/2.35 general(v0) | ~ p__less_equal__(v0, v1) | p__less__(v0, v1)) & ! [v0: % 12.17/2.35 general] : ! [v1: general] : ( ~ general(v1) | ~ general(v0) | ~ % 12.17/2.35 p__less__(v0, v1) | p__less_equal__(v0, v1)) & ! [v0: general] : ( ~ % 12.17/2.35 general(v0) | ~ p__less__(v0, v0)) % 12.17/2.35 % 12.17/2.35 Further assumptions not needed in the proof: % 12.17/2.35 -------------------------------------------- % 12.17/2.35 antisymmetric_ordering_ax, f__symbolic__def_ax, formula_0_transition_axiom_0, % 12.17/2.35 general_universe_ax, maximal_element_ax, minimal_element_ax, % 12.17/2.35 numerals_less_than_symbols_ax, p__greater_equal__def_ax, p__is_integer__def_ax, % 12.17/2.35 p__is_symbolic__def_ax, strongly_connected_ordering_ax, transitive_ordering_ax % 12.17/2.35 % 12.17/2.35 Those formulas are unsatisfiable: % 12.17/2.35 --------------------------------- % 12.17/2.35 % 12.17/2.35 Begin of proof % 12.17/2.35 | % 12.17/2.35 | ALPHA: (f__integer__def_ax) implies: % 12.17/2.35 | (1) ! [v0: int] : ! [v1: int] : ! [v2: general] : (v1 = v0 | ~ % 12.17/2.35 | (f__integer__(v1) = v2) | ~ (f__integer__(v0) = v2)) % 12.17/2.35 | % 12.17/2.35 | ALPHA: (numeral_ordering_ax) implies: % 12.17/2.35 | (2) ! [v0: int] : ! [v1: int] : ! [v2: general] : ! [v3: general] : ( ~ % 12.17/2.35 | ($lesseq(v0, v1)) | ~ (f__integer__(v1) = v3) | ~ (f__integer__(v0) % 12.17/2.35 | = v2) | p__less_equal__(v2, v3)) % 12.17/2.35 | % 12.17/2.35 | ALPHA: (p__less__def_ax) implies: % 12.17/2.35 | (3) ! [v0: general] : ! [v1: general] : (v1 = v0 | ~ general(v1) | ~ % 12.17/2.35 | general(v0) | ~ p__less_equal__(v0, v1) | p__less__(v0, v1)) % 12.17/2.35 | % 12.17/2.35 | ALPHA: (p__greater__def_ax) implies: % 12.17/2.35 | (4) ! [v0: general] : ! [v1: general] : (v1 = v0 | ~ general(v1) | ~ % 12.17/2.35 | general(v0) | ~ p__less_equal__(v1, v0) | p__greater__(v0, v1)) % 12.17/2.35 | % 12.17/2.35 | DELTA: instantiating (formula_2_right_0) with fresh symbol all_23_0 gives: % 12.17/2.35 | (5) f__integer__(4) = all_23_0 & general(all_23_0) & ( ~ tp(all_23_0) | ~ % 12.17/2.35 | hp(all_23_0)) % 12.17/2.35 | % 12.17/2.35 | ALPHA: (5) implies: % 12.17/2.35 | (6) general(all_23_0) % 12.17/2.35 | (7) f__integer__(4) = all_23_0 % 12.17/2.35 | (8) ~ tp(all_23_0) | ~ hp(all_23_0) % 12.17/2.35 | % 12.17/2.35 | DELTA: instantiating (formula_1_left_0) with fresh symbols all_26_0, all_26_1 % 12.17/2.35 | gives: % 12.17/2.35 | (9) f__integer__(5) = all_26_0 & f__integer__(3) = all_26_1 & % 12.17/2.35 | general(all_26_0) & general(all_26_1) & ! [v0: general] : ( ~ % 12.17/2.35 | general(v0) | ~ p__greater__(v0, all_26_1) | ~ p__less__(v0, % 12.17/2.35 | all_26_0) | tp(v0)) & ! [v0: general] : ( ~ general(v0) | ~ % 12.17/2.35 | p__greater__(v0, all_26_1) | ~ p__less__(v0, all_26_0) | hp(v0)) % 12.17/2.35 | % 12.17/2.35 | ALPHA: (9) implies: % 12.17/2.36 | (10) general(all_26_1) % 12.17/2.36 | (11) general(all_26_0) % 12.17/2.36 | (12) f__integer__(3) = all_26_1 % 12.17/2.36 | (13) f__integer__(5) = all_26_0 % 12.17/2.36 | (14) ! [v0: general] : ( ~ general(v0) | ~ p__greater__(v0, all_26_1) | % 12.17/2.36 | ~ p__less__(v0, all_26_0) | hp(v0)) % 12.17/2.36 | (15) ! [v0: general] : ( ~ general(v0) | ~ p__greater__(v0, all_26_1) | % 12.17/2.36 | ~ p__less__(v0, all_26_0) | tp(v0)) % 12.17/2.36 | % 12.17/2.36 | GROUND_INST: instantiating (1) with 3, 4, all_23_0, simplifying with (7) % 12.17/2.36 | gives: % 12.17/2.36 | (16) ~ (f__integer__(3) = all_23_0) % 12.17/2.36 | % 12.17/2.36 | GROUND_INST: instantiating (1) with 4, 5, all_23_0, simplifying with (7) % 12.17/2.36 | gives: % 12.17/2.36 | (17) ~ (f__integer__(5) = all_23_0) % 12.17/2.36 | % 12.17/2.36 | PRED_UNIFY: (12), (16) imply: % 12.17/2.36 | (18) ~ (all_26_1 = all_23_0) % 12.17/2.36 | % 12.17/2.36 | PRED_UNIFY: (13), (17) imply: % 12.17/2.36 | (19) ~ (all_26_0 = all_23_0) % 12.17/2.36 | % 12.17/2.36 | GROUND_INST: instantiating (2) with 3, 4, all_26_1, all_23_0, simplifying with % 12.17/2.36 | (7), (12) gives: % 12.17/2.36 | (20) p__less_equal__(all_26_1, all_23_0) % 12.17/2.36 | % 12.17/2.36 | GROUND_INST: instantiating (2) with 4, 5, all_23_0, all_26_0, simplifying with % 12.17/2.36 | (7), (13) gives: % 12.17/2.36 | (21) p__less_equal__(all_23_0, all_26_0) % 12.17/2.36 | % 12.17/2.36 | GROUND_INST: instantiating (4) with all_26_0, all_23_0, simplifying with (6), % 12.17/2.36 | (11), (21) gives: % 12.17/2.36 | (22) all_26_0 = all_23_0 | p__greater__(all_26_0, all_23_0) % 12.17/2.36 | % 12.17/2.36 | GROUND_INST: instantiating (3) with all_23_0, all_26_0, simplifying with (6), % 12.17/2.36 | (11), (21) gives: % 12.17/2.36 | (23) all_26_0 = all_23_0 | p__less__(all_23_0, all_26_0) % 12.17/2.36 | % 12.17/2.36 | GROUND_INST: instantiating (4) with all_23_0, all_26_1, simplifying with (6), % 12.17/2.36 | (10), (20) gives: % 12.17/2.36 | (24) all_26_1 = all_23_0 | p__greater__(all_23_0, all_26_1) % 12.17/2.36 | % 12.17/2.36 | BETA: splitting (24) gives: % 12.17/2.36 | % 12.17/2.36 | Case 1: % 12.17/2.36 | | % 12.17/2.36 | | (25) p__greater__(all_23_0, all_26_1) % 12.17/2.36 | | % 12.17/2.36 | | BETA: splitting (23) gives: % 12.17/2.36 | | % 12.17/2.36 | | Case 1: % 12.17/2.36 | | | % 12.17/2.36 | | | (26) p__less__(all_23_0, all_26_0) % 12.17/2.36 | | | % 12.17/2.36 | | | BETA: splitting (22) gives: % 12.17/2.36 | | | % 12.17/2.36 | | | Case 1: % 12.17/2.36 | | | | % 12.17/2.36 | | | | % 12.17/2.36 | | | | GROUND_INST: instantiating (15) with all_23_0, simplifying with (6), % 12.17/2.36 | | | | (25), (26) gives: % 12.17/2.36 | | | | (27) tp(all_23_0) % 12.17/2.36 | | | | % 12.17/2.36 | | | | GROUND_INST: instantiating (14) with all_23_0, simplifying with (6), % 12.17/2.36 | | | | (25), (26) gives: % 12.17/2.36 | | | | (28) hp(all_23_0) % 12.17/2.36 | | | | % 12.17/2.36 | | | | BETA: splitting (8) gives: % 12.17/2.36 | | | | % 12.17/2.36 | | | | Case 1: % 12.17/2.36 | | | | | % 12.17/2.36 | | | | | (29) ~ tp(all_23_0) % 12.17/2.36 | | | | | % 12.17/2.36 | | | | | PRED_UNIFY: (27), (29) imply: % 12.17/2.36 | | | | | (30) $false % 12.17/2.36 | | | | | % 12.17/2.36 | | | | | CLOSE: (30) is inconsistent. % 12.17/2.36 | | | | | % 12.17/2.36 | | | | Case 2: % 12.17/2.36 | | | | | % 12.17/2.36 | | | | | (31) ~ hp(all_23_0) % 12.17/2.36 | | | | | % 12.17/2.36 | | | | | PRED_UNIFY: (28), (31) imply: % 12.17/2.36 | | | | | (32) $false % 12.17/2.36 | | | | | % 12.17/2.36 | | | | | CLOSE: (32) is inconsistent. % 12.17/2.36 | | | | | % 12.17/2.36 | | | | End of split % 12.17/2.36 | | | | % 12.17/2.36 | | | Case 2: % 12.17/2.36 | | | | % 12.17/2.37 | | | | (33) all_26_0 = all_23_0 % 12.17/2.37 | | | | % 12.17/2.37 | | | | REDUCE: (19), (33) imply: % 12.17/2.37 | | | | (34) $false % 12.17/2.37 | | | | % 12.17/2.37 | | | | CLOSE: (34) is inconsistent. % 12.17/2.37 | | | | % 12.17/2.37 | | | End of split % 12.17/2.37 | | | % 12.17/2.37 | | Case 2: % 12.17/2.37 | | | % 12.17/2.37 | | | (35) all_26_0 = all_23_0 % 12.17/2.37 | | | % 12.17/2.37 | | | REDUCE: (19), (35) imply: % 12.17/2.37 | | | (36) $false % 12.17/2.37 | | | % 12.17/2.37 | | | CLOSE: (36) is inconsistent. % 12.17/2.37 | | | % 12.17/2.37 | | End of split % 12.17/2.37 | | % 12.17/2.37 | Case 2: % 12.17/2.37 | | % 12.17/2.37 | | (37) all_26_1 = all_23_0 % 12.17/2.37 | | % 12.17/2.37 | | REDUCE: (18), (37) imply: % 12.17/2.37 | | (38) $false % 12.17/2.37 | | % 12.17/2.37 | | CLOSE: (38) is inconsistent. % 12.17/2.37 | | % 12.17/2.37 | End of split % 12.17/2.37 | % 12.17/2.37 End of proof % 12.17/2.37 % SZS output end Proof for theBenchmark % 12.17/2.37 % 12.17/2.37 1762ms %------------------------------------------------------------------------------