%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : LCL542+1 : TPTP v9.3.1. Bugfixed v9.2.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 : Mon Sep 7 12:54:18 PM UTC 2026 % Result : Theorem 19.02s 3.27s % Output : Proof 47.98s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : LCL542+1 : TPTP v9.3.1. Bugfixed v9.2.0. % 0.00/0.04 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.09/0.35 % Computer : n031.cluster.edu % 0.09/0.35 % Model : x86_64 x86_64 % 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.35 % Memory : 8046.5625MB % 0.09/0.35 % OS : Linux 6.8.0-71-generic % 0.09/0.35 % CPULimit : 300 % 0.09/0.35 % WCLimit : 300 % 0.09/0.35 % DateTime : Sat Sep 5 21:53:10 UTC 2026 % 0.09/0.35 % CPUTime : % 0.09/0.37 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.71 ________ _____ % 0.67/0.71 ___ __ \_________(_)________________________________ % 0.67/0.71 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.67/0.71 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.67/0.71 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.67/0.71 % 0.67/0.71 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.67/0.71 (2023-06-19) % 0.67/0.71 % 0.67/0.71 (c) Philipp Rümmer, 2009-2023 % 0.67/0.71 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.67/0.71 Amanda Stjerna. % 0.67/0.71 Free software under BSD-3-Clause. % 0.67/0.71 % 0.67/0.71 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.67/0.71 % 0.67/0.71 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ... % 0.67/0.73 Running up to 7 provers in parallel. % 0.67/0.74 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.67/0.74 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.67/0.74 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.67/0.74 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.67/0.74 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.67/0.74 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.67/0.74 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 5.59/1.51 Prover 1: Preprocessing ... % 5.59/1.51 Prover 4: Preprocessing ... % 5.59/1.56 Prover 5: Preprocessing ... % 5.59/1.56 Prover 2: Preprocessing ... % 5.59/1.56 Prover 0: Preprocessing ... % 5.59/1.56 Prover 3: Preprocessing ... % 5.59/1.56 Prover 6: Preprocessing ... % 16.65/2.98 Prover 1: Constructing countermodel ... % 16.65/3.00 Prover 6: Constructing countermodel ... % 16.65/3.01 Prover 5: Proving ... % 16.65/3.03 Prover 3: Constructing countermodel ... % 17.77/3.11 Prover 0: Proving ... % 17.77/3.11 Prover 4: Constructing countermodel ... % 19.02/3.24 Prover 2: Proving ... % 19.02/3.26 Prover 6: proved (2520ms) % 19.02/3.26 % 19.02/3.27 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 19.02/3.27 % 19.02/3.27 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 19.02/3.27 Prover 2: stopped % 19.02/3.27 Prover 0: stopped % 19.02/3.28 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 19.02/3.28 Prover 5: stopped % 19.02/3.28 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 19.02/3.28 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 19.02/3.28 Prover 3: stopped % 19.02/3.29 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 20.58/3.40 Prover 8: Preprocessing ... % 20.58/3.44 Prover 7: Preprocessing ... % 20.58/3.48 Prover 11: Preprocessing ... % 21.41/3.58 Prover 13: Preprocessing ... % 22.18/3.60 Prover 10: Preprocessing ... % 22.18/3.66 Prover 8: Warning: ignoring some quantifiers % 22.18/3.70 Prover 8: Constructing countermodel ... % 24.57/3.93 Prover 7: Constructing countermodel ... % 24.57/3.95 Prover 13: Constructing countermodel ... % 25.83/4.08 Prover 11: Constructing countermodel ... % 25.83/4.11 Prover 10: Constructing countermodel ... % 46.74/6.78 Prover 10: Found proof (size 41) % 46.74/6.78 Prover 10: proved (3505ms) % 46.74/6.78 Prover 7: stopped % 46.74/6.79 Prover 8: stopped % 46.74/6.79 Prover 1: stopped % 46.74/6.79 Prover 4: stopped % 46.74/6.79 Prover 11: stopped % 47.52/6.80 Prover 13: stopped % 47.52/6.80 % 47.52/6.80 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 47.52/6.80 % 47.52/6.81 % SZS output start Proof for theBenchmark % 47.52/6.82 Assumptions after simplification: % 47.52/6.82 --------------------------------- % 47.52/6.82 % 47.52/6.82 (and_1) % 47.52/6.88 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ($i(v1) & $i(v0) & % 47.52/6.88 ((and(v0, v1) = v2 & implies(v2, v0) = v3 & $i(v3) & $i(v2) & ~ and_1 & ~ % 47.52/6.88 is_a_theorem(v3)) | (and_1 & ! [v4: $i] : ! [v5: $i] : ! [v6: $i] : % 47.52/6.88 ! [v7: $i] : ( ~ (and(v4, v5) = v6) | ~ (implies(v6, v4) = v7) | ~ % 47.52/6.88 $i(v5) | ~ $i(v4) | is_a_theorem(v7))))) % 47.52/6.88 % 47.52/6.88 (axiom_m2) % 47.52/6.89 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ($i(v1) & $i(v0) & % 47.52/6.89 ((strict_implies(v2, v0) = v3 & and(v0, v1) = v2 & $i(v3) & $i(v2) & ~ % 47.52/6.89 axiom_m2 & ~ is_a_theorem(v3)) | (axiom_m2 & ! [v4: $i] : ! [v5: $i] % 47.52/6.89 : ! [v6: $i] : ! [v7: $i] : ( ~ (strict_implies(v6, v4) = v7) | ~ % 47.52/6.89 (and(v4, v5) = v6) | ~ $i(v5) | ~ $i(v4) | is_a_theorem(v7))))) % 47.52/6.89 % 47.52/6.89 (hilbert_and_1) % 47.52/6.89 and_1 % 47.52/6.89 % 47.52/6.89 (hilbert_or_3) % 47.52/6.89 or_3 % 47.52/6.89 % 47.52/6.89 (km4b_necessitation) % 47.52/6.89 necessitation % 47.52/6.89 % 47.52/6.89 (necessitation) % 47.52/6.89 ? [v0: $i] : ? [v1: $i] : ($i(v0) & ((necessarily(v0) = v1 & $i(v1) & % 47.52/6.89 is_a_theorem(v0) & ~ necessitation & ~ is_a_theorem(v1)) | % 47.52/6.89 (necessitation & ! [v2: $i] : ! [v3: $i] : ( ~ (necessarily(v2) = v3) | % 47.52/6.89 ~ $i(v2) | ~ is_a_theorem(v2) | is_a_theorem(v3))))) % 47.52/6.89 % 47.52/6.89 (op_strict_implies) % 47.98/6.90 ~ op_strict_implies | ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ % 47.98/6.90 (strict_implies(v0, v1) = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : % 47.98/6.90 (necessarily(v3) = v2 & implies(v0, v1) = v3 & $i(v3) & $i(v2))) % 47.98/6.90 % 47.98/6.90 (or_3) % 47.98/6.91 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5: % 47.98/6.91 $i] : ? [v6: $i] : ? [v7: $i] : ? [v8: $i] : ($i(v2) & $i(v1) & $i(v0) & % 47.98/6.91 ((or(v0, v1) = v5 & implies(v5, v2) = v6 & implies(v4, v6) = v7 & % 47.98/6.91 implies(v3, v7) = v8 & implies(v1, v2) = v4 & implies(v0, v2) = v3 & % 47.98/6.91 $i(v8) & $i(v7) & $i(v6) & $i(v5) & $i(v4) & $i(v3) & ~ or_3 & ~ % 47.98/6.91 is_a_theorem(v8)) | (or_3 & ! [v9: $i] : ! [v10: $i] : ! [v11: $i] : % 47.98/6.91 ! [v12: $i] : ! [v13: $i] : ! [v14: $i] : ! [v15: $i] : ! [v16: $i] % 47.98/6.91 : ! [v17: $i] : ( ~ (or(v9, v10) = v14) | ~ (implies(v14, v11) = v15) % 47.98/6.91 | ~ (implies(v13, v15) = v16) | ~ (implies(v12, v16) = v17) | ~ % 47.98/6.91 (implies(v10, v11) = v13) | ~ (implies(v9, v11) = v12) | ~ $i(v11) | % 47.98/6.91 ~ $i(v10) | ~ $i(v9) | is_a_theorem(v17))))) % 47.98/6.91 % 47.98/6.91 (s1_0_axiom_m2) % 47.98/6.91 ~ axiom_m2 % 47.98/6.91 % 47.98/6.91 (s1_0_op_strict_implies) % 47.98/6.91 op_strict_implies % 47.98/6.91 % 47.98/6.91 Further assumptions not needed in the proof: % 47.98/6.91 -------------------------------------------- % 47.98/6.91 adjunction, and_2, and_3, axiom_4, axiom_5, axiom_B, axiom_K, axiom_M, axiom_m1, % 47.98/6.91 axiom_m10, axiom_m3, axiom_m4, axiom_m5, axiom_m6, axiom_m7, axiom_m8, axiom_m9, % 47.98/6.91 axiom_s1, axiom_s2, axiom_s3, axiom_s4, cn1, cn2, cn3, equivalence_1, % 47.98/6.91 equivalence_2, equivalence_3, hilbert_and_2, hilbert_and_3, % 47.98/6.91 hilbert_equivalence_1, hilbert_equivalence_2, hilbert_equivalence_3, % 47.98/6.91 hilbert_implies_1, hilbert_implies_2, hilbert_implies_3, hilbert_modus_ponens, % 47.98/6.91 hilbert_modus_tollens, hilbert_op_equiv, hilbert_op_implies_and, hilbert_op_or, % 47.98/6.91 hilbert_or_1, hilbert_or_2, implies_1, implies_2, implies_3, km4b_axiom_4, % 47.98/6.91 km4b_axiom_B, km4b_axiom_K, km4b_axiom_M, km4b_op_possibly, kn1, kn2, kn3, % 47.98/6.91 modus_ponens, modus_ponens_strict_implies, modus_tollens, op_and, op_equiv, % 47.98/6.91 op_implies_and, op_implies_or, op_necessarily, op_or, op_possibly, % 47.98/6.91 op_strict_equiv, or_1, or_2, r1, r2, r3, r4, r5, s1_0_op_equiv, s1_0_op_implies, % 47.98/6.91 s1_0_op_or, s1_0_op_possibly, s1_0_op_strict_equiv, substitution_of_equivalents, % 47.98/6.91 substitution_strict_equiv, use_substitution_of_equivalents % 47.98/6.91 % 47.98/6.91 Those formulas are unsatisfiable: % 47.98/6.91 --------------------------------- % 47.98/6.91 % 47.98/6.91 Begin of proof % 47.98/6.91 | % 47.98/6.91 | DELTA: instantiating (necessitation) with fresh symbols all_4_0, all_4_1 % 47.98/6.91 | gives: % 47.98/6.92 | (1) $i(all_4_1) & ((necessarily(all_4_1) = all_4_0 & $i(all_4_0) & % 47.98/6.92 | is_a_theorem(all_4_1) & ~ necessitation & ~ % 47.98/6.92 | is_a_theorem(all_4_0)) | (necessitation & ! [v0: $i] : ! [v1: $i] % 47.98/6.92 | : ( ~ (necessarily(v0) = v1) | ~ $i(v0) | ~ is_a_theorem(v0) | % 47.98/6.92 | is_a_theorem(v1)))) % 47.98/6.92 | % 47.98/6.92 | ALPHA: (1) implies: % 47.98/6.92 | (2) (necessarily(all_4_1) = all_4_0 & $i(all_4_0) & is_a_theorem(all_4_1) & % 47.98/6.92 | ~ necessitation & ~ is_a_theorem(all_4_0)) | (necessitation & ! % 47.98/6.92 | [v0: $i] : ! [v1: $i] : ( ~ (necessarily(v0) = v1) | ~ $i(v0) | ~ % 47.98/6.92 | is_a_theorem(v0) | is_a_theorem(v1))) % 47.98/6.92 | % 47.98/6.92 | DELTA: instantiating (and_1) with fresh symbols all_24_0, all_24_1, all_24_2, % 47.98/6.92 | all_24_3 gives: % 47.98/6.93 | (3) $i(all_24_2) & $i(all_24_3) & ((and(all_24_3, all_24_2) = all_24_1 & % 47.98/6.93 | implies(all_24_1, all_24_3) = all_24_0 & $i(all_24_0) & % 47.98/6.93 | $i(all_24_1) & ~ and_1 & ~ is_a_theorem(all_24_0)) | (and_1 & ! % 47.98/6.93 | [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ (and(v0, % 47.98/6.93 | v1) = v2) | ~ (implies(v2, v0) = v3) | ~ $i(v1) | ~ $i(v0) % 47.98/6.93 | | is_a_theorem(v3)))) % 47.98/6.93 | % 47.98/6.93 | ALPHA: (3) implies: % 47.98/6.93 | (4) (and(all_24_3, all_24_2) = all_24_1 & implies(all_24_1, all_24_3) = % 47.98/6.93 | all_24_0 & $i(all_24_0) & $i(all_24_1) & ~ and_1 & ~ % 47.98/6.93 | is_a_theorem(all_24_0)) | (and_1 & ! [v0: $i] : ! [v1: $i] : ! % 47.98/6.93 | [v2: $i] : ! [v3: $i] : ( ~ (and(v0, v1) = v2) | ~ (implies(v2, v0) % 47.98/6.93 | = v3) | ~ $i(v1) | ~ $i(v0) | is_a_theorem(v3))) % 47.98/6.93 | % 47.98/6.93 | DELTA: instantiating (axiom_m2) with fresh symbols all_32_0, all_32_1, % 47.98/6.93 | all_32_2, all_32_3 gives: % 47.98/6.93 | (5) $i(all_32_2) & $i(all_32_3) & ((strict_implies(all_32_1, all_32_3) = % 47.98/6.93 | all_32_0 & and(all_32_3, all_32_2) = all_32_1 & $i(all_32_0) & % 47.98/6.93 | $i(all_32_1) & ~ axiom_m2 & ~ is_a_theorem(all_32_0)) | (axiom_m2 % 47.98/6.93 | & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ % 47.98/6.93 | (strict_implies(v2, v0) = v3) | ~ (and(v0, v1) = v2) | ~ $i(v1) % 47.98/6.93 | | ~ $i(v0) | is_a_theorem(v3)))) % 47.98/6.93 | % 47.98/6.93 | ALPHA: (5) implies: % 47.98/6.94 | (6) $i(all_32_3) % 47.98/6.94 | (7) $i(all_32_2) % 47.98/6.94 | (8) (strict_implies(all_32_1, all_32_3) = all_32_0 & and(all_32_3, % 47.98/6.94 | all_32_2) = all_32_1 & $i(all_32_0) & $i(all_32_1) & ~ axiom_m2 & % 47.98/6.94 | ~ is_a_theorem(all_32_0)) | (axiom_m2 & ! [v0: $i] : ! [v1: $i] : % 47.98/6.94 | ! [v2: $i] : ! [v3: $i] : ( ~ (strict_implies(v2, v0) = v3) | ~ % 47.98/6.94 | (and(v0, v1) = v2) | ~ $i(v1) | ~ $i(v0) | is_a_theorem(v3))) % 47.98/6.94 | % 47.98/6.94 | DELTA: instantiating (or_3) with fresh symbols all_94_0, all_94_1, all_94_2, % 47.98/6.94 | all_94_3, all_94_4, all_94_5, all_94_6, all_94_7, all_94_8 gives: % 47.98/6.94 | (9) $i(all_94_6) & $i(all_94_7) & $i(all_94_8) & ((or(all_94_8, all_94_7) = % 47.98/6.94 | all_94_3 & implies(all_94_3, all_94_6) = all_94_2 & % 47.98/6.94 | implies(all_94_4, all_94_2) = all_94_1 & implies(all_94_5, % 47.98/6.94 | all_94_1) = all_94_0 & implies(all_94_7, all_94_6) = all_94_4 & % 47.98/6.94 | implies(all_94_8, all_94_6) = all_94_5 & $i(all_94_0) & % 47.98/6.94 | $i(all_94_1) & $i(all_94_2) & $i(all_94_3) & $i(all_94_4) & % 47.98/6.94 | $i(all_94_5) & ~ or_3 & ~ is_a_theorem(all_94_0)) | (or_3 & ! % 47.98/6.94 | [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : % 47.98/6.94 | ! [v5: $i] : ! [v6: $i] : ! [v7: $i] : ! [v8: $i] : ( ~ (or(v0, % 47.98/6.94 | v1) = v5) | ~ (implies(v5, v2) = v6) | ~ (implies(v4, v6) = % 47.98/6.94 | v7) | ~ (implies(v3, v7) = v8) | ~ (implies(v1, v2) = v4) | % 47.98/6.94 | ~ (implies(v0, v2) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 47.98/6.94 | is_a_theorem(v8)))) % 47.98/6.94 | % 47.98/6.94 | ALPHA: (9) implies: % 47.98/6.95 | (10) (or(all_94_8, all_94_7) = all_94_3 & implies(all_94_3, all_94_6) = % 47.98/6.95 | all_94_2 & implies(all_94_4, all_94_2) = all_94_1 & % 47.98/6.95 | implies(all_94_5, all_94_1) = all_94_0 & implies(all_94_7, all_94_6) % 47.98/6.95 | = all_94_4 & implies(all_94_8, all_94_6) = all_94_5 & $i(all_94_0) & % 47.98/6.95 | $i(all_94_1) & $i(all_94_2) & $i(all_94_3) & $i(all_94_4) & % 47.98/6.95 | $i(all_94_5) & ~ or_3 & ~ is_a_theorem(all_94_0)) | (or_3 & ! % 47.98/6.95 | [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : % 47.98/6.95 | ! [v5: $i] : ! [v6: $i] : ! [v7: $i] : ! [v8: $i] : ( ~ (or(v0, % 47.98/6.95 | v1) = v5) | ~ (implies(v5, v2) = v6) | ~ (implies(v4, v6) = % 47.98/6.95 | v7) | ~ (implies(v3, v7) = v8) | ~ (implies(v1, v2) = v4) | ~ % 47.98/6.95 | (implies(v0, v2) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 47.98/6.95 | is_a_theorem(v8))) % 47.98/6.95 | % 47.98/6.95 | BETA: splitting (8) gives: % 47.98/6.95 | % 47.98/6.95 | Case 1: % 47.98/6.95 | | % 47.98/6.95 | | (11) strict_implies(all_32_1, all_32_3) = all_32_0 & and(all_32_3, % 47.98/6.95 | | all_32_2) = all_32_1 & $i(all_32_0) & $i(all_32_1) & ~ axiom_m2 & % 47.98/6.95 | | ~ is_a_theorem(all_32_0) % 47.98/6.95 | | % 47.98/6.95 | | ALPHA: (11) implies: % 47.98/6.95 | | (12) ~ is_a_theorem(all_32_0) % 47.98/6.95 | | (13) $i(all_32_1) % 47.98/6.95 | | (14) and(all_32_3, all_32_2) = all_32_1 % 47.98/6.95 | | (15) strict_implies(all_32_1, all_32_3) = all_32_0 % 47.98/6.95 | | % 47.98/6.95 | | BETA: splitting (2) gives: % 47.98/6.95 | | % 47.98/6.95 | | Case 1: % 47.98/6.95 | | | % 47.98/6.95 | | | (16) necessarily(all_4_1) = all_4_0 & $i(all_4_0) & % 47.98/6.95 | | | is_a_theorem(all_4_1) & ~ necessitation & ~ % 47.98/6.95 | | | is_a_theorem(all_4_0) % 47.98/6.95 | | | % 47.98/6.96 | | | ALPHA: (16) implies: % 47.98/6.96 | | | (17) ~ necessitation % 47.98/6.96 | | | % 47.98/6.96 | | | PRED_UNIFY: (17), (km4b_necessitation) imply: % 47.98/6.96 | | | (18) $false % 47.98/6.96 | | | % 47.98/6.96 | | | CLOSE: (18) is inconsistent. % 47.98/6.96 | | | % 47.98/6.96 | | Case 2: % 47.98/6.96 | | | % 47.98/6.96 | | | (19) necessitation & ! [v0: $i] : ! [v1: $i] : ( ~ (necessarily(v0) = % 47.98/6.96 | | | v1) | ~ $i(v0) | ~ is_a_theorem(v0) | is_a_theorem(v1)) % 47.98/6.96 | | | % 47.98/6.96 | | | ALPHA: (19) implies: % 47.98/6.96 | | | (20) ! [v0: $i] : ! [v1: $i] : ( ~ (necessarily(v0) = v1) | ~ $i(v0) % 47.98/6.96 | | | | ~ is_a_theorem(v0) | is_a_theorem(v1)) % 47.98/6.96 | | | % 47.98/6.96 | | | BETA: splitting (op_strict_implies) gives: % 47.98/6.96 | | | % 47.98/6.96 | | | Case 1: % 47.98/6.96 | | | | % 47.98/6.96 | | | | (21) ~ op_strict_implies % 47.98/6.96 | | | | % 47.98/6.96 | | | | PRED_UNIFY: (21), (s1_0_op_strict_implies) imply: % 47.98/6.96 | | | | (22) $false % 47.98/6.96 | | | | % 47.98/6.96 | | | | CLOSE: (22) is inconsistent. % 47.98/6.96 | | | | % 47.98/6.96 | | | Case 2: % 47.98/6.96 | | | | % 47.98/6.96 | | | | (23) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ % 47.98/6.96 | | | | (strict_implies(v0, v1) = v2) | ~ $i(v1) | ~ $i(v0) | ? % 47.98/6.96 | | | | [v3: $i] : (necessarily(v3) = v2 & implies(v0, v1) = v3 & % 47.98/6.96 | | | | $i(v3) & $i(v2))) % 47.98/6.96 | | | | % 47.98/6.96 | | | | BETA: splitting (4) gives: % 47.98/6.96 | | | | % 47.98/6.96 | | | | Case 1: % 47.98/6.96 | | | | | % 47.98/6.96 | | | | | (24) and(all_24_3, all_24_2) = all_24_1 & implies(all_24_1, % 47.98/6.96 | | | | | all_24_3) = all_24_0 & $i(all_24_0) & $i(all_24_1) & ~ % 47.98/6.96 | | | | | and_1 & ~ is_a_theorem(all_24_0) % 47.98/6.96 | | | | | % 47.98/6.96 | | | | | ALPHA: (24) implies: % 47.98/6.96 | | | | | (25) ~ and_1 % 47.98/6.97 | | | | | % 47.98/6.97 | | | | | PRED_UNIFY: (25), (hilbert_and_1) imply: % 47.98/6.97 | | | | | (26) $false % 47.98/6.97 | | | | | % 47.98/6.97 | | | | | CLOSE: (26) is inconsistent. % 47.98/6.97 | | | | | % 47.98/6.97 | | | | Case 2: % 47.98/6.97 | | | | | % 47.98/6.97 | | | | | (27) and_1 & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] % 47.98/6.97 | | | | | : ( ~ (and(v0, v1) = v2) | ~ (implies(v2, v0) = v3) | ~ % 47.98/6.97 | | | | | $i(v1) | ~ $i(v0) | is_a_theorem(v3)) % 47.98/6.97 | | | | | % 47.98/6.97 | | | | | ALPHA: (27) implies: % 47.98/6.97 | | | | | (28) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ % 47.98/6.97 | | | | | (and(v0, v1) = v2) | ~ (implies(v2, v0) = v3) | ~ $i(v1) | % 47.98/6.97 | | | | | ~ $i(v0) | is_a_theorem(v3)) % 47.98/6.97 | | | | | % 47.98/6.97 | | | | | BETA: splitting (10) gives: % 47.98/6.97 | | | | | % 47.98/6.97 | | | | | Case 1: % 47.98/6.97 | | | | | | % 47.98/6.97 | | | | | | (29) or(all_94_8, all_94_7) = all_94_3 & implies(all_94_3, % 47.98/6.97 | | | | | | all_94_6) = all_94_2 & implies(all_94_4, all_94_2) = % 47.98/6.97 | | | | | | all_94_1 & implies(all_94_5, all_94_1) = all_94_0 & % 47.98/6.97 | | | | | | implies(all_94_7, all_94_6) = all_94_4 & implies(all_94_8, % 47.98/6.97 | | | | | | all_94_6) = all_94_5 & $i(all_94_0) & $i(all_94_1) & % 47.98/6.97 | | | | | | $i(all_94_2) & $i(all_94_3) & $i(all_94_4) & $i(all_94_5) & % 47.98/6.97 | | | | | | ~ or_3 & ~ is_a_theorem(all_94_0) % 47.98/6.97 | | | | | | % 47.98/6.97 | | | | | | ALPHA: (29) implies: % 47.98/6.97 | | | | | | (30) ~ or_3 % 47.98/6.97 | | | | | | % 47.98/6.97 | | | | | | PRED_UNIFY: (30), (hilbert_or_3) imply: % 47.98/6.97 | | | | | | (31) $false % 47.98/6.97 | | | | | | % 47.98/6.97 | | | | | | CLOSE: (31) is inconsistent. % 47.98/6.97 | | | | | | % 47.98/6.97 | | | | | Case 2: % 47.98/6.97 | | | | | | % 47.98/6.97 | | | | | | % 47.98/6.97 | | | | | | GROUND_INST: instantiating (23) with all_32_1, all_32_3, all_32_0, % 47.98/6.97 | | | | | | simplifying with (6), (13), (15) gives: % 47.98/6.97 | | | | | | (32) ? [v0: $i] : (necessarily(v0) = all_32_0 & % 47.98/6.97 | | | | | | implies(all_32_1, all_32_3) = v0 & $i(v0) & $i(all_32_0)) % 47.98/6.97 | | | | | | % 47.98/6.97 | | | | | | DELTA: instantiating (32) with fresh symbol all_216_0 gives: % 47.98/6.98 | | | | | | (33) necessarily(all_216_0) = all_32_0 & implies(all_32_1, % 47.98/6.98 | | | | | | all_32_3) = all_216_0 & $i(all_216_0) & $i(all_32_0) % 47.98/6.98 | | | | | | % 47.98/6.98 | | | | | | ALPHA: (33) implies: % 47.98/6.98 | | | | | | (34) $i(all_216_0) % 47.98/6.98 | | | | | | (35) implies(all_32_1, all_32_3) = all_216_0 % 47.98/6.98 | | | | | | (36) necessarily(all_216_0) = all_32_0 % 47.98/6.98 | | | | | | % 47.98/6.98 | | | | | | GROUND_INST: instantiating (28) with all_32_3, all_32_2, all_32_1, % 47.98/6.98 | | | | | | all_216_0, simplifying with (6), (7), (14), (35) gives: % 47.98/6.98 | | | | | | (37) is_a_theorem(all_216_0) % 47.98/6.98 | | | | | | % 47.98/6.98 | | | | | | GROUND_INST: instantiating (20) with all_216_0, all_32_0, % 47.98/6.98 | | | | | | simplifying with (12), (34), (36), (37) gives: % 47.98/6.98 | | | | | | (38) $false % 47.98/6.98 | | | | | | % 47.98/6.98 | | | | | | CLOSE: (38) is inconsistent. % 47.98/6.98 | | | | | | % 47.98/6.98 | | | | | End of split % 47.98/6.98 | | | | | % 47.98/6.98 | | | | End of split % 47.98/6.98 | | | | % 47.98/6.98 | | | End of split % 47.98/6.98 | | | % 47.98/6.98 | | End of split % 47.98/6.98 | | % 47.98/6.98 | Case 2: % 47.98/6.98 | | % 47.98/6.98 | | (39) axiom_m2 & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( % 47.98/6.98 | | ~ (strict_implies(v2, v0) = v3) | ~ (and(v0, v1) = v2) | ~ % 47.98/6.98 | | $i(v1) | ~ $i(v0) | is_a_theorem(v3)) % 47.98/6.98 | | % 47.98/6.98 | | ALPHA: (39) implies: % 47.98/6.98 | | (40) axiom_m2 % 47.98/6.98 | | % 47.98/6.98 | | PRED_UNIFY: (40), (s1_0_axiom_m2) imply: % 47.98/6.98 | | (41) $false % 47.98/6.98 | | % 47.98/6.98 | | CLOSE: (41) is inconsistent. % 47.98/6.98 | | % 47.98/6.98 | End of split % 47.98/6.98 | % 47.98/6.98 End of proof % 47.98/6.98 % SZS output end Proof for theBenchmark % 47.98/6.98 % 47.98/6.98 6273ms %------------------------------------------------------------------------------