TSTP Solution File: SEU139+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SEU139+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 : n004.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:43 EDT 2023
% Result : Theorem 3.86s 1.22s
% Output : Proof 4.37s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU139+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 : n004.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 16:43:38 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.19/0.62 ________ _____
% 0.19/0.62 ___ __ \_________(_)________________________________
% 0.19/0.62 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.19/0.62 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.19/0.62 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.19/0.62
% 0.19/0.62 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.19/0.62 (2023-06-19)
% 0.19/0.62
% 0.19/0.62 (c) Philipp Rümmer, 2009-2023
% 0.19/0.62 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.19/0.62 Amanda Stjerna.
% 0.19/0.62 Free software under BSD-3-Clause.
% 0.19/0.62
% 0.19/0.62 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.19/0.62
% 0.19/0.62 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.19/0.63 Running up to 7 provers in parallel.
% 0.19/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.19/0.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.19/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.19/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.19/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.19/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.19/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.91/0.96 Prover 1: Preprocessing ...
% 1.91/0.96 Prover 4: Preprocessing ...
% 1.91/1.01 Prover 0: Preprocessing ...
% 1.91/1.01 Prover 5: Preprocessing ...
% 1.91/1.01 Prover 6: Preprocessing ...
% 1.91/1.01 Prover 3: Preprocessing ...
% 1.91/1.01 Prover 2: Preprocessing ...
% 2.89/1.11 Prover 5: Proving ...
% 2.89/1.11 Prover 2: Proving ...
% 2.89/1.13 Prover 3: Warning: ignoring some quantifiers
% 2.89/1.14 Prover 6: Proving ...
% 2.89/1.14 Prover 1: Warning: ignoring some quantifiers
% 2.89/1.15 Prover 1: Constructing countermodel ...
% 2.89/1.15 Prover 3: Constructing countermodel ...
% 2.89/1.16 Prover 4: Constructing countermodel ...
% 3.63/1.19 Prover 0: Proving ...
% 3.86/1.22 Prover 3: proved (582ms)
% 3.86/1.22
% 3.86/1.22 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.86/1.22
% 3.86/1.23 Prover 0: stopped
% 3.86/1.23 Prover 2: proved (592ms)
% 3.86/1.23
% 3.86/1.23 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.86/1.23
% 3.86/1.24 Prover 6: proved (582ms)
% 3.86/1.24
% 3.86/1.24 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.86/1.24
% 3.86/1.25 Prover 5: proved (583ms)
% 3.86/1.25
% 3.86/1.25 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.86/1.25
% 3.86/1.26 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 3.86/1.26 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 3.86/1.26 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 3.86/1.26 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 3.86/1.26 Prover 10: Preprocessing ...
% 3.86/1.27 Prover 8: Preprocessing ...
% 3.86/1.27 Prover 7: Preprocessing ...
% 3.86/1.27 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 3.86/1.27 Prover 11: Preprocessing ...
% 3.86/1.28 Prover 13: Preprocessing ...
% 3.86/1.29 Prover 1: Found proof (size 16)
% 3.86/1.29 Prover 1: proved (654ms)
% 3.86/1.29 Prover 4: stopped
% 3.86/1.29 Prover 10: Warning: ignoring some quantifiers
% 3.86/1.29 Prover 7: Warning: ignoring some quantifiers
% 3.86/1.30 Prover 10: Constructing countermodel ...
% 3.86/1.30 Prover 10: stopped
% 3.86/1.30 Prover 11: stopped
% 3.86/1.31 Prover 7: Constructing countermodel ...
% 3.86/1.31 Prover 7: stopped
% 3.86/1.32 Prover 13: Warning: ignoring some quantifiers
% 3.86/1.32 Prover 8: Warning: ignoring some quantifiers
% 3.86/1.32 Prover 13: Constructing countermodel ...
% 3.86/1.32 Prover 8: Constructing countermodel ...
% 3.86/1.32 Prover 13: stopped
% 3.86/1.32 Prover 8: stopped
% 3.86/1.33
% 3.86/1.33 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.86/1.33
% 4.37/1.33 % SZS output start Proof for theBenchmark
% 4.37/1.33 Assumptions after simplification:
% 4.37/1.33 ---------------------------------
% 4.37/1.33
% 4.37/1.33 (d10_xboole_0)
% 4.37/1.36 ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ (subset(v0, v1) = 0) | ~ $i(v1) |
% 4.37/1.36 ~ $i(v0) | ? [v2: int] : ( ~ (v2 = 0) & subset(v1, v0) = v2)) & ! [v0: $i]
% 4.37/1.36 : ! [v1: int] : (v1 = 0 | ~ (subset(v0, v0) = v1) | ~ $i(v0))
% 4.37/1.36
% 4.37/1.36 (d8_xboole_0)
% 4.37/1.36 ! [v0: $i] : ! [v1: $i] : ! [v2: int] : (v2 = 0 | v1 = v0 | ~
% 4.37/1.36 (proper_subset(v0, v1) = v2) | ~ $i(v1) | ~ $i(v0) | ? [v3: int] : ( ~
% 4.37/1.36 (v3 = 0) & subset(v0, v1) = v3)) & ! [v0: $i] : ! [v1: $i] : ( ~
% 4.37/1.36 (proper_subset(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0) | ( ~ (v1 = v0) &
% 4.37/1.36 subset(v0, v1) = 0))
% 4.37/1.36
% 4.37/1.36 (t60_xboole_1)
% 4.37/1.37 ? [v0: $i] : ? [v1: $i] : (subset(v0, v1) = 0 & proper_subset(v1, v0) = 0 &
% 4.37/1.37 $i(v1) & $i(v0))
% 4.37/1.37
% 4.37/1.37 (function-axioms)
% 4.37/1.37 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : !
% 4.37/1.37 [v3: $i] : (v1 = v0 | ~ (subset(v3, v2) = v1) | ~ (subset(v3, v2) = v0)) &
% 4.37/1.37 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3:
% 4.37/1.37 $i] : (v1 = v0 | ~ (proper_subset(v3, v2) = v1) | ~ (proper_subset(v3, v2)
% 4.37/1.37 = v0))
% 4.37/1.37
% 4.37/1.37 Further assumptions not needed in the proof:
% 4.37/1.37 --------------------------------------------
% 4.37/1.37 antisymmetry_r2_xboole_0, irreflexivity_r2_xboole_0, reflexivity_r1_tarski
% 4.37/1.37
% 4.37/1.37 Those formulas are unsatisfiable:
% 4.37/1.37 ---------------------------------
% 4.37/1.37
% 4.37/1.37 Begin of proof
% 4.37/1.37 |
% 4.37/1.37 | ALPHA: (d10_xboole_0) implies:
% 4.37/1.37 | (1) ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ (subset(v0, v1) = 0) | ~
% 4.37/1.37 | $i(v1) | ~ $i(v0) | ? [v2: int] : ( ~ (v2 = 0) & subset(v1, v0) =
% 4.37/1.37 | v2))
% 4.37/1.37 |
% 4.37/1.37 | ALPHA: (d8_xboole_0) implies:
% 4.37/1.38 | (2) ! [v0: $i] : ! [v1: $i] : ( ~ (proper_subset(v0, v1) = 0) | ~ $i(v1)
% 4.37/1.38 | | ~ $i(v0) | ( ~ (v1 = v0) & subset(v0, v1) = 0))
% 4.37/1.38 |
% 4.37/1.38 | ALPHA: (function-axioms) implies:
% 4.37/1.38 | (3) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] :
% 4.37/1.38 | ! [v3: $i] : (v1 = v0 | ~ (subset(v3, v2) = v1) | ~ (subset(v3, v2)
% 4.37/1.38 | = v0))
% 4.37/1.38 |
% 4.37/1.38 | DELTA: instantiating (t60_xboole_1) with fresh symbols all_10_0, all_10_1
% 4.37/1.38 | gives:
% 4.37/1.38 | (4) subset(all_10_1, all_10_0) = 0 & proper_subset(all_10_0, all_10_1) = 0
% 4.37/1.38 | & $i(all_10_0) & $i(all_10_1)
% 4.37/1.38 |
% 4.37/1.38 | ALPHA: (4) implies:
% 4.37/1.38 | (5) $i(all_10_1)
% 4.37/1.38 | (6) $i(all_10_0)
% 4.37/1.38 | (7) proper_subset(all_10_0, all_10_1) = 0
% 4.37/1.38 | (8) subset(all_10_1, all_10_0) = 0
% 4.37/1.38 |
% 4.37/1.38 | GROUND_INST: instantiating (2) with all_10_0, all_10_1, simplifying with (5),
% 4.37/1.38 | (6), (7) gives:
% 4.37/1.38 | (9) ~ (all_10_0 = all_10_1) & subset(all_10_0, all_10_1) = 0
% 4.37/1.38 |
% 4.37/1.38 | ALPHA: (9) implies:
% 4.37/1.38 | (10) ~ (all_10_0 = all_10_1)
% 4.37/1.38 | (11) subset(all_10_0, all_10_1) = 0
% 4.37/1.38 |
% 4.37/1.38 | GROUND_INST: instantiating (1) with all_10_1, all_10_0, simplifying with (5),
% 4.37/1.38 | (6), (8) gives:
% 4.37/1.39 | (12) all_10_0 = all_10_1 | ? [v0: int] : ( ~ (v0 = 0) & subset(all_10_0,
% 4.37/1.39 | all_10_1) = v0)
% 4.37/1.39 |
% 4.37/1.39 | BETA: splitting (12) gives:
% 4.37/1.39 |
% 4.37/1.39 | Case 1:
% 4.37/1.39 | |
% 4.37/1.39 | | (13) all_10_0 = all_10_1
% 4.37/1.39 | |
% 4.37/1.39 | | REDUCE: (10), (13) imply:
% 4.37/1.39 | | (14) $false
% 4.37/1.39 | |
% 4.37/1.39 | | CLOSE: (14) is inconsistent.
% 4.37/1.39 | |
% 4.37/1.39 | Case 2:
% 4.37/1.39 | |
% 4.37/1.39 | | (15) ? [v0: int] : ( ~ (v0 = 0) & subset(all_10_0, all_10_1) = v0)
% 4.37/1.39 | |
% 4.37/1.39 | | DELTA: instantiating (15) with fresh symbol all_24_0 gives:
% 4.37/1.39 | | (16) ~ (all_24_0 = 0) & subset(all_10_0, all_10_1) = all_24_0
% 4.37/1.39 | |
% 4.37/1.39 | | ALPHA: (16) implies:
% 4.37/1.39 | | (17) ~ (all_24_0 = 0)
% 4.37/1.39 | | (18) subset(all_10_0, all_10_1) = all_24_0
% 4.37/1.39 | |
% 4.37/1.39 | | GROUND_INST: instantiating (3) with 0, all_24_0, all_10_1, all_10_0,
% 4.37/1.39 | | simplifying with (11), (18) gives:
% 4.37/1.39 | | (19) all_24_0 = 0
% 4.37/1.39 | |
% 4.37/1.39 | | REDUCE: (17), (19) imply:
% 4.37/1.39 | | (20) $false
% 4.37/1.39 | |
% 4.37/1.39 | | CLOSE: (20) is inconsistent.
% 4.37/1.39 | |
% 4.37/1.39 | End of split
% 4.37/1.39 |
% 4.37/1.39 End of proof
% 4.37/1.39 % SZS output end Proof for theBenchmark
% 4.37/1.39
% 4.37/1.39 775ms
%------------------------------------------------------------------------------