TSTP Solution File: SEU150+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SEU150+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 : n006.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:48 EDT 2023
% Result : Theorem 3.51s 1.21s
% Output : Proof 3.88s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU150+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.35 % Computer : n006.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Wed Aug 23 16:17:08 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.67 ________ _____
% 0.20/0.67 ___ __ \_________(_)________________________________
% 0.20/0.67 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.67 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.67 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.67
% 0.20/0.67 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.67 (2023-06-19)
% 0.20/0.67
% 0.20/0.67 (c) Philipp Rümmer, 2009-2023
% 0.20/0.67 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.67 Amanda Stjerna.
% 0.20/0.67 Free software under BSD-3-Clause.
% 0.20/0.67
% 0.20/0.67 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.67
% 0.20/0.67 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.20/0.69 Running up to 7 provers in parallel.
% 0.20/0.70 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.70 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.70 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.70 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.70 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.70 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.70 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.62/1.00 Prover 1: Preprocessing ...
% 1.62/1.00 Prover 4: Preprocessing ...
% 2.18/1.05 Prover 2: Preprocessing ...
% 2.18/1.05 Prover 0: Preprocessing ...
% 2.18/1.05 Prover 3: Preprocessing ...
% 2.18/1.05 Prover 6: Preprocessing ...
% 2.18/1.05 Prover 5: Preprocessing ...
% 2.63/1.12 Prover 4: Constructing countermodel ...
% 2.63/1.12 Prover 3: Constructing countermodel ...
% 2.63/1.12 Prover 1: Constructing countermodel ...
% 2.63/1.12 Prover 6: Constructing countermodel ...
% 2.63/1.13 Prover 0: Proving ...
% 2.63/1.14 Prover 5: Proving ...
% 2.63/1.15 Prover 2: Proving ...
% 3.51/1.21 Prover 6: proved (514ms)
% 3.51/1.21
% 3.51/1.21 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.51/1.21
% 3.51/1.21 Prover 3: proved (517ms)
% 3.51/1.21
% 3.51/1.21 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.51/1.21
% 3.51/1.22 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 3.51/1.22 Prover 5: stopped
% 3.51/1.22 Prover 0: stopped
% 3.51/1.22 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 3.51/1.22 Prover 2: stopped
% 3.51/1.22 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 3.51/1.22 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 3.51/1.22 Prover 7: Preprocessing ...
% 3.51/1.22 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 3.51/1.23 Prover 13: Preprocessing ...
% 3.51/1.23 Prover 8: Preprocessing ...
% 3.51/1.24 Prover 11: Preprocessing ...
% 3.51/1.25 Prover 10: Preprocessing ...
% 3.51/1.25 Prover 4: Found proof (size 12)
% 3.51/1.25 Prover 4: proved (560ms)
% 3.51/1.26 Prover 1: Found proof (size 11)
% 3.51/1.26 Prover 1: proved (569ms)
% 3.51/1.27 Prover 8: Warning: ignoring some quantifiers
% 3.51/1.27 Prover 8: Constructing countermodel ...
% 3.51/1.27 Prover 7: Constructing countermodel ...
% 3.51/1.27 Prover 8: stopped
% 3.51/1.27 Prover 7: stopped
% 3.51/1.28 Prover 13: Warning: ignoring some quantifiers
% 3.51/1.28 Prover 13: Constructing countermodel ...
% 3.51/1.28 Prover 10: Constructing countermodel ...
% 3.51/1.29 Prover 13: stopped
% 3.51/1.29 Prover 10: stopped
% 3.51/1.29 Prover 11: Constructing countermodel ...
% 3.51/1.29 Prover 11: stopped
% 3.51/1.29
% 3.51/1.29 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.51/1.29
% 3.51/1.29 % SZS output start Proof for theBenchmark
% 3.51/1.30 Assumptions after simplification:
% 3.51/1.30 ---------------------------------
% 3.51/1.30
% 3.51/1.30 (commutativity_k2_tarski)
% 3.88/1.33 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (unordered_pair(v1, v0) = v2) |
% 3.88/1.33 ~ $i(v1) | ~ $i(v0) | (unordered_pair(v0, v1) = v2 & $i(v2))) & ! [v0: $i]
% 3.88/1.33 : ! [v1: $i] : ! [v2: $i] : ( ~ (unordered_pair(v0, v1) = v2) | ~ $i(v1) |
% 3.88/1.33 ~ $i(v0) | (unordered_pair(v1, v0) = v2 & $i(v2)))
% 3.88/1.33
% 3.88/1.33 (t8_zfmisc_1)
% 3.88/1.34 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~
% 3.88/1.34 (singleton(v0) = v3) | ~ (unordered_pair(v1, v2) = v3) | ~ $i(v2) | ~
% 3.88/1.34 $i(v1) | ~ $i(v0))
% 3.88/1.34
% 3.88/1.34 (t9_zfmisc_1)
% 3.88/1.34 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ( ~ (v2 = v1) &
% 3.88/1.34 singleton(v0) = v3 & unordered_pair(v1, v2) = v3 & $i(v3) & $i(v2) & $i(v1)
% 3.88/1.34 & $i(v0))
% 3.88/1.34
% 3.88/1.34 Further assumptions not needed in the proof:
% 3.88/1.34 --------------------------------------------
% 3.88/1.34 dt_k1_tarski, dt_k2_tarski
% 3.88/1.34
% 3.88/1.34 Those formulas are unsatisfiable:
% 3.88/1.34 ---------------------------------
% 3.88/1.34
% 3.88/1.34 Begin of proof
% 3.88/1.34 |
% 3.88/1.34 | ALPHA: (commutativity_k2_tarski) implies:
% 3.88/1.34 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (unordered_pair(v1, v0) =
% 3.88/1.34 | v2) | ~ $i(v1) | ~ $i(v0) | (unordered_pair(v0, v1) = v2 &
% 3.88/1.34 | $i(v2)))
% 3.88/1.34 |
% 3.88/1.34 | DELTA: instantiating (t9_zfmisc_1) with fresh symbols all_5_0, all_5_1,
% 3.88/1.34 | all_5_2, all_5_3 gives:
% 3.88/1.34 | (2) ~ (all_5_1 = all_5_2) & singleton(all_5_3) = all_5_0 &
% 3.88/1.34 | unordered_pair(all_5_2, all_5_1) = all_5_0 & $i(all_5_0) & $i(all_5_1)
% 3.88/1.34 | & $i(all_5_2) & $i(all_5_3)
% 3.88/1.34 |
% 3.88/1.34 | ALPHA: (2) implies:
% 3.88/1.35 | (3) ~ (all_5_1 = all_5_2)
% 3.88/1.35 | (4) $i(all_5_3)
% 3.88/1.35 | (5) $i(all_5_2)
% 3.88/1.35 | (6) $i(all_5_1)
% 3.88/1.35 | (7) unordered_pair(all_5_2, all_5_1) = all_5_0
% 3.88/1.35 | (8) singleton(all_5_3) = all_5_0
% 3.88/1.35 |
% 3.88/1.35 | GROUND_INST: instantiating (1) with all_5_1, all_5_2, all_5_0, simplifying
% 3.88/1.35 | with (5), (6), (7) gives:
% 3.88/1.35 | (9) unordered_pair(all_5_1, all_5_2) = all_5_0 & $i(all_5_0)
% 3.88/1.35 |
% 3.88/1.35 | ALPHA: (9) implies:
% 3.88/1.35 | (10) unordered_pair(all_5_1, all_5_2) = all_5_0
% 3.88/1.35 |
% 3.88/1.35 | GROUND_INST: instantiating (t8_zfmisc_1) with all_5_3, all_5_2, all_5_1,
% 3.88/1.35 | all_5_0, simplifying with (4), (5), (6), (7), (8) gives:
% 3.88/1.35 | (11) all_5_2 = all_5_3
% 3.88/1.35 |
% 3.88/1.35 | REDUCE: (3), (11) imply:
% 3.88/1.35 | (12) ~ (all_5_1 = all_5_3)
% 3.88/1.35 |
% 3.88/1.35 | REDUCE: (10), (11) imply:
% 3.88/1.35 | (13) unordered_pair(all_5_1, all_5_3) = all_5_0
% 3.88/1.35 |
% 3.88/1.35 | GROUND_INST: instantiating (t8_zfmisc_1) with all_5_3, all_5_1, all_5_3,
% 3.88/1.35 | all_5_0, simplifying with (4), (6), (8), (13) gives:
% 3.88/1.35 | (14) all_5_1 = all_5_3
% 3.88/1.35 |
% 3.88/1.35 | REDUCE: (12), (14) imply:
% 3.88/1.35 | (15) $false
% 3.88/1.35 |
% 3.88/1.35 | CLOSE: (15) is inconsistent.
% 3.88/1.35 |
% 3.88/1.35 End of proof
% 3.88/1.35 % SZS output end Proof for theBenchmark
% 3.88/1.35
% 3.88/1.35 680ms
%------------------------------------------------------------------------------