%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : LCL650+1.001 : TPTP v9.3.1. Released v4.0.0. % Transfm : none % Format : tptp % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % Computer : n002.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 : Mon Sep 7 12:54:30 PM UTC 2026 % Result : Theorem 14.17s 2.67s % Output : Proof 18.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL650+1.001 : TPTP v9.3.1. Released v4.0.0. % 0.00/0.04 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.37 % Computer : n002.cluster.edu % 0.12/0.37 % Model : x86_64 x86_64 % 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.37 % Memory : 8046.5625MB % 0.12/0.37 % OS : Linux 6.8.0-71-generic % 0.12/0.37 % CPULimit : 300 % 0.12/0.37 % WCLimit : 300 % 0.12/0.37 % DateTime : Sat Sep 5 20:02:21 UTC 2026 % 0.12/0.37 % CPUTime : % 0.12/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.72 ________ _____ % 0.70/0.72 ___ __ \_________(_)________________________________ % 0.70/0.72 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.70/0.72 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.70/0.72 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.70/0.72 % 0.70/0.72 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.70/0.72 (2023-06-19) % 0.70/0.72 % 0.70/0.72 (c) Philipp Rümmer, 2009-2023 % 0.70/0.72 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.70/0.72 Amanda Stjerna. % 0.70/0.72 Free software under BSD-3-Clause. % 0.70/0.72 % 0.70/0.72 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.70/0.72 % 0.70/0.73 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.70/0.75 Running up to 7 provers in parallel. % 0.70/0.76 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.70/0.76 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.70/0.76 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.70/0.76 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.70/0.76 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.70/0.76 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.70/0.76 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.21/1.22 Prover 1: Preprocessing ... % 3.21/1.23 Prover 4: Preprocessing ... % 3.96/1.31 Prover 3: Preprocessing ... % 3.96/1.31 Prover 5: Preprocessing ... % 3.96/1.31 Prover 0: Preprocessing ... % 3.96/1.31 Prover 2: Preprocessing ... % 3.96/1.31 Prover 6: Preprocessing ... % 5.56/1.56 Prover 5: Constructing countermodel ... % 5.56/1.59 Prover 2: Constructing countermodel ... % 7.10/1.80 Prover 1: Constructing countermodel ... % 7.89/1.84 Prover 6: Proving ... % 7.89/1.85 Prover 3: Constructing countermodel ... % 8.72/1.93 Prover 0: Proving ... % 8.72/1.94 Prover 4: Constructing countermodel ... % 14.17/2.66 Prover 0: proved (1901ms) % 14.17/2.66 % 14.17/2.67 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 14.17/2.67 % 14.17/2.67 Prover 3: stopped % 14.17/2.67 Prover 5: stopped % 14.17/2.68 Prover 6: stopped % 14.17/2.68 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 14.17/2.68 Prover 2: stopped % 14.17/2.68 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 14.17/2.68 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 14.17/2.68 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 14.17/2.68 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 14.99/2.78 Prover 11: Preprocessing ... % 14.99/2.78 Prover 7: Preprocessing ... % 14.99/2.80 Prover 8: Preprocessing ... % 15.76/2.81 Prover 13: Preprocessing ... % 15.76/2.83 Prover 10: Preprocessing ... % 15.76/2.84 Prover 7: Constructing countermodel ... % 15.76/2.87 Prover 13: Constructing countermodel ... % 15.76/2.87 Prover 10: Constructing countermodel ... % 16.55/2.90 Prover 8: Warning: ignoring some quantifiers % 16.55/2.91 Prover 8: Constructing countermodel ... % 17.61/3.04 Prover 11: Constructing countermodel ... % 17.61/3.06 Prover 13: Found proof (size 19) % 17.61/3.06 Prover 13: proved (375ms) % 17.61/3.06 Prover 7: stopped % 17.61/3.06 Prover 8: stopped % 17.61/3.06 Prover 10: stopped % 17.61/3.06 Prover 1: stopped % 17.61/3.06 Prover 4: stopped % 17.61/3.06 Prover 11: stopped % 17.61/3.06 % 17.61/3.07 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 17.61/3.07 % 17.61/3.07 % SZS output start Proof for theBenchmark % 17.61/3.08 Assumptions after simplification: % 17.61/3.08 --------------------------------- % 17.61/3.08 % 17.61/3.08 (main) % 17.61/3.11 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5: % 17.61/3.11 $i] : ? [v6: $i] : ? [v7: $i] : ? [v8: $i] : ? [v9: $i] : ($i(v9) & % 17.61/3.11 $i(v8) & $i(v7) & $i(v6) & $i(v5) & $i(v4) & $i(v3) & $i(v2) & $i(v1) & % 17.61/3.11 $i(v0) & r1(v8, v9) & r1(v7, v8) & r1(v6, v7) & r1(v3, v4) & r1(v2, v3) & % 17.61/3.11 r1(v1, v2) & r1(v0, v6) & r1(v0, v5) & r1(v0, v1) & ~ p5(v5) & ! [v10: $i] % 17.61/3.11 : ! [v11: $i] : ! [v12: $i] : ! [v13: $i] : ( ~ $i(v13) | ~ $i(v12) | ~ % 17.61/3.11 $i(v11) | ~ $i(v10) | ~ p1(v13) | ~ p3(v13) | ~ r1(v12, v13) | ~ % 17.61/3.11 r1(v11, v12) | ~ r1(v10, v11) | ~ r1(v0, v10)) & ! [v10: $i] : ! [v11: % 17.61/3.11 $i] : ! [v12: $i] : ! [v13: $i] : ( ~ $i(v13) | ~ $i(v12) | ~ $i(v11) % 17.61/3.11 | ~ $i(v10) | ~ p1(v13) | ~ p2(v13) | ~ r1(v12, v13) | ~ r1(v11, v12) % 17.61/3.11 | ~ r1(v10, v11) | ~ r1(v0, v10)) & ! [v10: $i] : ! [v11: $i] : ! % 17.61/3.11 [v12: $i] : ! [v13: $i] : ( ~ $i(v13) | ~ $i(v12) | ~ $i(v11) | ~ % 17.61/3.11 $i(v10) | ~ p3(v13) | ~ p2(v13) | ~ r1(v12, v13) | ~ r1(v11, v12) | ~ % 17.61/3.11 r1(v10, v11) | ~ r1(v0, v10)) & ! [v10: $i] : ! [v11: $i] : ! [v12: % 17.61/3.11 $i] : ! [v13: $i] : ( ~ $i(v13) | ~ $i(v12) | ~ $i(v11) | ~ $i(v10) | % 17.61/3.11 ~ r1(v12, v13) | ~ r1(v11, v12) | ~ r1(v10, v11) | ~ r1(v0, v10) | % 17.61/3.11 p1(v13) | p3(v13)) & ! [v10: $i] : ! [v11: $i] : ! [v12: $i] : ! [v13: % 17.61/3.11 $i] : ( ~ $i(v13) | ~ $i(v12) | ~ $i(v11) | ~ $i(v10) | ~ r1(v12, v13) % 17.61/3.11 | ~ r1(v11, v12) | ~ r1(v10, v11) | ~ r1(v0, v10) | p1(v13) | p2(v13)) % 17.61/3.11 & ! [v10: $i] : ! [v11: $i] : ! [v12: $i] : ! [v13: $i] : ( ~ $i(v13) | % 17.61/3.11 ~ $i(v12) | ~ $i(v11) | ~ $i(v10) | ~ r1(v12, v13) | ~ r1(v11, v12) | % 17.61/3.11 ~ r1(v10, v11) | ~ r1(v0, v10) | p3(v13) | p2(v13)) & ! [v10: $i] : ! % 17.61/3.11 [v11: $i] : ( ~ $i(v11) | ~ $i(v10) | ~ r1(v10, v11) | ~ r1(v0, v10) | ? % 17.61/3.11 [v12: $i] : ($i(v12) & r1(v11, v12) & ~ p3(v12))) & ! [v10: $i] : ( ~ % 17.61/3.11 $i(v10) | ~ r1(v0, v10) | ? [v11: $i] : ($i(v11) & r1(v10, v11) & ~ % 17.61/3.11 p4(v11))) & ( ~ p1(v4) | ~ p3(v4) | ~ p2(v4) | ~ p4(v4)) & (p2(v9) | % 17.61/3.11 p4(v9) | p6(v9) | p8(v9))) % 17.61/3.11 % 17.61/3.11 Those formulas are unsatisfiable: % 17.61/3.11 --------------------------------- % 17.61/3.11 % 17.61/3.11 Begin of proof % 17.61/3.11 | % 17.61/3.12 | DELTA: instantiating (main) with fresh symbols all_2_0, all_2_1, all_2_2, % 17.61/3.12 | all_2_3, all_2_4, all_2_5, all_2_6, all_2_7, all_2_8, all_2_9 gives: % 17.61/3.13 | (1) $i(all_2_0) & $i(all_2_1) & $i(all_2_2) & $i(all_2_3) & $i(all_2_4) & % 17.61/3.13 | $i(all_2_5) & $i(all_2_6) & $i(all_2_7) & $i(all_2_8) & $i(all_2_9) & % 17.61/3.13 | r1(all_2_1, all_2_0) & r1(all_2_2, all_2_1) & r1(all_2_3, all_2_2) & % 17.61/3.13 | r1(all_2_6, all_2_5) & r1(all_2_7, all_2_6) & r1(all_2_8, all_2_7) & % 17.61/3.13 | r1(all_2_9, all_2_3) & r1(all_2_9, all_2_4) & r1(all_2_9, all_2_8) & ~ % 17.61/3.13 | p5(all_2_4) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( % 17.61/3.13 | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ p1(v3) | ~ p3(v3) % 17.61/3.13 | | ~ r1(v2, v3) | ~ r1(v1, v2) | ~ r1(v0, v1) | ~ r1(all_2_9, v0)) % 17.61/3.13 | & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | % 17.61/3.13 | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ p1(v3) | ~ p2(v3) | ~ r1(v2, % 17.61/3.13 | v3) | ~ r1(v1, v2) | ~ r1(v0, v1) | ~ r1(all_2_9, v0)) & ! [v0: % 17.61/3.13 | $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | ~ % 17.61/3.13 | $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ p3(v3) | ~ p2(v3) | ~ r1(v2, % 17.61/3.13 | v3) | ~ r1(v1, v2) | ~ r1(v0, v1) | ~ r1(all_2_9, v0)) & ! [v0: % 17.61/3.13 | $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | ~ % 17.61/3.13 | $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ r1(v2, v3) | ~ r1(v1, v2) | ~ % 17.61/3.13 | r1(v0, v1) | ~ r1(all_2_9, v0) | p1(v3) | p3(v3)) & ! [v0: $i] : ! % 17.61/3.13 | [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | ~ $i(v2) | ~ % 17.61/3.13 | $i(v1) | ~ $i(v0) | ~ r1(v2, v3) | ~ r1(v1, v2) | ~ r1(v0, v1) | % 17.61/3.13 | ~ r1(all_2_9, v0) | p1(v3) | p2(v3)) & ! [v0: $i] : ! [v1: $i] : ! % 17.61/3.13 | [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) % 17.61/3.13 | | ~ r1(v2, v3) | ~ r1(v1, v2) | ~ r1(v0, v1) | ~ r1(all_2_9, v0) % 17.61/3.13 | | p3(v3) | p2(v3)) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ % 17.61/3.13 | $i(v0) | ~ r1(v0, v1) | ~ r1(all_2_9, v0) | ? [v2: $i] : ($i(v2) & % 17.61/3.13 | r1(v1, v2) & ~ p3(v2))) & ! [v0: $i] : ( ~ $i(v0) | ~ % 17.61/3.13 | r1(all_2_9, v0) | ? [v1: $i] : ($i(v1) & r1(v0, v1) & ~ p4(v1))) & % 17.61/3.13 | ( ~ p1(all_2_5) | ~ p3(all_2_5) | ~ p2(all_2_5) | ~ p4(all_2_5)) & % 17.61/3.13 | (p2(all_2_0) | p4(all_2_0) | p6(all_2_0) | p8(all_2_0)) % 17.61/3.13 | % 17.61/3.13 | ALPHA: (1) implies: % 17.61/3.14 | (2) r1(all_2_9, all_2_3) % 17.61/3.14 | (3) r1(all_2_3, all_2_2) % 17.61/3.14 | (4) r1(all_2_2, all_2_1) % 18.18/3.14 | (5) r1(all_2_1, all_2_0) % 18.18/3.14 | (6) $i(all_2_3) % 18.18/3.14 | (7) $i(all_2_2) % 18.18/3.14 | (8) $i(all_2_1) % 18.18/3.14 | (9) $i(all_2_0) % 18.18/3.14 | (10) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | % 18.18/3.14 | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ r1(v2, v3) | ~ r1(v1, v2) | % 18.18/3.14 | ~ r1(v0, v1) | ~ r1(all_2_9, v0) | p3(v3) | p2(v3)) % 18.18/3.14 | (11) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | % 18.18/3.14 | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ r1(v2, v3) | ~ r1(v1, v2) | % 18.18/3.14 | ~ r1(v0, v1) | ~ r1(all_2_9, v0) | p1(v3) | p2(v3)) % 18.18/3.14 | (12) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | % 18.18/3.14 | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ r1(v2, v3) | ~ r1(v1, v2) | % 18.18/3.14 | ~ r1(v0, v1) | ~ r1(all_2_9, v0) | p1(v3) | p3(v3)) % 18.18/3.14 | (13) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | % 18.18/3.14 | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ p3(v3) | ~ p2(v3) | ~ r1(v2, % 18.18/3.14 | v3) | ~ r1(v1, v2) | ~ r1(v0, v1) | ~ r1(all_2_9, v0)) % 18.18/3.15 | (14) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | % 18.18/3.15 | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ p1(v3) | ~ p2(v3) | ~ r1(v2, % 18.18/3.15 | v3) | ~ r1(v1, v2) | ~ r1(v0, v1) | ~ r1(all_2_9, v0)) % 18.18/3.15 | (15) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | % 18.18/3.15 | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ p1(v3) | ~ p3(v3) | ~ r1(v2, % 18.18/3.15 | v3) | ~ r1(v1, v2) | ~ r1(v0, v1) | ~ r1(all_2_9, v0)) % 18.18/3.15 | % 18.18/3.15 | GROUND_INST: instantiating (12) with all_2_3, all_2_2, all_2_1, all_2_0, % 18.18/3.15 | simplifying with (2), (3), (4), (5), (6), (7), (8), (9) gives: % 18.18/3.15 | (16) p1(all_2_0) | p3(all_2_0) % 18.18/3.15 | % 18.18/3.15 | GROUND_INST: instantiating (11) with all_2_3, all_2_2, all_2_1, all_2_0, % 18.18/3.15 | simplifying with (2), (3), (4), (5), (6), (7), (8), (9) gives: % 18.18/3.15 | (17) p1(all_2_0) | p2(all_2_0) % 18.18/3.15 | % 18.18/3.15 | GROUND_INST: instantiating (10) with all_2_3, all_2_2, all_2_1, all_2_0, % 18.18/3.15 | simplifying with (2), (3), (4), (5), (6), (7), (8), (9) gives: % 18.18/3.15 | (18) p3(all_2_0) | p2(all_2_0) % 18.18/3.15 | % 18.18/3.15 | BETA: splitting (18) gives: % 18.18/3.15 | % 18.18/3.15 | Case 1: % 18.18/3.15 | | % 18.18/3.15 | | (19) p3(all_2_0) % 18.18/3.15 | | % 18.18/3.15 | | BETA: splitting (17) gives: % 18.18/3.15 | | % 18.18/3.15 | | Case 1: % 18.18/3.15 | | | % 18.18/3.15 | | | (20) p1(all_2_0) % 18.18/3.15 | | | % 18.18/3.16 | | | GROUND_INST: instantiating (15) with all_2_3, all_2_2, all_2_1, all_2_0, % 18.18/3.16 | | | simplifying with (2), (3), (4), (5), (6), (7), (8), (9), % 18.18/3.16 | | | (19), (20) gives: % 18.18/3.16 | | | (21) $false % 18.18/3.16 | | | % 18.18/3.16 | | | CLOSE: (21) is inconsistent. % 18.18/3.16 | | | % 18.18/3.16 | | Case 2: % 18.18/3.16 | | | % 18.18/3.16 | | | (22) p2(all_2_0) % 18.18/3.16 | | | % 18.18/3.16 | | | GROUND_INST: instantiating (13) with all_2_3, all_2_2, all_2_1, all_2_0, % 18.18/3.16 | | | simplifying with (2), (3), (4), (5), (6), (7), (8), (9), % 18.18/3.16 | | | (19), (22) gives: % 18.18/3.16 | | | (23) $false % 18.18/3.16 | | | % 18.18/3.16 | | | CLOSE: (23) is inconsistent. % 18.18/3.16 | | | % 18.18/3.16 | | End of split % 18.18/3.16 | | % 18.18/3.16 | Case 2: % 18.18/3.16 | | % 18.18/3.16 | | (24) p2(all_2_0) % 18.18/3.16 | | % 18.18/3.16 | | BETA: splitting (16) gives: % 18.18/3.16 | | % 18.18/3.16 | | Case 1: % 18.18/3.16 | | | % 18.18/3.16 | | | (25) p1(all_2_0) % 18.18/3.16 | | | % 18.18/3.16 | | | GROUND_INST: instantiating (14) with all_2_3, all_2_2, all_2_1, all_2_0, % 18.18/3.16 | | | simplifying with (2), (3), (4), (5), (6), (7), (8), (9), % 18.18/3.16 | | | (24), (25) gives: % 18.18/3.16 | | | (26) $false % 18.18/3.16 | | | % 18.18/3.16 | | | CLOSE: (26) is inconsistent. % 18.18/3.16 | | | % 18.18/3.17 | | Case 2: % 18.18/3.17 | | | % 18.18/3.17 | | | (27) p3(all_2_0) % 18.18/3.17 | | | % 18.18/3.17 | | | GROUND_INST: instantiating (13) with all_2_3, all_2_2, all_2_1, all_2_0, % 18.18/3.17 | | | simplifying with (2), (3), (4), (5), (6), (7), (8), (9), % 18.18/3.17 | | | (24), (27) gives: % 18.18/3.17 | | | (28) $false % 18.18/3.17 | | | % 18.18/3.17 | | | CLOSE: (28) is inconsistent. % 18.18/3.17 | | | % 18.18/3.17 | | End of split % 18.18/3.17 | | % 18.18/3.17 | End of split % 18.18/3.17 | % 18.18/3.17 End of proof % 18.18/3.17 % SZS output end Proof for theBenchmark % 18.18/3.17 % 18.18/3.17 2441ms %------------------------------------------------------------------------------