TSTP Solution File: DAT028_1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : DAT028_1 : TPTP v8.1.2. Released v5.0.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n021.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 : Wed Aug 30 22:18:56 EDT 2023
% Result : Theorem 4.36s 1.39s
% Output : Proof 5.48s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : DAT028_1 : TPTP v8.1.2. Released v5.0.0.
% 0.11/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 24 14:53:10 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.61 ________ _____
% 0.19/0.61 ___ __ \_________(_)________________________________
% 0.19/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.19/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.19/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.19/0.61
% 0.19/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.19/0.61 (2023-06-19)
% 0.19/0.61
% 0.19/0.61 (c) Philipp Rümmer, 2009-2023
% 0.19/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.19/0.61 Amanda Stjerna.
% 0.19/0.61 Free software under BSD-3-Clause.
% 0.19/0.61
% 0.19/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.19/0.61
% 0.19/0.61 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.19/0.62 Running up to 7 provers in parallel.
% 0.19/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.19/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.19/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.19/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.19/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.19/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.19/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.65/1.07 Prover 1: Preprocessing ...
% 2.65/1.07 Prover 4: Preprocessing ...
% 2.65/1.10 Prover 6: Preprocessing ...
% 2.65/1.10 Prover 5: Preprocessing ...
% 2.65/1.11 Prover 2: Preprocessing ...
% 2.65/1.11 Prover 3: Preprocessing ...
% 2.65/1.11 Prover 0: Preprocessing ...
% 3.82/1.27 Prover 4: Constructing countermodel ...
% 3.82/1.27 Prover 1: Constructing countermodel ...
% 3.82/1.28 Prover 2: Proving ...
% 3.82/1.28 Prover 6: Proving ...
% 3.82/1.28 Prover 0: Proving ...
% 3.82/1.28 Prover 3: Constructing countermodel ...
% 3.82/1.28 Prover 5: Proving ...
% 4.36/1.39 Prover 3: proved (757ms)
% 4.36/1.39
% 4.36/1.39 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.36/1.39
% 4.36/1.39 Prover 5: proved (756ms)
% 4.36/1.39
% 4.36/1.39 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.36/1.39
% 4.36/1.39 Prover 0: proved (762ms)
% 4.36/1.39
% 4.36/1.39 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.36/1.39
% 4.36/1.39 Prover 2: proved (761ms)
% 4.36/1.39
% 4.36/1.39 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.36/1.39
% 4.36/1.39 Prover 6: stopped
% 4.36/1.40 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 4.36/1.40 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 4.36/1.40 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 4.36/1.40 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 4.36/1.40 Prover 1: Found proof (size 11)
% 4.36/1.40 Prover 1: proved (773ms)
% 4.36/1.40 Prover 4: Found proof (size 9)
% 4.36/1.40 Prover 4: proved (770ms)
% 5.02/1.41 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 5.02/1.42 Prover 10: Preprocessing ...
% 5.02/1.43 Prover 8: Preprocessing ...
% 5.02/1.44 Prover 11: Preprocessing ...
% 5.02/1.44 Prover 7: Preprocessing ...
% 5.02/1.44 Prover 13: Preprocessing ...
% 5.02/1.44 Prover 10: stopped
% 5.02/1.46 Prover 7: stopped
% 5.02/1.46 Prover 11: stopped
% 5.02/1.46 Prover 13: stopped
% 5.48/1.50 Prover 8: Warning: ignoring some quantifiers
% 5.48/1.50 Prover 8: Constructing countermodel ...
% 5.48/1.51 Prover 8: stopped
% 5.48/1.51
% 5.48/1.51 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.48/1.51
% 5.48/1.51 % SZS output start Proof for theBenchmark
% 5.48/1.51 Assumptions after simplification:
% 5.48/1.51 ---------------------------------
% 5.48/1.51
% 5.48/1.51 (co1)
% 5.48/1.54 ? [v0: collection] : ? [v1: collection] : (collection(v1) & collection(v0) &
% 5.48/1.54 ! [v2: int] : ( ~ ($lesseq(v2, 0) | ~ (in(v2, v1) = 0)) & ! [v2: int] : (
% 5.48/1.54 ~ (in(v2, v0) = 0) | ? [v3: int] : ($lesseq(1, $difference(v2, v3)) &
% 5.48/1.54 in(v3, v1) = 0)) & ? [v2: int] : ($lesseq(v2, 1) & in(v2, v0) = 0))
% 5.48/1.54
% 5.48/1.54 Further assumptions not needed in the proof:
% 5.48/1.54 --------------------------------------------
% 5.48/1.54 ax1, ax2, ax3, ax4, ax5
% 5.48/1.54
% 5.48/1.54 Those formulas are unsatisfiable:
% 5.48/1.54 ---------------------------------
% 5.48/1.54
% 5.48/1.54 Begin of proof
% 5.48/1.54 |
% 5.48/1.54 | DELTA: instantiating (co1) with fresh symbols all_11_0, all_11_1 gives:
% 5.48/1.54 | (1) collection(all_11_0) & collection(all_11_1) & ! [v0: int] : ( ~
% 5.48/1.54 | ($lesseq(v0, 0) | ~ (in(v0, all_11_0) = 0)) & ! [v0: int] : ( ~
% 5.48/1.54 | (in(v0, all_11_1) = 0) | ? [v1: int] : ($lesseq(1, $difference(v0,
% 5.48/1.54 | v1)) & in(v1, all_11_0) = 0)) & ? [v0: int] : ($lesseq(v0,
% 5.48/1.54 | 1) & in(v0, all_11_1) = 0)
% 5.48/1.54 |
% 5.48/1.55 | ALPHA: (1) implies:
% 5.48/1.55 | (2) ! [v0: int] : ( ~ (in(v0, all_11_1) = 0) | ? [v1: int] : ($lesseq(1,
% 5.48/1.55 | $difference(v0, v1)) & in(v1, all_11_0) = 0))
% 5.48/1.55 | (3) ! [v0: int] : ( ~ ($lesseq(v0, 0) | ~ (in(v0, all_11_0) = 0))
% 5.48/1.55 | (4) ? [v0: int] : ($lesseq(v0, 1) & in(v0, all_11_1) = 0)
% 5.48/1.55 |
% 5.48/1.55 | DELTA: instantiating (4) with fresh symbol all_14_0 gives:
% 5.48/1.55 | (5) $lesseq(all_14_0, 1) & in(all_14_0, all_11_1) = 0
% 5.48/1.55 |
% 5.48/1.55 | ALPHA: (5) implies:
% 5.48/1.55 | (6) $lesseq(all_14_0, 1)
% 5.48/1.55 | (7) in(all_14_0, all_11_1) = 0
% 5.48/1.55 |
% 5.48/1.55 | GROUND_INST: instantiating (2) with all_14_0, simplifying with (7) gives:
% 5.48/1.55 | (8) ? [v0: int] : ($lesseq(1, $difference(all_14_0, v0)) & in(v0,
% 5.48/1.55 | all_11_0) = 0)
% 5.48/1.55 |
% 5.48/1.55 | DELTA: instantiating (8) with fresh symbol all_25_0 gives:
% 5.48/1.55 | (9) $lesseq(1, $difference(all_14_0, all_25_0)) & in(all_25_0, all_11_0) =
% 5.48/1.55 | 0
% 5.48/1.55 |
% 5.48/1.55 | ALPHA: (9) implies:
% 5.48/1.55 | (10) $lesseq(1, $difference(all_14_0, all_25_0))
% 5.48/1.55 | (11) in(all_25_0, all_11_0) = 0
% 5.48/1.55 |
% 5.48/1.55 | GROUND_INST: instantiating (3) with all_25_0, simplifying with (11) gives:
% 5.48/1.55 | (12) $lesseq(1, all_25_0)
% 5.48/1.55 |
% 5.48/1.55 | COMBINE_INEQS: (10), (12) imply:
% 5.48/1.55 | (13) $lesseq(2, all_14_0)
% 5.48/1.55 |
% 5.48/1.55 | COMBINE_INEQS: (6), (13) imply:
% 5.48/1.55 | (14) $false
% 5.48/1.56 |
% 5.48/1.56 | CLOSE: (14) is inconsistent.
% 5.48/1.56 |
% 5.48/1.56 End of proof
% 5.48/1.56 % SZS output end Proof for theBenchmark
% 5.48/1.56
% 5.48/1.56 945ms
%------------------------------------------------------------------------------