%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : MGT088+1 : TPTP v9.3.1. Bugfixed v9.3.1. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n008.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8046.5625MB % OS : Linux 6.8.0-71-generic % CPULimit : 300s % WCLimit : 300s % DateTime : Tue Sep 8 06:17:30 AM UTC 2026 % Result : Theorem 23.13s 3.73s % Output : Proof 27.88s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT088+1 : TPTP v9.3.1. Bugfixed v9.3.1. % 0.00/0.04 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.11/0.37 % Computer : n008.cluster.edu % 0.11/0.37 % Model : x86_64 x86_64 % 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.37 % Memory : 8046.5625MB % 0.11/0.37 % OS : Linux 6.8.0-71-generic % 0.11/0.37 % CPULimit : 300 % 0.11/0.37 % WCLimit : 300 % 0.11/0.37 % DateTime : Mon Sep 7 14:22:38 UTC 2026 % 0.11/0.37 % CPUTime : % 0.11/0.39 OpenJDK 64-Bit Server VM warning: Options -Xverify:none and -noverify were deprecated in JDK 13 and will likely be removed in a future release. % 0.70/0.70 ________ _____ % 0.70/0.70 ___ __ \_________(_)________________________________ % 0.70/0.70 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.70/0.70 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.70/0.70 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.70/0.70 % 0.70/0.70 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.70/0.70 (2023-06-19) % 0.70/0.70 % 0.70/0.70 (c) Philipp Rümmer, 2009-2023 % 0.70/0.70 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.70/0.70 Amanda Stjerna. % 0.70/0.70 Free software under BSD-3-Clause. % 0.70/0.70 % 0.70/0.70 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.70/0.70 % 0.70/0.71 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.70/0.72 Running up to 7 provers in parallel. % 0.70/0.74 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.70/0.74 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.70/0.74 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.70/0.74 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.70/0.74 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.70/0.74 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.70/0.74 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 4.19/1.30 Prover 1: Preprocessing ... % 4.19/1.30 Prover 4: Preprocessing ... % 4.19/1.36 Prover 6: Preprocessing ... % 4.19/1.36 Prover 5: Preprocessing ... % 4.19/1.36 Prover 0: Preprocessing ... % 4.19/1.36 Prover 2: Preprocessing ... % 4.19/1.36 Prover 3: Preprocessing ... % 8.90/2.00 Prover 5: Proving ... % 8.90/2.01 Prover 2: Proving ... % 9.89/2.06 Prover 6: Proving ... % 9.89/2.07 Prover 1: Constructing countermodel ... % 10.70/2.14 Prover 3: Constructing countermodel ... % 11.24/2.21 Prover 4: Constructing countermodel ... % 11.24/2.27 Prover 0: Proving ... % 23.13/3.72 Prover 0: proved (2989ms) % 23.13/3.73 % 23.13/3.73 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 23.13/3.73 % 23.13/3.73 Prover 3: stopped % 23.13/3.73 Prover 6: stopped % 23.13/3.73 Prover 5: stopped % 23.13/3.74 Prover 2: stopped % 23.13/3.75 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 23.13/3.75 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 23.13/3.75 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 23.13/3.75 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 23.13/3.75 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 23.90/3.83 Prover 8: Preprocessing ... % 23.90/3.84 Prover 7: Preprocessing ... % 23.90/3.86 Prover 10: Preprocessing ... % 24.73/3.90 Prover 13: Preprocessing ... % 24.73/3.91 Prover 11: Preprocessing ... % 24.73/4.01 Prover 7: Warning: ignoring some quantifiers % 24.73/4.02 Prover 10: Warning: ignoring some quantifiers % 24.73/4.03 Prover 10: Constructing countermodel ... % 24.73/4.03 Prover 7: Constructing countermodel ... % 24.73/4.05 Prover 13: Warning: ignoring some quantifiers % 24.73/4.06 Prover 13: Constructing countermodel ... % 25.96/4.14 Prover 4: Found proof (size 24) % 25.96/4.15 Prover 4: proved (3414ms) % 25.96/4.15 Prover 10: stopped % 25.96/4.15 Prover 7: stopped % 25.96/4.15 Prover 13: stopped % 25.96/4.15 Prover 1: stopped % 26.74/4.17 Prover 8: Warning: ignoring some quantifiers % 26.74/4.17 Prover 8: Constructing countermodel ... % 26.74/4.18 Prover 8: stopped % 26.94/4.25 Prover 11: Constructing countermodel ... % 26.94/4.27 Prover 11: stopped % 26.94/4.28 % 26.94/4.28 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 26.94/4.28 % 26.94/4.28 % SZS output start Proof for theBenchmark % 26.94/4.29 Assumptions after simplification: % 26.94/4.29 --------------------------------- % 26.94/4.29 % 26.94/4.29 (in_lopen) % 27.40/4.34 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ % 27.40/4.34 (in_lopen(v0, v1, v2) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v4: % 27.40/4.34 any] : ? [v5: any] : (leq(v0, v2) = v5 & less(v1, v0) = v4 & ( ~ (v5 = 0) % 27.40/4.34 | ~ (v4 = 0)))) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ % 27.40/4.34 (in_lopen(v0, v1, v2) = 0) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | (leq(v0, % 27.40/4.34 v2) = 0 & less(v1, v0) = 0)) % 27.40/4.34 % 27.40/4.34 (leq_def) % 27.40/4.35 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | v1 = v0 | ~ (less(v0, % 27.40/4.35 v1) = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: int] : ( ~ (v3 = 0) & % 27.40/4.35 leq(v0, v1) = v3)) & ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | % 27.40/4.35 ~ (leq(v0, v1) = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: int] : ( ~ (v3 = 0) & % 27.40/4.35 less(v0, v1) = v3)) & ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ (leq(v0, % 27.40/4.35 v1) = 0) | ~ $i(v1) | ~ $i(v0) | less(v0, v1) = 0) & ! [v0: $i] : ! % 27.40/4.35 [v1: int] : (v1 = 0 | ~ (leq(v0, v0) = v1) | ~ $i(v0)) & ! [v0: $i] : ! % 27.40/4.35 [v1: $i] : ( ~ (less(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0) | leq(v0, v1) = 0) & % 27.40/4.35 ! [v0: $i] : ! [v1: MultipleValueBool] : ( ~ (less(v0, v0) = v1) | ~ $i(v0) % 27.40/4.35 | leq(v0, v0) = 0) % 27.40/4.35 % 27.40/4.35 (odrl509) % 27.40/4.36 $i(v400) & $i(v200) & $i(v0) & ! [v0: $i] : ( ~ (in_lopen(v0, v0, v400) = 0) % 27.40/4.36 | ~ $i(v0) | ? [v1: int] : ( ~ (v1 = 0) & less(v200, v0) = v1)) & ! [v0: % 27.40/4.36 $i] : ( ~ (less(v200, v0) = 0) | ~ $i(v0) | ? [v1: int] : ( ~ (v1 = 0) & % 27.40/4.36 in_lopen(v0, v0, v400) = v1)) % 27.40/4.36 % 27.40/4.36 (ord_v0_v400) % 27.40/4.36 less(v0, v400) = 0 & $i(v400) & $i(v0) % 27.40/4.36 % 27.40/4.36 (ord_v200_v400) % 27.40/4.36 less(v200, v400) = 0 & $i(v400) & $i(v200) % 27.40/4.36 % 27.40/4.36 (function-axioms) % 27.40/4.37 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 27.40/4.37 [v3: $i] : ! [v4: $i] : ! [v5: $i] : (v1 = v0 | ~ (axis_subsumes(v5, v4, % 27.40/4.37 v3, v2) = v1) | ~ (axis_subsumes(v5, v4, v3, v2) = v0)) & ! [v0: % 27.40/4.37 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 27.40/4.37 : ! [v4: $i] : ! [v5: $i] : (v1 = v0 | ~ (axis_compatible(v5, v4, v3, v2) = % 27.40/4.37 v1) | ~ (axis_compatible(v5, v4, v3, v2) = v0)) & ! [v0: % 27.40/4.37 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 27.40/4.37 : ! [v4: $i] : ! [v5: $i] : (v1 = v0 | ~ (axis_conflict(v5, v4, v3, v2) = % 27.40/4.37 v1) | ~ (axis_conflict(v5, v4, v3, v2) = v0)) & ! [v0: % 27.40/4.37 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 27.40/4.37 : ! [v4: $i] : (v1 = v0 | ~ (in_open(v4, v3, v2) = v1) | ~ (in_open(v4, v3, % 27.40/4.37 v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : % 27.40/4.37 ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (in_ropen(v4, v3, v2) = % 27.40/4.37 v1) | ~ (in_ropen(v4, v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! % 27.40/4.37 [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0 | % 27.40/4.37 ~ (in_lopen(v4, v3, v2) = v1) | ~ (in_lopen(v4, v3, v2) = v0)) & ! [v0: % 27.40/4.37 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 27.40/4.37 : ! [v4: $i] : (v1 = v0 | ~ (in_closed(v4, v3, v2) = v1) | ~ (in_closed(v4, % 27.40/4.37 v3, v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : % 27.40/4.37 (v1 = v0 | ~ (box_verdict(v3, v2) = v1) | ~ (box_verdict(v3, v2) = v0)) & ! % 27.40/4.37 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: % 27.40/4.37 $i] : (v1 = v0 | ~ (leq(v3, v2) = v1) | ~ (leq(v3, v2) = v0)) & ! [v0: % 27.40/4.37 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] % 27.40/4.37 : (v1 = v0 | ~ (less(v3, v2) = v1) | ~ (less(v3, v2) = v0)) & ! [v0: % 27.40/4.37 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 27.40/4.37 ~ (val(v2) = v1) | ~ (val(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 27.40/4.37 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (is_verdict(v2) = v1) | ~ % 27.40/4.37 (is_verdict(v2) = v0)) % 27.40/4.37 % 27.40/4.37 Further assumptions not needed in the proof: % 27.40/4.37 -------------------------------------------- % 27.40/4.38 axis_compatible_def, axis_conflict_def, axis_subsumes_def, box_compatible, % 27.40/4.38 box_conflict, box_unknown, box_verdict_total, compatible_is_verdict, % 27.40/4.38 conflict_is_verdict, dense, distinct, in_closed, in_open, in_ropen, irreflexive, % 27.40/4.38 leq_antisym, leq_less_trans, leq_trans, less_implies_leq, less_leq_trans, % 27.40/4.38 ord_v0_v200, ord_v0_v600, ord_v200_v600, ord_v400_v600, transitive, trichotomy, % 27.40/4.38 unknown_is_verdict, val_v0, val_v200, val_v400, val_v600, verdict_enum, % 27.40/4.38 verdicts_distinct_cf_cp, verdicts_distinct_cf_un, verdicts_distinct_cp_un % 27.40/4.38 % 27.40/4.38 Those formulas are unsatisfiable: % 27.40/4.38 --------------------------------- % 27.40/4.38 % 27.40/4.38 Begin of proof % 27.40/4.38 | % 27.40/4.38 | ALPHA: (leq_def) implies: % 27.40/4.38 | (1) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (leq(v0, v0) = v1) | ~ % 27.40/4.38 | $i(v0)) % 27.40/4.38 | % 27.40/4.38 | ALPHA: (in_lopen) implies: % 27.40/4.38 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ % 27.40/4.38 | (in_lopen(v0, v1, v2) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? % 27.40/4.38 | [v4: any] : ? [v5: any] : (leq(v0, v2) = v5 & less(v1, v0) = v4 & ( % 27.40/4.38 | ~ (v5 = 0) | ~ (v4 = 0)))) % 27.40/4.38 | % 27.40/4.38 | ALPHA: (ord_v0_v400) implies: % 27.40/4.38 | (3) less(v0, v400) = 0 % 27.40/4.38 | % 27.40/4.38 | ALPHA: (ord_v200_v400) implies: % 27.40/4.38 | (4) less(v200, v400) = 0 % 27.40/4.38 | % 27.40/4.38 | ALPHA: (odrl509) implies: % 27.40/4.39 | (5) $i(v0) % 27.40/4.39 | (6) $i(v400) % 27.40/4.39 | (7) ! [v0: $i] : ( ~ (less(v200, v0) = 0) | ~ $i(v0) | ? [v1: int] : ( ~ % 27.40/4.39 | (v1 = 0) & in_lopen(v0, v0, v400) = v1)) % 27.40/4.39 | % 27.40/4.39 | ALPHA: (function-axioms) implies: % 27.40/4.39 | (8) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 27.40/4.39 | ! [v3: $i] : (v1 = v0 | ~ (less(v3, v2) = v1) | ~ (less(v3, v2) = % 27.40/4.39 | v0)) % 27.40/4.39 | % 27.40/4.39 | GROUND_INST: instantiating (7) with v400, simplifying with (4), (6) gives: % 27.40/4.39 | (9) ? [v0: int] : ( ~ (v0 = 0) & in_lopen(v400, v0, v400) = v0) % 27.40/4.39 | % 27.40/4.39 | DELTA: instantiating (9) with fresh symbol all_33_0 gives: % 27.40/4.39 | (10) ~ (all_33_0 = 0) & in_lopen(v400, v0, v400) = all_33_0 % 27.40/4.39 | % 27.40/4.39 | ALPHA: (10) implies: % 27.40/4.39 | (11) ~ (all_33_0 = 0) % 27.40/4.39 | (12) in_lopen(v400, v0, v400) = all_33_0 % 27.40/4.39 | % 27.40/4.39 | GROUND_INST: instantiating (2) with v400, v0, v400, all_33_0, simplifying with % 27.40/4.39 | (5), (6), (12) gives: % 27.40/4.39 | (13) all_33_0 = 0 | ? [v0: any] : ? [v1: any] : (leq(v400, v400) = v1 & % 27.40/4.39 | less(v0, v400) = v0 & ( ~ (v1 = 0) | ~ (v0 = 0))) % 27.40/4.39 | % 27.40/4.39 | BETA: splitting (13) gives: % 27.40/4.39 | % 27.40/4.39 | Case 1: % 27.40/4.39 | | % 27.40/4.39 | | (14) all_33_0 = 0 % 27.40/4.39 | | % 27.40/4.39 | | REDUCE: (11), (14) imply: % 27.40/4.39 | | (15) $false % 27.40/4.40 | | % 27.40/4.40 | | CLOSE: (15) is inconsistent. % 27.88/4.40 | | % 27.88/4.40 | Case 2: % 27.88/4.40 | | % 27.88/4.40 | | (16) ? [v0: any] : ? [v1: any] : (leq(v400, v400) = v1 & less(v0, v400) % 27.88/4.40 | | = v0 & ( ~ (v1 = 0) | ~ (v0 = 0))) % 27.88/4.40 | | % 27.88/4.40 | | DELTA: instantiating (16) with fresh symbols all_107_0, all_107_1 gives: % 27.88/4.40 | | (17) leq(v400, v400) = all_107_0 & less(v0, v400) = all_107_1 & ( ~ % 27.88/4.40 | | (all_107_0 = 0) | ~ (all_107_1 = 0)) % 27.88/4.40 | | % 27.88/4.40 | | ALPHA: (17) implies: % 27.88/4.40 | | (18) less(v0, v400) = all_107_1 % 27.88/4.40 | | (19) leq(v400, v400) = all_107_0 % 27.88/4.40 | | (20) ~ (all_107_0 = 0) | ~ (all_107_1 = 0) % 27.88/4.40 | | % 27.88/4.40 | | GROUND_INST: instantiating (8) with 0, all_107_1, v400, v0, simplifying with % 27.88/4.40 | | (3), (18) gives: % 27.88/4.40 | | (21) all_107_1 = 0 % 27.88/4.40 | | % 27.88/4.40 | | BETA: splitting (20) gives: % 27.88/4.40 | | % 27.88/4.40 | | Case 1: % 27.88/4.40 | | | % 27.88/4.40 | | | (22) ~ (all_107_0 = 0) % 27.88/4.40 | | | % 27.88/4.40 | | | GROUND_INST: instantiating (1) with v400, all_107_0, simplifying with (6), % 27.88/4.40 | | | (19) gives: % 27.88/4.40 | | | (23) all_107_0 = 0 % 27.88/4.40 | | | % 27.88/4.40 | | | REDUCE: (22), (23) imply: % 27.88/4.40 | | | (24) $false % 27.88/4.40 | | | % 27.88/4.40 | | | CLOSE: (24) is inconsistent. % 27.88/4.40 | | | % 27.88/4.40 | | Case 2: % 27.88/4.40 | | | % 27.88/4.40 | | | (25) ~ (all_107_1 = 0) % 27.88/4.40 | | | % 27.88/4.40 | | | REDUCE: (21), (25) imply: % 27.88/4.40 | | | (26) $false % 27.88/4.40 | | | % 27.88/4.40 | | | CLOSE: (26) is inconsistent. % 27.88/4.40 | | | % 27.88/4.40 | | End of split % 27.88/4.40 | | % 27.88/4.40 | End of split % 27.88/4.40 | % 27.88/4.40 End of proof % 27.88/4.40 % SZS output end Proof for theBenchmark % 27.88/4.40 % 27.88/4.40 3698ms %------------------------------------------------------------------------------