TSTP Solution File: SYN956+1 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SYN956+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n003.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:29:21 EDT 2023
% Result : Theorem 3.08s 1.15s
% Output : Proof 3.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN956+1 : TPTP v8.1.2. Released v3.1.0.
% 0.12/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34 % Computer : n003.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 19:53:39 EDT 2023
% 0.13/0.34 % 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.65 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.20/0.65 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.20/0.65 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.20/0.65 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.20/0.65 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.20/0.65 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 0.20/0.65 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 1.79/0.94 Prover 1: Preprocessing ...
% 1.79/0.94 Prover 4: Preprocessing ...
% 2.00/0.98 Prover 0: Preprocessing ...
% 2.00/0.98 Prover 6: Preprocessing ...
% 2.00/0.98 Prover 2: Preprocessing ...
% 2.00/0.99 Prover 5: Preprocessing ...
% 2.00/1.00 Prover 3: Preprocessing ...
% 2.00/1.04 Prover 2: Proving ...
% 2.46/1.04 Prover 5: Proving ...
% 2.46/1.04 Prover 3: Constructing countermodel ...
% 2.46/1.05 Prover 1: Constructing countermodel ...
% 2.46/1.05 Prover 6: Proving ...
% 2.46/1.05 Prover 4: Constructing countermodel ...
% 2.46/1.06 Prover 0: Proving ...
% 3.08/1.14 Prover 3: proved (503ms)
% 3.08/1.14
% 3.08/1.15 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.08/1.15
% 3.08/1.15 Prover 6: stopped
% 3.08/1.15 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 3.08/1.15 Prover 1: Found proof (size 10)
% 3.08/1.15 Prover 4: Found proof (size 9)
% 3.08/1.15 Prover 1: proved (515ms)
% 3.08/1.15 Prover 4: proved (511ms)
% 3.08/1.15 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 3.08/1.15 Prover 0: proved (514ms)
% 3.08/1.15 Prover 5: proved (502ms)
% 3.08/1.15 Prover 2: proved (515ms)
% 3.08/1.16 Prover 7: Preprocessing ...
% 3.08/1.16 Prover 8: Preprocessing ...
% 3.24/1.16 Prover 7: Warning: ignoring some quantifiers
% 3.24/1.16 Prover 7: Constructing countermodel ...
% 3.24/1.17 Prover 7: stopped
% 3.24/1.17 Prover 8: Warning: ignoring some quantifiers
% 3.24/1.17 Prover 8: Constructing countermodel ...
% 3.24/1.18 Prover 8: stopped
% 3.24/1.18
% 3.24/1.18 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.24/1.18
% 3.24/1.18 % SZS output start Proof for theBenchmark
% 3.24/1.18 Assumptions after simplification:
% 3.24/1.18 ---------------------------------
% 3.24/1.18
% 3.24/1.18 (prove_this)
% 3.24/1.22 ? [v0: $i] : ? [v1: any] : ? [v2: any] : (a(v0) = v1 & b(v0) = v2 & $i(v0)
% 3.24/1.22 & ! [v3: $i] : ! [v4: int] : (v4 = 0 | ~ (a(v3) = v4) | ~ $i(v3)) & !
% 3.24/1.22 [v3: $i] : ( ~ (b(v3) = 0) | ~ $i(v3)) & ( ~ (v1 = 0) | v2 = 0))
% 3.43/1.22
% 3.43/1.22 Those formulas are unsatisfiable:
% 3.43/1.22 ---------------------------------
% 3.43/1.22
% 3.43/1.22 Begin of proof
% 3.43/1.22 |
% 3.43/1.22 | DELTA: instantiating (prove_this) with fresh symbols all_3_0, all_3_1, all_3_2
% 3.43/1.22 | gives:
% 3.43/1.23 | (1) a(all_3_2) = all_3_1 & b(all_3_2) = all_3_0 & $i(all_3_2) & ! [v0: $i]
% 3.43/1.23 | : ! [v1: int] : (v1 = 0 | ~ (a(v0) = v1) | ~ $i(v0)) & ! [v0: $i] :
% 3.43/1.23 | ( ~ (b(v0) = 0) | ~ $i(v0)) & ( ~ (all_3_1 = 0) | all_3_0 = 0)
% 3.43/1.23 |
% 3.43/1.23 | ALPHA: (1) implies:
% 3.43/1.23 | (2) $i(all_3_2)
% 3.43/1.23 | (3) b(all_3_2) = all_3_0
% 3.43/1.23 | (4) a(all_3_2) = all_3_1
% 3.43/1.23 | (5) ~ (all_3_1 = 0) | all_3_0 = 0
% 3.43/1.23 | (6) ! [v0: $i] : ( ~ (b(v0) = 0) | ~ $i(v0))
% 3.43/1.23 | (7) ! [v0: $i] : ! [v1: int] : (v1 = 0 | ~ (a(v0) = v1) | ~ $i(v0))
% 3.43/1.23 |
% 3.43/1.23 | GROUND_INST: instantiating (7) with all_3_2, all_3_1, simplifying with (2),
% 3.43/1.23 | (4) gives:
% 3.43/1.23 | (8) all_3_1 = 0
% 3.43/1.23 |
% 3.43/1.23 | BETA: splitting (5) gives:
% 3.43/1.23 |
% 3.43/1.23 | Case 1:
% 3.43/1.23 | |
% 3.43/1.23 | | (9) ~ (all_3_1 = 0)
% 3.43/1.23 | |
% 3.43/1.23 | | REDUCE: (8), (9) imply:
% 3.43/1.23 | | (10) $false
% 3.43/1.24 | |
% 3.43/1.24 | | CLOSE: (10) is inconsistent.
% 3.43/1.24 | |
% 3.43/1.24 | Case 2:
% 3.43/1.24 | |
% 3.43/1.24 | | (11) all_3_0 = 0
% 3.43/1.24 | |
% 3.43/1.24 | | REDUCE: (3), (11) imply:
% 3.43/1.24 | | (12) b(all_3_2) = 0
% 3.43/1.24 | |
% 3.43/1.24 | | GROUND_INST: instantiating (6) with all_3_2, simplifying with (2), (12)
% 3.43/1.24 | | gives:
% 3.43/1.24 | | (13) $false
% 3.43/1.24 | |
% 3.43/1.24 | | CLOSE: (13) is inconsistent.
% 3.43/1.24 | |
% 3.43/1.24 | End of split
% 3.43/1.24 |
% 3.43/1.24 End of proof
% 3.43/1.24 % SZS output end Proof for theBenchmark
% 3.43/1.24
% 3.43/1.24 625ms
%------------------------------------------------------------------------------