TSTP Solution File: SET009+3 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SET009+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n010.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:23:03 EDT 2023
% Result : Theorem 3.80s 1.32s
% Output : Proof 4.95s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET009+3 : TPTP v8.1.2. Released v2.2.0.
% 0.11/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.12/0.34 % Computer : n010.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 : Sat Aug 26 16:17:05 EDT 2023
% 0.12/0.34 % 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/sandbox2/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 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 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 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.86/0.99 Prover 4: Preprocessing ...
% 1.86/0.99 Prover 1: Preprocessing ...
% 2.12/1.03 Prover 0: Preprocessing ...
% 2.12/1.03 Prover 3: Preprocessing ...
% 2.12/1.03 Prover 2: Preprocessing ...
% 2.12/1.03 Prover 5: Preprocessing ...
% 2.12/1.03 Prover 6: Preprocessing ...
% 2.84/1.16 Prover 5: Proving ...
% 2.84/1.17 Prover 2: Proving ...
% 2.84/1.17 Prover 6: Proving ...
% 2.84/1.17 Prover 1: Constructing countermodel ...
% 2.84/1.17 Prover 3: Constructing countermodel ...
% 2.84/1.18 Prover 0: Proving ...
% 3.20/1.19 Prover 4: Constructing countermodel ...
% 3.80/1.32 Prover 3: proved (693ms)
% 3.80/1.32
% 3.80/1.32 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.80/1.32
% 3.80/1.32 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 3.80/1.33 Prover 5: stopped
% 3.80/1.33 Prover 2: stopped
% 3.80/1.34 Prover 6: stopped
% 3.80/1.36 Prover 0: proved (708ms)
% 3.80/1.36
% 3.80/1.36 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.80/1.36
% 3.80/1.37 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 3.80/1.37 Prover 7: Preprocessing ...
% 3.80/1.37 Prover 8: Preprocessing ...
% 3.80/1.37 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 3.80/1.37 Prover 10: Preprocessing ...
% 3.80/1.37 Prover 1: Found proof (size 30)
% 3.80/1.37 Prover 1: proved (740ms)
% 3.80/1.37 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 3.80/1.37 Prover 7: Warning: ignoring some quantifiers
% 3.80/1.37 Prover 11: Preprocessing ...
% 3.80/1.37 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 3.80/1.37 Prover 4: stopped
% 3.80/1.37 Prover 7: Constructing countermodel ...
% 3.80/1.38 Prover 7: stopped
% 3.80/1.38 Prover 10: Warning: ignoring some quantifiers
% 3.80/1.38 Prover 13: Preprocessing ...
% 3.80/1.39 Prover 11: stopped
% 3.80/1.39 Prover 10: Constructing countermodel ...
% 3.80/1.39 Prover 10: stopped
% 3.80/1.40 Prover 8: Warning: ignoring some quantifiers
% 3.80/1.40 Prover 8: Constructing countermodel ...
% 3.80/1.41 Prover 8: stopped
% 3.80/1.41 Prover 13: Warning: ignoring some quantifiers
% 4.52/1.42 Prover 13: Constructing countermodel ...
% 4.52/1.42 Prover 13: stopped
% 4.52/1.42
% 4.52/1.42 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.52/1.42
% 4.52/1.43 % SZS output start Proof for theBenchmark
% 4.52/1.43 Assumptions after simplification:
% 4.52/1.43 ---------------------------------
% 4.52/1.43
% 4.52/1.43 (difference_defn)
% 4.95/1.46 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: int] : (v4 = 0
% 4.95/1.46 | ~ (difference(v0, v1) = v3) | ~ (member(v2, v3) = v4) | ~ $i(v2) | ~
% 4.95/1.46 $i(v1) | ~ $i(v0) | ? [v5: any] : ? [v6: any] : (member(v2, v1) = v6 &
% 4.95/1.46 member(v2, v0) = v5 & ( ~ (v5 = 0) | v6 = 0))) & ! [v0: $i] : ! [v1: $i]
% 4.95/1.46 : ! [v2: $i] : ! [v3: $i] : ( ~ (difference(v0, v1) = v3) | ~ (member(v2,
% 4.95/1.46 v3) = 0) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v4: int] : ( ~ (v4 =
% 4.95/1.46 0) & member(v2, v1) = v4 & member(v2, v0) = 0))
% 4.95/1.46
% 4.95/1.46 (prove_subset_difference)
% 4.95/1.47 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ? [v4: $i] : ? [v5:
% 4.95/1.47 int] : ( ~ (v5 = 0) & subset(v3, v4) = v5 & subset(v0, v1) = 0 &
% 4.95/1.47 difference(v2, v1) = v3 & difference(v2, v0) = v4 & $i(v4) & $i(v3) & $i(v2)
% 4.95/1.47 & $i(v1) & $i(v0))
% 4.95/1.47
% 4.95/1.47 (subset_defn)
% 4.95/1.47 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (subset(v0, v1) = v2)
% 4.95/1.47 | ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : ? [v4: int] : ( ~ (v4 = 0) &
% 4.95/1.47 member(v3, v1) = v4 & member(v3, v0) = 0 & $i(v3))) & ! [v0: $i] : !
% 4.95/1.47 [v1: $i] : ( ~ (subset(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0) | ! [v2: $i] : (
% 4.95/1.47 ~ (member(v2, v0) = 0) | ~ $i(v2) | member(v2, v1) = 0))
% 4.95/1.47
% 4.95/1.47 (function-axioms)
% 4.95/1.47 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : !
% 4.95/1.47 [v3: $i] : (v1 = v0 | ~ (subset(v3, v2) = v1) | ~ (subset(v3, v2) = v0)) &
% 4.95/1.47 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 4.95/1.47 (difference(v3, v2) = v1) | ~ (difference(v3, v2) = v0)) & ! [v0:
% 4.95/1.47 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i]
% 4.95/1.47 : (v1 = v0 | ~ (member(v3, v2) = v1) | ~ (member(v3, v2) = v0))
% 4.95/1.47
% 4.95/1.47 Further assumptions not needed in the proof:
% 4.95/1.47 --------------------------------------------
% 4.95/1.48 reflexivity_of_subset
% 4.95/1.48
% 4.95/1.48 Those formulas are unsatisfiable:
% 4.95/1.48 ---------------------------------
% 4.95/1.48
% 4.95/1.48 Begin of proof
% 4.95/1.48 |
% 4.95/1.48 | ALPHA: (difference_defn) implies:
% 4.95/1.48 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ( ~
% 4.95/1.48 | (difference(v0, v1) = v3) | ~ (member(v2, v3) = 0) | ~ $i(v2) | ~
% 4.95/1.48 | $i(v1) | ~ $i(v0) | ? [v4: int] : ( ~ (v4 = 0) & member(v2, v1) =
% 4.95/1.48 | v4 & member(v2, v0) = 0))
% 4.95/1.48 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : ! [v4: int] :
% 4.95/1.48 | (v4 = 0 | ~ (difference(v0, v1) = v3) | ~ (member(v2, v3) = v4) | ~
% 4.95/1.48 | $i(v2) | ~ $i(v1) | ~ $i(v0) | ? [v5: any] : ? [v6: any] :
% 4.95/1.48 | (member(v2, v1) = v6 & member(v2, v0) = v5 & ( ~ (v5 = 0) | v6 = 0)))
% 4.95/1.48 |
% 4.95/1.48 | ALPHA: (subset_defn) implies:
% 4.95/1.48 | (3) ! [v0: $i] : ! [v1: $i] : ( ~ (subset(v0, v1) = 0) | ~ $i(v1) | ~
% 4.95/1.48 | $i(v0) | ! [v2: $i] : ( ~ (member(v2, v0) = 0) | ~ $i(v2) |
% 4.95/1.48 | member(v2, v1) = 0))
% 4.95/1.49 | (4) ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | ~ (subset(v0, v1)
% 4.95/1.49 | = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : ? [v4: int] : ( ~
% 4.95/1.49 | (v4 = 0) & member(v3, v1) = v4 & member(v3, v0) = 0 & $i(v3)))
% 4.95/1.49 |
% 4.95/1.49 | ALPHA: (function-axioms) implies:
% 4.95/1.49 | (5) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] :
% 4.95/1.49 | ! [v3: $i] : (v1 = v0 | ~ (member(v3, v2) = v1) | ~ (member(v3, v2)
% 4.95/1.49 | = v0))
% 4.95/1.49 |
% 4.95/1.49 | DELTA: instantiating (prove_subset_difference) with fresh symbols all_6_0,
% 4.95/1.49 | all_6_1, all_6_2, all_6_3, all_6_4, all_6_5 gives:
% 4.95/1.49 | (6) ~ (all_6_0 = 0) & subset(all_6_2, all_6_1) = all_6_0 & subset(all_6_5,
% 4.95/1.49 | all_6_4) = 0 & difference(all_6_3, all_6_4) = all_6_2 &
% 4.95/1.49 | difference(all_6_3, all_6_5) = all_6_1 & $i(all_6_1) & $i(all_6_2) &
% 4.95/1.49 | $i(all_6_3) & $i(all_6_4) & $i(all_6_5)
% 4.95/1.49 |
% 4.95/1.49 | ALPHA: (6) implies:
% 4.95/1.49 | (7) ~ (all_6_0 = 0)
% 4.95/1.49 | (8) $i(all_6_5)
% 4.95/1.49 | (9) $i(all_6_4)
% 4.95/1.49 | (10) $i(all_6_3)
% 4.95/1.49 | (11) $i(all_6_2)
% 4.95/1.49 | (12) $i(all_6_1)
% 4.95/1.49 | (13) difference(all_6_3, all_6_5) = all_6_1
% 4.95/1.49 | (14) difference(all_6_3, all_6_4) = all_6_2
% 4.95/1.49 | (15) subset(all_6_5, all_6_4) = 0
% 4.95/1.49 | (16) subset(all_6_2, all_6_1) = all_6_0
% 4.95/1.49 |
% 4.95/1.49 | GROUND_INST: instantiating (3) with all_6_5, all_6_4, simplifying with (8),
% 4.95/1.49 | (9), (15) gives:
% 4.95/1.49 | (17) ! [v0: $i] : ( ~ (member(v0, all_6_5) = 0) | ~ $i(v0) | member(v0,
% 4.95/1.49 | all_6_4) = 0)
% 4.95/1.49 |
% 4.95/1.49 | GROUND_INST: instantiating (4) with all_6_2, all_6_1, all_6_0, simplifying
% 4.95/1.49 | with (11), (12), (16) gives:
% 4.95/1.49 | (18) all_6_0 = 0 | ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & member(v0,
% 4.95/1.49 | all_6_1) = v1 & member(v0, all_6_2) = 0 & $i(v0))
% 4.95/1.49 |
% 4.95/1.49 | BETA: splitting (18) gives:
% 4.95/1.49 |
% 4.95/1.49 | Case 1:
% 4.95/1.49 | |
% 4.95/1.49 | | (19) all_6_0 = 0
% 4.95/1.50 | |
% 4.95/1.50 | | REDUCE: (7), (19) imply:
% 4.95/1.50 | | (20) $false
% 4.95/1.50 | |
% 4.95/1.50 | | CLOSE: (20) is inconsistent.
% 4.95/1.50 | |
% 4.95/1.50 | Case 2:
% 4.95/1.50 | |
% 4.95/1.50 | | (21) ? [v0: $i] : ? [v1: int] : ( ~ (v1 = 0) & member(v0, all_6_1) = v1
% 4.95/1.50 | | & member(v0, all_6_2) = 0 & $i(v0))
% 4.95/1.50 | |
% 4.95/1.50 | | DELTA: instantiating (21) with fresh symbols all_18_0, all_18_1 gives:
% 4.95/1.50 | | (22) ~ (all_18_0 = 0) & member(all_18_1, all_6_1) = all_18_0 &
% 4.95/1.50 | | member(all_18_1, all_6_2) = 0 & $i(all_18_1)
% 4.95/1.50 | |
% 4.95/1.50 | | ALPHA: (22) implies:
% 4.95/1.50 | | (23) ~ (all_18_0 = 0)
% 4.95/1.50 | | (24) $i(all_18_1)
% 4.95/1.50 | | (25) member(all_18_1, all_6_2) = 0
% 4.95/1.50 | | (26) member(all_18_1, all_6_1) = all_18_0
% 4.95/1.50 | |
% 4.95/1.50 | | GROUND_INST: instantiating (1) with all_6_3, all_6_4, all_18_1, all_6_2,
% 4.95/1.50 | | simplifying with (9), (10), (14), (24), (25) gives:
% 4.95/1.50 | | (27) ? [v0: int] : ( ~ (v0 = 0) & member(all_18_1, all_6_3) = 0 &
% 4.95/1.50 | | member(all_18_1, all_6_4) = v0)
% 4.95/1.50 | |
% 4.95/1.50 | | GROUND_INST: instantiating (2) with all_6_3, all_6_5, all_18_1, all_6_1,
% 4.95/1.50 | | all_18_0, simplifying with (8), (10), (13), (24), (26) gives:
% 4.95/1.50 | | (28) all_18_0 = 0 | ? [v0: any] : ? [v1: any] : (member(all_18_1,
% 4.95/1.50 | | all_6_3) = v0 & member(all_18_1, all_6_5) = v1 & ( ~ (v0 = 0) |
% 4.95/1.50 | | v1 = 0))
% 4.95/1.50 | |
% 4.95/1.50 | | DELTA: instantiating (27) with fresh symbol all_25_0 gives:
% 4.95/1.50 | | (29) ~ (all_25_0 = 0) & member(all_18_1, all_6_3) = 0 & member(all_18_1,
% 4.95/1.50 | | all_6_4) = all_25_0
% 4.95/1.50 | |
% 4.95/1.50 | | ALPHA: (29) implies:
% 4.95/1.50 | | (30) ~ (all_25_0 = 0)
% 4.95/1.50 | | (31) member(all_18_1, all_6_4) = all_25_0
% 4.95/1.50 | | (32) member(all_18_1, all_6_3) = 0
% 4.95/1.50 | |
% 4.95/1.50 | | BETA: splitting (28) gives:
% 4.95/1.50 | |
% 4.95/1.50 | | Case 1:
% 4.95/1.50 | | |
% 4.95/1.50 | | | (33) all_18_0 = 0
% 4.95/1.50 | | |
% 4.95/1.50 | | | REDUCE: (23), (33) imply:
% 4.95/1.50 | | | (34) $false
% 4.95/1.50 | | |
% 4.95/1.50 | | | CLOSE: (34) is inconsistent.
% 4.95/1.50 | | |
% 4.95/1.50 | | Case 2:
% 4.95/1.50 | | |
% 4.95/1.50 | | | (35) ? [v0: any] : ? [v1: any] : (member(all_18_1, all_6_3) = v0 &
% 4.95/1.50 | | | member(all_18_1, all_6_5) = v1 & ( ~ (v0 = 0) | v1 = 0))
% 4.95/1.50 | | |
% 4.95/1.50 | | | DELTA: instantiating (35) with fresh symbols all_31_0, all_31_1 gives:
% 4.95/1.51 | | | (36) member(all_18_1, all_6_3) = all_31_1 & member(all_18_1, all_6_5) =
% 4.95/1.51 | | | all_31_0 & ( ~ (all_31_1 = 0) | all_31_0 = 0)
% 4.95/1.51 | | |
% 4.95/1.51 | | | ALPHA: (36) implies:
% 4.95/1.51 | | | (37) member(all_18_1, all_6_5) = all_31_0
% 4.95/1.51 | | | (38) member(all_18_1, all_6_3) = all_31_1
% 4.95/1.51 | | | (39) ~ (all_31_1 = 0) | all_31_0 = 0
% 4.95/1.51 | | |
% 4.95/1.51 | | | GROUND_INST: instantiating (5) with 0, all_31_1, all_6_3, all_18_1,
% 4.95/1.51 | | | simplifying with (32), (38) gives:
% 4.95/1.51 | | | (40) all_31_1 = 0
% 4.95/1.51 | | |
% 4.95/1.51 | | | BETA: splitting (39) gives:
% 4.95/1.51 | | |
% 4.95/1.51 | | | Case 1:
% 4.95/1.51 | | | |
% 4.95/1.51 | | | | (41) ~ (all_31_1 = 0)
% 4.95/1.51 | | | |
% 4.95/1.51 | | | | REDUCE: (40), (41) imply:
% 4.95/1.51 | | | | (42) $false
% 4.95/1.51 | | | |
% 4.95/1.51 | | | | CLOSE: (42) is inconsistent.
% 4.95/1.51 | | | |
% 4.95/1.51 | | | Case 2:
% 4.95/1.51 | | | |
% 4.95/1.51 | | | | (43) all_31_0 = 0
% 4.95/1.51 | | | |
% 4.95/1.51 | | | | REDUCE: (37), (43) imply:
% 4.95/1.51 | | | | (44) member(all_18_1, all_6_5) = 0
% 4.95/1.51 | | | |
% 4.95/1.51 | | | | GROUND_INST: instantiating (17) with all_18_1, simplifying with (24),
% 4.95/1.51 | | | | (44) gives:
% 4.95/1.51 | | | | (45) member(all_18_1, all_6_4) = 0
% 4.95/1.51 | | | |
% 4.95/1.51 | | | | GROUND_INST: instantiating (5) with all_25_0, 0, all_6_4, all_18_1,
% 4.95/1.51 | | | | simplifying with (31), (45) gives:
% 4.95/1.51 | | | | (46) all_25_0 = 0
% 4.95/1.51 | | | |
% 4.95/1.51 | | | | REDUCE: (30), (46) imply:
% 4.95/1.51 | | | | (47) $false
% 4.95/1.51 | | | |
% 4.95/1.51 | | | | CLOSE: (47) is inconsistent.
% 4.95/1.51 | | | |
% 4.95/1.51 | | | End of split
% 4.95/1.51 | | |
% 4.95/1.51 | | End of split
% 4.95/1.51 | |
% 4.95/1.51 | End of split
% 4.95/1.51 |
% 4.95/1.51 End of proof
% 4.95/1.51 % SZS output end Proof for theBenchmark
% 4.95/1.51
% 4.95/1.51 907ms
%------------------------------------------------------------------------------