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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : SWV392+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm  : none
% Format   : tptp
% Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s

% Computer : n009.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 : Thu Aug 31 22:56:08 EDT 2023

% Result   : Theorem 6.49s 1.55s
% Output   : Proof 7.82s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWV392+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.13  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.12/0.34  % Computer : n009.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Tue Aug 29 09:59:50 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.46/0.61  ________       _____
% 0.46/0.61  ___  __ \_________(_)________________________________
% 0.46/0.61  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.46/0.61  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.46/0.61  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.46/0.61  
% 0.46/0.61  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.46/0.61  (2023-06-19)
% 0.46/0.61  
% 0.46/0.61  (c) Philipp Rümmer, 2009-2023
% 0.46/0.61  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.46/0.61                Amanda Stjerna.
% 0.46/0.61  Free software under BSD-3-Clause.
% 0.46/0.61  
% 0.46/0.61  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.46/0.61  
% 0.46/0.61  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.46/0.62  Running up to 7 provers in parallel.
% 0.46/0.63  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.46/0.63  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.46/0.63  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.46/0.63  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.46/0.63  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.46/0.63  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.46/0.63  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 2.07/1.03  Prover 1: Preprocessing ...
% 2.75/1.04  Prover 4: Preprocessing ...
% 2.75/1.08  Prover 5: Preprocessing ...
% 2.75/1.08  Prover 2: Preprocessing ...
% 2.75/1.08  Prover 3: Preprocessing ...
% 2.75/1.08  Prover 0: Preprocessing ...
% 2.75/1.08  Prover 6: Preprocessing ...
% 5.30/1.43  Prover 6: Constructing countermodel ...
% 5.30/1.44  Prover 3: Constructing countermodel ...
% 5.30/1.44  Prover 1: Constructing countermodel ...
% 5.86/1.47  Prover 5: Proving ...
% 5.86/1.47  Prover 2: Proving ...
% 5.86/1.50  Prover 4: Constructing countermodel ...
% 6.22/1.54  Prover 0: Proving ...
% 6.49/1.55  Prover 6: proved (918ms)
% 6.49/1.55  
% 6.49/1.55  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.49/1.55  
% 6.49/1.55  Prover 3: stopped
% 6.49/1.55  Prover 5: stopped
% 6.49/1.55  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 6.49/1.55  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 6.49/1.56  Prover 2: stopped
% 6.49/1.56  Prover 0: stopped
% 6.49/1.56  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 6.49/1.57  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 6.49/1.57  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 6.49/1.58  Prover 4: Found proof (size 6)
% 6.49/1.58  Prover 4: proved (947ms)
% 6.49/1.58  Prover 1: Found proof (size 6)
% 6.49/1.58  Prover 1: proved (952ms)
% 6.49/1.60  Prover 7: Preprocessing ...
% 6.49/1.61  Prover 10: Preprocessing ...
% 6.49/1.62  Prover 11: Preprocessing ...
% 6.49/1.62  Prover 13: Preprocessing ...
% 6.49/1.62  Prover 8: Preprocessing ...
% 6.49/1.63  Prover 7: stopped
% 7.13/1.64  Prover 10: stopped
% 7.13/1.65  Prover 11: stopped
% 7.13/1.65  Prover 13: stopped
% 7.39/1.70  Prover 8: Warning: ignoring some quantifiers
% 7.39/1.71  Prover 8: Constructing countermodel ...
% 7.39/1.72  Prover 8: stopped
% 7.39/1.72  
% 7.39/1.72  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.39/1.72  
% 7.39/1.72  % SZS output start Proof for theBenchmark
% 7.39/1.72  Assumptions after simplification:
% 7.39/1.72  ---------------------------------
% 7.39/1.73  
% 7.39/1.73    (ax22)
% 7.39/1.75    $i(create_slb) &  ! [v0: $i] :  ! [v1: $i] : ( ~ (pair_in_list(create_slb, v0,
% 7.39/1.75          v1) = 0) |  ~ $i(v1) |  ~ $i(v0))
% 7.39/1.75  
% 7.39/1.75    (l28_co)
% 7.74/1.76    $i(create_slb) &  ? [v0: $i] :  ? [v1: $i] :  ? [v2: $i] :  ? [v3: $i] :  ?
% 7.74/1.76    [v4: int] : ( ~ (v4 = 0) &  ~ (v2 = v0) & remove_slb(create_slb, v2) = v3 &
% 7.74/1.76      pair_in_list(v3, v0, v1) = v4 & pair_in_list(create_slb, v0, v1) = 0 &
% 7.74/1.76      contains_slb(create_slb, v2) = 0 & $i(v3) & $i(v2) & $i(v1) & $i(v0))
% 7.74/1.76  
% 7.74/1.76  Further assumptions not needed in the proof:
% 7.74/1.76  --------------------------------------------
% 7.74/1.76  ax18, ax19, ax20, ax21, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax30,
% 7.74/1.76  bottom_smallest, reflexivity, stricly_smaller_definition, totality, transitivity
% 7.74/1.76  
% 7.74/1.76  Those formulas are unsatisfiable:
% 7.74/1.76  ---------------------------------
% 7.74/1.76  
% 7.74/1.76  Begin of proof
% 7.74/1.76  | 
% 7.74/1.76  | ALPHA: (ax22) implies:
% 7.74/1.76  |   (1)   ! [v0: $i] :  ! [v1: $i] : ( ~ (pair_in_list(create_slb, v0, v1) = 0)
% 7.74/1.76  |          |  ~ $i(v1) |  ~ $i(v0))
% 7.74/1.76  | 
% 7.74/1.76  | ALPHA: (l28_co) implies:
% 7.74/1.76  |   (2)   ? [v0: $i] :  ? [v1: $i] :  ? [v2: $i] :  ? [v3: $i] :  ? [v4: int] :
% 7.74/1.76  |        ( ~ (v4 = 0) &  ~ (v2 = v0) & remove_slb(create_slb, v2) = v3 &
% 7.74/1.76  |          pair_in_list(v3, v0, v1) = v4 & pair_in_list(create_slb, v0, v1) = 0
% 7.74/1.76  |          & contains_slb(create_slb, v2) = 0 & $i(v3) & $i(v2) & $i(v1) &
% 7.74/1.76  |          $i(v0))
% 7.74/1.76  | 
% 7.74/1.77  | DELTA: instantiating (2) with fresh symbols all_23_0, all_23_1, all_23_2,
% 7.74/1.77  |        all_23_3, all_23_4 gives:
% 7.74/1.77  |   (3)   ~ (all_23_0 = 0) &  ~ (all_23_2 = all_23_4) & remove_slb(create_slb,
% 7.74/1.77  |          all_23_2) = all_23_1 & pair_in_list(all_23_1, all_23_4, all_23_3) =
% 7.74/1.77  |        all_23_0 & pair_in_list(create_slb, all_23_4, all_23_3) = 0 &
% 7.74/1.77  |        contains_slb(create_slb, all_23_2) = 0 & $i(all_23_1) & $i(all_23_2) &
% 7.74/1.77  |        $i(all_23_3) & $i(all_23_4)
% 7.74/1.77  | 
% 7.74/1.77  | ALPHA: (3) implies:
% 7.74/1.77  |   (4)  $i(all_23_4)
% 7.74/1.77  |   (5)  $i(all_23_3)
% 7.74/1.77  |   (6)  pair_in_list(create_slb, all_23_4, all_23_3) = 0
% 7.74/1.77  | 
% 7.74/1.77  | GROUND_INST: instantiating (1) with all_23_4, all_23_3, simplifying with (4),
% 7.74/1.77  |              (5), (6) gives:
% 7.74/1.77  |   (7)  $false
% 7.82/1.77  | 
% 7.82/1.77  | CLOSE: (7) is inconsistent.
% 7.82/1.77  | 
% 7.82/1.77  End of proof
% 7.82/1.77  % SZS output end Proof for theBenchmark
% 7.82/1.77  
% 7.82/1.77  1161ms
%------------------------------------------------------------------------------