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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : SWV400+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 : n011.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:11 EDT 2023

% Result   : Theorem 6.37s 1.62s
% Output   : Proof 7.89s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWV400+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.13/0.34  % Computer : n011.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 : Tue Aug 29 06:50:41 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.61  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.19/0.62  Running up to 7 provers in parallel.
% 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 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 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
% 2.68/1.08  Prover 4: Preprocessing ...
% 2.68/1.08  Prover 1: Preprocessing ...
% 3.01/1.13  Prover 5: Preprocessing ...
% 3.01/1.13  Prover 0: Preprocessing ...
% 3.01/1.13  Prover 6: Preprocessing ...
% 3.01/1.13  Prover 3: Preprocessing ...
% 3.01/1.13  Prover 2: Preprocessing ...
% 5.37/1.48  Prover 1: Constructing countermodel ...
% 5.92/1.51  Prover 5: Proving ...
% 5.92/1.52  Prover 6: Constructing countermodel ...
% 5.92/1.52  Prover 3: Constructing countermodel ...
% 5.92/1.53  Prover 0: Proving ...
% 5.92/1.55  Prover 4: Constructing countermodel ...
% 6.37/1.58  Prover 2: Proving ...
% 6.37/1.62  Prover 6: proved (988ms)
% 6.37/1.62  
% 6.37/1.62  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.37/1.62  
% 6.37/1.62  Prover 0: stopped
% 6.37/1.62  Prover 2: stopped
% 6.37/1.62  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 6.37/1.62  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 6.37/1.62  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 6.37/1.62  Prover 5: stopped
% 6.37/1.64  Prover 3: stopped
% 6.37/1.64  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 6.37/1.64  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 6.37/1.64  Prover 1: Found proof (size 6)
% 6.37/1.64  Prover 1: proved (1019ms)
% 6.37/1.65  Prover 4: Found proof (size 6)
% 6.37/1.65  Prover 4: proved (1018ms)
% 7.03/1.66  Prover 8: Preprocessing ...
% 7.03/1.67  Prover 10: Preprocessing ...
% 7.03/1.67  Prover 11: Preprocessing ...
% 7.03/1.68  Prover 13: Preprocessing ...
% 7.03/1.68  Prover 7: Preprocessing ...
% 7.25/1.69  Prover 10: stopped
% 7.25/1.70  Prover 7: stopped
% 7.25/1.71  Prover 13: stopped
% 7.25/1.71  Prover 11: stopped
% 7.54/1.75  Prover 8: Warning: ignoring some quantifiers
% 7.54/1.76  Prover 8: Constructing countermodel ...
% 7.54/1.76  Prover 8: stopped
% 7.54/1.76  
% 7.54/1.76  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.54/1.76  
% 7.54/1.77  % SZS output start Proof for theBenchmark
% 7.54/1.77  Assumptions after simplification:
% 7.54/1.77  ---------------------------------
% 7.54/1.77  
% 7.54/1.77    (ax22)
% 7.89/1.81    $i(create_slb) &  ! [v0: $i] :  ! [v1: $i] : ( ~ (pair_in_list(create_slb, v0,
% 7.89/1.81          v1) = 0) |  ~ $i(v1) |  ~ $i(v0))
% 7.89/1.81  
% 7.89/1.81    (l36_co)
% 7.89/1.82    $i(create_slb) &  ? [v0: $i] :  ? [v1: $i] :  ? [v2: $i] :  ? [v3: $i] :  ?
% 7.89/1.82    [v4: $i] :  ? [v5: int] : ( ~ (v5 = 0) & update_slb(create_slb, v3) = v4 &
% 7.89/1.82      pair_in_list(v4, v1, v2) = v5 & pair_in_list(create_slb, v1, v2) = 0 &
% 7.89/1.82      less_than(v3, v2) = 0 & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0))
% 7.89/1.82  
% 7.89/1.82  Further assumptions not needed in the proof:
% 7.89/1.82  --------------------------------------------
% 7.89/1.82  ax18, ax19, ax20, ax21, ax23, ax24, ax25, ax26, ax27, ax28, ax29, ax30,
% 7.89/1.82  bottom_smallest, reflexivity, stricly_smaller_definition, totality, transitivity
% 7.89/1.82  
% 7.89/1.82  Those formulas are unsatisfiable:
% 7.89/1.82  ---------------------------------
% 7.89/1.82  
% 7.89/1.82  Begin of proof
% 7.89/1.82  | 
% 7.89/1.82  | ALPHA: (ax22) implies:
% 7.89/1.82  |   (1)   ! [v0: $i] :  ! [v1: $i] : ( ~ (pair_in_list(create_slb, v0, v1) = 0)
% 7.89/1.82  |          |  ~ $i(v1) |  ~ $i(v0))
% 7.89/1.82  | 
% 7.89/1.82  | ALPHA: (l36_co) implies:
% 7.89/1.82  |   (2)   ? [v0: $i] :  ? [v1: $i] :  ? [v2: $i] :  ? [v3: $i] :  ? [v4: $i] : 
% 7.89/1.82  |        ? [v5: int] : ( ~ (v5 = 0) & update_slb(create_slb, v3) = v4 &
% 7.89/1.82  |          pair_in_list(v4, v1, v2) = v5 & pair_in_list(create_slb, v1, v2) = 0
% 7.89/1.82  |          & less_than(v3, v2) = 0 & $i(v4) & $i(v3) & $i(v2) & $i(v1) & $i(v0))
% 7.89/1.82  | 
% 7.89/1.83  | DELTA: instantiating (2) with fresh symbols all_23_0, all_23_1, all_23_2,
% 7.89/1.83  |        all_23_3, all_23_4, all_23_5 gives:
% 7.89/1.83  |   (3)   ~ (all_23_0 = 0) & update_slb(create_slb, all_23_2) = all_23_1 &
% 7.89/1.83  |        pair_in_list(all_23_1, all_23_4, all_23_3) = all_23_0 &
% 7.89/1.83  |        pair_in_list(create_slb, all_23_4, all_23_3) = 0 & less_than(all_23_2,
% 7.89/1.83  |          all_23_3) = 0 & $i(all_23_1) & $i(all_23_2) & $i(all_23_3) &
% 7.89/1.83  |        $i(all_23_4) & $i(all_23_5)
% 7.89/1.83  | 
% 7.89/1.83  | ALPHA: (3) implies:
% 7.89/1.83  |   (4)  $i(all_23_4)
% 7.89/1.83  |   (5)  $i(all_23_3)
% 7.89/1.83  |   (6)  pair_in_list(create_slb, all_23_4, all_23_3) = 0
% 7.89/1.83  | 
% 7.89/1.83  | GROUND_INST: instantiating (1) with all_23_4, all_23_3, simplifying with (4),
% 7.89/1.83  |              (5), (6) gives:
% 7.89/1.83  |   (7)  $false
% 7.89/1.83  | 
% 7.89/1.83  | CLOSE: (7) is inconsistent.
% 7.89/1.83  | 
% 7.89/1.83  End of proof
% 7.89/1.83  % SZS output end Proof for theBenchmark
% 7.89/1.83  
% 7.89/1.83  1228ms
%------------------------------------------------------------------------------