TSTP Solution File: SEU144+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SEU144+1 : TPTP v8.1.2. Released v3.3.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 : Thu Aug 31 17:42:45 EDT 2023
% Result : Theorem 4.09s 1.35s
% Output : Proof 5.63s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU144+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.33 % Computer : n009.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Aug 23 14:50:36 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.19/0.60 ________ _____
% 0.19/0.60 ___ __ \_________(_)________________________________
% 0.19/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.19/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.19/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.19/0.60
% 0.19/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.19/0.60 (2023-06-19)
% 0.19/0.60
% 0.19/0.60 (c) Philipp Rümmer, 2009-2023
% 0.19/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.19/0.60 Amanda Stjerna.
% 0.19/0.60 Free software under BSD-3-Clause.
% 0.19/0.60
% 0.19/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.19/0.60
% 0.19/0.60 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.19/0.61 Running up to 7 provers in parallel.
% 0.19/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.19/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.19/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.19/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.19/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.19/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.19/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.89/0.94 Prover 4: Preprocessing ...
% 1.89/0.94 Prover 1: Preprocessing ...
% 1.89/0.98 Prover 6: Preprocessing ...
% 1.89/0.98 Prover 2: Preprocessing ...
% 1.89/0.98 Prover 0: Preprocessing ...
% 1.89/0.98 Prover 3: Preprocessing ...
% 1.89/0.98 Prover 5: Preprocessing ...
% 3.01/1.12 Prover 1: Warning: ignoring some quantifiers
% 3.01/1.13 Prover 6: Proving ...
% 3.01/1.13 Prover 5: Proving ...
% 3.01/1.13 Prover 2: Proving ...
% 3.01/1.13 Prover 3: Warning: ignoring some quantifiers
% 3.01/1.13 Prover 0: Proving ...
% 3.01/1.13 Prover 1: Constructing countermodel ...
% 3.01/1.13 Prover 4: Warning: ignoring some quantifiers
% 3.01/1.14 Prover 3: Constructing countermodel ...
% 3.01/1.14 Prover 4: Constructing countermodel ...
% 3.95/1.30 Prover 1: gave up
% 3.95/1.30 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 4.09/1.32 Prover 7: Preprocessing ...
% 4.09/1.34 Prover 7: Warning: ignoring some quantifiers
% 4.09/1.35 Prover 7: Constructing countermodel ...
% 4.09/1.35 Prover 0: proved (733ms)
% 4.09/1.35
% 4.09/1.35 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.09/1.35
% 4.09/1.35 Prover 3: stopped
% 4.09/1.35 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 4.09/1.36 Prover 2: stopped
% 4.09/1.36 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 4.09/1.36 Prover 5: stopped
% 4.09/1.37 Prover 6: stopped
% 4.09/1.37 Prover 4: Found proof (size 31)
% 4.09/1.37 Prover 4: proved (735ms)
% 4.09/1.37 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 4.09/1.37 Prover 8: Preprocessing ...
% 4.09/1.37 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 4.09/1.37 Prover 16: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=completeFrugal -randomSeed=-2043353683
% 4.09/1.38 Prover 10: Preprocessing ...
% 4.09/1.38 Prover 7: stopped
% 4.09/1.39 Prover 11: Preprocessing ...
% 4.09/1.39 Prover 13: Preprocessing ...
% 4.09/1.39 Prover 16: Preprocessing ...
% 5.18/1.41 Prover 11: stopped
% 5.18/1.41 Prover 13: stopped
% 5.18/1.41 Prover 10: Warning: ignoring some quantifiers
% 5.18/1.41 Prover 10: Constructing countermodel ...
% 5.18/1.42 Prover 10: stopped
% 5.18/1.42 Prover 8: Warning: ignoring some quantifiers
% 5.18/1.43 Prover 8: Constructing countermodel ...
% 5.18/1.43 Prover 16: Warning: ignoring some quantifiers
% 5.18/1.43 Prover 8: stopped
% 5.18/1.43 Prover 16: Constructing countermodel ...
% 5.18/1.44 Prover 16: stopped
% 5.18/1.44
% 5.18/1.44 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.18/1.44
% 5.18/1.45 % SZS output start Proof for theBenchmark
% 5.18/1.45 Assumptions after simplification:
% 5.18/1.45 ---------------------------------
% 5.18/1.45
% 5.18/1.45 (d1_tarski)
% 5.18/1.48 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v0 | ~ (singleton(v0) = v1) |
% 5.18/1.48 ~ (in(v2, v1) = 0) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0)) & ! [v0: $i] : !
% 5.18/1.48 [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (singleton(v0) = v1) | ~ (in(v0, v1) =
% 5.18/1.48 v2) | ~ $i(v1) | ~ $i(v0)) & ? [v0: $i] : ! [v1: $i] : ! [v2: $i] :
% 5.63/1.48 (v2 = v0 | ~ (singleton(v1) = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : ?
% 5.63/1.48 [v4: any] : (in(v3, v0) = v4 & $i(v3) & ( ~ (v4 = 0) | ~ (v3 = v1)) & (v4 =
% 5.63/1.48 0 | v3 = v1)))
% 5.63/1.48
% 5.63/1.48 (d3_tarski)
% 5.63/1.48 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~
% 5.63/1.48 (subset(v0, v1) = 0) | ~ (in(v2, v1) = v3) | ~ $i(v2) | ~ $i(v1) | ~
% 5.63/1.49 $i(v0) | ? [v4: int] : ( ~ (v4 = 0) & in(v2, v0) = v4)) & ! [v0: $i] : !
% 5.63/1.49 [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (subset(v0, v1) = v2) | ~ $i(v1) | ~
% 5.63/1.49 $i(v0) | ? [v3: $i] : ? [v4: int] : ( ~ (v4 = 0) & in(v3, v1) = v4 &
% 5.63/1.49 in(v3, v0) = 0 & $i(v3))) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~
% 5.63/1.49 (subset(v0, v1) = 0) | ~ (in(v2, v0) = 0) | ~ $i(v2) | ~ $i(v1) | ~
% 5.63/1.49 $i(v0) | in(v2, v1) = 0)
% 5.63/1.49
% 5.63/1.49 (l2_zfmisc_1)
% 5.63/1.49 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: any] : ? [v4: any] :
% 5.63/1.49 (subset(v2, v1) = v3 & singleton(v0) = v2 & in(v0, v1) = v4 & $i(v2) & $i(v1)
% 5.63/1.49 & $i(v0) & ((v4 = 0 & ~ (v3 = 0)) | (v3 = 0 & ~ (v4 = 0))))
% 5.63/1.49
% 5.63/1.49 (function-axioms)
% 5.63/1.49 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : !
% 5.63/1.49 [v3: $i] : (v1 = v0 | ~ (subset(v3, v2) = v1) | ~ (subset(v3, v2) = v0)) &
% 5.63/1.49 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3:
% 5.63/1.49 $i] : (v1 = v0 | ~ (in(v3, v2) = v1) | ~ (in(v3, v2) = v0)) & ! [v0: $i]
% 5.63/1.49 : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (singleton(v2) = v1) | ~
% 5.63/1.49 (singleton(v2) = v0))
% 5.63/1.49
% 5.63/1.49 Further assumptions not needed in the proof:
% 5.63/1.49 --------------------------------------------
% 5.63/1.49 antisymmetry_r2_hidden, dt_k1_tarski, reflexivity_r1_tarski
% 5.63/1.49
% 5.63/1.49 Those formulas are unsatisfiable:
% 5.63/1.49 ---------------------------------
% 5.63/1.49
% 5.63/1.49 Begin of proof
% 5.63/1.49 |
% 5.63/1.49 | ALPHA: (d1_tarski) implies:
% 5.63/1.49 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (singleton(v0)
% 5.63/1.49 | = v1) | ~ (in(v0, v1) = v2) | ~ $i(v1) | ~ $i(v0))
% 5.63/1.50 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v0 | ~ (singleton(v0)
% 5.63/1.50 | = v1) | ~ (in(v2, v1) = 0) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0))
% 5.63/1.50 |
% 5.63/1.50 | ALPHA: (d3_tarski) implies:
% 5.63/1.50 | (3) ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (subset(v0, v1)
% 5.63/1.50 | = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : ? [v4: int] : ( ~
% 5.63/1.50 | (v4 = 0) & in(v3, v1) = v4 & in(v3, v0) = 0 & $i(v3)))
% 5.63/1.50 | (4) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~
% 5.63/1.50 | (subset(v0, v1) = 0) | ~ (in(v2, v1) = v3) | ~ $i(v2) | ~ $i(v1) |
% 5.63/1.50 | ~ $i(v0) | ? [v4: int] : ( ~ (v4 = 0) & in(v2, v0) = v4))
% 5.63/1.50 |
% 5.63/1.50 | ALPHA: (function-axioms) implies:
% 5.63/1.50 | (5) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] :
% 5.63/1.50 | ! [v3: $i] : (v1 = v0 | ~ (in(v3, v2) = v1) | ~ (in(v3, v2) = v0))
% 5.63/1.50 |
% 5.63/1.50 | DELTA: instantiating (l2_zfmisc_1) with fresh symbols all_9_0, all_9_1,
% 5.63/1.50 | all_9_2, all_9_3, all_9_4 gives:
% 5.63/1.50 | (6) subset(all_9_2, all_9_3) = all_9_1 & singleton(all_9_4) = all_9_2 &
% 5.63/1.50 | in(all_9_4, all_9_3) = all_9_0 & $i(all_9_2) & $i(all_9_3) &
% 5.63/1.50 | $i(all_9_4) & ((all_9_0 = 0 & ~ (all_9_1 = 0)) | (all_9_1 = 0 & ~
% 5.63/1.50 | (all_9_0 = 0)))
% 5.63/1.50 |
% 5.63/1.50 | ALPHA: (6) implies:
% 5.63/1.50 | (7) $i(all_9_4)
% 5.63/1.50 | (8) $i(all_9_3)
% 5.63/1.51 | (9) $i(all_9_2)
% 5.63/1.51 | (10) in(all_9_4, all_9_3) = all_9_0
% 5.63/1.51 | (11) singleton(all_9_4) = all_9_2
% 5.63/1.51 | (12) subset(all_9_2, all_9_3) = all_9_1
% 5.63/1.51 | (13) (all_9_0 = 0 & ~ (all_9_1 = 0)) | (all_9_1 = 0 & ~ (all_9_0 = 0))
% 5.63/1.51 |
% 5.63/1.51 | GROUND_INST: instantiating (3) with all_9_2, all_9_3, all_9_1, simplifying
% 5.63/1.51 | with (8), (9), (12) gives:
% 5.63/1.51 | (14) all_9_1 = 0 | ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & in(v0,
% 5.63/1.51 | all_9_2) = 0 & in(v0, all_9_3) = v1 & $i(v0))
% 5.63/1.51 |
% 5.63/1.51 | BETA: splitting (13) gives:
% 5.63/1.51 |
% 5.63/1.51 | Case 1:
% 5.63/1.51 | |
% 5.63/1.51 | | (15) all_9_0 = 0 & ~ (all_9_1 = 0)
% 5.63/1.51 | |
% 5.63/1.51 | | ALPHA: (15) implies:
% 5.63/1.51 | | (16) all_9_0 = 0
% 5.63/1.51 | | (17) ~ (all_9_1 = 0)
% 5.63/1.51 | |
% 5.63/1.51 | | REDUCE: (10), (16) imply:
% 5.63/1.51 | | (18) in(all_9_4, all_9_3) = 0
% 5.63/1.51 | |
% 5.63/1.51 | | BETA: splitting (14) gives:
% 5.63/1.51 | |
% 5.63/1.51 | | Case 1:
% 5.63/1.51 | | |
% 5.63/1.51 | | | (19) all_9_1 = 0
% 5.63/1.51 | | |
% 5.63/1.51 | | | REDUCE: (17), (19) imply:
% 5.63/1.51 | | | (20) $false
% 5.63/1.51 | | |
% 5.63/1.51 | | | CLOSE: (20) is inconsistent.
% 5.63/1.51 | | |
% 5.63/1.51 | | Case 2:
% 5.63/1.51 | | |
% 5.63/1.51 | | | (21) ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & in(v0, all_9_2) = 0 &
% 5.63/1.51 | | | in(v0, all_9_3) = v1 & $i(v0))
% 5.63/1.51 | | |
% 5.63/1.51 | | | DELTA: instantiating (21) with fresh symbols all_22_0, all_22_1 gives:
% 5.63/1.51 | | | (22) ~ (all_22_0 = 0) & in(all_22_1, all_9_2) = 0 & in(all_22_1,
% 5.63/1.51 | | | all_9_3) = all_22_0 & $i(all_22_1)
% 5.63/1.51 | | |
% 5.63/1.51 | | | ALPHA: (22) implies:
% 5.63/1.51 | | | (23) ~ (all_22_0 = 0)
% 5.63/1.51 | | | (24) $i(all_22_1)
% 5.63/1.51 | | | (25) in(all_22_1, all_9_3) = all_22_0
% 5.63/1.51 | | | (26) in(all_22_1, all_9_2) = 0
% 5.63/1.51 | | |
% 5.63/1.52 | | | GROUND_INST: instantiating (2) with all_9_4, all_9_2, all_22_1,
% 5.63/1.52 | | | simplifying with (7), (9), (11), (24), (26) gives:
% 5.63/1.52 | | | (27) all_22_1 = all_9_4
% 5.63/1.52 | | |
% 5.63/1.52 | | | REDUCE: (25), (27) imply:
% 5.63/1.52 | | | (28) in(all_9_4, all_9_3) = all_22_0
% 5.63/1.52 | | |
% 5.63/1.52 | | | GROUND_INST: instantiating (5) with 0, all_22_0, all_9_3, all_9_4,
% 5.63/1.52 | | | simplifying with (18), (28) gives:
% 5.63/1.52 | | | (29) all_22_0 = 0
% 5.63/1.52 | | |
% 5.63/1.52 | | | REDUCE: (23), (29) imply:
% 5.63/1.52 | | | (30) $false
% 5.63/1.52 | | |
% 5.63/1.52 | | | CLOSE: (30) is inconsistent.
% 5.63/1.52 | | |
% 5.63/1.52 | | End of split
% 5.63/1.52 | |
% 5.63/1.52 | Case 2:
% 5.63/1.52 | |
% 5.63/1.52 | | (31) all_9_1 = 0 & ~ (all_9_0 = 0)
% 5.63/1.52 | |
% 5.63/1.52 | | ALPHA: (31) implies:
% 5.63/1.52 | | (32) all_9_1 = 0
% 5.63/1.52 | | (33) ~ (all_9_0 = 0)
% 5.63/1.52 | |
% 5.63/1.52 | | REDUCE: (12), (32) imply:
% 5.63/1.52 | | (34) subset(all_9_2, all_9_3) = 0
% 5.63/1.52 | |
% 5.63/1.52 | | GROUND_INST: instantiating (4) with all_9_2, all_9_3, all_9_4, all_9_0,
% 5.63/1.52 | | simplifying with (7), (8), (9), (10), (34) gives:
% 5.63/1.52 | | (35) all_9_0 = 0 | ? [v0: int] : ( ~ (v0 = 0) & in(all_9_4, all_9_2) =
% 5.63/1.52 | | v0)
% 5.63/1.52 | |
% 5.63/1.52 | | BETA: splitting (35) gives:
% 5.63/1.52 | |
% 5.63/1.52 | | Case 1:
% 5.63/1.52 | | |
% 5.63/1.52 | | | (36) all_9_0 = 0
% 5.63/1.52 | | |
% 5.63/1.52 | | | REDUCE: (33), (36) imply:
% 5.63/1.52 | | | (37) $false
% 5.63/1.52 | | |
% 5.63/1.52 | | | CLOSE: (37) is inconsistent.
% 5.63/1.52 | | |
% 5.63/1.52 | | Case 2:
% 5.63/1.52 | | |
% 5.63/1.52 | | | (38) ? [v0: int] : ( ~ (v0 = 0) & in(all_9_4, all_9_2) = v0)
% 5.63/1.52 | | |
% 5.63/1.52 | | | DELTA: instantiating (38) with fresh symbol all_29_0 gives:
% 5.63/1.52 | | | (39) ~ (all_29_0 = 0) & in(all_9_4, all_9_2) = all_29_0
% 5.63/1.52 | | |
% 5.63/1.52 | | | ALPHA: (39) implies:
% 5.63/1.52 | | | (40) ~ (all_29_0 = 0)
% 5.63/1.52 | | | (41) in(all_9_4, all_9_2) = all_29_0
% 5.63/1.52 | | |
% 5.63/1.52 | | | GROUND_INST: instantiating (1) with all_9_4, all_9_2, all_29_0,
% 5.63/1.52 | | | simplifying with (7), (9), (11), (41) gives:
% 5.63/1.52 | | | (42) all_29_0 = 0
% 5.63/1.52 | | |
% 5.63/1.52 | | | REDUCE: (40), (42) imply:
% 5.63/1.52 | | | (43) $false
% 5.63/1.52 | | |
% 5.63/1.52 | | | CLOSE: (43) is inconsistent.
% 5.63/1.52 | | |
% 5.63/1.52 | | End of split
% 5.63/1.52 | |
% 5.63/1.52 | End of split
% 5.63/1.52 |
% 5.63/1.52 End of proof
% 5.63/1.52 % SZS output end Proof for theBenchmark
% 5.63/1.52
% 5.63/1.52 925ms
%------------------------------------------------------------------------------