%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : GEO209+3 : TPTP v8.1.2. Released v4.0.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n003.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 : Wed Aug 30 23:22:20 EDT 2023 % Result : Theorem 7.55s 1.84s % Output : Proof 10.10s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : GEO209+3 : TPTP v8.1.2. Released v4.0.0. % 0.11/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n003.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 : Tue Aug 29 23:35:26 EDT 2023 % 0.13/0.35 % CPUTime : % 0.21/0.61 ________ _____ % 0.21/0.61 ___ __ \_________(_)________________________________ % 0.21/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.21/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.21/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.21/0.61 % 0.21/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.21/0.61 (2023-06-19) % 0.21/0.61 % 0.21/0.61 (c) Philipp Rümmer, 2009-2023 % 0.21/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.21/0.61 Amanda Stjerna. % 0.21/0.61 Free software under BSD-3-Clause. % 0.21/0.61 % 0.21/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.21/0.61 % 0.21/0.61 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.21/0.62 Running up to 7 provers in parallel. % 0.21/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.21/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.21/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.21/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.21/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.21/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.21/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.33/1.19 Prover 1: Preprocessing ... % 3.33/1.19 Prover 4: Preprocessing ... % 3.33/1.23 Prover 2: Preprocessing ... % 3.33/1.23 Prover 3: Preprocessing ... % 3.33/1.23 Prover 6: Preprocessing ... % 3.33/1.23 Prover 5: Preprocessing ... % 3.33/1.23 Prover 0: Preprocessing ... % 6.19/1.63 Prover 5: Proving ... % 6.19/1.63 Prover 2: Proving ... % 6.77/1.66 Prover 6: Constructing countermodel ... % 7.05/1.69 Prover 1: Constructing countermodel ... % 7.05/1.70 Prover 3: Constructing countermodel ... % 7.55/1.84 Prover 3: proved (1204ms) % 7.55/1.84 % 7.55/1.84 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 7.55/1.84 % 7.55/1.85 Prover 6: stopped % 7.55/1.86 Prover 5: stopped % 7.55/1.86 Prover 2: stopped % 7.55/1.86 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 7.55/1.86 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 8.31/1.86 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 8.31/1.88 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 8.68/1.93 Prover 8: Preprocessing ... % 8.68/1.94 Prover 7: Preprocessing ... % 8.68/1.95 Prover 10: Preprocessing ... % 8.68/1.95 Prover 11: Preprocessing ... % 8.68/1.98 Prover 1: Found proof (size 23) % 8.68/1.98 Prover 1: proved (1356ms) % 8.68/1.98 Prover 7: stopped % 9.28/2.00 Prover 10: stopped % 9.28/2.05 Prover 11: stopped % 9.28/2.07 Prover 0: Proving ... % 9.28/2.08 Prover 0: stopped % 10.02/2.10 Prover 8: Warning: ignoring some quantifiers % 10.02/2.11 Prover 8: Constructing countermodel ... % 10.10/2.11 Prover 4: Constructing countermodel ... % 10.10/2.12 Prover 8: stopped % 10.10/2.13 Prover 4: stopped % 10.10/2.13 % 10.10/2.13 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 10.10/2.13 % 10.10/2.14 % SZS output start Proof for theBenchmark % 10.10/2.14 Assumptions after simplification: % 10.10/2.14 --------------------------------- % 10.10/2.14 % 10.10/2.14 (a3) % 10.10/2.17 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (parallel_lines(v0, % 10.10/2.17 v1) = v2) | ~ $i(v1) | ~ $i(v0) | convergent_lines(v0, v1) = 0) & ! % 10.10/2.17 [v0: $i] : ! [v1: $i] : ( ~ (parallel_lines(v0, v1) = 0) | ~ $i(v1) | ~ % 10.10/2.17 $i(v0) | ? [v2: int] : ( ~ (v2 = 0) & convergent_lines(v0, v1) = v2)) % 10.10/2.17 % 10.10/2.17 (ax2) % 10.10/2.17 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (equal_lines(v0, v1) = % 10.10/2.17 v2) | ~ $i(v1) | ~ $i(v0) | distinct_lines(v0, v1) = 0) & ! [v0: $i] : % 10.10/2.17 ! [v1: $i] : ( ~ (equal_lines(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0) | ? [v2: % 10.10/2.17 int] : ( ~ (v2 = 0) & distinct_lines(v0, v1) = v2)) % 10.10/2.17 % 10.10/2.17 (ax6) % 10.10/2.18 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ % 10.10/2.18 (convergent_lines(v0, v2) = v3) | ~ (convergent_lines(v0, v1) = 0) | ~ % 10.10/2.18 $i(v2) | ~ $i(v1) | ~ $i(v0) | convergent_lines(v1, v2) = 0) % 10.10/2.18 % 10.10/2.18 (con) % 10.10/2.18 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: int] : ( ~ (v4 % 10.10/2.18 = 0) & incident_point_and_line(v0, v3) = 0 & incident_point_and_line(v0, % 10.10/2.18 v2) = 0 & parallel_lines(v3, v1) = 0 & parallel_lines(v2, v1) = 0 & % 10.10/2.18 equal_lines(v2, v3) = v4 & apart_point_and_line(v0, v1) = 0 & $i(v3) & % 10.10/2.18 $i(v2) & $i(v1) & $i(v0)) % 10.10/2.18 % 10.10/2.18 (p1) % 10.10/2.18 ! [v0: $i] : ! [v1: $i] : ( ~ (distinct_lines(v0, v1) = 0) | ~ $i(v1) | ~ % 10.10/2.18 $i(v0) | convergent_lines(v0, v1) = 0) % 10.10/2.18 % 10.10/2.18 (function-axioms) % 10.10/2.19 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 10.10/2.19 [v3: $i] : (v1 = v0 | ~ (orthogonal_lines(v3, v2) = v1) | ~ % 10.10/2.19 (orthogonal_lines(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 10.10/2.19 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 10.10/2.19 (incident_point_and_line(v3, v2) = v1) | ~ (incident_point_and_line(v3, v2) % 10.10/2.19 = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 10.10/2.19 $i] : ! [v3: $i] : (v1 = v0 | ~ (parallel_lines(v3, v2) = v1) | ~ % 10.10/2.19 (parallel_lines(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 10.10/2.19 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 10.10/2.19 (equal_lines(v3, v2) = v1) | ~ (equal_lines(v3, v2) = v0)) & ! [v0: % 10.10/2.19 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 10.10/2.19 : (v1 = v0 | ~ (equal_points(v3, v2) = v1) | ~ (equal_points(v3, v2) = v0)) % 10.10/2.19 & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 10.10/2.19 (orthogonal_through_point(v3, v2) = v1) | ~ (orthogonal_through_point(v3, % 10.10/2.19 v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : % 10.10/2.19 ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (unorthogonal_lines(v3, v2) = v1) | % 10.10/2.19 ~ (unorthogonal_lines(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: % 10.10/2.19 $i] : ! [v3: $i] : (v1 = v0 | ~ (parallel_through_point(v3, v2) = v1) | ~ % 10.10/2.19 (parallel_through_point(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: % 10.10/2.19 $i] : ! [v3: $i] : (v1 = v0 | ~ (intersection_point(v3, v2) = v1) | ~ % 10.10/2.19 (intersection_point(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] % 10.10/2.19 : ! [v3: $i] : (v1 = v0 | ~ (line_connecting(v3, v2) = v1) | ~ % 10.10/2.19 (line_connecting(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 10.10/2.19 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 10.10/2.19 (apart_point_and_line(v3, v2) = v1) | ~ (apart_point_and_line(v3, v2) = % 10.10/2.19 v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 10.10/2.19 $i] : ! [v3: $i] : (v1 = v0 | ~ (convergent_lines(v3, v2) = v1) | ~ % 10.10/2.19 (convergent_lines(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 10.10/2.19 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 10.10/2.19 (distinct_lines(v3, v2) = v1) | ~ (distinct_lines(v3, v2) = v0)) & ! [v0: % 10.10/2.19 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 10.10/2.19 : (v1 = v0 | ~ (distinct_points(v3, v2) = v1) | ~ (distinct_points(v3, v2) = % 10.10/2.19 v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 10.10/2.19 $i] : (v1 = v0 | ~ (point(v2) = v1) | ~ (point(v2) = v0)) & ! [v0: % 10.10/2.19 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 10.10/2.19 ~ (line(v2) = v1) | ~ (line(v2) = v0)) % 10.10/2.19 % 10.10/2.19 Further assumptions not needed in the proof: % 10.10/2.19 -------------------------------------------- % 10.10/2.19 a4, a5, apart1, apart2, apart3, apart4, apart5, ax1, ceq1, ceq2, ceq3, ci1, ci2, % 10.10/2.19 ci3, ci4, coipo1, con1, cotno1, couo1, cp1, cp2, cu1, cup1, int1, oac1, occu1, % 10.10/2.19 ooc1, ooc2, orth1, ouo1, par1 % 10.10/2.19 % 10.10/2.19 Those formulas are unsatisfiable: % 10.10/2.19 --------------------------------- % 10.10/2.19 % 10.10/2.19 Begin of proof % 10.10/2.19 | % 10.10/2.19 | ALPHA: (ax2) implies: % 10.10/2.19 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ % 10.10/2.19 | (equal_lines(v0, v1) = v2) | ~ $i(v1) | ~ $i(v0) | % 10.10/2.19 | distinct_lines(v0, v1) = 0) % 10.10/2.19 | % 10.10/2.19 | ALPHA: (a3) implies: % 10.10/2.19 | (2) ! [v0: $i] : ! [v1: $i] : ( ~ (parallel_lines(v0, v1) = 0) | ~ % 10.10/2.19 | $i(v1) | ~ $i(v0) | ? [v2: int] : ( ~ (v2 = 0) & % 10.10/2.19 | convergent_lines(v0, v1) = v2)) % 10.10/2.19 | % 10.10/2.19 | ALPHA: (function-axioms) implies: % 10.10/2.19 | (3) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 10.10/2.19 | ! [v3: $i] : (v1 = v0 | ~ (convergent_lines(v3, v2) = v1) | ~ % 10.10/2.19 | (convergent_lines(v3, v2) = v0)) % 10.10/2.19 | % 10.10/2.20 | DELTA: instantiating (con) with fresh symbols all_38_0, all_38_1, all_38_2, % 10.10/2.20 | all_38_3, all_38_4 gives: % 10.10/2.20 | (4) ~ (all_38_0 = 0) & incident_point_and_line(all_38_4, all_38_1) = 0 & % 10.10/2.20 | incident_point_and_line(all_38_4, all_38_2) = 0 & % 10.10/2.20 | parallel_lines(all_38_1, all_38_3) = 0 & parallel_lines(all_38_2, % 10.10/2.20 | all_38_3) = 0 & equal_lines(all_38_2, all_38_1) = all_38_0 & % 10.10/2.20 | apart_point_and_line(all_38_4, all_38_3) = 0 & $i(all_38_1) & % 10.10/2.20 | $i(all_38_2) & $i(all_38_3) & $i(all_38_4) % 10.10/2.20 | % 10.10/2.20 | ALPHA: (4) implies: % 10.10/2.20 | (5) ~ (all_38_0 = 0) % 10.10/2.20 | (6) $i(all_38_3) % 10.10/2.20 | (7) $i(all_38_2) % 10.10/2.20 | (8) $i(all_38_1) % 10.10/2.20 | (9) equal_lines(all_38_2, all_38_1) = all_38_0 % 10.10/2.20 | (10) parallel_lines(all_38_2, all_38_3) = 0 % 10.10/2.20 | (11) parallel_lines(all_38_1, all_38_3) = 0 % 10.10/2.20 | % 10.10/2.20 | GROUND_INST: instantiating (1) with all_38_2, all_38_1, all_38_0, simplifying % 10.10/2.20 | with (7), (8), (9) gives: % 10.10/2.20 | (12) all_38_0 = 0 | distinct_lines(all_38_2, all_38_1) = 0 % 10.10/2.20 | % 10.10/2.20 | GROUND_INST: instantiating (2) with all_38_2, all_38_3, simplifying with (6), % 10.10/2.20 | (7), (10) gives: % 10.10/2.20 | (13) ? [v0: int] : ( ~ (v0 = 0) & convergent_lines(all_38_2, all_38_3) = % 10.10/2.20 | v0) % 10.10/2.20 | % 10.10/2.20 | GROUND_INST: instantiating (2) with all_38_1, all_38_3, simplifying with (6), % 10.10/2.20 | (8), (11) gives: % 10.10/2.20 | (14) ? [v0: int] : ( ~ (v0 = 0) & convergent_lines(all_38_1, all_38_3) = % 10.10/2.20 | v0) % 10.10/2.20 | % 10.10/2.20 | DELTA: instantiating (14) with fresh symbol all_49_0 gives: % 10.10/2.20 | (15) ~ (all_49_0 = 0) & convergent_lines(all_38_1, all_38_3) = all_49_0 % 10.10/2.20 | % 10.10/2.20 | ALPHA: (15) implies: % 10.10/2.20 | (16) ~ (all_49_0 = 0) % 10.10/2.20 | (17) convergent_lines(all_38_1, all_38_3) = all_49_0 % 10.10/2.20 | % 10.10/2.20 | DELTA: instantiating (13) with fresh symbol all_51_0 gives: % 10.10/2.20 | (18) ~ (all_51_0 = 0) & convergent_lines(all_38_2, all_38_3) = all_51_0 % 10.10/2.20 | % 10.10/2.20 | ALPHA: (18) implies: % 10.10/2.20 | (19) ~ (all_51_0 = 0) % 10.10/2.20 | (20) convergent_lines(all_38_2, all_38_3) = all_51_0 % 10.10/2.20 | % 10.10/2.20 | BETA: splitting (12) gives: % 10.10/2.20 | % 10.10/2.20 | Case 1: % 10.10/2.20 | | % 10.10/2.20 | | (21) distinct_lines(all_38_2, all_38_1) = 0 % 10.10/2.20 | | % 10.10/2.20 | | GROUND_INST: instantiating (p1) with all_38_2, all_38_1, simplifying with % 10.10/2.20 | | (7), (8), (21) gives: % 10.10/2.20 | | (22) convergent_lines(all_38_2, all_38_1) = 0 % 10.10/2.20 | | % 10.10/2.20 | | GROUND_INST: instantiating (ax6) with all_38_2, all_38_1, all_38_3, % 10.10/2.20 | | all_51_0, simplifying with (6), (7), (8), (20), (22) gives: % 10.10/2.21 | | (23) all_51_0 = 0 | convergent_lines(all_38_1, all_38_3) = 0 % 10.10/2.21 | | % 10.10/2.21 | | BETA: splitting (23) gives: % 10.10/2.21 | | % 10.10/2.21 | | Case 1: % 10.10/2.21 | | | % 10.10/2.21 | | | (24) convergent_lines(all_38_1, all_38_3) = 0 % 10.10/2.21 | | | % 10.10/2.21 | | | GROUND_INST: instantiating (3) with all_49_0, 0, all_38_3, all_38_1, % 10.10/2.21 | | | simplifying with (17), (24) gives: % 10.10/2.21 | | | (25) all_49_0 = 0 % 10.10/2.21 | | | % 10.10/2.21 | | | REDUCE: (16), (25) imply: % 10.10/2.21 | | | (26) $false % 10.10/2.21 | | | % 10.10/2.21 | | | CLOSE: (26) is inconsistent. % 10.10/2.21 | | | % 10.10/2.21 | | Case 2: % 10.10/2.21 | | | % 10.10/2.21 | | | (27) all_51_0 = 0 % 10.10/2.21 | | | % 10.10/2.21 | | | REDUCE: (19), (27) imply: % 10.10/2.21 | | | (28) $false % 10.10/2.21 | | | % 10.10/2.21 | | | CLOSE: (28) is inconsistent. % 10.10/2.21 | | | % 10.10/2.21 | | End of split % 10.10/2.21 | | % 10.10/2.21 | Case 2: % 10.10/2.21 | | % 10.10/2.21 | | (29) all_38_0 = 0 % 10.10/2.21 | | % 10.10/2.21 | | REDUCE: (5), (29) imply: % 10.10/2.21 | | (30) $false % 10.10/2.21 | | % 10.10/2.21 | | CLOSE: (30) is inconsistent. % 10.10/2.21 | | % 10.10/2.21 | End of split % 10.10/2.21 | % 10.10/2.21 End of proof % 10.10/2.21 % SZS output end Proof for theBenchmark % 10.10/2.21 % 10.10/2.21 1600ms %------------------------------------------------------------------------------