TSTP Solution File: GEO227+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : GEO227+1 : TPTP v8.1.2. Bugfixed v6.4.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n009.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:22:34 EDT 2023
% Result : Theorem 8.24s 1.85s
% Output : Proof 10.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO227+1 : TPTP v8.1.2. Bugfixed v6.4.0.
% 0.03/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.12/0.33 % Computer : n009.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Aug 30 00:05:20 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.51/0.63 ________ _____
% 0.51/0.63 ___ __ \_________(_)________________________________
% 0.51/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.51/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.51/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.51/0.63
% 0.51/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.51/0.63 (2023-06-19)
% 0.51/0.63
% 0.51/0.63 (c) Philipp Rümmer, 2009-2023
% 0.51/0.63 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.51/0.63 Amanda Stjerna.
% 0.51/0.63 Free software under BSD-3-Clause.
% 0.51/0.63
% 0.51/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.51/0.63
% 0.51/0.63 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.67/0.64 Running up to 7 provers in parallel.
% 0.67/0.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.67/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.67/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.67/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.67/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.67/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.67/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 3.31/1.17 Prover 4: Preprocessing ...
% 3.31/1.18 Prover 1: Preprocessing ...
% 3.31/1.21 Prover 0: Preprocessing ...
% 3.31/1.21 Prover 5: Preprocessing ...
% 3.31/1.21 Prover 2: Preprocessing ...
% 3.31/1.21 Prover 6: Preprocessing ...
% 3.31/1.22 Prover 3: Preprocessing ...
% 6.68/1.67 Prover 5: Proving ...
% 6.98/1.74 Prover 2: Proving ...
% 7.55/1.75 Prover 1: Constructing countermodel ...
% 7.55/1.75 Prover 3: Constructing countermodel ...
% 7.55/1.75 Prover 6: Constructing countermodel ...
% 8.24/1.85 Prover 3: proved (1197ms)
% 8.24/1.85
% 8.24/1.85 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.24/1.85
% 8.24/1.86 Prover 6: stopped
% 8.24/1.86 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 8.24/1.86 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 8.24/1.86 Prover 5: proved (1205ms)
% 8.24/1.86
% 8.24/1.86 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.24/1.86
% 8.24/1.86 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 8.24/1.87 Prover 2: stopped
% 8.24/1.87 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 9.10/1.98 Prover 7: Preprocessing ...
% 9.10/1.98 Prover 10: Preprocessing ...
% 9.10/1.98 Prover 1: Found proof (size 29)
% 9.10/1.99 Prover 1: proved (1334ms)
% 9.10/1.99 Prover 8: Preprocessing ...
% 9.10/2.01 Prover 11: Preprocessing ...
% 9.10/2.01 Prover 7: stopped
% 9.10/2.01 Prover 10: stopped
% 9.88/2.08 Prover 11: stopped
% 9.88/2.10 Prover 4: Constructing countermodel ...
% 9.88/2.12 Prover 4: stopped
% 9.88/2.12 Prover 8: Warning: ignoring some quantifiers
% 10.25/2.13 Prover 8: Constructing countermodel ...
% 10.25/2.13 Prover 8: stopped
% 10.25/2.14 Prover 0: Proving ...
% 10.25/2.15 Prover 0: stopped
% 10.25/2.15
% 10.25/2.15 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.25/2.15
% 10.25/2.16 % SZS output start Proof for theBenchmark
% 10.44/2.16 Assumptions after simplification:
% 10.44/2.16 ---------------------------------
% 10.44/2.16
% 10.44/2.16 (con)
% 10.44/2.18 ? [v0: $i] : ? [v1: $i] : ? [v2: int] : ? [v3: $i] : ? [v4: int] : ( ~
% 10.44/2.18 (v4 = 0) & ~ (v2 = 0) & line(v1) = 0 & line(v0) = 0 &
% 10.44/2.18 unequally_directed_lines(v0, v3) = v4 & unequally_directed_lines(v0, v1) =
% 10.44/2.18 v2 & reverse_line(v1) = v3 & $i(v3) & $i(v1) & $i(v0))
% 10.44/2.18
% 10.44/2.18 (con_def)
% 10.44/2.19 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: any] : ( ~
% 10.44/2.19 (unequally_directed_lines(v0, v2) = v3) | ~ (reverse_line(v1) = v2) | ~
% 10.44/2.19 $i(v1) | ~ $i(v0) | ? [v4: any] : ? [v5: any] : (convergent_lines(v0, v1)
% 10.44/2.19 = v4 & unequally_directed_lines(v0, v1) = v5 & ( ~ (v4 = 0) | (v5 = 0 & v3
% 10.44/2.19 = 0)))) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~
% 10.44/2.19 (unequally_directed_lines(v0, v2) = 0) | ~ (reverse_line(v1) = v2) | ~
% 10.44/2.19 $i(v1) | ~ $i(v0) | ? [v3: any] : ? [v4: any] : (convergent_lines(v0, v1)
% 10.44/2.19 = v4 & unequally_directed_lines(v0, v1) = v3 & ( ~ (v3 = 0) | v4 = 0)))
% 10.44/2.19
% 10.44/2.19 (oag8)
% 10.44/2.19 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~
% 10.44/2.19 (unequally_directed_lines(v0, v2) = v3) | ~ (reverse_line(v1) = v2) | ~
% 10.44/2.19 $i(v1) | ~ $i(v0) | ? [v4: any] : ? [v5: any] : ? [v6: any] : (line(v1)
% 10.44/2.19 = v5 & line(v0) = v4 & unequally_directed_lines(v0, v1) = v6 & ( ~ (v5 =
% 10.44/2.19 0) | ~ (v4 = 0) | v6 = 0)))
% 10.44/2.19
% 10.44/2.19 (function-axioms)
% 10.44/2.20 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : !
% 10.44/2.20 [v3: $i] : ! [v4: $i] : ! [v5: $i] : (v1 = v0 | ~ (between_on_line(v5, v4,
% 10.44/2.20 v3, v2) = v1) | ~ (between_on_line(v5, v4, v3, v2) = v0)) & ! [v0:
% 10.44/2.20 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i]
% 10.44/2.20 : ! [v4: $i] : (v1 = v0 | ~ (before_on_line(v4, v3, v2) = v1) | ~
% 10.44/2.20 (before_on_line(v4, v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 10.44/2.20 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : ! [v4: $i] : (v1 = v0 | ~
% 10.44/2.20 (divides_points(v4, v3, v2) = v1) | ~ (divides_points(v4, v3, v2) = v0)) &
% 10.44/2.20 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 10.44/2.20 (parallel_through_point(v3, v2) = v1) | ~ (parallel_through_point(v3, v2) =
% 10.44/2.20 v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 |
% 10.44/2.20 ~ (intersection_point(v3, v2) = v1) | ~ (intersection_point(v3, v2) = v0))
% 10.44/2.20 & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : !
% 10.44/2.20 [v3: $i] : (v1 = v0 | ~ (left_convergent_lines(v3, v2) = v1) | ~
% 10.44/2.20 (left_convergent_lines(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 10.44/2.20 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 10.44/2.20 (distinct_lines(v3, v2) = v1) | ~ (distinct_lines(v3, v2) = v0)) & ! [v0:
% 10.44/2.20 $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 10.44/2.20 (line_connecting(v3, v2) = v1) | ~ (line_connecting(v3, v2) = v0)) & !
% 10.44/2.20 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3:
% 10.44/2.20 $i] : (v1 = v0 | ~ (distinct_points(v3, v2) = v1) | ~ (distinct_points(v3,
% 10.44/2.20 v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] :
% 10.44/2.20 ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (convergent_lines(v3, v2) = v1) | ~
% 10.44/2.20 (convergent_lines(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 10.44/2.20 MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 10.44/2.20 (unequally_directed_lines(v3, v2) = v1) | ~ (unequally_directed_lines(v3,
% 10.44/2.20 v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] :
% 10.44/2.20 ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (apart_point_and_line(v3, v2) = v1) |
% 10.44/2.20 ~ (apart_point_and_line(v3, v2) = v0)) & ! [v0: MultipleValueBool] : !
% 10.44/2.20 [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 10.44/2.20 (left_apart_point(v3, v2) = v1) | ~ (left_apart_point(v3, v2) = v0)) & !
% 10.44/2.20 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0
% 10.44/2.20 | ~ (point(v2) = v1) | ~ (point(v2) = v0)) & ! [v0: MultipleValueBool] :
% 10.44/2.20 ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (line(v2) = v1) | ~
% 10.44/2.20 (line(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~
% 10.44/2.20 (reverse_line(v2) = v1) | ~ (reverse_line(v2) = v0))
% 10.44/2.20
% 10.44/2.20 Further assumptions not needed in the proof:
% 10.44/2.20 --------------------------------------------
% 10.44/2.20 apt_def, bet_def, bf_def, div_def, oag1, oag10, oag11, oag2, oag3, oag4, oag5,
% 10.44/2.20 oag6, oag7, oag9, oagco1, oagco10, oagco2, oagco3, oagco4, oagco5, oagco6,
% 10.44/2.20 oagco7, oagco8, oagco9, oagsub1, oagsub2, oagsub3, oaguc1, oaguc2
% 10.44/2.20
% 10.44/2.20 Those formulas are unsatisfiable:
% 10.44/2.20 ---------------------------------
% 10.44/2.20
% 10.44/2.20 Begin of proof
% 10.44/2.20 |
% 10.44/2.20 | ALPHA: (con_def) implies:
% 10.44/2.21 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: any] : ( ~
% 10.44/2.21 | (unequally_directed_lines(v0, v2) = v3) | ~ (reverse_line(v1) = v2)
% 10.44/2.21 | | ~ $i(v1) | ~ $i(v0) | ? [v4: any] : ? [v5: any] :
% 10.44/2.21 | (convergent_lines(v0, v1) = v4 & unequally_directed_lines(v0, v1) =
% 10.44/2.21 | v5 & ( ~ (v4 = 0) | (v5 = 0 & v3 = 0))))
% 10.44/2.21 |
% 10.44/2.21 | ALPHA: (function-axioms) implies:
% 10.44/2.21 | (2) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] :
% 10.44/2.21 | (v1 = v0 | ~ (line(v2) = v1) | ~ (line(v2) = v0))
% 10.44/2.21 | (3) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] :
% 10.44/2.21 | ! [v3: $i] : (v1 = v0 | ~ (unequally_directed_lines(v3, v2) = v1) |
% 10.44/2.21 | ~ (unequally_directed_lines(v3, v2) = v0))
% 10.44/2.21 |
% 10.44/2.21 | DELTA: instantiating (con) with fresh symbols all_34_0, all_34_1, all_34_2,
% 10.44/2.21 | all_34_3, all_34_4 gives:
% 10.44/2.21 | (4) ~ (all_34_0 = 0) & ~ (all_34_2 = 0) & line(all_34_3) = 0 &
% 10.44/2.21 | line(all_34_4) = 0 & unequally_directed_lines(all_34_4, all_34_1) =
% 10.44/2.21 | all_34_0 & unequally_directed_lines(all_34_4, all_34_3) = all_34_2 &
% 10.44/2.21 | reverse_line(all_34_3) = all_34_1 & $i(all_34_1) & $i(all_34_3) &
% 10.44/2.21 | $i(all_34_4)
% 10.44/2.21 |
% 10.44/2.21 | ALPHA: (4) implies:
% 10.44/2.21 | (5) ~ (all_34_2 = 0)
% 10.44/2.21 | (6) ~ (all_34_0 = 0)
% 10.44/2.21 | (7) $i(all_34_4)
% 10.44/2.21 | (8) $i(all_34_3)
% 10.44/2.21 | (9) reverse_line(all_34_3) = all_34_1
% 10.44/2.21 | (10) unequally_directed_lines(all_34_4, all_34_3) = all_34_2
% 10.44/2.21 | (11) unequally_directed_lines(all_34_4, all_34_1) = all_34_0
% 10.44/2.21 | (12) line(all_34_4) = 0
% 10.44/2.21 | (13) line(all_34_3) = 0
% 10.44/2.21 |
% 10.44/2.21 | GROUND_INST: instantiating (oag8) with all_34_4, all_34_3, all_34_1, all_34_0,
% 10.44/2.21 | simplifying with (7), (8), (9), (11) gives:
% 10.44/2.21 | (14) all_34_0 = 0 | ? [v0: any] : ? [v1: any] : ? [v2: any] :
% 10.44/2.21 | (line(all_34_3) = v1 & line(all_34_4) = v0 &
% 10.44/2.21 | unequally_directed_lines(all_34_4, all_34_3) = v2 & ( ~ (v1 = 0) |
% 10.44/2.21 | ~ (v0 = 0) | v2 = 0))
% 10.44/2.21 |
% 10.44/2.22 | GROUND_INST: instantiating (1) with all_34_4, all_34_3, all_34_1, all_34_0,
% 10.44/2.22 | simplifying with (7), (8), (9), (11) gives:
% 10.44/2.22 | (15) ? [v0: any] : ? [v1: any] : (convergent_lines(all_34_4, all_34_3) =
% 10.44/2.22 | v0 & unequally_directed_lines(all_34_4, all_34_3) = v1 & ( ~ (v0 =
% 10.44/2.22 | 0) | (v1 = 0 & all_34_0 = 0)))
% 10.44/2.22 |
% 10.44/2.22 | DELTA: instantiating (15) with fresh symbols all_45_0, all_45_1 gives:
% 10.44/2.22 | (16) convergent_lines(all_34_4, all_34_3) = all_45_1 &
% 10.44/2.22 | unequally_directed_lines(all_34_4, all_34_3) = all_45_0 & ( ~
% 10.44/2.22 | (all_45_1 = 0) | (all_45_0 = 0 & all_34_0 = 0))
% 10.44/2.22 |
% 10.44/2.22 | ALPHA: (16) implies:
% 10.44/2.22 | (17) unequally_directed_lines(all_34_4, all_34_3) = all_45_0
% 10.44/2.22 |
% 10.44/2.22 | BETA: splitting (14) gives:
% 10.44/2.22 |
% 10.44/2.22 | Case 1:
% 10.44/2.22 | |
% 10.44/2.22 | | (18) all_34_0 = 0
% 10.44/2.22 | |
% 10.44/2.22 | | REDUCE: (6), (18) imply:
% 10.44/2.22 | | (19) $false
% 10.44/2.22 | |
% 10.44/2.22 | | CLOSE: (19) is inconsistent.
% 10.44/2.22 | |
% 10.44/2.22 | Case 2:
% 10.44/2.22 | |
% 10.44/2.22 | | (20) ? [v0: any] : ? [v1: any] : ? [v2: any] : (line(all_34_3) = v1 &
% 10.44/2.22 | | line(all_34_4) = v0 & unequally_directed_lines(all_34_4, all_34_3)
% 10.44/2.22 | | = v2 & ( ~ (v1 = 0) | ~ (v0 = 0) | v2 = 0))
% 10.44/2.22 | |
% 10.44/2.22 | | DELTA: instantiating (20) with fresh symbols all_55_0, all_55_1, all_55_2
% 10.44/2.22 | | gives:
% 10.44/2.22 | | (21) line(all_34_3) = all_55_1 & line(all_34_4) = all_55_2 &
% 10.44/2.22 | | unequally_directed_lines(all_34_4, all_34_3) = all_55_0 & ( ~
% 10.44/2.22 | | (all_55_1 = 0) | ~ (all_55_2 = 0) | all_55_0 = 0)
% 10.44/2.22 | |
% 10.44/2.22 | | ALPHA: (21) implies:
% 10.44/2.22 | | (22) unequally_directed_lines(all_34_4, all_34_3) = all_55_0
% 10.44/2.22 | | (23) line(all_34_4) = all_55_2
% 10.44/2.22 | | (24) line(all_34_3) = all_55_1
% 10.44/2.22 | | (25) ~ (all_55_1 = 0) | ~ (all_55_2 = 0) | all_55_0 = 0
% 10.44/2.22 | |
% 10.44/2.22 | | GROUND_INST: instantiating (3) with all_34_2, all_55_0, all_34_3, all_34_4,
% 10.44/2.22 | | simplifying with (10), (22) gives:
% 10.44/2.22 | | (26) all_55_0 = all_34_2
% 10.44/2.22 | |
% 10.44/2.22 | | GROUND_INST: instantiating (3) with all_45_0, all_55_0, all_34_3, all_34_4,
% 10.44/2.22 | | simplifying with (17), (22) gives:
% 10.44/2.22 | | (27) all_55_0 = all_45_0
% 10.44/2.22 | |
% 10.44/2.22 | | GROUND_INST: instantiating (2) with 0, all_55_2, all_34_4, simplifying with
% 10.44/2.22 | | (12), (23) gives:
% 10.44/2.22 | | (28) all_55_2 = 0
% 10.44/2.22 | |
% 10.44/2.22 | | GROUND_INST: instantiating (2) with 0, all_55_1, all_34_3, simplifying with
% 10.44/2.22 | | (13), (24) gives:
% 10.44/2.22 | | (29) all_55_1 = 0
% 10.44/2.22 | |
% 10.44/2.22 | | COMBINE_EQS: (26), (27) imply:
% 10.44/2.22 | | (30) all_45_0 = all_34_2
% 10.44/2.22 | |
% 10.44/2.22 | | BETA: splitting (25) gives:
% 10.44/2.22 | |
% 10.44/2.22 | | Case 1:
% 10.44/2.22 | | |
% 10.44/2.22 | | | (31) ~ (all_55_1 = 0)
% 10.44/2.22 | | |
% 10.44/2.22 | | | REDUCE: (29), (31) imply:
% 10.44/2.22 | | | (32) $false
% 10.44/2.22 | | |
% 10.44/2.22 | | | CLOSE: (32) is inconsistent.
% 10.44/2.22 | | |
% 10.44/2.22 | | Case 2:
% 10.44/2.22 | | |
% 10.44/2.22 | | | (33) ~ (all_55_2 = 0) | all_55_0 = 0
% 10.44/2.22 | | |
% 10.44/2.22 | | | BETA: splitting (33) gives:
% 10.44/2.22 | | |
% 10.44/2.22 | | | Case 1:
% 10.44/2.22 | | | |
% 10.44/2.22 | | | | (34) ~ (all_55_2 = 0)
% 10.44/2.23 | | | |
% 10.44/2.23 | | | | REDUCE: (28), (34) imply:
% 10.44/2.23 | | | | (35) $false
% 10.44/2.23 | | | |
% 10.44/2.23 | | | | CLOSE: (35) is inconsistent.
% 10.44/2.23 | | | |
% 10.44/2.23 | | | Case 2:
% 10.44/2.23 | | | |
% 10.44/2.23 | | | | (36) all_55_0 = 0
% 10.44/2.23 | | | |
% 10.44/2.23 | | | | COMBINE_EQS: (26), (36) imply:
% 10.44/2.23 | | | | (37) all_34_2 = 0
% 10.44/2.23 | | | |
% 10.44/2.23 | | | | REDUCE: (5), (37) imply:
% 10.44/2.23 | | | | (38) $false
% 10.44/2.23 | | | |
% 10.44/2.23 | | | | CLOSE: (38) is inconsistent.
% 10.44/2.23 | | | |
% 10.44/2.23 | | | End of split
% 10.44/2.23 | | |
% 10.44/2.23 | | End of split
% 10.44/2.23 | |
% 10.44/2.23 | End of split
% 10.44/2.23 |
% 10.44/2.23 End of proof
% 10.44/2.23 % SZS output end Proof for theBenchmark
% 10.44/2.23
% 10.44/2.23 1595ms
%------------------------------------------------------------------------------