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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : SYN931+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 : n029.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:16 EDT 2023

% Result   : Theorem 2.86s 1.14s
% Output   : Proof 3.27s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SYN931+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.14  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.14/0.36  % Computer : n029.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 300
% 0.14/0.36  % DateTime : Sat Aug 26 18:09:40 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 0.21/0.62  ________       _____
% 0.21/0.62  ___  __ \_________(_)________________________________
% 0.21/0.62  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.21/0.62  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.21/0.62  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.21/0.63  
% 0.21/0.63  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.21/0.63  (2023-06-19)
% 0.21/0.63  
% 0.21/0.63  (c) Philipp Rümmer, 2009-2023
% 0.21/0.63  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.21/0.63                Amanda Stjerna.
% 0.21/0.63  Free software under BSD-3-Clause.
% 0.21/0.63  
% 0.21/0.63  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.21/0.63  
% 0.21/0.63  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.21/0.64  Running up to 7 provers in parallel.
% 0.21/0.65  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.21/0.65  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.21/0.65  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.21/0.65  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.21/0.65  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.21/0.65  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.21/0.65  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.87/0.97  Prover 1: Preprocessing ...
% 1.87/0.97  Prover 4: Preprocessing ...
% 1.87/1.02  Prover 2: Preprocessing ...
% 1.87/1.02  Prover 3: Preprocessing ...
% 1.87/1.02  Prover 6: Preprocessing ...
% 1.87/1.02  Prover 5: Preprocessing ...
% 1.87/1.02  Prover 0: Preprocessing ...
% 2.40/1.07  Prover 5: Constructing countermodel ...
% 2.40/1.07  Prover 2: Constructing countermodel ...
% 2.40/1.07  Prover 3: Constructing countermodel ...
% 2.40/1.07  Prover 4: Constructing countermodel ...
% 2.40/1.08  Prover 1: Constructing countermodel ...
% 2.40/1.08  Prover 0: Proving ...
% 2.40/1.09  Prover 6: Proving ...
% 2.86/1.14  Prover 2: proved (488ms)
% 2.86/1.14  
% 2.86/1.14  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.86/1.14  
% 2.86/1.14  Prover 3: stopped
% 2.86/1.14  Prover 6: stopped
% 2.86/1.14  Prover 0: stopped
% 2.86/1.14  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 2.86/1.14  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 2.86/1.14  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 2.86/1.14  Prover 5: stopped
% 2.86/1.15  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 2.86/1.15  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 2.86/1.15  Prover 8: Preprocessing ...
% 2.86/1.15  Prover 10: Preprocessing ...
% 2.86/1.16  Prover 13: Preprocessing ...
% 2.86/1.16  Prover 10: Constructing countermodel ...
% 2.86/1.17  Prover 11: Preprocessing ...
% 2.86/1.17  Prover 7: Preprocessing ...
% 2.86/1.17  Prover 13: Constructing countermodel ...
% 2.86/1.18  Prover 10: Found proof (size 4)
% 2.86/1.18  Prover 10: proved (33ms)
% 2.86/1.18  Prover 1: stopped
% 2.86/1.18  Prover 8: Warning: ignoring some quantifiers
% 2.86/1.18  Prover 13: stopped
% 2.86/1.18  Prover 8: Constructing countermodel ...
% 2.86/1.18  Prover 4: Found proof (size 9)
% 2.86/1.18  Prover 4: proved (529ms)
% 2.86/1.18  Prover 8: stopped
% 2.86/1.19  Prover 7: Constructing countermodel ...
% 2.86/1.19  Prover 7: stopped
% 2.86/1.19  Prover 11: Constructing countermodel ...
% 2.86/1.19  Prover 11: stopped
% 2.86/1.19  
% 2.86/1.19  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.86/1.19  
% 2.86/1.20  % SZS output start Proof for theBenchmark
% 2.86/1.20  Assumptions after simplification:
% 2.86/1.20  ---------------------------------
% 2.86/1.20  
% 2.86/1.20    (prove_this)
% 3.27/1.20     ? [v0: $i] : ($i(v0) & c & p(v0) &  ! [v1: $i] : ( ~ $i(v1) |  ~ p(v1)))
% 3.27/1.20  
% 3.27/1.20  Those formulas are unsatisfiable:
% 3.27/1.20  ---------------------------------
% 3.27/1.20  
% 3.27/1.20  Begin of proof
% 3.27/1.20  | 
% 3.27/1.20  | DELTA: instantiating (prove_this) with fresh symbol all_2_0 gives:
% 3.27/1.21  |   (1)  $i(all_2_0) & c & p(all_2_0) &  ! [v0: $i] : ( ~ $i(v0) |  ~ p(v0))
% 3.27/1.21  | 
% 3.27/1.21  | ALPHA: (1) implies:
% 3.27/1.21  |   (2)  p(all_2_0)
% 3.27/1.21  |   (3)  $i(all_2_0)
% 3.27/1.21  |   (4)   ! [v0: $i] : ( ~ $i(v0) |  ~ p(v0))
% 3.27/1.21  | 
% 3.27/1.21  | GROUND_INST: instantiating (4) with all_2_0, simplifying with (2), (3) gives:
% 3.27/1.21  |   (5)  $false
% 3.27/1.21  | 
% 3.27/1.21  | CLOSE: (5) is inconsistent.
% 3.27/1.21  | 
% 3.27/1.21  End of proof
% 3.27/1.21  % SZS output end Proof for theBenchmark
% 3.27/1.21  
% 3.27/1.21  583ms
%------------------------------------------------------------------------------