TSTP Solution File: SYN411+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SYN411+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 : n002.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:35 EDT 2023
% Result : Theorem 2.64s 1.18s
% Output : Proof 3.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYN411+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.35 % Computer : n002.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 19:38:33 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.64 ________ _____
% 0.20/0.64 ___ __ \_________(_)________________________________
% 0.20/0.64 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.20/0.64 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.20/0.64 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.20/0.64
% 0.20/0.64 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.20/0.64 (2023-06-19)
% 0.20/0.64
% 0.20/0.64 (c) Philipp Rümmer, 2009-2023
% 0.20/0.64 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.20/0.64 Amanda Stjerna.
% 0.20/0.64 Free software under BSD-3-Clause.
% 0.20/0.64
% 0.20/0.64 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.20/0.64
% 0.20/0.64 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.20/0.66 Running up to 7 provers in parallel.
% 0.64/0.67 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.64/0.67 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.64/0.67 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.64/0.67 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.64/0.67 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.64/0.67 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.64/0.67 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.80/1.01 Prover 1: Preprocessing ...
% 1.80/1.01 Prover 4: Preprocessing ...
% 1.80/1.06 Prover 6: Preprocessing ...
% 1.80/1.06 Prover 5: Preprocessing ...
% 1.80/1.06 Prover 2: Preprocessing ...
% 1.80/1.06 Prover 0: Preprocessing ...
% 1.80/1.06 Prover 3: Preprocessing ...
% 2.50/1.09 Prover 4: Constructing countermodel ...
% 2.50/1.10 Prover 3: Constructing countermodel ...
% 2.50/1.10 Prover 1: Constructing countermodel ...
% 2.50/1.10 Prover 5: Proving ...
% 2.50/1.10 Prover 2: Proving ...
% 2.50/1.10 Prover 0: Proving ...
% 2.50/1.10 Prover 6: Proving ...
% 2.64/1.18 Prover 3: proved (509ms)
% 2.64/1.18
% 2.64/1.18 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.64/1.18
% 2.64/1.18 Prover 0: proved (514ms)
% 2.64/1.18
% 2.64/1.18 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.64/1.18
% 2.64/1.18 Prover 6: stopped
% 2.64/1.18 Prover 5: stopped
% 2.64/1.18 Prover 2: stopped
% 2.64/1.18 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 2.64/1.18 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 2.64/1.18 Prover 1: Found proof (size 6)
% 2.64/1.18 Prover 1: proved (520ms)
% 2.64/1.19 Prover 4: Found proof (size 5)
% 2.64/1.19 Prover 4: proved (516ms)
% 2.81/1.19 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 2.81/1.19 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 2.81/1.19 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 2.81/1.19 Prover 8: Preprocessing ...
% 2.81/1.19 Prover 10: Preprocessing ...
% 2.81/1.19 Prover 11: Preprocessing ...
% 2.81/1.19 Prover 13: Preprocessing ...
% 2.81/1.19 Prover 7: Preprocessing ...
% 2.81/1.20 Prover 7: Warning: ignoring some quantifiers
% 2.81/1.20 Prover 13: Warning: ignoring some quantifiers
% 2.81/1.20 Prover 7: Constructing countermodel ...
% 2.81/1.21 Prover 13: Constructing countermodel ...
% 2.81/1.21 Prover 7: stopped
% 2.81/1.21 Prover 13: stopped
% 2.81/1.21 Prover 8: Warning: ignoring some quantifiers
% 2.81/1.21 Prover 11: Constructing countermodel ...
% 2.81/1.21 Prover 8: Constructing countermodel ...
% 2.81/1.21 Prover 11: stopped
% 2.81/1.22 Prover 8: stopped
% 2.81/1.22 Prover 10: Warning: ignoring some quantifiers
% 2.81/1.22 Prover 10: Constructing countermodel ...
% 2.81/1.22 Prover 10: stopped
% 2.81/1.22
% 2.81/1.22 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.81/1.22
% 2.81/1.22 % SZS output start Proof for theBenchmark
% 2.81/1.22 Assumptions after simplification:
% 2.81/1.22 ---------------------------------
% 2.81/1.22
% 2.81/1.22 (kalish250)
% 3.46/1.27 ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~ (f(v0,
% 3.46/1.27 v1, v2) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0)) & ? [v0: $i] : ?
% 3.46/1.27 [v1: $i] : ? [v2: $i] : ? [v3: int] : ( ~ (v3 = 0) & f(v0, v1, v2) = v3 &
% 3.46/1.27 $i(v2) & $i(v1) & $i(v0))
% 3.46/1.27
% 3.46/1.27 Those formulas are unsatisfiable:
% 3.46/1.27 ---------------------------------
% 3.46/1.27
% 3.46/1.27 Begin of proof
% 3.46/1.27 |
% 3.46/1.27 | ALPHA: (kalish250) implies:
% 3.46/1.27 | (1) ! [v0: $i] : ! [v1: $i] : ! [v2: $i] : ! [v3: int] : (v3 = 0 | ~
% 3.46/1.27 | (f(v0, v1, v2) = v3) | ~ $i(v2) | ~ $i(v1) | ~ $i(v0))
% 3.46/1.28 | (2) ? [v0: $i] : ? [v1: $i] : ? [v2: $i] : ? [v3: int] : ( ~ (v3 = 0) &
% 3.46/1.28 | f(v0, v1, v2) = v3 & $i(v2) & $i(v1) & $i(v0))
% 3.46/1.28 |
% 3.46/1.28 | DELTA: instantiating (2) with fresh symbols all_4_0, all_4_1, all_4_2, all_4_3
% 3.46/1.28 | gives:
% 3.46/1.28 | (3) ~ (all_4_0 = 0) & f(all_4_3, all_4_2, all_4_1) = all_4_0 & $i(all_4_1)
% 3.46/1.28 | & $i(all_4_2) & $i(all_4_3)
% 3.46/1.28 |
% 3.46/1.28 | ALPHA: (3) implies:
% 3.46/1.28 | (4) ~ (all_4_0 = 0)
% 3.46/1.28 | (5) $i(all_4_3)
% 3.46/1.28 | (6) $i(all_4_2)
% 3.46/1.28 | (7) $i(all_4_1)
% 3.46/1.28 | (8) f(all_4_3, all_4_2, all_4_1) = all_4_0
% 3.46/1.28 |
% 3.46/1.28 | GROUND_INST: instantiating (1) with all_4_3, all_4_2, all_4_1, all_4_0,
% 3.46/1.28 | simplifying with (5), (6), (7), (8) gives:
% 3.46/1.28 | (9) all_4_0 = 0
% 3.46/1.28 |
% 3.46/1.28 | REDUCE: (4), (9) imply:
% 3.46/1.28 | (10) $false
% 3.46/1.28 |
% 3.46/1.28 | CLOSE: (10) is inconsistent.
% 3.46/1.28 |
% 3.46/1.28 End of proof
% 3.46/1.28 % SZS output end Proof for theBenchmark
% 3.46/1.28
% 3.46/1.28 641ms
%------------------------------------------------------------------------------