TSTP Solution File: SET913+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SET913+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 : n019.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:00 EDT 2023
% Result : Theorem 3.60s 1.19s
% Output : Proof 4.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET913+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.18/0.34 % Computer : n019.cluster.edu
% 0.18/0.34 % Model : x86_64 x86_64
% 0.18/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.34 % Memory : 8042.1875MB
% 0.18/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.34 % CPULimit : 300
% 0.18/0.34 % WCLimit : 300
% 0.18/0.34 % DateTime : Sat Aug 26 09:39:43 EDT 2023
% 0.18/0.34 % CPUTime :
% 0.21/0.61 ________ _____
% 0.21/0.61 ___ __ \_________(_)________________________________
% 0.21/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.21/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.21/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.21/0.61
% 0.21/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.21/0.61 (2023-06-19)
% 0.21/0.61
% 0.21/0.61 (c) Philipp Rümmer, 2009-2023
% 0.21/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.21/0.61 Amanda Stjerna.
% 0.21/0.61 Free software under BSD-3-Clause.
% 0.21/0.61
% 0.21/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.21/0.61
% 0.21/0.61 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.21/0.62 Running up to 7 provers in parallel.
% 0.21/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.21/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.21/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.21/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.21/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.21/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.21/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.92/0.95 Prover 1: Preprocessing ...
% 1.92/0.95 Prover 4: Preprocessing ...
% 1.92/0.99 Prover 3: Preprocessing ...
% 1.92/0.99 Prover 2: Preprocessing ...
% 1.92/0.99 Prover 0: Preprocessing ...
% 1.92/0.99 Prover 6: Preprocessing ...
% 1.92/0.99 Prover 5: Preprocessing ...
% 2.92/1.08 Prover 2: Proving ...
% 2.92/1.08 Prover 6: Constructing countermodel ...
% 2.92/1.09 Prover 5: Constructing countermodel ...
% 2.92/1.10 Prover 1: Constructing countermodel ...
% 2.92/1.11 Prover 3: Constructing countermodel ...
% 2.92/1.11 Prover 4: Constructing countermodel ...
% 2.92/1.12 Prover 0: Proving ...
% 3.60/1.19 Prover 5: proved (553ms)
% 3.60/1.19
% 3.60/1.19 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.60/1.19
% 3.60/1.19 Prover 3: proved (558ms)
% 3.60/1.19
% 3.60/1.19 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.60/1.19
% 3.60/1.20 Prover 0: stopped
% 3.60/1.20 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 3.60/1.20 Prover 6: stopped
% 3.60/1.20 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 3.60/1.20 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 3.60/1.20 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 3.60/1.21 Prover 7: Preprocessing ...
% 3.60/1.21 Prover 2: proved (583ms)
% 3.60/1.21
% 3.60/1.21 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.60/1.21
% 3.60/1.21 Prover 10: Preprocessing ...
% 3.60/1.21 Prover 11: Preprocessing ...
% 3.60/1.21 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 3.85/1.22 Prover 8: Preprocessing ...
% 3.99/1.23 Prover 10: Constructing countermodel ...
% 3.99/1.24 Prover 13: Preprocessing ...
% 3.99/1.24 Prover 7: Constructing countermodel ...
% 3.99/1.26 Prover 4: Found proof (size 10)
% 3.99/1.26 Prover 1: Found proof (size 9)
% 3.99/1.26 Prover 4: proved (628ms)
% 3.99/1.26 Prover 1: proved (630ms)
% 3.99/1.26 Prover 7: stopped
% 3.99/1.26 Prover 10: stopped
% 3.99/1.28 Prover 8: Warning: ignoring some quantifiers
% 3.99/1.28 Prover 13: Constructing countermodel ...
% 3.99/1.28 Prover 11: Constructing countermodel ...
% 3.99/1.28 Prover 13: stopped
% 3.99/1.28 Prover 8: Constructing countermodel ...
% 3.99/1.28 Prover 11: stopped
% 3.99/1.29 Prover 8: stopped
% 3.99/1.29
% 3.99/1.29 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.99/1.29
% 3.99/1.29 % SZS output start Proof for theBenchmark
% 3.99/1.29 Assumptions after simplification:
% 3.99/1.29 ---------------------------------
% 3.99/1.29
% 3.99/1.29 (l25_zfmisc_1)
% 4.44/1.33 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (singleton(v0) = v2) | ~
% 4.44/1.33 (disjoint(v2, v1) = 0) | ~ $i(v1) | ~ $i(v0) | ? [v3: int] : ( ~ (v3 = 0)
% 4.44/1.33 & in(v0, v1) = v3)) & ! [v0: $i] : ! [v1: $i] : ( ~ (in(v0, v1) = 0) |
% 4.44/1.33 ~ $i(v1) | ~ $i(v0) | ? [v2: $i] : ? [v3: int] : ( ~ (v3 = 0) &
% 4.44/1.33 singleton(v0) = v2 & disjoint(v2, v1) = v3 & $i(v2)))
% 4.44/1.33
% 4.44/1.33 (t54_zfmisc_1)
% 4.44/1.33 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : (singleton(v0) = v2 & in(v0, v1) = 0
% 4.44/1.33 & disjoint(v2, v1) = 0 & $i(v2) & $i(v1) & $i(v0))
% 4.44/1.33
% 4.44/1.33 (function-axioms)
% 4.44/1.33 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : !
% 4.44/1.33 [v3: $i] : (v1 = v0 | ~ (in(v3, v2) = v1) | ~ (in(v3, v2) = v0)) & ! [v0:
% 4.44/1.33 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! [v3: $i]
% 4.44/1.33 : (v1 = v0 | ~ (disjoint(v3, v2) = v1) | ~ (disjoint(v3, v2) = v0)) & !
% 4.44/1.33 [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v1 = v0 | ~ (singleton(v2) = v1) | ~
% 4.44/1.33 (singleton(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1:
% 4.44/1.33 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (empty(v2) = v1) | ~
% 4.44/1.33 (empty(v2) = v0))
% 4.44/1.33
% 4.44/1.33 Further assumptions not needed in the proof:
% 4.44/1.33 --------------------------------------------
% 4.44/1.33 antisymmetry_r2_hidden, rc1_xboole_0, rc2_xboole_0, symmetry_r1_xboole_0
% 4.44/1.33
% 4.44/1.33 Those formulas are unsatisfiable:
% 4.44/1.33 ---------------------------------
% 4.44/1.33
% 4.44/1.33 Begin of proof
% 4.44/1.34 |
% 4.44/1.34 | ALPHA: (l25_zfmisc_1) implies:
% 4.44/1.34 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (singleton(v0) = v2) | ~
% 4.44/1.34 | (disjoint(v2, v1) = 0) | ~ $i(v1) | ~ $i(v0) | ? [v3: int] : ( ~
% 4.44/1.34 | (v3 = 0) & in(v0, v1) = v3))
% 4.44/1.34 |
% 4.44/1.34 | ALPHA: (function-axioms) implies:
% 4.44/1.34 | (2) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] :
% 4.44/1.34 | ! [v3: $i] : (v1 = v0 | ~ (in(v3, v2) = v1) | ~ (in(v3, v2) = v0))
% 4.44/1.34 |
% 4.44/1.34 | DELTA: instantiating (t54_zfmisc_1) with fresh symbols all_10_0, all_10_1,
% 4.44/1.34 | all_10_2 gives:
% 4.44/1.34 | (3) singleton(all_10_2) = all_10_0 & in(all_10_2, all_10_1) = 0 &
% 4.44/1.34 | disjoint(all_10_0, all_10_1) = 0 & $i(all_10_0) & $i(all_10_1) &
% 4.44/1.34 | $i(all_10_2)
% 4.44/1.34 |
% 4.44/1.34 | ALPHA: (3) implies:
% 4.44/1.34 | (4) $i(all_10_2)
% 4.44/1.34 | (5) $i(all_10_1)
% 4.44/1.34 | (6) disjoint(all_10_0, all_10_1) = 0
% 4.44/1.34 | (7) in(all_10_2, all_10_1) = 0
% 4.44/1.34 | (8) singleton(all_10_2) = all_10_0
% 4.44/1.34 |
% 4.44/1.35 | GROUND_INST: instantiating (1) with all_10_2, all_10_1, all_10_0, simplifying
% 4.44/1.35 | with (4), (5), (6), (8) gives:
% 4.44/1.35 | (9) ? [v0: int] : ( ~ (v0 = 0) & in(all_10_2, all_10_1) = v0)
% 4.44/1.35 |
% 4.44/1.35 | DELTA: instantiating (9) with fresh symbol all_18_0 gives:
% 4.44/1.35 | (10) ~ (all_18_0 = 0) & in(all_10_2, all_10_1) = all_18_0
% 4.44/1.35 |
% 4.44/1.35 | ALPHA: (10) implies:
% 4.44/1.35 | (11) ~ (all_18_0 = 0)
% 4.44/1.35 | (12) in(all_10_2, all_10_1) = all_18_0
% 4.44/1.35 |
% 4.44/1.35 | GROUND_INST: instantiating (2) with 0, all_18_0, all_10_1, all_10_2,
% 4.44/1.35 | simplifying with (7), (12) gives:
% 4.44/1.35 | (13) all_18_0 = 0
% 4.44/1.35 |
% 4.44/1.35 | REDUCE: (11), (13) imply:
% 4.44/1.35 | (14) $false
% 4.44/1.35 |
% 4.44/1.35 | CLOSE: (14) is inconsistent.
% 4.44/1.35 |
% 4.44/1.35 End of proof
% 4.44/1.35 % SZS output end Proof for theBenchmark
% 4.44/1.35
% 4.44/1.35 743ms
%------------------------------------------------------------------------------