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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : SYN406+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 : n001.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:33 EDT 2023

% Result   : Theorem 2.88s 1.15s
% Output   : Proof 3.40s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN406+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.34  % Computer : n001.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:25:01 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.19/0.60  ________       _____
% 0.19/0.60  ___  __ \_________(_)________________________________
% 0.19/0.60  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.19/0.60  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.19/0.60  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.19/0.60  
% 0.19/0.60  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.19/0.60  (2023-06-19)
% 0.19/0.60  
% 0.19/0.60  (c) Philipp Rümmer, 2009-2023
% 0.19/0.60  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.19/0.60                Amanda Stjerna.
% 0.19/0.60  Free software under BSD-3-Clause.
% 0.19/0.60  
% 0.19/0.60  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.19/0.60  
% 0.19/0.60  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.19/0.61  Running up to 7 provers in parallel.
% 0.19/0.63  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.19/0.63  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.19/0.63  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.19/0.63  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.19/0.63  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.19/0.63  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.19/0.63  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.71/0.97  Prover 4: Preprocessing ...
% 1.71/0.97  Prover 1: Preprocessing ...
% 1.71/1.01  Prover 6: Preprocessing ...
% 1.71/1.01  Prover 5: Preprocessing ...
% 1.71/1.01  Prover 3: Preprocessing ...
% 1.71/1.01  Prover 0: Preprocessing ...
% 1.71/1.01  Prover 2: Preprocessing ...
% 2.34/1.07  Prover 5: Constructing countermodel ...
% 2.34/1.07  Prover 2: Constructing countermodel ...
% 2.34/1.07  Prover 1: Constructing countermodel ...
% 2.34/1.07  Prover 6: Proving ...
% 2.34/1.07  Prover 3: Constructing countermodel ...
% 2.34/1.08  Prover 4: Constructing countermodel ...
% 2.34/1.10  Prover 0: Proving ...
% 2.88/1.14  Prover 5: proved (517ms)
% 2.88/1.14  
% 2.88/1.15  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.88/1.15  
% 2.88/1.15  Prover 2: proved (526ms)
% 2.88/1.15  
% 2.88/1.15  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.88/1.15  
% 2.88/1.15  Prover 3: proved (525ms)
% 2.88/1.15  
% 2.88/1.15  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.88/1.15  
% 2.88/1.15  Prover 6: stopped
% 2.88/1.15  Prover 0: proved (531ms)
% 2.88/1.15  
% 2.88/1.15  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.88/1.15  
% 2.88/1.16  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 2.88/1.16  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 2.88/1.16  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 2.88/1.16  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 2.88/1.16  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 2.88/1.17  Prover 11: Preprocessing ...
% 2.88/1.17  Prover 10: Preprocessing ...
% 2.88/1.17  Prover 8: Preprocessing ...
% 3.40/1.17  Prover 10: Constructing countermodel ...
% 3.40/1.18  Prover 13: Preprocessing ...
% 3.40/1.18  Prover 7: Preprocessing ...
% 3.40/1.19  Prover 13: Constructing countermodel ...
% 3.40/1.19  Prover 4: Found proof (size 10)
% 3.40/1.19  Prover 7: Constructing countermodel ...
% 3.40/1.19  Prover 10: Found proof (size 5)
% 3.40/1.19  Prover 10: proved (41ms)
% 3.40/1.19  Prover 4: proved (573ms)
% 3.40/1.20  Prover 13: stopped
% 3.40/1.20  Prover 1: stopped
% 3.40/1.20  Prover 7: stopped
% 3.40/1.20  Prover 8: Warning: ignoring some quantifiers
% 3.40/1.20  Prover 11: Constructing countermodel ...
% 3.40/1.21  Prover 11: stopped
% 3.40/1.21  Prover 8: Constructing countermodel ...
% 3.40/1.21  Prover 8: stopped
% 3.40/1.21  
% 3.40/1.21  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.40/1.21  
% 3.40/1.21  % SZS output start Proof for theBenchmark
% 3.40/1.22  Assumptions after simplification:
% 3.40/1.22  ---------------------------------
% 3.40/1.22  
% 3.40/1.22    (kalish240)
% 3.40/1.22     ? [v0: $i] : ($i(v0) & h(v0) & f(v0) &  ! [v1: $i] : ( ~ $i(v1) |  ~ h(v1) | 
% 3.40/1.22        ~ g(v1)) &  ! [v1: $i] : ( ~ $i(v1) |  ~ f(v1) | g(v1)))
% 3.40/1.22  
% 3.40/1.22  Those formulas are unsatisfiable:
% 3.40/1.22  ---------------------------------
% 3.40/1.22  
% 3.40/1.22  Begin of proof
% 3.40/1.22  | 
% 3.40/1.22  | DELTA: instantiating (kalish240) with fresh symbol all_2_0 gives:
% 3.40/1.23  |   (1)  $i(all_2_0) & h(all_2_0) & f(all_2_0) &  ! [v0: $i] : ( ~ $i(v0) |  ~
% 3.40/1.23  |          h(v0) |  ~ g(v0)) &  ! [v0: $i] : ( ~ $i(v0) |  ~ f(v0) | g(v0))
% 3.40/1.23  | 
% 3.40/1.23  | ALPHA: (1) implies:
% 3.40/1.23  |   (2)  f(all_2_0)
% 3.40/1.23  |   (3)  h(all_2_0)
% 3.40/1.23  |   (4)  $i(all_2_0)
% 3.40/1.23  |   (5)   ! [v0: $i] : ( ~ $i(v0) |  ~ f(v0) | g(v0))
% 3.40/1.23  |   (6)   ! [v0: $i] : ( ~ $i(v0) |  ~ h(v0) |  ~ g(v0))
% 3.40/1.23  | 
% 3.40/1.23  | GROUND_INST: instantiating (5) with all_2_0, simplifying with (2), (4) gives:
% 3.40/1.23  |   (7)  g(all_2_0)
% 3.40/1.23  | 
% 3.40/1.23  | GROUND_INST: instantiating (6) with all_2_0, simplifying with (3), (4), (7)
% 3.40/1.23  |              gives:
% 3.40/1.23  |   (8)  $false
% 3.40/1.24  | 
% 3.40/1.24  | CLOSE: (8) is inconsistent.
% 3.40/1.24  | 
% 3.40/1.24  End of proof
% 3.40/1.24  % SZS output end Proof for theBenchmark
% 3.40/1.24  
% 3.40/1.24  636ms
%------------------------------------------------------------------------------