TSTP Solution File: SET942+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SET942+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n011.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 15:27:08 EDT 2023
% Result : Theorem 4.88s 1.50s
% Output : Proof 6.61s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET942+1 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.14 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.14/0.35 % Computer : n011.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat Aug 26 13:47:24 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.22/0.62 ________ _____
% 0.22/0.62 ___ __ \_________(_)________________________________
% 0.22/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.22/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.22/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.22/0.62
% 0.22/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.22/0.62 (2023-06-19)
% 0.22/0.62
% 0.22/0.62 (c) Philipp Rümmer, 2009-2023
% 0.22/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.22/0.62 Amanda Stjerna.
% 0.22/0.62 Free software under BSD-3-Clause.
% 0.22/0.62
% 0.22/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.22/0.62
% 0.22/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.22/0.63 Running up to 7 provers in parallel.
% 0.22/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.22/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.22/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.22/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.22/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.22/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.22/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.94/1.01 Prover 1: Preprocessing ...
% 1.94/1.01 Prover 4: Preprocessing ...
% 2.20/1.05 Prover 6: Preprocessing ...
% 2.20/1.05 Prover 2: Preprocessing ...
% 2.20/1.05 Prover 0: Preprocessing ...
% 2.20/1.05 Prover 3: Preprocessing ...
% 2.20/1.05 Prover 5: Preprocessing ...
% 3.31/1.27 Prover 1: Warning: ignoring some quantifiers
% 3.31/1.27 Prover 4: Warning: ignoring some quantifiers
% 3.91/1.28 Prover 3: Warning: ignoring some quantifiers
% 3.91/1.28 Prover 0: Proving ...
% 3.91/1.28 Prover 2: Proving ...
% 3.91/1.28 Prover 1: Constructing countermodel ...
% 3.91/1.28 Prover 3: Constructing countermodel ...
% 3.91/1.29 Prover 5: Proving ...
% 3.91/1.29 Prover 6: Proving ...
% 3.91/1.29 Prover 4: Constructing countermodel ...
% 4.88/1.50 Prover 0: proved (861ms)
% 4.88/1.50
% 4.88/1.50 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.88/1.50
% 4.88/1.50 Prover 3: stopped
% 4.88/1.51 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 4.88/1.51 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 4.88/1.51 Prover 6: stopped
% 5.56/1.52 Prover 5: stopped
% 5.56/1.52 Prover 2: stopped
% 5.56/1.52 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 5.56/1.52 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 5.56/1.53 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 5.56/1.53 Prover 8: Preprocessing ...
% 5.56/1.54 Prover 10: Preprocessing ...
% 5.56/1.54 Prover 7: Preprocessing ...
% 5.56/1.54 Prover 13: Preprocessing ...
% 5.56/1.55 Prover 11: Preprocessing ...
% 5.56/1.56 Prover 1: Found proof (size 30)
% 5.56/1.56 Prover 4: Found proof (size 26)
% 5.56/1.57 Prover 4: proved (920ms)
% 5.56/1.57 Prover 1: proved (926ms)
% 5.56/1.57 Prover 11: stopped
% 5.56/1.57 Prover 10: Warning: ignoring some quantifiers
% 5.56/1.57 Prover 10: Constructing countermodel ...
% 5.56/1.58 Prover 10: stopped
% 5.56/1.58 Prover 7: Warning: ignoring some quantifiers
% 5.56/1.58 Prover 7: Constructing countermodel ...
% 6.12/1.59 Prover 7: stopped
% 6.12/1.59 Prover 13: Warning: ignoring some quantifiers
% 6.12/1.59 Prover 8: Warning: ignoring some quantifiers
% 6.12/1.59 Prover 13: Constructing countermodel ...
% 6.12/1.60 Prover 13: stopped
% 6.12/1.60 Prover 8: Constructing countermodel ...
% 6.12/1.60 Prover 8: stopped
% 6.12/1.60
% 6.12/1.60 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.12/1.60
% 6.12/1.61 % SZS output start Proof for theBenchmark
% 6.12/1.61 Assumptions after simplification:
% 6.12/1.61 ---------------------------------
% 6.12/1.61
% 6.12/1.61 (d3_tarski)
% 6.12/1.64 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~
% 6.12/1.64 (subset(v0, v1) = 0) | ~ (in(v2, v1) = v3) | ~ $i(v2) | ~ $i(v1) | ~
% 6.12/1.64 $i(v0) | ? [v4: int] : ( ~ (v4 = 0) & in(v2, v0) = v4)) & ! [v0: $i] : !
% 6.12/1.64 [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (subset(v0, v1) = v2) | ~ $i(v1) | ~
% 6.12/1.64 $i(v0) | ? [v3: $i] : ? [v4: int] : ( ~ (v4 = 0) & in(v3, v1) = v4 &
% 6.12/1.64 in(v3, v0) = 0 & $i(v3))) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~
% 6.12/1.64 (subset(v0, v1) = 0) | ~ (in(v2, v0) = 0) | ~ $i(v2) | ~ $i(v1) | ~
% 6.12/1.64 $i(v0) | in(v2, v1) = 0)
% 6.12/1.64
% 6.12/1.64 (d4_tarski)
% 6.12/1.65 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : ! [v4: $i] : (v3 = 0
% 6.12/1.65 | ~ (union(v0) = v1) | ~ (in(v4, v0) = 0) | ~ (in(v2, v1) = v3) | ~
% 6.12/1.65 $i(v4) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v5: int] : ( ~ (v5 = 0) &
% 6.12/1.65 in(v2, v4) = v5)) & ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int]
% 6.12/1.65 : ! [v4: $i] : (v3 = 0 | ~ (union(v0) = v1) | ~ (in(v2, v4) = 0) | ~
% 6.12/1.65 (in(v2, v1) = v3) | ~ $i(v4) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v5:
% 6.12/1.65 int] : ( ~ (v5 = 0) & in(v4, v0) = v5)) & ! [v0: $i] : ! [v1: $i] : !
% 6.12/1.65 [v2: $i] : ( ~ (union(v0) = v1) | ~ (in(v2, v1) = 0) | ~ $i(v2) | ~ $i(v1)
% 6.12/1.65 | ~ $i(v0) | ? [v3: $i] : (in(v3, v0) = 0 & in(v2, v3) = 0 & $i(v3))) & ?
% 6.12/1.65 [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v0 | ~ (union(v1) = v2) | ~
% 6.12/1.65 $i(v1) | ~ $i(v0) | ? [v3: $i] : ? [v4: any] : ? [v5: $i] : ? [v6: int]
% 6.12/1.65 : ? [v7: int] : (in(v3, v0) = v4 & $i(v5) & $i(v3) & ( ~ (v4 = 0) | ( !
% 6.12/1.65 [v8: $i] : ( ~ (in(v8, v1) = 0) | ~ $i(v8) | ? [v9: int] : ( ~ (v9 =
% 6.12/1.65 0) & in(v3, v8) = v9)) & ! [v8: $i] : ( ~ (in(v3, v8) = 0) | ~
% 6.12/1.65 $i(v8) | ? [v9: int] : ( ~ (v9 = 0) & in(v8, v1) = v9)))) & (v4 = 0
% 6.12/1.65 | (v7 = 0 & v6 = 0 & in(v5, v1) = 0 & in(v3, v5) = 0))))
% 6.12/1.65
% 6.12/1.65 (t95_zfmisc_1)
% 6.12/1.65 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: int] : ( ~ (v4
% 6.12/1.65 = 0) & union(v1) = v3 & union(v0) = v2 & subset(v2, v3) = v4 & subset(v0,
% 6.12/1.65 v1) = 0 & $i(v3) & $i(v2) & $i(v1) & $i(v0))
% 6.12/1.65
% 6.12/1.65 (function-axioms)
% 6.12/1.66 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : !
% 6.12/1.66 [v3: $i] : (v1 = v0 | ~ (subset(v3, v2) = v1) | ~ (subset(v3, v2) = v0)) &
% 6.12/1.66 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3:
% 6.12/1.66 $i] : (v1 = v0 | ~ (in(v3, v2) = v1) | ~ (in(v3, v2) = v0)) & ! [v0:
% 6.12/1.66 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 |
% 6.12/1.66 ~ (empty(v2) = v1) | ~ (empty(v2) = v0)) & ! [v0: $i] : ! [v1: $i] : !
% 6.12/1.66 [v2: $i] : (v1 = v0 | ~ (union(v2) = v1) | ~ (union(v2) = v0))
% 6.12/1.66
% 6.12/1.66 Further assumptions not needed in the proof:
% 6.12/1.66 --------------------------------------------
% 6.12/1.66 antisymmetry_r2_hidden, rc1_xboole_0, rc2_xboole_0, reflexivity_r1_tarski
% 6.12/1.66
% 6.12/1.66 Those formulas are unsatisfiable:
% 6.12/1.66 ---------------------------------
% 6.12/1.66
% 6.12/1.66 Begin of proof
% 6.12/1.66 |
% 6.12/1.66 | ALPHA: (d3_tarski) implies:
% 6.12/1.66 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (subset(v0, v1) = 0) | ~
% 6.12/1.66 | (in(v2, v0) = 0) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | in(v2, v1) =
% 6.12/1.66 | 0)
% 6.12/1.66 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (subset(v0, v1)
% 6.12/1.66 | = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : ? [v4: int] : ( ~
% 6.12/1.66 | (v4 = 0) & in(v3, v1) = v4 & in(v3, v0) = 0 & $i(v3)))
% 6.12/1.66 |
% 6.12/1.66 | ALPHA: (d4_tarski) implies:
% 6.12/1.66 | (3) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (union(v0) = v1) | ~
% 6.12/1.66 | (in(v2, v1) = 0) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: $i] :
% 6.12/1.66 | (in(v3, v0) = 0 & in(v2, v3) = 0 & $i(v3)))
% 6.12/1.67 | (4) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : ! [v4: $i] :
% 6.12/1.67 | (v3 = 0 | ~ (union(v0) = v1) | ~ (in(v2, v4) = 0) | ~ (in(v2, v1) =
% 6.12/1.67 | v3) | ~ $i(v4) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v5: int]
% 6.12/1.67 | : ( ~ (v5 = 0) & in(v4, v0) = v5))
% 6.12/1.67 |
% 6.12/1.67 | ALPHA: (function-axioms) implies:
% 6.12/1.67 | (5) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] :
% 6.12/1.67 | ! [v3: $i] : (v1 = v0 | ~ (in(v3, v2) = v1) | ~ (in(v3, v2) = v0))
% 6.12/1.67 |
% 6.12/1.67 | DELTA: instantiating (t95_zfmisc_1) with fresh symbols all_11_0, all_11_1,
% 6.12/1.67 | all_11_2, all_11_3, all_11_4 gives:
% 6.12/1.67 | (6) ~ (all_11_0 = 0) & union(all_11_3) = all_11_1 & union(all_11_4) =
% 6.12/1.67 | all_11_2 & subset(all_11_2, all_11_1) = all_11_0 & subset(all_11_4,
% 6.12/1.67 | all_11_3) = 0 & $i(all_11_1) & $i(all_11_2) & $i(all_11_3) &
% 6.12/1.67 | $i(all_11_4)
% 6.12/1.67 |
% 6.12/1.67 | ALPHA: (6) implies:
% 6.12/1.67 | (7) ~ (all_11_0 = 0)
% 6.12/1.67 | (8) $i(all_11_4)
% 6.12/1.67 | (9) $i(all_11_3)
% 6.12/1.67 | (10) $i(all_11_2)
% 6.12/1.67 | (11) $i(all_11_1)
% 6.12/1.67 | (12) subset(all_11_4, all_11_3) = 0
% 6.12/1.67 | (13) subset(all_11_2, all_11_1) = all_11_0
% 6.12/1.67 | (14) union(all_11_4) = all_11_2
% 6.12/1.67 | (15) union(all_11_3) = all_11_1
% 6.12/1.67 |
% 6.55/1.67 | GROUND_INST: instantiating (2) with all_11_2, all_11_1, all_11_0, simplifying
% 6.55/1.67 | with (10), (11), (13) gives:
% 6.55/1.67 | (16) all_11_0 = 0 | ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & in(v0,
% 6.55/1.67 | all_11_1) = v1 & in(v0, all_11_2) = 0 & $i(v0))
% 6.55/1.67 |
% 6.55/1.67 | BETA: splitting (16) gives:
% 6.55/1.67 |
% 6.55/1.67 | Case 1:
% 6.55/1.67 | |
% 6.55/1.67 | | (17) all_11_0 = 0
% 6.55/1.67 | |
% 6.55/1.67 | | REDUCE: (7), (17) imply:
% 6.55/1.67 | | (18) $false
% 6.55/1.68 | |
% 6.55/1.68 | | CLOSE: (18) is inconsistent.
% 6.55/1.68 | |
% 6.55/1.68 | Case 2:
% 6.55/1.68 | |
% 6.55/1.68 | | (19) ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & in(v0, all_11_1) = v1 &
% 6.55/1.68 | | in(v0, all_11_2) = 0 & $i(v0))
% 6.55/1.68 | |
% 6.55/1.68 | | DELTA: instantiating (19) with fresh symbols all_22_0, all_22_1 gives:
% 6.55/1.68 | | (20) ~ (all_22_0 = 0) & in(all_22_1, all_11_1) = all_22_0 & in(all_22_1,
% 6.55/1.68 | | all_11_2) = 0 & $i(all_22_1)
% 6.55/1.68 | |
% 6.55/1.68 | | ALPHA: (20) implies:
% 6.55/1.68 | | (21) ~ (all_22_0 = 0)
% 6.55/1.68 | | (22) $i(all_22_1)
% 6.55/1.68 | | (23) in(all_22_1, all_11_2) = 0
% 6.55/1.68 | | (24) in(all_22_1, all_11_1) = all_22_0
% 6.55/1.68 | |
% 6.55/1.68 | | GROUND_INST: instantiating (3) with all_11_4, all_11_2, all_22_1,
% 6.55/1.68 | | simplifying with (8), (10), (14), (22), (23) gives:
% 6.55/1.68 | | (25) ? [v0: $i] : (in(v0, all_11_4) = 0 & in(all_22_1, v0) = 0 & $i(v0))
% 6.55/1.68 | |
% 6.55/1.68 | | DELTA: instantiating (25) with fresh symbol all_31_0 gives:
% 6.55/1.68 | | (26) in(all_31_0, all_11_4) = 0 & in(all_22_1, all_31_0) = 0 &
% 6.55/1.68 | | $i(all_31_0)
% 6.55/1.68 | |
% 6.55/1.68 | | ALPHA: (26) implies:
% 6.55/1.68 | | (27) $i(all_31_0)
% 6.55/1.68 | | (28) in(all_22_1, all_31_0) = 0
% 6.55/1.68 | | (29) in(all_31_0, all_11_4) = 0
% 6.55/1.68 | |
% 6.55/1.68 | | GROUND_INST: instantiating (4) with all_11_3, all_11_1, all_22_1, all_22_0,
% 6.55/1.68 | | all_31_0, simplifying with (9), (11), (15), (22), (24), (27),
% 6.55/1.68 | | (28) gives:
% 6.61/1.68 | | (30) all_22_0 = 0 | ? [v0: int] : ( ~ (v0 = 0) & in(all_31_0, all_11_3)
% 6.61/1.68 | | = v0)
% 6.61/1.68 | |
% 6.61/1.68 | | GROUND_INST: instantiating (1) with all_11_4, all_11_3, all_31_0,
% 6.61/1.68 | | simplifying with (8), (9), (12), (27), (29) gives:
% 6.61/1.68 | | (31) in(all_31_0, all_11_3) = 0
% 6.61/1.68 | |
% 6.61/1.68 | | BETA: splitting (30) gives:
% 6.61/1.68 | |
% 6.61/1.68 | | Case 1:
% 6.61/1.68 | | |
% 6.61/1.68 | | | (32) all_22_0 = 0
% 6.61/1.68 | | |
% 6.61/1.68 | | | REDUCE: (21), (32) imply:
% 6.61/1.68 | | | (33) $false
% 6.61/1.68 | | |
% 6.61/1.68 | | | CLOSE: (33) is inconsistent.
% 6.61/1.68 | | |
% 6.61/1.68 | | Case 2:
% 6.61/1.68 | | |
% 6.61/1.68 | | | (34) ? [v0: int] : ( ~ (v0 = 0) & in(all_31_0, all_11_3) = v0)
% 6.61/1.68 | | |
% 6.61/1.68 | | | DELTA: instantiating (34) with fresh symbol all_53_0 gives:
% 6.61/1.69 | | | (35) ~ (all_53_0 = 0) & in(all_31_0, all_11_3) = all_53_0
% 6.61/1.69 | | |
% 6.61/1.69 | | | ALPHA: (35) implies:
% 6.61/1.69 | | | (36) ~ (all_53_0 = 0)
% 6.61/1.69 | | | (37) in(all_31_0, all_11_3) = all_53_0
% 6.61/1.69 | | |
% 6.61/1.69 | | | GROUND_INST: instantiating (5) with 0, all_53_0, all_11_3, all_31_0,
% 6.61/1.69 | | | simplifying with (31), (37) gives:
% 6.61/1.69 | | | (38) all_53_0 = 0
% 6.61/1.69 | | |
% 6.61/1.69 | | | REDUCE: (36), (38) imply:
% 6.61/1.69 | | | (39) $false
% 6.61/1.69 | | |
% 6.61/1.69 | | | CLOSE: (39) is inconsistent.
% 6.61/1.69 | | |
% 6.61/1.69 | | End of split
% 6.61/1.69 | |
% 6.61/1.69 | End of split
% 6.61/1.69 |
% 6.61/1.69 End of proof
% 6.61/1.69 % SZS output end Proof for theBenchmark
% 6.61/1.69
% 6.61/1.69 1066ms
%------------------------------------------------------------------------------