TSTP Solution File: SYN359+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SYN359+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 : n015.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:21 EDT 2023
% Result : Theorem 3.42s 1.23s
% Output : Proof 4.55s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN359+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.35 % Computer : n015.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 : Sat Aug 26 17:59:23 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.61 ________ _____
% 0.20/0.61 ___ __ \_________(_)________________________________
% 0.20/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.61
% 0.20/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.61 (2023-06-19)
% 0.20/0.61
% 0.20/0.61 (c) Philipp Rümmer, 2009-2023
% 0.20/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.61 Amanda Stjerna.
% 0.20/0.61 Free software under BSD-3-Clause.
% 0.20/0.61
% 0.20/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.61
% 0.20/0.61 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.20/0.62 Running up to 7 provers in parallel.
% 0.20/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.20/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.55/0.98 Prover 1: Preprocessing ...
% 1.55/0.98 Prover 4: Preprocessing ...
% 2.18/1.03 Prover 6: Preprocessing ...
% 2.18/1.03 Prover 0: Preprocessing ...
% 2.18/1.03 Prover 2: Preprocessing ...
% 2.18/1.03 Prover 3: Preprocessing ...
% 2.18/1.03 Prover 5: Preprocessing ...
% 2.79/1.10 Prover 5: Constructing countermodel ...
% 2.79/1.10 Prover 1: Constructing countermodel ...
% 2.79/1.10 Prover 2: Constructing countermodel ...
% 2.79/1.11 Prover 3: Constructing countermodel ...
% 2.79/1.11 Prover 6: Proving ...
% 2.79/1.12 Prover 4: Constructing countermodel ...
% 2.79/1.14 Prover 0: Proving ...
% 3.42/1.22 Prover 5: proved (592ms)
% 3.42/1.22
% 3.42/1.23 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.42/1.23
% 3.42/1.23 Prover 2: stopped
% 3.42/1.23 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 3.42/1.23 Prover 0: stopped
% 3.42/1.23 Prover 6: stopped
% 3.42/1.23 Prover 3: stopped
% 3.42/1.23 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 3.42/1.23 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 3.42/1.24 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 3.42/1.24 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 3.42/1.25 Prover 10: Preprocessing ...
% 3.42/1.25 Prover 7: Preprocessing ...
% 3.42/1.25 Prover 13: Preprocessing ...
% 3.42/1.26 Prover 8: Preprocessing ...
% 3.42/1.26 Prover 11: Preprocessing ...
% 3.42/1.27 Prover 13: Constructing countermodel ...
% 3.42/1.28 Prover 7: Constructing countermodel ...
% 3.42/1.28 Prover 10: Constructing countermodel ...
% 4.13/1.30 Prover 4: Found proof (size 13)
% 4.13/1.30 Prover 4: proved (671ms)
% 4.13/1.30 Prover 7: stopped
% 4.13/1.30 Prover 13: stopped
% 4.13/1.30 Prover 1: Found proof (size 14)
% 4.13/1.30 Prover 1: proved (674ms)
% 4.13/1.30 Prover 10: stopped
% 4.13/1.31 Prover 8: Warning: ignoring some quantifiers
% 4.13/1.32 Prover 8: Constructing countermodel ...
% 4.13/1.32 Prover 11: Constructing countermodel ...
% 4.13/1.32 Prover 8: stopped
% 4.13/1.33 Prover 11: stopped
% 4.13/1.33
% 4.13/1.33 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.13/1.33
% 4.13/1.33 % SZS output start Proof for theBenchmark
% 4.13/1.34 Assumptions after simplification:
% 4.13/1.34 ---------------------------------
% 4.13/1.34
% 4.13/1.34 (x2110)
% 4.55/1.40 ? [v0: $i] : (big_r(v0) = 0 & $i(v0) & ! [v1: $i] : ! [v2: $i] : ( ~
% 4.55/1.40 (big_q(v1, v2) = 0) | ~ $i(v2) | ~ $i(v1) | big_q(v1, v1) = 0) & ! [v1:
% 4.55/1.40 $i] : ! [v2: $i] : ( ~ (big_q(v1, v2) = 0) | ~ $i(v2) | ~ $i(v1) | ?
% 4.55/1.40 [v3: int] : ( ~ (v3 = 0) & big_r(v2) = v3)) & ! [v1: $i] : ( ~ (big_r(v1)
% 4.55/1.40 = 0) | ~ $i(v1) | ? [v2: $i] : (big_q(v1, v2) = 0 & $i(v2))))
% 4.55/1.40
% 4.55/1.40 (function-axioms)
% 4.55/1.40 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : !
% 4.55/1.40 [v3: $i] : (v1 = v0 | ~ (big_q(v3, v2) = v1) | ~ (big_q(v3, v2) = v0)) & !
% 4.55/1.40 [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0
% 4.55/1.40 | ~ (big_r(v2) = v1) | ~ (big_r(v2) = v0))
% 4.55/1.40
% 4.55/1.40 Those formulas are unsatisfiable:
% 4.55/1.40 ---------------------------------
% 4.55/1.40
% 4.55/1.40 Begin of proof
% 4.55/1.41 |
% 4.55/1.41 | ALPHA: (function-axioms) implies:
% 4.55/1.41 | (1) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] :
% 4.55/1.41 | (v1 = v0 | ~ (big_r(v2) = v1) | ~ (big_r(v2) = v0))
% 4.55/1.41 |
% 4.55/1.41 | DELTA: instantiating (x2110) with fresh symbol all_3_0 gives:
% 4.55/1.42 | (2) big_r(all_3_0) = 0 & $i(all_3_0) & ! [v0: $i] : ! [v1: $i] : ( ~
% 4.55/1.42 | (big_q(v0, v1) = 0) | ~ $i(v1) | ~ $i(v0) | big_q(v0, v0) = 0) & !
% 4.55/1.42 | [v0: $i] : ! [v1: $i] : ( ~ (big_q(v0, v1) = 0) | ~ $i(v1) | ~
% 4.55/1.42 | $i(v0) | ? [v2: int] : ( ~ (v2 = 0) & big_r(v1) = v2)) & ! [v0: $i]
% 4.55/1.42 | : ( ~ (big_r(v0) = 0) | ~ $i(v0) | ? [v1: $i] : (big_q(v0, v1) = 0 &
% 4.55/1.42 | $i(v1)))
% 4.55/1.42 |
% 4.55/1.42 | ALPHA: (2) implies:
% 4.55/1.42 | (3) $i(all_3_0)
% 4.55/1.42 | (4) big_r(all_3_0) = 0
% 4.55/1.42 | (5) ! [v0: $i] : ( ~ (big_r(v0) = 0) | ~ $i(v0) | ? [v1: $i] :
% 4.55/1.42 | (big_q(v0, v1) = 0 & $i(v1)))
% 4.55/1.42 | (6) ! [v0: $i] : ! [v1: $i] : ( ~ (big_q(v0, v1) = 0) | ~ $i(v1) | ~
% 4.55/1.42 | $i(v0) | ? [v2: int] : ( ~ (v2 = 0) & big_r(v1) = v2))
% 4.55/1.43 | (7) ! [v0: $i] : ! [v1: $i] : ( ~ (big_q(v0, v1) = 0) | ~ $i(v1) | ~
% 4.55/1.43 | $i(v0) | big_q(v0, v0) = 0)
% 4.55/1.43 |
% 4.55/1.43 | GROUND_INST: instantiating (5) with all_3_0, simplifying with (3), (4) gives:
% 4.55/1.43 | (8) ? [v0: $i] : (big_q(all_3_0, v0) = 0 & $i(v0))
% 4.55/1.43 |
% 4.55/1.43 | DELTA: instantiating (8) with fresh symbol all_11_0 gives:
% 4.55/1.43 | (9) big_q(all_3_0, all_11_0) = 0 & $i(all_11_0)
% 4.55/1.43 |
% 4.55/1.43 | ALPHA: (9) implies:
% 4.55/1.43 | (10) $i(all_11_0)
% 4.55/1.43 | (11) big_q(all_3_0, all_11_0) = 0
% 4.55/1.43 |
% 4.55/1.43 | GROUND_INST: instantiating (7) with all_3_0, all_11_0, simplifying with (3),
% 4.55/1.43 | (10), (11) gives:
% 4.55/1.43 | (12) big_q(all_3_0, all_3_0) = 0
% 4.55/1.43 |
% 4.55/1.43 | GROUND_INST: instantiating (6) with all_3_0, all_3_0, simplifying with (3),
% 4.55/1.43 | (12) gives:
% 4.55/1.43 | (13) ? [v0: int] : ( ~ (v0 = 0) & big_r(all_3_0) = v0)
% 4.55/1.43 |
% 4.55/1.43 | DELTA: instantiating (13) with fresh symbol all_26_0 gives:
% 4.55/1.43 | (14) ~ (all_26_0 = 0) & big_r(all_3_0) = all_26_0
% 4.55/1.43 |
% 4.55/1.43 | ALPHA: (14) implies:
% 4.55/1.43 | (15) ~ (all_26_0 = 0)
% 4.55/1.43 | (16) big_r(all_3_0) = all_26_0
% 4.55/1.43 |
% 4.55/1.43 | GROUND_INST: instantiating (1) with 0, all_26_0, all_3_0, simplifying with
% 4.55/1.43 | (4), (16) gives:
% 4.55/1.44 | (17) all_26_0 = 0
% 4.55/1.44 |
% 4.55/1.44 | REDUCE: (15), (17) imply:
% 4.55/1.44 | (18) $false
% 4.55/1.44 |
% 4.55/1.44 | CLOSE: (18) is inconsistent.
% 4.55/1.44 |
% 4.55/1.44 End of proof
% 4.55/1.44 % SZS output end Proof for theBenchmark
% 4.55/1.44
% 4.55/1.44 832ms
%------------------------------------------------------------------------------