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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : SYN960+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 : n018.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:22 EDT 2023

% Result   : Theorem 2.91s 1.29s
% Output   : Proof 3.82s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN960+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.12  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.12/0.33  % Computer : n018.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Sat Aug 26 20:14:00 EDT 2023
% 0.12/0.33  % CPUTime  : 
% 0.18/0.62  ________       _____
% 0.18/0.62  ___  __ \_________(_)________________________________
% 0.18/0.62  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.18/0.62  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.18/0.62  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.18/0.62  
% 0.18/0.62  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.18/0.63  (2023-06-19)
% 0.18/0.63  
% 0.18/0.63  (c) Philipp Rümmer, 2009-2023
% 0.18/0.63  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.18/0.63                Amanda Stjerna.
% 0.18/0.63  Free software under BSD-3-Clause.
% 0.18/0.63  
% 0.18/0.63  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.18/0.63  
% 0.18/0.63  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.18/0.64  Running up to 7 provers in parallel.
% 0.18/0.66  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.18/0.67  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.18/0.67  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.18/0.67  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.18/0.67  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.18/0.67  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.18/0.67  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.51/1.04  Prover 4: Preprocessing ...
% 1.51/1.04  Prover 1: Preprocessing ...
% 2.05/1.10  Prover 6: Preprocessing ...
% 2.05/1.10  Prover 5: Preprocessing ...
% 2.05/1.10  Prover 0: Preprocessing ...
% 2.05/1.10  Prover 3: Preprocessing ...
% 2.05/1.10  Prover 2: Preprocessing ...
% 2.35/1.17  Prover 2: Constructing countermodel ...
% 2.35/1.17  Prover 4: Constructing countermodel ...
% 2.35/1.17  Prover 1: Constructing countermodel ...
% 2.35/1.17  Prover 3: Constructing countermodel ...
% 2.35/1.17  Prover 5: Constructing countermodel ...
% 2.35/1.17  Prover 6: Proving ...
% 2.35/1.17  Prover 0: Proving ...
% 2.91/1.29  Prover 2: proved (634ms)
% 2.91/1.29  
% 2.91/1.29  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.91/1.29  
% 2.91/1.29  Prover 3: proved (628ms)
% 2.91/1.29  
% 2.91/1.29  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.91/1.29  
% 2.91/1.29  Prover 5: proved (627ms)
% 2.91/1.29  
% 2.91/1.29  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.91/1.29  
% 2.91/1.29  Prover 6: stopped
% 2.91/1.30  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 3.36/1.30  Prover 0: stopped
% 3.36/1.30  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 3.36/1.30  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 3.36/1.30  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 3.36/1.30  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 3.36/1.31  Prover 8: Preprocessing ...
% 3.36/1.31  Prover 7: Preprocessing ...
% 3.36/1.31  Prover 11: Preprocessing ...
% 3.36/1.31  Prover 13: Preprocessing ...
% 3.36/1.31  Prover 10: Preprocessing ...
% 3.36/1.33  Prover 7: Constructing countermodel ...
% 3.36/1.33  Prover 13: Constructing countermodel ...
% 3.36/1.34  Prover 10: Constructing countermodel ...
% 3.36/1.35  Prover 1: Found proof (size 11)
% 3.36/1.35  Prover 4: Found proof (size 9)
% 3.36/1.35  Prover 4: proved (688ms)
% 3.36/1.35  Prover 8: Warning: ignoring some quantifiers
% 3.36/1.35  Prover 1: proved (693ms)
% 3.36/1.35  Prover 8: Constructing countermodel ...
% 3.36/1.35  Prover 13: stopped
% 3.36/1.35  Prover 10: stopped
% 3.36/1.35  Prover 8: stopped
% 3.36/1.36  Prover 7: stopped
% 3.36/1.36  Prover 11: Constructing countermodel ...
% 3.36/1.36  Prover 11: stopped
% 3.36/1.36  
% 3.36/1.36  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.36/1.36  
% 3.82/1.37  % SZS output start Proof for theBenchmark
% 3.82/1.37  Assumptions after simplification:
% 3.82/1.37  ---------------------------------
% 3.82/1.37  
% 3.82/1.37    (prove_this)
% 3.82/1.44     ? [v0: $i] :  ? [v1: $i] :  ? [v2: int] :  ? [v3: $i] :  ? [v4: $i] :  ? [v5:
% 3.82/1.44      int] : ($i(v4) & $i(v3) & $i(v1) & $i(v0) & ((v5 = 0 & a(v3, v4) = 0 &  !
% 3.82/1.44          [v6: $i] :  ! [v7: $i] : ( ~ (a(v7, v6) = 0) |  ~ $i(v7) |  ~ $i(v6))) |
% 3.82/1.44        (v2 = 0 & a(v1, v0) = 0 &  ! [v6: $i] :  ! [v7: $i] : ( ~ (a(v6, v7) = 0)
% 3.82/1.44            |  ~ $i(v7) |  ~ $i(v6)))))
% 3.82/1.44  
% 3.82/1.44  Those formulas are unsatisfiable:
% 3.82/1.44  ---------------------------------
% 3.82/1.44  
% 3.82/1.44  Begin of proof
% 3.82/1.44  | 
% 3.82/1.44  | DELTA: instantiating (prove_this) with fresh symbols all_3_0, all_3_1,
% 3.82/1.44  |        all_3_2, all_3_3, all_3_4, all_3_5 gives:
% 3.82/1.45  |   (1)  $i(all_3_1) & $i(all_3_2) & $i(all_3_4) & $i(all_3_5) & ((all_3_0 = 0 &
% 3.82/1.45  |            a(all_3_2, all_3_1) = 0 &  ! [v0: $i] :  ! [v1: $i] : ( ~ (a(v1,
% 3.82/1.45  |                  v0) = 0) |  ~ $i(v1) |  ~ $i(v0))) | (all_3_3 = 0 &
% 3.82/1.45  |            a(all_3_4, all_3_5) = 0 &  ! [v0: $i] :  ! [v1: $i] : ( ~ (a(v0,
% 3.82/1.45  |                  v1) = 0) |  ~ $i(v1) |  ~ $i(v0))))
% 3.82/1.45  | 
% 3.82/1.45  | ALPHA: (1) implies:
% 3.82/1.45  |   (2)  $i(all_3_5)
% 3.82/1.45  |   (3)  $i(all_3_4)
% 3.82/1.45  |   (4)  $i(all_3_2)
% 3.82/1.45  |   (5)  $i(all_3_1)
% 3.82/1.45  |   (6)  (all_3_0 = 0 & a(all_3_2, all_3_1) = 0 &  ! [v0: $i] :  ! [v1: $i] : (
% 3.82/1.45  |            ~ (a(v1, v0) = 0) |  ~ $i(v1) |  ~ $i(v0))) | (all_3_3 = 0 &
% 3.82/1.45  |          a(all_3_4, all_3_5) = 0 &  ! [v0: $i] :  ! [v1: $i] : ( ~ (a(v0, v1)
% 3.82/1.45  |              = 0) |  ~ $i(v1) |  ~ $i(v0)))
% 3.82/1.45  | 
% 3.82/1.46  | BETA: splitting (6) gives:
% 3.82/1.46  | 
% 3.82/1.46  | Case 1:
% 3.82/1.46  | | 
% 3.82/1.46  | |   (7)  all_3_0 = 0 & a(all_3_2, all_3_1) = 0 &  ! [v0: $i] :  ! [v1: $i] : (
% 3.82/1.46  | |          ~ (a(v1, v0) = 0) |  ~ $i(v1) |  ~ $i(v0))
% 3.82/1.46  | | 
% 3.82/1.46  | | ALPHA: (7) implies:
% 3.82/1.46  | |   (8)  a(all_3_2, all_3_1) = 0
% 3.82/1.46  | |   (9)   ! [v0: $i] :  ! [v1: $i] : ( ~ (a(v1, v0) = 0) |  ~ $i(v1) |  ~
% 3.82/1.46  | |          $i(v0))
% 3.82/1.46  | | 
% 3.82/1.46  | | GROUND_INST: instantiating (9) with all_3_1, all_3_2, simplifying with (4),
% 3.82/1.46  | |              (5), (8) gives:
% 3.82/1.46  | |   (10)  $false
% 3.82/1.46  | | 
% 3.82/1.46  | | CLOSE: (10) is inconsistent.
% 3.82/1.46  | | 
% 3.82/1.46  | Case 2:
% 3.82/1.46  | | 
% 3.82/1.47  | |   (11)  all_3_3 = 0 & a(all_3_4, all_3_5) = 0 &  ! [v0: $i] :  ! [v1: $i] :
% 3.82/1.47  | |         ( ~ (a(v0, v1) = 0) |  ~ $i(v1) |  ~ $i(v0))
% 3.82/1.47  | | 
% 3.82/1.47  | | ALPHA: (11) implies:
% 3.82/1.47  | |   (12)  a(all_3_4, all_3_5) = 0
% 3.82/1.47  | |   (13)   ! [v0: $i] :  ! [v1: $i] : ( ~ (a(v0, v1) = 0) |  ~ $i(v1) |  ~
% 3.82/1.47  | |           $i(v0))
% 3.82/1.47  | | 
% 3.82/1.47  | | GROUND_INST: instantiating (13) with all_3_4, all_3_5, simplifying with (2),
% 3.82/1.47  | |              (3), (12) gives:
% 3.82/1.47  | |   (14)  $false
% 3.82/1.47  | | 
% 3.82/1.47  | | CLOSE: (14) is inconsistent.
% 3.82/1.47  | | 
% 3.82/1.47  | End of split
% 3.82/1.47  | 
% 3.82/1.47  End of proof
% 3.82/1.47  % SZS output end Proof for theBenchmark
% 3.82/1.47  
% 3.82/1.47  841ms
%------------------------------------------------------------------------------