%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : MGT060+1 : TPTP v9.3.0. Released v2.4.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n031.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:27 AM UTC 2026 % Result : Theorem 9.64s 2.07s % Output : Proof 15.01s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT060+1 : TPTP v9.3.0. Released v2.4.0. % 0.00/0.04 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.38 % Computer : n031.cluster.edu % 0.12/0.38 % Model : x86_64 x86_64 % 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.38 % Memory : 8046.5625MB % 0.12/0.38 % OS : Linux 6.8.0-71-generic % 0.12/0.38 % CPULimit : 300 % 0.12/0.38 % WCLimit : 300 % 0.12/0.38 % DateTime : Mon Sep 7 13:37:11 UTC 2026 % 0.12/0.38 % CPUTime : % 0.12/0.40 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.67/0.75 ________ _____ % 0.67/0.76 ___ __ \_________(_)________________________________ % 0.67/0.76 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.67/0.76 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.67/0.76 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.67/0.76 % 0.67/0.76 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.67/0.76 (2023-06-19) % 0.67/0.76 % 0.67/0.76 (c) Philipp Rümmer, 2009-2023 % 0.67/0.76 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.67/0.76 Amanda Stjerna. % 0.67/0.76 Free software under BSD-3-Clause. % 0.67/0.76 % 0.67/0.76 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.67/0.76 % 0.67/0.76 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.67/0.78 Running up to 7 provers in parallel. % 0.67/0.79 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.67/0.79 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.67/0.79 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.67/0.79 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.67/0.79 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.67/0.79 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.67/0.79 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.98/1.25 Prover 4: Preprocessing ... % 2.98/1.26 Prover 1: Preprocessing ... % 3.67/1.32 Prover 3: Preprocessing ... % 3.67/1.32 Prover 6: Preprocessing ... % 3.67/1.32 Prover 5: Preprocessing ... % 3.67/1.32 Prover 2: Preprocessing ... % 3.67/1.32 Prover 0: Preprocessing ... % 6.03/1.67 Prover 2: Proving ... % 6.03/1.68 Prover 3: Constructing countermodel ... % 6.03/1.68 Prover 5: Proving ... % 6.03/1.69 Prover 1: Constructing countermodel ... % 6.82/1.72 Prover 6: Constructing countermodel ... % 6.82/1.76 Prover 4: Constructing countermodel ... % 7.57/1.88 Prover 0: Proving ... % 8.35/2.04 Prover 3: gave up % 8.35/2.04 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 8.35/2.06 Prover 5: proved (1273ms) % 8.35/2.07 % 9.64/2.07 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 9.64/2.07 % 9.64/2.07 Prover 6: stopped % 9.64/2.08 Prover 0: stopped % 9.64/2.08 Prover 2: stopped % 9.64/2.08 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 9.64/2.08 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 9.64/2.08 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 9.64/2.08 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 9.64/2.10 Prover 1: gave up % 9.64/2.10 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683 % 9.64/2.17 Prover 16: Preprocessing ... % 9.64/2.17 Prover 10: Preprocessing ... % 10.45/2.18 Prover 7: Preprocessing ... % 10.45/2.19 Prover 11: Preprocessing ... % 10.45/2.19 Prover 13: Preprocessing ... % 10.45/2.19 Prover 8: Preprocessing ... % 10.67/2.25 Prover 10: Warning: ignoring some quantifiers % 10.67/2.26 Prover 16: Warning: ignoring some quantifiers % 10.67/2.27 Prover 7: Warning: ignoring some quantifiers % 10.67/2.27 Prover 10: Constructing countermodel ... % 10.67/2.27 Prover 7: Constructing countermodel ... % 10.67/2.28 Prover 16: Constructing countermodel ... % 11.47/2.30 Prover 13: Warning: ignoring some quantifiers % 11.47/2.31 Prover 13: Constructing countermodel ... % 11.47/2.32 Prover 8: Warning: ignoring some quantifiers % 11.47/2.33 Prover 8: Constructing countermodel ... % 13.06/2.52 Prover 11: Constructing countermodel ... % 13.06/2.59 Prover 8: gave up % 13.06/2.59 Prover 19: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=-1780594085 % 13.82/2.65 Prover 19: Preprocessing ... % 13.82/2.66 Prover 10: Found proof (size 34) % 13.82/2.67 Prover 10: proved (592ms) % 13.82/2.67 Prover 11: stopped % 13.82/2.67 Prover 4: stopped % 13.82/2.67 Prover 16: stopped % 13.82/2.67 Prover 7: stopped % 13.82/2.67 Prover 13: stopped % 14.53/2.73 Prover 19: Warning: ignoring some quantifiers % 14.53/2.74 Prover 19: Constructing countermodel ... % 14.53/2.74 Prover 19: stopped % 14.53/2.74 % 14.53/2.74 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 14.53/2.74 % 14.53/2.76 % SZS output start Proof for theBenchmark % 14.53/2.76 Assumptions after simplification: % 14.53/2.76 --------------------------------- % 14.53/2.76 % 14.53/2.76 (assumption_17) % 15.01/2.82 $i(high) & $i(mod2) & $i(mod1) & $i(low) & $i(very_low) & ! [v0: $i] : ! % 15.01/2.82 [v1: $i] : ! [v2: $i] : (v2 = high | ~ (hazard_of_mortality(v0, v1) = v2) | % 15.01/2.82 ~ $i(v1) | ~ $i(v0) | ~ organization(v0) | positional_advantage(v0, v1) | % 15.01/2.82 is_aligned(v0, v1) | has_immunity(v0, v1)) & ! [v0: $i] : ! [v1: $i] : ! % 15.01/2.82 [v2: $i] : (v2 = mod2 | ~ (hazard_of_mortality(v0, v1) = v2) | ~ $i(v1) | ~ % 15.01/2.82 $i(v0) | ~ is_aligned(v0, v1) | ~ organization(v0) | % 15.01/2.82 positional_advantage(v0, v1) | has_immunity(v0, v1)) & ! [v0: $i] : ! [v1: % 15.01/2.82 $i] : ! [v2: $i] : (v2 = mod1 | ~ (hazard_of_mortality(v0, v1) = v2) | ~ % 15.01/2.82 $i(v1) | ~ $i(v0) | ~ positional_advantage(v0, v1) | ~ organization(v0) | % 15.01/2.82 is_aligned(v0, v1) | has_immunity(v0, v1)) & ! [v0: $i] : ! [v1: $i] : ! % 15.01/2.82 [v2: $i] : (v2 = low | ~ (hazard_of_mortality(v0, v1) = v2) | ~ $i(v1) | ~ % 15.01/2.82 $i(v0) | ~ positional_advantage(v0, v1) | ~ is_aligned(v0, v1) | ~ % 15.01/2.82 organization(v0) | has_immunity(v0, v1)) & ! [v0: $i] : ! [v1: $i] : ! % 15.01/2.82 [v2: $i] : (v2 = very_low | ~ (hazard_of_mortality(v0, v1) = v2) | ~ $i(v1) % 15.01/2.82 | ~ $i(v0) | ~ has_immunity(v0, v1) | ~ organization(v0)) % 15.01/2.82 % 15.01/2.82 (assumption_18b) % 15.01/2.82 $i(mod1) & $i(low) & greater(mod1, low) % 15.01/2.82 % 15.01/2.82 (assumption_18c) % 15.01/2.82 $i(low) & $i(very_low) & greater(low, very_low) % 15.01/2.82 % 15.01/2.82 (assumption_18d) % 15.01/2.83 $i(high) & $i(mod2) & greater(high, mod2) % 15.01/2.83 % 15.01/2.83 (assumption_18e) % 15.01/2.83 $i(mod2) & $i(low) & greater(mod2, low) % 15.01/2.83 % 15.01/2.83 (assumption_3) % 15.01/2.83 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : % 15.01/2.83 (hazard_of_mortality(v0, v2) = v3 & hazard_of_mortality(v0, v1) = v4 & $i(v4) % 15.01/2.83 & $i(v3) & $i(v2) & $i(v1) & $i(v0) & has_immunity(v0, v1) & % 15.01/2.83 organization(v0) & ~ has_immunity(v0, v2) & ~ greater(v3, v4)) % 15.01/2.83 % 15.01/2.83 (meaning_postulate_greater_transitive) % 15.01/2.83 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 15.01/2.83 ~ greater(v1, v2) | ~ greater(v0, v1) | greater(v0, v2)) % 15.01/2.83 % 15.01/2.83 Further assumptions not needed in the proof: % 15.01/2.83 -------------------------------------------- % 15.01/2.83 assumption_18a, definition_greater_or_equal, definition_smaller, % 15.01/2.83 definition_smaller_or_equal, meaning_postulate_greater_comparable, % 15.01/2.83 meaning_postulate_greater_strict % 15.01/2.83 % 15.01/2.83 Those formulas are unsatisfiable: % 15.01/2.83 --------------------------------- % 15.01/2.83 % 15.01/2.83 Begin of proof % 15.01/2.83 | % 15.01/2.84 | ALPHA: (assumption_17) implies: % 15.01/2.84 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = very_low | ~ % 15.01/2.84 | (hazard_of_mortality(v0, v1) = v2) | ~ $i(v1) | ~ $i(v0) | ~ % 15.01/2.84 | has_immunity(v0, v1) | ~ organization(v0)) % 15.01/2.84 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = low | ~ % 15.01/2.84 | (hazard_of_mortality(v0, v1) = v2) | ~ $i(v1) | ~ $i(v0) | ~ % 15.01/2.84 | positional_advantage(v0, v1) | ~ is_aligned(v0, v1) | ~ % 15.01/2.84 | organization(v0) | has_immunity(v0, v1)) % 15.01/2.84 | (3) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = mod1 | ~ % 15.01/2.84 | (hazard_of_mortality(v0, v1) = v2) | ~ $i(v1) | ~ $i(v0) | ~ % 15.01/2.84 | positional_advantage(v0, v1) | ~ organization(v0) | is_aligned(v0, % 15.01/2.84 | v1) | has_immunity(v0, v1)) % 15.01/2.85 | (4) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = mod2 | ~ % 15.01/2.85 | (hazard_of_mortality(v0, v1) = v2) | ~ $i(v1) | ~ $i(v0) | ~ % 15.01/2.85 | is_aligned(v0, v1) | ~ organization(v0) | positional_advantage(v0, % 15.01/2.85 | v1) | has_immunity(v0, v1)) % 15.01/2.85 | (5) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = high | ~ % 15.01/2.85 | (hazard_of_mortality(v0, v1) = v2) | ~ $i(v1) | ~ $i(v0) | ~ % 15.01/2.85 | organization(v0) | positional_advantage(v0, v1) | is_aligned(v0, v1) % 15.01/2.85 | | has_immunity(v0, v1)) % 15.01/2.85 | % 15.01/2.85 | ALPHA: (assumption_18b) implies: % 15.01/2.85 | (6) greater(mod1, low) % 15.01/2.85 | (7) $i(mod1) % 15.01/2.85 | % 15.01/2.85 | ALPHA: (assumption_18c) implies: % 15.01/2.85 | (8) greater(low, very_low) % 15.01/2.85 | (9) $i(very_low) % 15.01/2.85 | % 15.01/2.85 | ALPHA: (assumption_18d) implies: % 15.01/2.85 | (10) greater(high, mod2) % 15.01/2.85 | (11) $i(high) % 15.01/2.85 | % 15.01/2.85 | ALPHA: (assumption_18e) implies: % 15.01/2.85 | (12) greater(mod2, low) % 15.01/2.85 | (13) $i(low) % 15.01/2.85 | (14) $i(mod2) % 15.01/2.85 | % 15.01/2.85 | DELTA: instantiating (assumption_3) with fresh symbols all_13_0, all_13_1, % 15.01/2.85 | all_13_2, all_13_3, all_13_4 gives: % 15.01/2.86 | (15) hazard_of_mortality(all_13_4, all_13_2) = all_13_1 & % 15.01/2.86 | hazard_of_mortality(all_13_4, all_13_3) = all_13_0 & $i(all_13_0) & % 15.01/2.86 | $i(all_13_1) & $i(all_13_2) & $i(all_13_3) & $i(all_13_4) & % 15.01/2.86 | has_immunity(all_13_4, all_13_3) & organization(all_13_4) & ~ % 15.01/2.86 | has_immunity(all_13_4, all_13_2) & ~ greater(all_13_1, all_13_0) % 15.01/2.86 | % 15.01/2.86 | ALPHA: (15) implies: % 15.01/2.86 | (16) ~ greater(all_13_1, all_13_0) % 15.01/2.86 | (17) ~ has_immunity(all_13_4, all_13_2) % 15.01/2.86 | (18) organization(all_13_4) % 15.01/2.86 | (19) has_immunity(all_13_4, all_13_3) % 15.01/2.86 | (20) $i(all_13_4) % 15.01/2.86 | (21) $i(all_13_3) % 15.01/2.86 | (22) $i(all_13_2) % 15.01/2.86 | (23) $i(all_13_0) % 15.01/2.86 | (24) hazard_of_mortality(all_13_4, all_13_3) = all_13_0 % 15.01/2.86 | (25) hazard_of_mortality(all_13_4, all_13_2) = all_13_1 % 15.01/2.86 | % 15.01/2.86 | GROUND_INST: instantiating (meaning_postulate_greater_transitive) with mod1, % 15.01/2.86 | low, very_low, simplifying with (6), (7), (8), (9), (13) gives: % 15.01/2.86 | (26) greater(mod1, very_low) % 15.01/2.86 | % 15.01/2.86 | GROUND_INST: instantiating (meaning_postulate_greater_transitive) with mod2, % 15.01/2.86 | low, very_low, simplifying with (8), (9), (12), (13), (14) gives: % 15.01/2.86 | (27) greater(mod2, very_low) % 15.01/2.86 | % 15.01/2.86 | GROUND_INST: instantiating (meaning_postulate_greater_transitive) with high, % 15.01/2.86 | mod2, low, simplifying with (10), (11), (12), (13), (14) gives: % 15.01/2.86 | (28) greater(high, low) % 15.01/2.87 | % 15.01/2.87 | GROUND_INST: instantiating (1) with all_13_4, all_13_3, all_13_0, simplifying % 15.01/2.87 | with (18), (19), (20), (21), (24) gives: % 15.01/2.87 | (29) all_13_0 = very_low % 15.01/2.87 | % 15.01/2.87 | GROUND_INST: instantiating (5) with all_13_4, all_13_2, all_13_1, simplifying % 15.01/2.87 | with (17), (18), (20), (22), (25) gives: % 15.01/2.87 | (30) all_13_1 = high | positional_advantage(all_13_4, all_13_2) | % 15.01/2.87 | is_aligned(all_13_4, all_13_2) % 15.01/2.87 | % 15.01/2.87 | REDUCE: (16), (29) imply: % 15.01/2.87 | (31) ~ greater(all_13_1, very_low) % 15.01/2.87 | % 15.01/2.87 | GROUND_INST: instantiating (meaning_postulate_greater_transitive) with high, % 15.01/2.87 | low, very_low, simplifying with (8), (9), (11), (13), (28) gives: % 15.01/2.87 | (32) greater(high, very_low) % 15.01/2.87 | % 15.01/2.87 | BETA: splitting (30) gives: % 15.01/2.87 | % 15.01/2.87 | Case 1: % 15.01/2.87 | | % 15.01/2.87 | | (33) positional_advantage(all_13_4, all_13_2) % 15.01/2.87 | | % 15.01/2.87 | | GROUND_INST: instantiating (3) with all_13_4, all_13_2, all_13_1, % 15.01/2.87 | | simplifying with (17), (18), (20), (22), (25), (33) gives: % 15.01/2.87 | | (34) all_13_1 = mod1 | is_aligned(all_13_4, all_13_2) % 15.01/2.87 | | % 15.01/2.87 | | BETA: splitting (34) gives: % 15.01/2.87 | | % 15.01/2.87 | | Case 1: % 15.01/2.87 | | | % 15.01/2.87 | | | (35) is_aligned(all_13_4, all_13_2) % 15.01/2.87 | | | % 15.01/2.87 | | | GROUND_INST: instantiating (2) with all_13_4, all_13_2, all_13_1, % 15.01/2.87 | | | simplifying with (17), (18), (20), (22), (25), (33), (35) % 15.01/2.87 | | | gives: % 15.01/2.87 | | | (36) all_13_1 = low % 15.01/2.87 | | | % 15.01/2.87 | | | REDUCE: (31), (36) imply: % 15.01/2.88 | | | (37) ~ greater(low, very_low) % 15.01/2.88 | | | % 15.01/2.88 | | | PRED_UNIFY: (8), (37) imply: % 15.01/2.88 | | | (38) $false % 15.01/2.88 | | | % 15.01/2.88 | | | CLOSE: (38) is inconsistent. % 15.01/2.88 | | | % 15.01/2.88 | | Case 2: % 15.01/2.88 | | | % 15.01/2.88 | | | (39) all_13_1 = mod1 % 15.01/2.88 | | | % 15.01/2.88 | | | REDUCE: (31), (39) imply: % 15.01/2.88 | | | (40) ~ greater(mod1, very_low) % 15.01/2.88 | | | % 15.01/2.88 | | | PRED_UNIFY: (26), (40) imply: % 15.01/2.88 | | | (41) $false % 15.01/2.88 | | | % 15.01/2.88 | | | CLOSE: (41) is inconsistent. % 15.01/2.88 | | | % 15.01/2.88 | | End of split % 15.01/2.88 | | % 15.01/2.88 | Case 2: % 15.01/2.88 | | % 15.01/2.88 | | (42) ~ positional_advantage(all_13_4, all_13_2) % 15.01/2.88 | | (43) all_13_1 = high | is_aligned(all_13_4, all_13_2) % 15.01/2.88 | | % 15.01/2.88 | | BETA: splitting (43) gives: % 15.01/2.88 | | % 15.01/2.88 | | Case 1: % 15.01/2.88 | | | % 15.01/2.88 | | | (44) is_aligned(all_13_4, all_13_2) % 15.01/2.88 | | | % 15.01/2.88 | | | GROUND_INST: instantiating (4) with all_13_4, all_13_2, all_13_1, % 15.01/2.88 | | | simplifying with (17), (18), (20), (22), (25), (42), (44) % 15.01/2.88 | | | gives: % 15.01/2.88 | | | (45) all_13_1 = mod2 % 15.01/2.88 | | | % 15.01/2.88 | | | REDUCE: (31), (45) imply: % 15.01/2.88 | | | (46) ~ greater(mod2, very_low) % 15.01/2.88 | | | % 15.01/2.88 | | | PRED_UNIFY: (27), (46) imply: % 15.01/2.88 | | | (47) $false % 15.01/2.88 | | | % 15.01/2.88 | | | CLOSE: (47) is inconsistent. % 15.01/2.88 | | | % 15.01/2.88 | | Case 2: % 15.01/2.88 | | | % 15.01/2.88 | | | (48) all_13_1 = high % 15.01/2.88 | | | % 15.01/2.88 | | | REDUCE: (31), (48) imply: % 15.01/2.89 | | | (49) ~ greater(high, very_low) % 15.01/2.89 | | | % 15.01/2.89 | | | PRED_UNIFY: (32), (49) imply: % 15.01/2.89 | | | (50) $false % 15.01/2.89 | | | % 15.01/2.89 | | | CLOSE: (50) is inconsistent. % 15.01/2.89 | | | % 15.01/2.89 | | End of split % 15.01/2.89 | | % 15.01/2.89 | End of split % 15.01/2.89 | % 15.01/2.89 End of proof % 15.01/2.89 % SZS output end Proof for theBenchmark % 15.01/2.89 % 15.01/2.89 2128ms %------------------------------------------------------------------------------