TSTP Solution File: SYN373+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SYN373+1 : TPTP v8.1.2. Released v2.0.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 : Fri Sep 1 03:27:24 EDT 2023
% Result : Theorem 2.83s 1.10s
% Output : Proof 3.54s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN373+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34 % Computer : n004.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 : Sat Aug 26 21:06:53 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.59 ________ _____
% 0.20/0.59 ___ __ \_________(_)________________________________
% 0.20/0.59 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.59 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.59 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.59
% 0.20/0.59 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.59 (2023-06-19)
% 0.20/0.59
% 0.20/0.59 (c) Philipp Rümmer, 2009-2023
% 0.20/0.59 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.59 Amanda Stjerna.
% 0.20/0.59 Free software under BSD-3-Clause.
% 0.20/0.59
% 0.20/0.59 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.59
% 0.20/0.59 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.20/0.60 Running up to 7 provers in parallel.
% 0.20/0.62 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.62 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.62 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.62 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.62 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.62 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.62 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.64/0.91 Prover 4: Preprocessing ...
% 1.64/0.91 Prover 1: Preprocessing ...
% 2.04/0.95 Prover 3: Preprocessing ...
% 2.04/0.95 Prover 2: Preprocessing ...
% 2.04/0.95 Prover 5: Preprocessing ...
% 2.04/0.95 Prover 0: Preprocessing ...
% 2.04/0.96 Prover 6: Preprocessing ...
% 2.18/1.01 Prover 1: Constructing countermodel ...
% 2.18/1.01 Prover 5: Proving ...
% 2.18/1.01 Prover 4: Constructing countermodel ...
% 2.18/1.01 Prover 2: Proving ...
% 2.18/1.01 Prover 3: Constructing countermodel ...
% 2.18/1.02 Prover 0: Proving ...
% 2.58/1.04 Prover 6: Proving ...
% 2.83/1.10 Prover 2: proved (484ms)
% 2.83/1.10
% 2.83/1.10 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.83/1.10
% 2.83/1.10 Prover 3: stopped
% 2.83/1.11 Prover 0: stopped
% 2.83/1.11 Prover 6: stopped
% 2.83/1.11 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 2.83/1.11 Prover 7: Preprocessing ...
% 2.83/1.11 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 2.83/1.11 Prover 5: stopped
% 2.83/1.12 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 2.83/1.12 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 2.83/1.12 Prover 7: Warning: ignoring some quantifiers
% 2.83/1.12 Prover 10: Preprocessing ...
% 2.83/1.12 Prover 8: Preprocessing ...
% 2.83/1.12 Prover 7: Constructing countermodel ...
% 2.83/1.12 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 2.83/1.13 Prover 10: Warning: ignoring some quantifiers
% 2.83/1.13 Prover 10: Constructing countermodel ...
% 2.83/1.13 Prover 11: Preprocessing ...
% 3.33/1.13 Prover 4: Found proof (size 19)
% 3.33/1.13 Prover 4: proved (520ms)
% 3.33/1.14 Prover 1: stopped
% 3.33/1.14 Prover 10: stopped
% 3.33/1.14 Prover 7: stopped
% 3.33/1.14 Prover 13: Preprocessing ...
% 3.33/1.14 Prover 8: Warning: ignoring some quantifiers
% 3.33/1.15 Prover 8: Constructing countermodel ...
% 3.33/1.15 Prover 13: Warning: ignoring some quantifiers
% 3.33/1.15 Prover 8: stopped
% 3.33/1.15 Prover 13: Constructing countermodel ...
% 3.33/1.15 Prover 13: stopped
% 3.33/1.15 Prover 11: Constructing countermodel ...
% 3.33/1.15 Prover 11: stopped
% 3.33/1.15
% 3.33/1.15 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.33/1.15
% 3.33/1.16 % SZS output start Proof for theBenchmark
% 3.33/1.16 Assumptions after simplification:
% 3.33/1.16 ---------------------------------
% 3.33/1.16
% 3.33/1.16 (x2124)
% 3.54/1.20 ? [v0: $i] : ? [v1: int] : ? [v2: $i] : ? [v3: int] : ? [v4: $i] : ?
% 3.54/1.20 [v5: any] : ? [v6: any] : ($i(v4) & $i(v2) & $i(v0) & ! [v7: $i] : ! [v8:
% 3.54/1.20 int] : (v8 = 0 | ~ (big_p(v7) = v8) | ~ $i(v7)) & ! [v7: $i] : ( ~
% 3.54/1.20 (big_q(v7) = 0) | ~ $i(v7)) & ((v1 = 0 & big_q(v0) = 0) | ( ~ (v3 = 0) &
% 3.54/1.20 big_p(v2) = v3) | (big_p(v4) = v5 & big_q(v4) = v6 & ( ~ (v5 = 0) | v6 =
% 3.54/1.20 0))))
% 3.54/1.20
% 3.54/1.20 Those formulas are unsatisfiable:
% 3.54/1.20 ---------------------------------
% 3.54/1.20
% 3.54/1.20 Begin of proof
% 3.54/1.20 |
% 3.54/1.20 | DELTA: instantiating (x2124) with fresh symbols all_3_0, all_3_1, all_3_2,
% 3.54/1.20 | all_3_3, all_3_4, all_3_5, all_3_6 gives:
% 3.54/1.21 | (1) $i(all_3_2) & $i(all_3_4) & $i(all_3_6) & ! [v0: $i] : ! [v1: int] :
% 3.54/1.21 | (v1 = 0 | ~ (big_p(v0) = v1) | ~ $i(v0)) & ! [v0: $i] : ( ~
% 3.54/1.21 | (big_q(v0) = 0) | ~ $i(v0)) & ((all_3_5 = 0 & big_q(all_3_6) = 0) |
% 3.54/1.21 | ( ~ (all_3_3 = 0) & big_p(all_3_4) = all_3_3) | (big_p(all_3_2) =
% 3.54/1.21 | all_3_1 & big_q(all_3_2) = all_3_0 & ( ~ (all_3_1 = 0) | all_3_0 =
% 3.54/1.21 | 0)))
% 3.54/1.21 |
% 3.54/1.21 | ALPHA: (1) implies:
% 3.54/1.21 | (2) $i(all_3_6)
% 3.54/1.21 | (3) $i(all_3_4)
% 3.54/1.21 | (4) $i(all_3_2)
% 3.54/1.21 | (5) (all_3_5 = 0 & big_q(all_3_6) = 0) | ( ~ (all_3_3 = 0) & big_p(all_3_4)
% 3.54/1.21 | = all_3_3) | (big_p(all_3_2) = all_3_1 & big_q(all_3_2) = all_3_0 & (
% 3.54/1.21 | ~ (all_3_1 = 0) | all_3_0 = 0))
% 3.54/1.21 | (6) ! [v0: $i] : ( ~ (big_q(v0) = 0) | ~ $i(v0))
% 3.54/1.21 | (7) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (big_p(v0) = v1) | ~ $i(v0))
% 3.54/1.21 |
% 3.54/1.21 | BETA: splitting (5) gives:
% 3.54/1.21 |
% 3.54/1.21 | Case 1:
% 3.54/1.21 | |
% 3.54/1.21 | | (8) all_3_5 = 0 & big_q(all_3_6) = 0
% 3.54/1.21 | |
% 3.54/1.21 | | ALPHA: (8) implies:
% 3.54/1.21 | | (9) big_q(all_3_6) = 0
% 3.54/1.21 | |
% 3.54/1.21 | | GROUND_INST: instantiating (6) with all_3_6, simplifying with (2), (9)
% 3.54/1.21 | | gives:
% 3.54/1.21 | | (10) $false
% 3.54/1.21 | |
% 3.54/1.21 | | CLOSE: (10) is inconsistent.
% 3.54/1.21 | |
% 3.54/1.21 | Case 2:
% 3.54/1.21 | |
% 3.54/1.22 | | (11) ( ~ (all_3_3 = 0) & big_p(all_3_4) = all_3_3) | (big_p(all_3_2) =
% 3.54/1.22 | | all_3_1 & big_q(all_3_2) = all_3_0 & ( ~ (all_3_1 = 0) | all_3_0 =
% 3.54/1.22 | | 0))
% 3.54/1.22 | |
% 3.54/1.22 | | BETA: splitting (11) gives:
% 3.54/1.22 | |
% 3.54/1.22 | | Case 1:
% 3.54/1.22 | | |
% 3.54/1.22 | | | (12) ~ (all_3_3 = 0) & big_p(all_3_4) = all_3_3
% 3.54/1.22 | | |
% 3.54/1.22 | | | ALPHA: (12) implies:
% 3.54/1.22 | | | (13) ~ (all_3_3 = 0)
% 3.54/1.22 | | | (14) big_p(all_3_4) = all_3_3
% 3.54/1.22 | | |
% 3.54/1.22 | | | GROUND_INST: instantiating (7) with all_3_4, all_3_3, simplifying with
% 3.54/1.22 | | | (3), (14) gives:
% 3.54/1.22 | | | (15) all_3_3 = 0
% 3.54/1.22 | | |
% 3.54/1.22 | | | REDUCE: (13), (15) imply:
% 3.54/1.22 | | | (16) $false
% 3.54/1.22 | | |
% 3.54/1.22 | | | CLOSE: (16) is inconsistent.
% 3.54/1.22 | | |
% 3.54/1.22 | | Case 2:
% 3.54/1.22 | | |
% 3.54/1.22 | | | (17) big_p(all_3_2) = all_3_1 & big_q(all_3_2) = all_3_0 & ( ~ (all_3_1
% 3.54/1.22 | | | = 0) | all_3_0 = 0)
% 3.54/1.22 | | |
% 3.54/1.22 | | | ALPHA: (17) implies:
% 3.54/1.22 | | | (18) big_q(all_3_2) = all_3_0
% 3.54/1.22 | | | (19) big_p(all_3_2) = all_3_1
% 3.54/1.22 | | | (20) ~ (all_3_1 = 0) | all_3_0 = 0
% 3.54/1.22 | | |
% 3.54/1.22 | | | GROUND_INST: instantiating (7) with all_3_2, all_3_1, simplifying with
% 3.54/1.22 | | | (4), (19) gives:
% 3.54/1.22 | | | (21) all_3_1 = 0
% 3.54/1.22 | | |
% 3.54/1.22 | | | BETA: splitting (20) gives:
% 3.54/1.22 | | |
% 3.54/1.22 | | | Case 1:
% 3.54/1.22 | | | |
% 3.54/1.22 | | | | (22) ~ (all_3_1 = 0)
% 3.54/1.22 | | | |
% 3.54/1.22 | | | | REDUCE: (21), (22) imply:
% 3.54/1.22 | | | | (23) $false
% 3.54/1.22 | | | |
% 3.54/1.22 | | | | CLOSE: (23) is inconsistent.
% 3.54/1.22 | | | |
% 3.54/1.22 | | | Case 2:
% 3.54/1.22 | | | |
% 3.54/1.22 | | | | (24) all_3_0 = 0
% 3.54/1.22 | | | |
% 3.54/1.22 | | | | REDUCE: (18), (24) imply:
% 3.54/1.22 | | | | (25) big_q(all_3_2) = 0
% 3.54/1.22 | | | |
% 3.54/1.22 | | | | GROUND_INST: instantiating (6) with all_3_2, simplifying with (4), (25)
% 3.54/1.22 | | | | gives:
% 3.54/1.22 | | | | (26) $false
% 3.54/1.22 | | | |
% 3.54/1.22 | | | | CLOSE: (26) is inconsistent.
% 3.54/1.22 | | | |
% 3.54/1.22 | | | End of split
% 3.54/1.22 | | |
% 3.54/1.22 | | End of split
% 3.54/1.22 | |
% 3.54/1.22 | End of split
% 3.54/1.22 |
% 3.54/1.22 End of proof
% 3.54/1.22 % SZS output end Proof for theBenchmark
% 3.54/1.22
% 3.54/1.22 630ms
%------------------------------------------------------------------------------