TSTP Solution File: SEU148+2 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SEU148+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n014.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:47 EDT 2023
% Result : Theorem 11.14s 2.24s
% Output : Proof 13.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SEU148+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.12/0.33 % Computer : n014.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Aug 23 23:47:49 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.60 ________ _____
% 0.18/0.60 ___ __ \_________(_)________________________________
% 0.18/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.18/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.18/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.18/0.60
% 0.18/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.18/0.60 (2023-06-19)
% 0.18/0.60
% 0.18/0.60 (c) Philipp Rümmer, 2009-2023
% 0.18/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.18/0.60 Amanda Stjerna.
% 0.18/0.60 Free software under BSD-3-Clause.
% 0.18/0.60
% 0.18/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.18/0.60
% 0.18/0.60 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.18/0.61 Running up to 7 provers in parallel.
% 0.18/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.18/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.18/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.18/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.18/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.18/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.18/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 3.07/1.12 Prover 1: Preprocessing ...
% 3.07/1.12 Prover 4: Preprocessing ...
% 3.33/1.16 Prover 2: Preprocessing ...
% 3.33/1.16 Prover 6: Preprocessing ...
% 3.33/1.16 Prover 5: Preprocessing ...
% 3.33/1.16 Prover 3: Preprocessing ...
% 3.33/1.17 Prover 0: Preprocessing ...
% 8.44/1.87 Prover 1: Warning: ignoring some quantifiers
% 8.44/1.89 Prover 5: Proving ...
% 9.19/1.97 Prover 1: Constructing countermodel ...
% 9.19/1.98 Prover 3: Warning: ignoring some quantifiers
% 9.19/2.03 Prover 3: Constructing countermodel ...
% 9.19/2.09 Prover 4: Warning: ignoring some quantifiers
% 9.19/2.11 Prover 6: Proving ...
% 9.19/2.14 Prover 2: Proving ...
% 9.19/2.15 Prover 4: Constructing countermodel ...
% 10.09/2.23 Prover 3: proved (1610ms)
% 10.09/2.23
% 11.14/2.24 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.14/2.24
% 11.14/2.24 Prover 6: stopped
% 11.14/2.24 Prover 5: stopped
% 11.14/2.24 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 11.14/2.26 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 11.14/2.26 Prover 2: stopped
% 11.14/2.27 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 11.14/2.27 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 11.49/2.30 Prover 1: Found proof (size 10)
% 11.49/2.30 Prover 1: proved (1680ms)
% 11.49/2.31 Prover 4: stopped
% 11.49/2.31 Prover 7: Preprocessing ...
% 11.49/2.32 Prover 0: Proving ...
% 11.49/2.32 Prover 0: stopped
% 11.49/2.32 Prover 8: Preprocessing ...
% 11.49/2.34 Prover 11: Preprocessing ...
% 11.92/2.35 Prover 10: Preprocessing ...
% 11.92/2.36 Prover 7: stopped
% 12.01/2.39 Prover 10: stopped
% 12.31/2.41 Prover 11: stopped
% 12.49/2.50 Prover 8: Warning: ignoring some quantifiers
% 12.49/2.52 Prover 8: Constructing countermodel ...
% 12.93/2.53 Prover 8: stopped
% 12.93/2.53
% 12.93/2.53 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 12.93/2.53
% 12.93/2.54 % SZS output start Proof for theBenchmark
% 12.93/2.55 Assumptions after simplification:
% 12.93/2.55 ---------------------------------
% 12.93/2.55
% 12.93/2.55 (d1_tarski)
% 13.15/2.60 ? [v0: $i] : ! [v1: $i] : ! [v2: $i] : (v2 = v0 | ~ (singleton(v1) = v2) |
% 13.15/2.60 ~ $i(v1) | ~ $i(v0) | ? [v3: $i] : ? [v4: any] : (in(v3, v0) = v4 &
% 13.15/2.60 $i(v3) & ( ~ (v4 = 0) | ~ (v3 = v1)) & (v4 = 0 | v3 = v1))) & ! [v0: $i]
% 13.15/2.60 : ! [v1: $i] : ( ~ (singleton(v0) = v1) | ~ $i(v1) | ~ $i(v0) | ( ! [v2:
% 13.15/2.60 $i] : (v2 = v0 | ~ (in(v2, v1) = 0) | ~ $i(v2)) & ! [v2: int] : (v2 =
% 13.15/2.60 0 | ~ (in(v0, v1) = v2))))
% 13.15/2.60
% 13.15/2.60 (l2_zfmisc_1)
% 13.15/2.60 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~
% 13.15/2.60 (singleton(v0) = v2) | ~ (subset(v2, v1) = v3) | ~ $i(v1) | ~ $i(v0) | ?
% 13.15/2.60 [v4: int] : ( ~ (v4 = 0) & in(v0, v1) = v4)) & ! [v0: $i] : ! [v1: $i] :
% 13.15/2.60 ! [v2: $i] : ( ~ (singleton(v0) = v2) | ~ (subset(v2, v1) = 0) | ~ $i(v1) |
% 13.15/2.60 ~ $i(v0) | in(v0, v1) = 0)
% 13.15/2.60
% 13.15/2.60 (t6_zfmisc_1)
% 13.15/2.60 ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: $i] : ( ~ (v1 = v0) &
% 13.15/2.60 singleton(v1) = v3 & singleton(v0) = v2 & subset(v2, v3) = 0 & $i(v3) &
% 13.15/2.60 $i(v2) & $i(v1) & $i(v0))
% 13.15/2.60
% 13.15/2.60 Further assumptions not needed in the proof:
% 13.15/2.60 --------------------------------------------
% 13.15/2.60 antisymmetry_r2_hidden, antisymmetry_r2_xboole_0, commutativity_k2_tarski,
% 13.15/2.60 commutativity_k2_xboole_0, commutativity_k3_xboole_0, d10_xboole_0, d1_xboole_0,
% 13.15/2.60 d1_zfmisc_1, d2_tarski, d2_xboole_0, d3_tarski, d3_xboole_0, d4_xboole_0,
% 13.15/2.60 d7_xboole_0, d8_xboole_0, dt_k1_tarski, dt_k1_xboole_0, dt_k1_zfmisc_1,
% 13.15/2.60 dt_k2_tarski, dt_k2_xboole_0, dt_k3_xboole_0, dt_k4_xboole_0, fc1_xboole_0,
% 13.15/2.60 fc2_xboole_0, fc3_xboole_0, idempotence_k2_xboole_0, idempotence_k3_xboole_0,
% 13.15/2.60 irreflexivity_r2_xboole_0, l1_zfmisc_1, l32_xboole_1, l3_zfmisc_1, l4_zfmisc_1,
% 13.15/2.60 rc1_xboole_0, rc2_xboole_0, reflexivity_r1_tarski, symmetry_r1_xboole_0,
% 13.15/2.60 t12_xboole_1, t17_xboole_1, t19_xboole_1, t1_boole, t1_xboole_1, t1_zfmisc_1,
% 13.15/2.60 t26_xboole_1, t28_xboole_1, t2_boole, t2_tarski, t2_xboole_1, t33_xboole_1,
% 13.15/2.60 t36_xboole_1, t37_xboole_1, t39_xboole_1, t3_boole, t3_xboole_0, t3_xboole_1,
% 13.15/2.60 t40_xboole_1, t45_xboole_1, t48_xboole_1, t4_boole, t4_xboole_0, t60_xboole_1,
% 13.15/2.60 t63_xboole_1, t69_enumset1, t6_boole, t7_boole, t7_xboole_1, t83_xboole_1,
% 13.15/2.60 t8_boole, t8_xboole_1
% 13.15/2.60
% 13.15/2.60 Those formulas are unsatisfiable:
% 13.15/2.60 ---------------------------------
% 13.15/2.60
% 13.15/2.60 Begin of proof
% 13.15/2.60 |
% 13.15/2.60 | ALPHA: (d1_tarski) implies:
% 13.15/2.60 | (1) ! [v0: $i] : ! [v1: $i] : ( ~ (singleton(v0) = v1) | ~ $i(v1) | ~
% 13.15/2.61 | $i(v0) | ( ! [v2: $i] : (v2 = v0 | ~ (in(v2, v1) = 0) | ~ $i(v2)) &
% 13.15/2.61 | ! [v2: int] : (v2 = 0 | ~ (in(v0, v1) = v2))))
% 13.15/2.61 |
% 13.15/2.61 | ALPHA: (l2_zfmisc_1) implies:
% 13.15/2.61 | (2) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ( ~ (singleton(v0) = v2) | ~
% 13.15/2.61 | (subset(v2, v1) = 0) | ~ $i(v1) | ~ $i(v0) | in(v0, v1) = 0)
% 13.15/2.61 |
% 13.15/2.61 | DELTA: instantiating (t6_zfmisc_1) with fresh symbols all_73_0, all_73_1,
% 13.15/2.61 | all_73_2, all_73_3 gives:
% 13.15/2.61 | (3) ~ (all_73_2 = all_73_3) & singleton(all_73_2) = all_73_0 &
% 13.15/2.61 | singleton(all_73_3) = all_73_1 & subset(all_73_1, all_73_0) = 0 &
% 13.15/2.61 | $i(all_73_0) & $i(all_73_1) & $i(all_73_2) & $i(all_73_3)
% 13.15/2.61 |
% 13.15/2.61 | ALPHA: (3) implies:
% 13.15/2.61 | (4) ~ (all_73_2 = all_73_3)
% 13.15/2.61 | (5) $i(all_73_3)
% 13.15/2.61 | (6) $i(all_73_2)
% 13.15/2.61 | (7) $i(all_73_0)
% 13.15/2.61 | (8) subset(all_73_1, all_73_0) = 0
% 13.15/2.61 | (9) singleton(all_73_3) = all_73_1
% 13.15/2.61 | (10) singleton(all_73_2) = all_73_0
% 13.15/2.61 |
% 13.15/2.61 | GROUND_INST: instantiating (2) with all_73_3, all_73_0, all_73_1, simplifying
% 13.15/2.61 | with (5), (7), (8), (9) gives:
% 13.15/2.61 | (11) in(all_73_3, all_73_0) = 0
% 13.15/2.61 |
% 13.15/2.61 | GROUND_INST: instantiating (1) with all_73_2, all_73_0, simplifying with (6),
% 13.15/2.61 | (7), (10) gives:
% 13.15/2.61 | (12) ! [v0: any] : (v0 = all_73_2 | ~ (in(v0, all_73_0) = 0) | ~ $i(v0))
% 13.15/2.61 | & ! [v0: int] : (v0 = 0 | ~ (in(all_73_2, all_73_0) = v0))
% 13.15/2.61 |
% 13.15/2.61 | ALPHA: (12) implies:
% 13.15/2.61 | (13) ! [v0: any] : (v0 = all_73_2 | ~ (in(v0, all_73_0) = 0) | ~ $i(v0))
% 13.15/2.61 |
% 13.15/2.61 | GROUND_INST: instantiating (13) with all_73_3, simplifying with (5), (11)
% 13.15/2.61 | gives:
% 13.15/2.61 | (14) all_73_2 = all_73_3
% 13.15/2.61 |
% 13.15/2.61 | REDUCE: (4), (14) imply:
% 13.15/2.61 | (15) $false
% 13.15/2.62 |
% 13.15/2.62 | CLOSE: (15) is inconsistent.
% 13.15/2.62 |
% 13.15/2.62 End of proof
% 13.15/2.62 % SZS output end Proof for theBenchmark
% 13.15/2.62
% 13.15/2.62 2019ms
%------------------------------------------------------------------------------