TSTP Solution File: SYN372+1 by Princess---230619

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : SYN372+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 : n028.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.88s 1.11s
% Output   : Proof 3.69s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN372+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 : n028.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 18:59:23 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.19/0.57  ________       _____
% 0.19/0.57  ___  __ \_________(_)________________________________
% 0.19/0.57  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.19/0.57  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.19/0.57  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.19/0.57  
% 0.19/0.57  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.19/0.57  (2023-06-19)
% 0.19/0.57  
% 0.19/0.57  (c) Philipp Rümmer, 2009-2023
% 0.19/0.57  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.19/0.57                Amanda Stjerna.
% 0.19/0.57  Free software under BSD-3-Clause.
% 0.19/0.57  
% 0.19/0.57  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.19/0.57  
% 0.19/0.57  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.19/0.58  Running up to 7 provers in parallel.
% 0.19/0.59  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.19/0.59  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.19/0.59  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.19/0.59  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.19/0.59  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.19/0.59  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.19/0.59  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.38/0.92  Prover 4: Preprocessing ...
% 1.38/0.92  Prover 1: Preprocessing ...
% 1.97/0.96  Prover 3: Preprocessing ...
% 1.97/0.96  Prover 5: Preprocessing ...
% 1.97/0.96  Prover 6: Preprocessing ...
% 1.97/0.96  Prover 0: Preprocessing ...
% 1.97/0.96  Prover 2: Preprocessing ...
% 2.30/1.03  Prover 1: Constructing countermodel ...
% 2.30/1.03  Prover 3: Constructing countermodel ...
% 2.30/1.03  Prover 4: Constructing countermodel ...
% 2.30/1.03  Prover 0: Proving ...
% 2.30/1.03  Prover 2: Proving ...
% 2.30/1.03  Prover 6: Proving ...
% 2.30/1.03  Prover 5: Proving ...
% 2.88/1.11  Prover 3: proved (519ms)
% 2.88/1.11  
% 2.88/1.11  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.88/1.11  
% 3.19/1.11  Prover 0: stopped
% 3.19/1.11  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 3.19/1.12  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 3.19/1.12  Prover 2: proved (529ms)
% 3.19/1.12  
% 3.19/1.12  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.19/1.12  
% 3.19/1.12  Prover 7: Preprocessing ...
% 3.19/1.12  Prover 6: stopped
% 3.19/1.12  Prover 5: stopped
% 3.19/1.13  Prover 8: Preprocessing ...
% 3.19/1.13  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 3.19/1.13  Prover 7: Warning: ignoring some quantifiers
% 3.19/1.13  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 3.19/1.14  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 3.35/1.14  Prover 10: Preprocessing ...
% 3.35/1.14  Prover 7: Constructing countermodel ...
% 3.35/1.14  Prover 11: Preprocessing ...
% 3.35/1.14  Prover 4: Found proof (size 9)
% 3.35/1.14  Prover 4: proved (552ms)
% 3.35/1.15  Prover 13: Preprocessing ...
% 3.35/1.15  Prover 10: Warning: ignoring some quantifiers
% 3.35/1.15  Prover 1: Found proof (size 11)
% 3.35/1.15  Prover 1: proved (558ms)
% 3.35/1.15  Prover 10: Constructing countermodel ...
% 3.35/1.15  Prover 7: stopped
% 3.35/1.15  Prover 10: stopped
% 3.35/1.15  Prover 13: Warning: ignoring some quantifiers
% 3.35/1.15  Prover 8: Warning: ignoring some quantifiers
% 3.35/1.15  Prover 13: Constructing countermodel ...
% 3.35/1.16  Prover 13: stopped
% 3.35/1.16  Prover 8: Constructing countermodel ...
% 3.35/1.16  Prover 8: stopped
% 3.35/1.16  Prover 11: Constructing countermodel ...
% 3.35/1.16  Prover 11: stopped
% 3.35/1.16  
% 3.35/1.16  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.35/1.16  
% 3.35/1.16  % SZS output start Proof for theBenchmark
% 3.35/1.17  Assumptions after simplification:
% 3.35/1.17  ---------------------------------
% 3.35/1.17  
% 3.35/1.17    (x2123)
% 3.35/1.21     ? [v0: $i] :  ? [v1: any] :  ? [v2: $i] :  ? [v3: any] : (big_q(v0) = v1 &
% 3.35/1.21      big_p(v2) = v3 & $i(v2) & $i(v0) &  ! [v4: $i] :  ! [v5: int] : (v5 = 0 |  ~
% 3.35/1.21        (big_p(v4) = v5) |  ~ $i(v4)) &  ! [v4: $i] : ( ~ (big_q(v4) = 0) |  ~
% 3.35/1.21        $i(v4)) & ( ~ (v3 = 0) | v1 = 0))
% 3.35/1.21  
% 3.35/1.21  Those formulas are unsatisfiable:
% 3.35/1.21  ---------------------------------
% 3.35/1.21  
% 3.35/1.21  Begin of proof
% 3.35/1.21  | 
% 3.35/1.21  | DELTA: instantiating (x2123) with fresh symbols all_3_0, all_3_1, all_3_2,
% 3.35/1.21  |        all_3_3 gives:
% 3.35/1.21  |   (1)  big_q(all_3_3) = all_3_2 & big_p(all_3_1) = all_3_0 & $i(all_3_1) &
% 3.35/1.21  |        $i(all_3_3) &  ! [v0: $i] :  ! [v1: int] : (v1 = 0 |  ~ (big_p(v0) =
% 3.35/1.21  |            v1) |  ~ $i(v0)) &  ! [v0: $i] : ( ~ (big_q(v0) = 0) |  ~ $i(v0)) &
% 3.35/1.21  |        ( ~ (all_3_0 = 0) | all_3_2 = 0)
% 3.35/1.21  | 
% 3.35/1.21  | ALPHA: (1) implies:
% 3.35/1.22  |   (2)  $i(all_3_3)
% 3.35/1.22  |   (3)  $i(all_3_1)
% 3.35/1.22  |   (4)  big_p(all_3_1) = all_3_0
% 3.35/1.22  |   (5)  big_q(all_3_3) = all_3_2
% 3.35/1.22  |   (6)   ~ (all_3_0 = 0) | all_3_2 = 0
% 3.35/1.22  |   (7)   ! [v0: $i] : ( ~ (big_q(v0) = 0) |  ~ $i(v0))
% 3.35/1.22  |   (8)   ! [v0: $i] :  ! [v1: int] : (v1 = 0 |  ~ (big_p(v0) = v1) |  ~ $i(v0))
% 3.35/1.22  | 
% 3.35/1.22  | GROUND_INST: instantiating (8) with all_3_1, all_3_0, simplifying with (3),
% 3.35/1.22  |              (4) gives:
% 3.35/1.22  |   (9)  all_3_0 = 0
% 3.35/1.22  | 
% 3.35/1.22  | BETA: splitting (6) gives:
% 3.35/1.22  | 
% 3.35/1.22  | Case 1:
% 3.35/1.22  | | 
% 3.69/1.22  | |   (10)   ~ (all_3_0 = 0)
% 3.69/1.22  | | 
% 3.69/1.22  | | REDUCE: (9), (10) imply:
% 3.69/1.22  | |   (11)  $false
% 3.69/1.22  | | 
% 3.69/1.22  | | CLOSE: (11) is inconsistent.
% 3.69/1.22  | | 
% 3.69/1.22  | Case 2:
% 3.69/1.22  | | 
% 3.69/1.22  | |   (12)  all_3_2 = 0
% 3.69/1.22  | | 
% 3.69/1.22  | | REDUCE: (5), (12) imply:
% 3.69/1.22  | |   (13)  big_q(all_3_3) = 0
% 3.69/1.22  | | 
% 3.69/1.22  | | GROUND_INST: instantiating (7) with all_3_3, simplifying with (2), (13)
% 3.69/1.22  | |              gives:
% 3.69/1.22  | |   (14)  $false
% 3.69/1.22  | | 
% 3.69/1.22  | | CLOSE: (14) is inconsistent.
% 3.69/1.22  | | 
% 3.69/1.22  | End of split
% 3.69/1.22  | 
% 3.69/1.22  End of proof
% 3.69/1.22  % SZS output end Proof for theBenchmark
% 3.69/1.22  
% 3.69/1.22  653ms
%------------------------------------------------------------------------------