%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWV056+1 : TPTP v8.1.2. Bugfixed v3.3.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n016.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 22:54:44 EDT 2023 % Result : Theorem 14.59s 2.62s % Output : Proof 17.61s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SWV056+1 : TPTP v8.1.2. Bugfixed v3.3.0. % 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.14/0.34 % Computer : n016.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 300 % 0.14/0.34 % DateTime : Tue Aug 29 04:15:45 EDT 2023 % 0.14/0.34 % CPUTime : % 0.64/0.62 ________ _____ % 0.64/0.62 ___ __ \_________(_)________________________________ % 0.64/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.64/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.64/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.64/0.62 % 0.64/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.64/0.62 (2023-06-19) % 0.64/0.62 % 0.64/0.62 (c) Philipp Rümmer, 2009-2023 % 0.64/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.64/0.62 Amanda Stjerna. % 0.64/0.62 Free software under BSD-3-Clause. % 0.64/0.62 % 0.64/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.64/0.62 % 0.64/0.62 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.67/0.64 Running up to 7 provers in parallel. % 0.67/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.67/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.67/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.67/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.67/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.67/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.67/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 5.39/1.42 Prover 4: Preprocessing ... % 5.39/1.42 Prover 1: Preprocessing ... % 5.39/1.45 Prover 5: Preprocessing ... % 5.39/1.45 Prover 3: Preprocessing ... % 5.39/1.45 Prover 0: Preprocessing ... % 5.39/1.45 Prover 6: Preprocessing ... % 6.01/1.47 Prover 2: Preprocessing ... % 11.18/2.16 Prover 1: Warning: ignoring some quantifiers % 11.18/2.19 Prover 3: Warning: ignoring some quantifiers % 11.18/2.21 Prover 6: Proving ... % 11.18/2.21 Prover 3: Constructing countermodel ... % 11.81/2.22 Prover 1: Constructing countermodel ... % 11.81/2.25 Prover 4: Warning: ignoring some quantifiers % 12.33/2.33 Prover 4: Constructing countermodel ... % 12.33/2.36 Prover 0: Proving ... % 12.97/2.38 Prover 5: Proving ... % 13.11/2.39 Prover 2: Proving ... % 14.59/2.61 Prover 3: proved (1962ms) % 14.59/2.61 % 14.59/2.62 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 14.59/2.62 % 14.59/2.62 Prover 0: stopped % 14.59/2.62 Prover 2: stopped % 14.59/2.62 Prover 6: stopped % 14.59/2.62 Prover 5: stopped % 14.59/2.63 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 14.59/2.63 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 14.59/2.63 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 14.59/2.63 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 14.59/2.63 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 15.76/2.77 Prover 1: Found proof (size 16) % 15.76/2.77 Prover 1: proved (2123ms) % 15.76/2.77 Prover 4: stopped % 15.76/2.78 Prover 8: Preprocessing ... % 15.76/2.79 Prover 13: Preprocessing ... % 15.76/2.79 Prover 7: Preprocessing ... % 15.76/2.80 Prover 10: Preprocessing ... % 15.76/2.81 Prover 11: Preprocessing ... % 16.46/2.85 Prover 7: stopped % 16.46/2.86 Prover 10: stopped % 16.46/2.89 Prover 11: stopped % 17.00/2.89 Prover 13: stopped % 17.00/2.95 Prover 8: Warning: ignoring some quantifiers % 17.00/2.97 Prover 8: Constructing countermodel ... % 17.49/2.99 Prover 8: stopped % 17.49/2.99 % 17.49/2.99 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 17.49/2.99 % 17.49/2.99 % SZS output start Proof for theBenchmark % 17.49/3.00 Assumptions after simplification: % 17.49/3.00 --------------------------------- % 17.49/3.00 % 17.49/3.00 (cl5_nebula_norm_0040) % 17.61/3.02 $i(pv77) & $i(q) & $i(pv25) & $i(n5) & $i(n1) & $i(n0) & ? [v0: $i] : ? [v1: % 17.61/3.02 $i] : ? [v2: $i] : ? [v3: $i] : ( ~ (v3 = n0) & minus(n5, n1) = v0 & % 17.61/3.02 minus(n0, n1) = v1 & sum(n0, v1, v2) = v3 & a_select3(q, pv77, pv25) = v2 & % 17.61/3.02 leq(pv25, v0) = 0 & leq(n0, pv25) = 0 & $i(v3) & $i(v2) & $i(v1) & $i(v0)) % 17.61/3.02 % 17.61/3.02 (gt_3_tptp_minus_1) % 17.61/3.02 gt(n3, tptp_minus_1) = 0 & $i(n3) & $i(tptp_minus_1) % 17.61/3.02 % 17.61/3.02 (pred_minus_1) % 17.61/3.02 $i(n1) & ! [v0: $i] : ! [v1: $i] : ( ~ (minus(v0, n1) = v1) | ~ $i(v0) | % 17.61/3.02 (pred(v0) = v1 & $i(v1))) % 17.61/3.02 % 17.61/3.02 (pred_succ) % 17.61/3.02 ! [v0: $i] : ! [v1: $i] : ( ~ (succ(v0) = v1) | ~ $i(v0) | pred(v1) = v0) % 17.61/3.02 % 17.61/3.02 (succ_tptp_minus_1) % 17.61/3.02 succ(tptp_minus_1) = n0 & $i(tptp_minus_1) & $i(n0) % 17.61/3.02 % 17.61/3.02 (sum_plus_base) % 17.61/3.03 $i(tptp_minus_1) & $i(n0) & ! [v0: $i] : ! [v1: $i] : (v1 = n0 | ~ (sum(n0, % 17.61/3.03 tptp_minus_1, v0) = v1) | ~ $i(v0)) % 17.61/3.03 % 17.61/3.03 (function-axioms) % 17.61/3.04 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : ! [v5: % 17.61/3.04 $i] : (v1 = v0 | ~ (tptp_update3(v5, v4, v3, v2) = v1) | ~ % 17.61/3.04 (tptp_update3(v5, v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: % 17.61/3.04 $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (tptp_update2(v4, v3, v2) = % 17.61/3.04 v1) | ~ (tptp_update2(v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! % 17.61/3.04 [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (sum(v4, v3, v2) = v1) | % 17.61/3.04 ~ (sum(v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! % 17.61/3.04 [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (tptp_const_array2(v4, v3, v2) = v1) | % 17.61/3.04 ~ (tptp_const_array2(v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! % 17.61/3.04 [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (a_select3(v4, v3, v2) = % 17.61/3.04 v1) | ~ (a_select3(v4, v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! % 17.61/3.04 [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (minus(v3, v2) = v1) | ~ (minus(v3, % 17.61/3.04 v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 % 17.61/3.04 = v0 | ~ (plus(v3, v2) = v1) | ~ (plus(v3, v2) = v0)) & ! [v0: $i] : ! % 17.61/3.04 [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (tptp_mmul(v3, v2) = v1) % 17.61/3.04 | ~ (tptp_mmul(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : % 17.61/3.04 ! [v3: $i] : (v1 = v0 | ~ (tptp_msub(v3, v2) = v1) | ~ (tptp_msub(v3, v2) = % 17.61/3.04 v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | % 17.61/3.04 ~ (tptp_madd(v3, v2) = v1) | ~ (tptp_madd(v3, v2) = v0)) & ! [v0: $i] : ! % 17.61/3.04 [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (dim(v3, v2) = v1) | ~ % 17.61/3.04 (dim(v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] % 17.61/3.04 : (v1 = v0 | ~ (tptp_const_array1(v3, v2) = v1) | ~ (tptp_const_array1(v3, % 17.61/3.04 v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 % 17.61/3.04 = v0 | ~ (a_select2(v3, v2) = v1) | ~ (a_select2(v3, v2) = v0)) & ! [v0: % 17.61/3.04 $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ % 17.61/3.04 (uniform_int_rnd(v3, v2) = v1) | ~ (uniform_int_rnd(v3, v2) = v0)) & ! % 17.61/3.04 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 17.61/3.04 $i] : (v1 = v0 | ~ (geq(v3, v2) = v1) | ~ (geq(v3, v2) = v0)) & ! [v0: % 17.61/3.04 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 17.61/3.04 : (v1 = v0 | ~ (lt(v3, v2) = v1) | ~ (lt(v3, v2) = v0)) & ! [v0: % 17.61/3.04 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 17.61/3.04 : (v1 = v0 | ~ (leq(v3, v2) = v1) | ~ (leq(v3, v2) = v0)) & ! [v0: % 17.61/3.04 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 17.61/3.04 : (v1 = v0 | ~ (gt(v3, v2) = v1) | ~ (gt(v3, v2) = v0)) & ! [v0: $i] : ! % 17.61/3.04 [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (inv(v2) = v1) | ~ (inv(v2) = v0)) & % 17.61/3.04 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (trans(v2) = v1) | ~ % 17.61/3.04 (trans(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ % 17.61/3.04 (succ(v2) = v1) | ~ (succ(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: % 17.61/3.04 $i] : (v1 = v0 | ~ (pred(v2) = v1) | ~ (pred(v2) = v0)) % 17.61/3.04 % 17.61/3.04 Further assumptions not needed in the proof: % 17.61/3.04 -------------------------------------------- % 17.61/3.04 const_array1_select, const_array2_select, defuse, finite_domain_0, % 17.61/3.04 finite_domain_1, finite_domain_2, finite_domain_3, finite_domain_4, % 17.61/3.04 finite_domain_5, gt_0_tptp_minus_1, gt_1_0, gt_1_tptp_minus_1, gt_2_0, gt_2_1, % 17.61/3.04 gt_2_tptp_minus_1, gt_3_0, gt_3_1, gt_3_2, gt_4_0, gt_4_1, gt_4_2, gt_4_3, % 17.61/3.04 gt_4_tptp_minus_1, gt_5_0, gt_5_1, gt_5_2, gt_5_3, gt_5_4, gt_5_tptp_minus_1, % 17.61/3.04 gt_succ, irreflexivity_gt, leq_geq, leq_gt1, leq_gt2, leq_gt_pred, leq_minus, % 17.61/3.04 leq_succ, leq_succ_gt, leq_succ_gt_equiv, leq_succ_succ, lt_gt, % 17.61/3.04 matrix_symm_aba1, matrix_symm_aba2, matrix_symm_add, matrix_symm_inv, % 17.61/3.04 matrix_symm_joseph_update, matrix_symm_sub, matrix_symm_trans, % 17.61/3.04 matrix_symm_update_diagonal, reflexivity_leq, sel2_update_1, sel2_update_2, % 17.61/3.04 sel2_update_3, sel3_update_1, sel3_update_2, sel3_update_3, succ_plus_1_l, % 17.61/3.04 succ_plus_1_r, succ_plus_2_l, succ_plus_2_r, succ_plus_3_l, succ_plus_3_r, % 17.61/3.04 succ_plus_4_l, succ_plus_4_r, succ_plus_5_l, succ_plus_5_r, succ_pred, % 17.61/3.04 successor_1, successor_2, successor_3, successor_4, successor_5, % 17.61/3.04 sum_plus_base_float, totality, transitivity_gt, transitivity_leq, ttrue, % 17.61/3.04 uniform_int_rand_ranges_hi, uniform_int_rand_ranges_lo % 17.61/3.04 % 17.61/3.04 Those formulas are unsatisfiable: % 17.61/3.04 --------------------------------- % 17.61/3.04 % 17.61/3.04 Begin of proof % 17.61/3.04 | % 17.61/3.04 | ALPHA: (sum_plus_base) implies: % 17.61/3.04 | (1) ! [v0: $i] : ! [v1: $i] : (v1 = n0 | ~ (sum(n0, tptp_minus_1, v0) = % 17.61/3.04 | v1) | ~ $i(v0)) % 17.61/3.04 | % 17.61/3.04 | ALPHA: (succ_tptp_minus_1) implies: % 17.61/3.04 | (2) succ(tptp_minus_1) = n0 % 17.61/3.04 | % 17.61/3.04 | ALPHA: (pred_minus_1) implies: % 17.61/3.04 | (3) ! [v0: $i] : ! [v1: $i] : ( ~ (minus(v0, n1) = v1) | ~ $i(v0) | % 17.61/3.04 | (pred(v0) = v1 & $i(v1))) % 17.61/3.04 | % 17.61/3.04 | ALPHA: (gt_3_tptp_minus_1) implies: % 17.61/3.04 | (4) $i(tptp_minus_1) % 17.61/3.04 | % 17.61/3.04 | ALPHA: (cl5_nebula_norm_0040) implies: % 17.61/3.04 | (5) $i(n0) % 17.61/3.04 | (6) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ( ~ (v3 = n0) & % 17.61/3.04 | minus(n5, n1) = v0 & minus(n0, n1) = v1 & sum(n0, v1, v2) = v3 & % 17.61/3.04 | a_select3(q, pv77, pv25) = v2 & leq(pv25, v0) = 0 & leq(n0, pv25) = 0 % 17.61/3.04 | & $i(v3) & $i(v2) & $i(v1) & $i(v0)) % 17.61/3.04 | % 17.61/3.04 | ALPHA: (function-axioms) implies: % 17.61/3.04 | (7) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (pred(v2) = v1) % 17.61/3.04 | | ~ (pred(v2) = v0)) % 17.61/3.04 | % 17.61/3.04 | DELTA: instantiating (6) with fresh symbols all_57_0, all_57_1, all_57_2, % 17.61/3.04 | all_57_3 gives: % 17.61/3.05 | (8) ~ (all_57_0 = n0) & minus(n5, n1) = all_57_3 & minus(n0, n1) = % 17.61/3.05 | all_57_2 & sum(n0, all_57_2, all_57_1) = all_57_0 & a_select3(q, pv77, % 17.61/3.05 | pv25) = all_57_1 & leq(pv25, all_57_3) = 0 & leq(n0, pv25) = 0 & % 17.61/3.05 | $i(all_57_0) & $i(all_57_1) & $i(all_57_2) & $i(all_57_3) % 17.61/3.05 | % 17.61/3.05 | ALPHA: (8) implies: % 17.61/3.05 | (9) ~ (all_57_0 = n0) % 17.61/3.05 | (10) $i(all_57_1) % 17.61/3.05 | (11) sum(n0, all_57_2, all_57_1) = all_57_0 % 17.61/3.05 | (12) minus(n0, n1) = all_57_2 % 17.61/3.05 | % 17.61/3.05 | GROUND_INST: instantiating (pred_succ) with tptp_minus_1, n0, simplifying with % 17.61/3.05 | (2), (4) gives: % 17.61/3.05 | (13) pred(n0) = tptp_minus_1 % 17.61/3.05 | % 17.61/3.05 | GROUND_INST: instantiating (3) with n0, all_57_2, simplifying with (5), (12) % 17.61/3.05 | gives: % 17.61/3.05 | (14) pred(n0) = all_57_2 & $i(all_57_2) % 17.61/3.05 | % 17.61/3.05 | ALPHA: (14) implies: % 17.61/3.05 | (15) pred(n0) = all_57_2 % 17.61/3.05 | % 17.61/3.05 | GROUND_INST: instantiating (7) with tptp_minus_1, all_57_2, n0, simplifying % 17.61/3.05 | with (13), (15) gives: % 17.61/3.05 | (16) all_57_2 = tptp_minus_1 % 17.61/3.05 | % 17.61/3.05 | REDUCE: (11), (16) imply: % 17.61/3.05 | (17) sum(n0, tptp_minus_1, all_57_1) = all_57_0 % 17.61/3.05 | % 17.61/3.05 | GROUND_INST: instantiating (1) with all_57_1, all_57_0, simplifying with (10), % 17.61/3.05 | (17) gives: % 17.61/3.05 | (18) all_57_0 = n0 % 17.61/3.05 | % 17.61/3.05 | REDUCE: (9), (18) imply: % 17.61/3.05 | (19) $false % 17.61/3.05 | % 17.61/3.05 | CLOSE: (19) is inconsistent. % 17.61/3.05 | % 17.61/3.05 End of proof % 17.61/3.05 % SZS output end Proof for theBenchmark % 17.61/3.05 % 17.61/3.05 2431ms %------------------------------------------------------------------------------