%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : GEO111+1 : TPTP v8.1.2. Released v2.4.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 : Wed Aug 30 23:21:28 EDT 2023 % Result : Theorem 8.43s 1.86s % Output : Proof 12.64s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : GEO111+1 : TPTP v8.1.2. Released v2.4.0. % 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.34 % Computer : n016.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 300 % 0.12/0.34 % DateTime : Wed Aug 30 00:32:31 EDT 2023 % 0.12/0.34 % CPUTime : % 0.63/0.62 ________ _____ % 0.63/0.62 ___ __ \_________(_)________________________________ % 0.63/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.63/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.63/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.63/0.62 % 0.63/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.63/0.62 (2023-06-19) % 0.63/0.62 % 0.63/0.62 (c) Philipp Rümmer, 2009-2023 % 0.63/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.63/0.62 Amanda Stjerna. % 0.63/0.62 Free software under BSD-3-Clause. % 0.63/0.62 % 0.63/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.63/0.62 % 0.63/0.62 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.68/0.64 Running up to 7 provers in parallel. % 0.68/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.68/0.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.68/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.68/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.68/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.68/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.68/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 2.79/1.17 Prover 4: Preprocessing ... % 2.79/1.17 Prover 1: Preprocessing ... % 3.46/1.21 Prover 0: Preprocessing ... % 3.46/1.21 Prover 3: Preprocessing ... % 3.46/1.21 Prover 5: Preprocessing ... % 3.46/1.21 Prover 2: Preprocessing ... % 3.46/1.21 Prover 6: Preprocessing ... % 6.18/1.54 Prover 5: Proving ... % 6.18/1.55 Prover 2: Proving ... % 6.18/1.60 Prover 3: Warning: ignoring some quantifiers % 6.18/1.60 Prover 1: Warning: ignoring some quantifiers % 6.18/1.61 Prover 3: Constructing countermodel ... % 6.80/1.62 Prover 1: Constructing countermodel ... % 6.80/1.65 Prover 6: Proving ... % 8.43/1.86 Prover 5: proved (1201ms) % 8.43/1.86 % 8.43/1.86 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 8.43/1.86 % 8.43/1.86 Prover 3: stopped % 8.43/1.86 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 8.43/1.86 Prover 2: stopped % 8.43/1.86 Prover 6: stopped % 8.43/1.86 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 8.43/1.88 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 8.43/1.88 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 9.01/1.93 Prover 10: Preprocessing ... % 9.01/1.93 Prover 7: Preprocessing ... % 9.01/1.94 Prover 8: Preprocessing ... % 9.01/1.94 Prover 11: Preprocessing ... % 9.56/1.99 Prover 7: Warning: ignoring some quantifiers % 9.56/2.00 Prover 7: Constructing countermodel ... % 9.56/2.02 Prover 10: Warning: ignoring some quantifiers % 9.56/2.02 Prover 8: Warning: ignoring some quantifiers % 9.56/2.03 Prover 4: Warning: ignoring some quantifiers % 9.56/2.04 Prover 8: Constructing countermodel ... % 9.56/2.04 Prover 10: Constructing countermodel ... % 10.28/2.08 Prover 4: Constructing countermodel ... % 10.75/2.13 Prover 0: Proving ... % 10.75/2.15 Prover 0: stopped % 10.75/2.15 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 10.75/2.18 Prover 13: Preprocessing ... % 11.45/2.22 Prover 13: Warning: ignoring some quantifiers % 11.45/2.22 Prover 13: Constructing countermodel ... % 12.02/2.29 Prover 7: Found proof (size 38) % 12.02/2.29 Prover 7: proved (430ms) % 12.02/2.29 Prover 13: stopped % 12.02/2.29 Prover 10: stopped % 12.02/2.29 Prover 4: stopped % 12.02/2.29 Prover 8: stopped % 12.02/2.29 Prover 1: stopped % 12.02/2.36 Prover 11: Warning: ignoring some quantifiers % 12.47/2.38 Prover 11: Constructing countermodel ... % 12.47/2.39 Prover 11: stopped % 12.47/2.39 % 12.51/2.39 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 12.51/2.39 % 12.51/2.39 % SZS output start Proof for theBenchmark % 12.51/2.40 Assumptions after simplification: % 12.51/2.40 --------------------------------- % 12.51/2.40 % 12.51/2.40 (between_c_defn) % 12.51/2.40 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v3 = v1 % 12.51/2.40 | ~ $i(v4) | ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 12.51/2.40 inner_point(v2, v4) | ~ end_point(v3, v4) | ~ end_point(v1, v4) | ~ % 12.51/2.40 part_of(v4, v0) | between_c(v0, v1, v2, v3)) & ! [v0: $i] : ! [v1: $i] : % 12.51/2.40 ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 12.51/2.40 between_c(v0, v1, v2, v3) | ? [v4: $i] : ($i(v4) & inner_point(v2, v4) & % 12.51/2.40 end_point(v3, v4) & end_point(v1, v4) & part_of(v4, v0))) & ! [v0: $i] : % 12.60/2.40 ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ % 12.60/2.41 between_c(v0, v1, v2, v1)) % 12.60/2.41 % 12.60/2.41 (end_point_defn) % 12.60/2.41 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | ~ $i(v2) % 12.60/2.41 | ~ $i(v1) | ~ $i(v0) | ~ end_point(v0, v1) | ~ incident_c(v0, v3) | ~ % 12.60/2.41 incident_c(v0, v2) | ~ part_of(v3, v1) | ~ part_of(v2, v1) | part_of(v3, % 12.60/2.41 v2) | part_of(v2, v3)) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ % 12.60/2.41 $i(v0) | ~ end_point(v0, v1) | incident_c(v0, v1)) & ! [v0: $i] : ! [v1: % 12.60/2.41 $i] : ( ~ $i(v1) | ~ $i(v0) | ~ incident_c(v0, v1) | end_point(v0, v1) | % 12.60/2.41 ? [v2: $i] : ? [v3: $i] : ($i(v3) & $i(v2) & incident_c(v0, v3) & % 12.60/2.41 incident_c(v0, v2) & part_of(v3, v1) & part_of(v2, v1) & ~ part_of(v3, % 12.60/2.41 v2) & ~ part_of(v2, v3))) % 12.60/2.41 % 12.60/2.41 (inner_point_defn) % 12.60/2.41 ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ inner_point(v0, v1) | % 12.60/2.41 ~ end_point(v0, v1)) & ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | % 12.60/2.41 ~ inner_point(v0, v1) | incident_c(v0, v1)) & ! [v0: $i] : ! [v1: $i] : ( % 12.60/2.41 ~ $i(v1) | ~ $i(v0) | ~ incident_c(v0, v1) | inner_point(v0, v1) | % 12.60/2.41 end_point(v0, v1)) % 12.60/2.41 % 12.60/2.41 (part_of_defn) % 12.60/2.41 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | % 12.60/2.41 ~ incident_c(v2, v1) | ~ part_of(v1, v0) | incident_c(v2, v0)) & ? [v0: % 12.60/2.41 $i] : ? [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | part_of(v1, v0) | ? [v2: $i] : % 12.60/2.41 ($i(v2) & incident_c(v2, v1) & ~ incident_c(v2, v0))) % 12.60/2.41 % 12.60/2.41 (theorem_3_8_1) % 12.64/2.41 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ($i(v3) & $i(v2) & % 12.64/2.41 $i(v1) & $i(v0) & between_c(v0, v1, v2, v3) & (v3 = v2 | v3 = v1 | v2 = v1 | % 12.64/2.41 ~ incident_c(v3, v0) | ~ incident_c(v2, v0) | ~ incident_c(v1, v0))) % 12.64/2.41 % 12.64/2.41 Further assumptions not needed in the proof: % 12.64/2.41 -------------------------------------------- % 12.64/2.42 c1, c2, c3, c4, c5, c6, c7, c8, c9, closed_defn, meet_defn, open_defn, sum_defn % 12.64/2.42 % 12.64/2.42 Those formulas are unsatisfiable: % 12.64/2.42 --------------------------------- % 12.64/2.42 % 12.64/2.42 Begin of proof % 12.64/2.42 | % 12.64/2.42 | ALPHA: (part_of_defn) implies: % 12.64/2.42 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ % 12.64/2.42 | $i(v0) | ~ incident_c(v2, v1) | ~ part_of(v1, v0) | incident_c(v2, % 12.64/2.42 | v0)) % 12.64/2.42 | % 12.64/2.42 | ALPHA: (end_point_defn) implies: % 12.64/2.42 | (2) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ end_point(v0, % 12.64/2.42 | v1) | incident_c(v0, v1)) % 12.64/2.42 | % 12.64/2.42 | ALPHA: (inner_point_defn) implies: % 12.64/2.42 | (3) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ inner_point(v0, % 12.64/2.42 | v1) | incident_c(v0, v1)) % 12.64/2.42 | (4) ! [v0: $i] : ! [v1: $i] : ( ~ $i(v1) | ~ $i(v0) | ~ inner_point(v0, % 12.64/2.42 | v1) | ~ end_point(v0, v1)) % 12.64/2.42 | % 12.64/2.42 | ALPHA: (between_c_defn) implies: % 12.64/2.42 | (5) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ $i(v2) | ~ $i(v1) | ~ % 12.64/2.42 | $i(v0) | ~ between_c(v0, v1, v2, v1)) % 12.64/2.42 | (6) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~ $i(v3) | ~ % 12.64/2.42 | $i(v2) | ~ $i(v1) | ~ $i(v0) | ~ between_c(v0, v1, v2, v3) | ? % 12.64/2.42 | [v4: $i] : ($i(v4) & inner_point(v2, v4) & end_point(v3, v4) & % 12.64/2.42 | end_point(v1, v4) & part_of(v4, v0))) % 12.64/2.42 | % 12.64/2.42 | DELTA: instantiating (theorem_3_8_1) with fresh symbols all_22_0, all_22_1, % 12.64/2.42 | all_22_2, all_22_3 gives: % 12.64/2.42 | (7) $i(all_22_0) & $i(all_22_1) & $i(all_22_2) & $i(all_22_3) & % 12.64/2.42 | between_c(all_22_3, all_22_2, all_22_1, all_22_0) & (all_22_0 = % 12.64/2.42 | all_22_1 | all_22_0 = all_22_2 | all_22_1 = all_22_2 | ~ % 12.64/2.42 | incident_c(all_22_0, all_22_3) | ~ incident_c(all_22_1, all_22_3) | % 12.64/2.42 | ~ incident_c(all_22_2, all_22_3)) % 12.64/2.42 | % 12.64/2.42 | ALPHA: (7) implies: % 12.64/2.42 | (8) between_c(all_22_3, all_22_2, all_22_1, all_22_0) % 12.64/2.42 | (9) $i(all_22_3) % 12.64/2.42 | (10) $i(all_22_2) % 12.64/2.42 | (11) $i(all_22_1) % 12.64/2.42 | (12) $i(all_22_0) % 12.64/2.42 | (13) all_22_0 = all_22_1 | all_22_0 = all_22_2 | all_22_1 = all_22_2 | ~ % 12.64/2.43 | incident_c(all_22_0, all_22_3) | ~ incident_c(all_22_1, all_22_3) | % 12.64/2.43 | ~ incident_c(all_22_2, all_22_3) % 12.64/2.43 | % 12.64/2.43 | GROUND_INST: instantiating (5) with all_22_3, all_22_2, all_22_1, simplifying % 12.64/2.43 | with (9), (10), (11) gives: % 12.64/2.43 | (14) ~ between_c(all_22_3, all_22_2, all_22_1, all_22_2) % 12.64/2.43 | % 12.64/2.43 | GROUND_INST: instantiating (6) with all_22_3, all_22_2, all_22_1, all_22_0, % 12.64/2.43 | simplifying with (8), (9), (10), (11), (12) gives: % 12.64/2.43 | (15) ? [v0: $i] : ($i(v0) & inner_point(all_22_1, v0) & % 12.64/2.43 | end_point(all_22_0, v0) & end_point(all_22_2, v0) & part_of(v0, % 12.64/2.43 | all_22_3)) % 12.64/2.43 | % 12.64/2.43 | DELTA: instantiating (15) with fresh symbol all_32_0 gives: % 12.64/2.43 | (16) $i(all_32_0) & inner_point(all_22_1, all_32_0) & end_point(all_22_0, % 12.64/2.43 | all_32_0) & end_point(all_22_2, all_32_0) & part_of(all_32_0, % 12.64/2.43 | all_22_3) % 12.64/2.43 | % 12.64/2.43 | ALPHA: (16) implies: % 12.64/2.43 | (17) part_of(all_32_0, all_22_3) % 12.64/2.43 | (18) end_point(all_22_2, all_32_0) % 12.64/2.43 | (19) end_point(all_22_0, all_32_0) % 12.64/2.43 | (20) inner_point(all_22_1, all_32_0) % 12.64/2.43 | (21) $i(all_32_0) % 12.64/2.43 | % 12.64/2.43 | PRED_UNIFY: (8), (14) imply: % 12.64/2.43 | (22) ~ (all_22_0 = all_22_2) % 12.64/2.43 | % 12.64/2.43 | GROUND_INST: instantiating (2) with all_22_2, all_32_0, simplifying with (10), % 12.64/2.43 | (18), (21) gives: % 12.64/2.43 | (23) incident_c(all_22_2, all_32_0) % 12.64/2.43 | % 12.64/2.43 | GROUND_INST: instantiating (2) with all_22_0, all_32_0, simplifying with (12), % 12.64/2.43 | (19), (21) gives: % 12.64/2.43 | (24) incident_c(all_22_0, all_32_0) % 12.64/2.43 | % 12.64/2.43 | GROUND_INST: instantiating (4) with all_22_1, all_32_0, simplifying with (11), % 12.64/2.43 | (20), (21) gives: % 12.64/2.43 | (25) ~ end_point(all_22_1, all_32_0) % 12.64/2.43 | % 12.64/2.43 | GROUND_INST: instantiating (3) with all_22_1, all_32_0, simplifying with (11), % 12.64/2.43 | (20), (21) gives: % 12.64/2.43 | (26) incident_c(all_22_1, all_32_0) % 12.64/2.43 | % 12.64/2.43 | PRED_UNIFY: (19), (25) imply: % 12.64/2.43 | (27) ~ (all_22_0 = all_22_1) % 12.64/2.43 | % 12.64/2.43 | PRED_UNIFY: (18), (25) imply: % 12.64/2.43 | (28) ~ (all_22_1 = all_22_2) % 12.64/2.43 | % 12.64/2.43 | GROUND_INST: instantiating (1) with all_22_3, all_32_0, all_22_2, simplifying % 12.64/2.43 | with (9), (10), (17), (21), (23) gives: % 12.64/2.43 | (29) incident_c(all_22_2, all_22_3) % 12.64/2.43 | % 12.64/2.43 | GROUND_INST: instantiating (1) with all_22_3, all_32_0, all_22_1, simplifying % 12.64/2.43 | with (9), (11), (17), (21), (26) gives: % 12.64/2.43 | (30) incident_c(all_22_1, all_22_3) % 12.64/2.43 | % 12.64/2.43 | GROUND_INST: instantiating (1) with all_22_3, all_32_0, all_22_0, simplifying % 12.64/2.43 | with (9), (12), (17), (21), (24) gives: % 12.64/2.43 | (31) incident_c(all_22_0, all_22_3) % 12.64/2.43 | % 12.64/2.43 | BETA: splitting (13) gives: % 12.64/2.43 | % 12.64/2.43 | Case 1: % 12.64/2.43 | | % 12.64/2.43 | | (32) ~ incident_c(all_22_0, all_22_3) % 12.64/2.43 | | % 12.64/2.43 | | PRED_UNIFY: (31), (32) imply: % 12.64/2.43 | | (33) $false % 12.64/2.44 | | % 12.64/2.44 | | CLOSE: (33) is inconsistent. % 12.64/2.44 | | % 12.64/2.44 | Case 2: % 12.64/2.44 | | % 12.64/2.44 | | (34) all_22_0 = all_22_1 | all_22_0 = all_22_2 | all_22_1 = all_22_2 | ~ % 12.64/2.44 | | incident_c(all_22_1, all_22_3) | ~ incident_c(all_22_2, all_22_3) % 12.64/2.44 | | % 12.64/2.44 | | BETA: splitting (34) gives: % 12.64/2.44 | | % 12.64/2.44 | | Case 1: % 12.64/2.44 | | | % 12.64/2.44 | | | (35) ~ incident_c(all_22_1, all_22_3) % 12.64/2.44 | | | % 12.64/2.44 | | | PRED_UNIFY: (30), (35) imply: % 12.64/2.44 | | | (36) $false % 12.64/2.44 | | | % 12.64/2.44 | | | CLOSE: (36) is inconsistent. % 12.64/2.44 | | | % 12.64/2.44 | | Case 2: % 12.64/2.44 | | | % 12.64/2.44 | | | (37) all_22_0 = all_22_1 | all_22_0 = all_22_2 | all_22_1 = all_22_2 | % 12.64/2.44 | | | ~ incident_c(all_22_2, all_22_3) % 12.64/2.44 | | | % 12.64/2.44 | | | BETA: splitting (37) gives: % 12.64/2.44 | | | % 12.64/2.44 | | | Case 1: % 12.64/2.44 | | | | % 12.64/2.44 | | | | (38) ~ incident_c(all_22_2, all_22_3) % 12.64/2.44 | | | | % 12.64/2.44 | | | | PRED_UNIFY: (29), (38) imply: % 12.64/2.44 | | | | (39) $false % 12.64/2.44 | | | | % 12.64/2.44 | | | | CLOSE: (39) is inconsistent. % 12.64/2.44 | | | | % 12.64/2.44 | | | Case 2: % 12.64/2.44 | | | | % 12.64/2.44 | | | | (40) all_22_0 = all_22_1 | all_22_0 = all_22_2 | all_22_1 = all_22_2 % 12.64/2.44 | | | | % 12.64/2.44 | | | | BETA: splitting (40) gives: % 12.64/2.44 | | | | % 12.64/2.44 | | | | Case 1: % 12.64/2.44 | | | | | % 12.64/2.44 | | | | | (41) all_22_0 = all_22_1 % 12.64/2.44 | | | | | % 12.64/2.44 | | | | | REDUCE: (27), (41) imply: % 12.64/2.44 | | | | | (42) $false % 12.64/2.44 | | | | | % 12.64/2.44 | | | | | CLOSE: (42) is inconsistent. % 12.64/2.44 | | | | | % 12.64/2.44 | | | | Case 2: % 12.64/2.44 | | | | | % 12.64/2.44 | | | | | (43) all_22_0 = all_22_2 | all_22_1 = all_22_2 % 12.64/2.44 | | | | | % 12.64/2.44 | | | | | BETA: splitting (43) gives: % 12.64/2.44 | | | | | % 12.64/2.44 | | | | | Case 1: % 12.64/2.44 | | | | | | % 12.64/2.44 | | | | | | (44) all_22_0 = all_22_2 % 12.64/2.44 | | | | | | % 12.64/2.44 | | | | | | REDUCE: (22), (44) imply: % 12.64/2.44 | | | | | | (45) $false % 12.64/2.44 | | | | | | % 12.64/2.44 | | | | | | CLOSE: (45) is inconsistent. % 12.64/2.44 | | | | | | % 12.64/2.44 | | | | | Case 2: % 12.64/2.44 | | | | | | % 12.64/2.44 | | | | | | (46) all_22_1 = all_22_2 % 12.64/2.44 | | | | | | % 12.64/2.44 | | | | | | REDUCE: (28), (46) imply: % 12.64/2.44 | | | | | | (47) $false % 12.64/2.44 | | | | | | % 12.64/2.44 | | | | | | CLOSE: (47) is inconsistent. % 12.64/2.44 | | | | | | % 12.64/2.44 | | | | | End of split % 12.64/2.44 | | | | | % 12.64/2.44 | | | | End of split % 12.64/2.44 | | | | % 12.64/2.44 | | | End of split % 12.64/2.44 | | | % 12.64/2.44 | | End of split % 12.64/2.44 | | % 12.64/2.44 | End of split % 12.64/2.44 | % 12.64/2.44 End of proof % 12.64/2.44 % SZS output end Proof for theBenchmark % 12.64/2.44 % 12.64/2.44 1815ms %------------------------------------------------------------------------------