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

View Problem - Process Solution

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

% Computer : n025.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 04:53:17 EDT 2023

% Result   : Theorem 13.48s 2.58s
% Output   : Proof 21.05s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYO578+1 : TPTP v8.1.2. Released v5.5.0.
% 0.00/0.13  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34  % Computer : n025.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 06:05:52 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/sandbox2/benchmark/theBenchmark.p ...
% 0.19/0.61  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
% 3.66/1.21  Prover 4: Preprocessing ...
% 3.66/1.21  Prover 1: Preprocessing ...
% 3.91/1.25  Prover 6: Preprocessing ...
% 3.91/1.25  Prover 0: Preprocessing ...
% 3.91/1.25  Prover 3: Preprocessing ...
% 3.91/1.25  Prover 5: Preprocessing ...
% 3.91/1.26  Prover 2: Preprocessing ...
% 7.41/1.76  Prover 2: Constructing countermodel ...
% 7.41/1.76  Prover 5: Constructing countermodel ...
% 9.06/1.97  Prover 6: Proving ...
% 9.06/1.98  Prover 3: Constructing countermodel ...
% 9.06/2.01  Prover 1: Constructing countermodel ...
% 10.04/2.24  Prover 4: Constructing countermodel ...
% 11.51/2.30  Prover 0: Proving ...
% 13.48/2.57  Prover 3: proved (1953ms)
% 13.48/2.58  
% 13.48/2.58  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 13.48/2.58  
% 13.48/2.58  Prover 2: stopped
% 13.75/2.59  Prover 5: stopped
% 13.75/2.60  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 13.75/2.60  Prover 6: stopped
% 13.75/2.60  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 13.75/2.60  Prover 0: stopped
% 13.75/2.60  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 13.75/2.60  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 13.75/2.60  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 14.57/2.72  Prover 7: Preprocessing ...
% 14.57/2.73  Prover 8: Preprocessing ...
% 14.57/2.75  Prover 11: Preprocessing ...
% 14.57/2.76  Prover 10: Preprocessing ...
% 14.57/2.77  Prover 13: Preprocessing ...
% 14.57/2.86  Prover 7: Constructing countermodel ...
% 15.82/2.93  Prover 10: Constructing countermodel ...
% 15.82/2.94  Prover 13: Constructing countermodel ...
% 16.62/3.00  Prover 8: Warning: ignoring some quantifiers
% 16.62/3.02  Prover 8: Constructing countermodel ...
% 18.01/3.21  Prover 11: Constructing countermodel ...
% 19.84/3.59  Prover 13: Found proof (size 11)
% 19.84/3.59  Prover 13: proved (984ms)
% 19.84/3.59  Prover 7: stopped
% 19.84/3.59  Prover 10: stopped
% 19.84/3.59  Prover 11: stopped
% 19.84/3.59  Prover 1: stopped
% 19.84/3.59  Prover 8: stopped
% 19.84/3.59  Prover 4: stopped
% 19.84/3.59  
% 21.05/3.59  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 21.05/3.59  
% 21.05/3.60  % SZS output start Proof for theBenchmark
% 21.05/3.60  Assumptions after simplification:
% 21.05/3.60  ---------------------------------
% 21.05/3.60  
% 21.05/3.60    (goals_86)
% 21.05/3.61     ? [v0: $i] :  ? [v1: $i] :  ? [v2: $i] : ($i(v2) & $i(v1) & $i(v0) &
% 21.05/3.61      k04_buttercup10100(v0) & b48_buttercup10098(v0) &  ! [v3: $i] :  ! [v4: $i]
% 21.05/3.61      :  ! [v5: $i] : ( ~ $i(v5) |  ~ $i(v4) |  ~ $i(v3) |  ~
% 21.05/3.61        k04_buttercup10100(v4) |  ~ k04_buttercup10100(v3) |  ~
% 21.05/3.61        b48_buttercup10098(v5) |  ~ b48_buttercup10098(v3) |
% 21.05/3.61        k04_buttercup10100(v5) | b48_buttercup10098(v4)) & ( ! [v3: $i] : ( ~
% 21.05/3.61          $i(v3) |  ~ k04_buttercup10100(v3) | b48_buttercup10098(v3)) |
% 21.05/3.61        (b48_buttercup10098(v2) &  ~ k04_buttercup10100(v2))) & ( ! [v3: $i] : ( ~
% 21.05/3.61          $i(v3) |  ~ b48_buttercup10098(v3) | k04_buttercup10100(v3)) |
% 21.05/3.61        (k04_buttercup10100(v1) &  ~ b48_buttercup10098(v1))))
% 21.05/3.61  
% 21.05/3.61    (sos_21)
% 21.05/3.61     ? [v0: $i] : ($i(v0) & b48_buttercup10098(v0) &  ~ k04_buttercup10100(v0) & 
% 21.05/3.61      ! [v1: $i] : ( ~ $i(v1) |  ~ k04_buttercup10100(v1) |
% 21.05/3.61        b48_buttercup10098(v1)))
% 21.05/3.61  
% 21.05/3.61  Further assumptions not needed in the proof:
% 21.05/3.61  --------------------------------------------
% 21.05/3.61  sos_01, sos_02, sos_03, sos_04, sos_05, sos_06, sos_07, sos_08, sos_09, sos_10,
% 21.05/3.61  sos_11, sos_12, sos_13, sos_14, sos_15, sos_16, sos_17, sos_18, sos_19, sos_20,
% 21.05/3.61  sos_22, sos_23, sos_24, sos_25, sos_26, sos_27, sos_28, sos_29, sos_30, sos_31,
% 21.05/3.61  sos_32, sos_33, sos_34, sos_35, sos_36, sos_37, sos_38, sos_39, sos_40, sos_41,
% 21.05/3.61  sos_42, sos_43, sos_44, sos_45, sos_46, sos_47, sos_48, sos_49, sos_50, sos_51,
% 21.05/3.61  sos_52, sos_53, sos_54, sos_55, sos_56, sos_57, sos_58, sos_59, sos_60, sos_61,
% 21.05/3.61  sos_62, sos_63, sos_64, sos_65, sos_66, sos_67, sos_68, sos_69, sos_70, sos_71,
% 21.05/3.61  sos_72, sos_73, sos_74, sos_75, sos_76, sos_77, sos_78, sos_79, sos_80, sos_81,
% 21.05/3.61  sos_82, sos_83, sos_84, sos_85
% 21.05/3.61  
% 21.05/3.61  Those formulas are unsatisfiable:
% 21.05/3.61  ---------------------------------
% 21.05/3.61  
% 21.05/3.61  Begin of proof
% 21.05/3.61  | 
% 21.05/3.61  | DELTA: instantiating (sos_21) with fresh symbol all_102_0 gives:
% 21.05/3.61  |   (1)  $i(all_102_0) & b48_buttercup10098(all_102_0) &  ~
% 21.05/3.61  |        k04_buttercup10100(all_102_0) &  ! [v0: $i] : ( ~ $i(v0) |  ~
% 21.05/3.61  |          k04_buttercup10100(v0) | b48_buttercup10098(v0))
% 21.05/3.61  | 
% 21.05/3.61  | ALPHA: (1) implies:
% 21.05/3.62  |   (2)   ~ k04_buttercup10100(all_102_0)
% 21.05/3.62  |   (3)  b48_buttercup10098(all_102_0)
% 21.05/3.62  |   (4)  $i(all_102_0)
% 21.05/3.62  |   (5)   ! [v0: $i] : ( ~ $i(v0) |  ~ k04_buttercup10100(v0) |
% 21.05/3.62  |          b48_buttercup10098(v0))
% 21.05/3.62  | 
% 21.05/3.62  | DELTA: instantiating (goals_86) with fresh symbols all_122_0, all_122_1,
% 21.05/3.62  |        all_122_2 gives:
% 21.05/3.62  |   (6)  $i(all_122_0) & $i(all_122_1) & $i(all_122_2) &
% 21.05/3.62  |        k04_buttercup10100(all_122_2) & b48_buttercup10098(all_122_2) &  ! [v0:
% 21.05/3.62  |          $i] :  ! [v1: $i] :  ! [v2: $i] : ( ~ $i(v2) |  ~ $i(v1) |  ~ $i(v0)
% 21.05/3.62  |          |  ~ k04_buttercup10100(v1) |  ~ k04_buttercup10100(v0) |  ~
% 21.05/3.62  |          b48_buttercup10098(v2) |  ~ b48_buttercup10098(v0) |
% 21.05/3.62  |          k04_buttercup10100(v2) | b48_buttercup10098(v1)) & ( ! [v0: $i] : ( ~
% 21.05/3.62  |            $i(v0) |  ~ k04_buttercup10100(v0) | b48_buttercup10098(v0)) |
% 21.05/3.62  |          (b48_buttercup10098(all_122_0) &  ~ k04_buttercup10100(all_122_0))) &
% 21.05/3.62  |        ( ! [v0: $i] : ( ~ $i(v0) |  ~ b48_buttercup10098(v0) |
% 21.05/3.62  |            k04_buttercup10100(v0)) | (k04_buttercup10100(all_122_1) &  ~
% 21.05/3.62  |            b48_buttercup10098(all_122_1)))
% 21.05/3.62  | 
% 21.05/3.62  | ALPHA: (6) implies:
% 21.05/3.62  |   (7)  $i(all_122_1)
% 21.05/3.62  |   (8)   ! [v0: $i] : ( ~ $i(v0) |  ~ b48_buttercup10098(v0) |
% 21.05/3.62  |          k04_buttercup10100(v0)) | (k04_buttercup10100(all_122_1) &  ~
% 21.05/3.62  |          b48_buttercup10098(all_122_1))
% 21.05/3.62  | 
% 21.05/3.62  | BETA: splitting (8) gives:
% 21.05/3.62  | 
% 21.05/3.62  | Case 1:
% 21.05/3.62  | | 
% 21.05/3.62  | |   (9)   ! [v0: $i] : ( ~ $i(v0) |  ~ b48_buttercup10098(v0) |
% 21.05/3.62  | |          k04_buttercup10100(v0))
% 21.05/3.62  | | 
% 21.05/3.62  | | GROUND_INST: instantiating (9) with all_102_0, simplifying with (2), (3),
% 21.05/3.62  | |              (4) gives:
% 21.05/3.62  | |   (10)  $false
% 21.05/3.62  | | 
% 21.05/3.62  | | CLOSE: (10) is inconsistent.
% 21.05/3.62  | | 
% 21.05/3.62  | Case 2:
% 21.05/3.62  | | 
% 21.05/3.62  | |   (11)  k04_buttercup10100(all_122_1) &  ~ b48_buttercup10098(all_122_1)
% 21.05/3.62  | | 
% 21.05/3.62  | | ALPHA: (11) implies:
% 21.05/3.62  | |   (12)   ~ b48_buttercup10098(all_122_1)
% 21.05/3.62  | |   (13)  k04_buttercup10100(all_122_1)
% 21.05/3.62  | | 
% 21.05/3.62  | | GROUND_INST: instantiating (5) with all_122_1, simplifying with (7), (12),
% 21.05/3.62  | |              (13) gives:
% 21.05/3.62  | |   (14)  $false
% 21.05/3.62  | | 
% 21.05/3.62  | | CLOSE: (14) is inconsistent.
% 21.05/3.62  | | 
% 21.05/3.62  | End of split
% 21.05/3.62  | 
% 21.05/3.62  End of proof
% 21.05/3.63  % SZS output end Proof for theBenchmark
% 21.05/3.63  
% 21.05/3.63  3027ms
%------------------------------------------------------------------------------