TSTP Solution File: SWB017+2 by Princess---230619

View Problem - Process Solution

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

% Computer : n032.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 20:11:44 EDT 2023

% Result   : Theorem 3.37s 1.11s
% Output   : Proof 4.28s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : SWB017+2 : TPTP v8.1.2. Released v5.2.0.
% 0.00/0.10  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.09/0.29  % Computer : n032.cluster.edu
% 0.09/0.29  % Model    : x86_64 x86_64
% 0.09/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29  % Memory   : 8042.1875MB
% 0.09/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29  % CPULimit : 300
% 0.09/0.29  % WCLimit  : 300
% 0.09/0.29  % DateTime : Sun Aug 27 07:23:14 EDT 2023
% 0.09/0.29  % CPUTime  : 
% 0.14/0.50  ________       _____
% 0.14/0.50  ___  __ \_________(_)________________________________
% 0.14/0.50  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.14/0.50  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.14/0.50  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.14/0.50  
% 0.14/0.50  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.14/0.50  (2023-06-19)
% 0.14/0.50  
% 0.14/0.50  (c) Philipp Rümmer, 2009-2023
% 0.14/0.50  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.14/0.50                Amanda Stjerna.
% 0.14/0.50  Free software under BSD-3-Clause.
% 0.14/0.50  
% 0.14/0.50  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.14/0.50  
% 0.14/0.50  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.14/0.51  Running up to 7 provers in parallel.
% 0.14/0.52  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.14/0.52  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.14/0.52  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.14/0.52  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.14/0.52  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.14/0.52  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.14/0.52  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 0.14/0.82  Prover 4: Preprocessing ...
% 0.14/0.83  Prover 1: Preprocessing ...
% 1.03/0.86  Prover 6: Preprocessing ...
% 1.03/0.86  Prover 3: Preprocessing ...
% 1.03/0.86  Prover 0: Preprocessing ...
% 1.03/0.86  Prover 2: Preprocessing ...
% 1.03/0.86  Prover 5: Preprocessing ...
% 2.31/0.99  Prover 5: Proving ...
% 2.31/1.00  Prover 2: Proving ...
% 2.31/1.00  Prover 1: Constructing countermodel ...
% 2.31/1.00  Prover 4: Constructing countermodel ...
% 2.31/1.01  Prover 3: Constructing countermodel ...
% 2.31/1.01  Prover 6: Proving ...
% 2.31/1.02  Prover 0: Proving ...
% 3.37/1.11  Prover 3: proved (589ms)
% 3.37/1.11  
% 3.37/1.11  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.37/1.11  
% 3.37/1.11  Prover 6: stopped
% 3.37/1.12  Prover 5: stopped
% 3.37/1.13  Prover 2: stopped
% 3.37/1.13  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 3.37/1.13  Prover 0: proved (597ms)
% 3.37/1.13  
% 3.37/1.13  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.37/1.13  
% 3.37/1.13  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 3.37/1.13  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 3.37/1.13  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 3.37/1.13  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 3.37/1.14  Prover 8: Preprocessing ...
% 3.37/1.14  Prover 13: Preprocessing ...
% 3.37/1.14  Prover 7: Preprocessing ...
% 3.37/1.15  Prover 11: Preprocessing ...
% 3.81/1.15  Prover 10: Preprocessing ...
% 3.81/1.16  Prover 1: Found proof (size 20)
% 3.81/1.16  Prover 1: proved (641ms)
% 3.81/1.16  Prover 4: Found proof (size 18)
% 3.81/1.16  Prover 4: proved (639ms)
% 3.88/1.17  Prover 11: stopped
% 3.88/1.17  Prover 13: Warning: ignoring some quantifiers
% 3.88/1.17  Prover 7: Warning: ignoring some quantifiers
% 3.88/1.17  Prover 13: Constructing countermodel ...
% 3.88/1.17  Prover 7: Constructing countermodel ...
% 3.88/1.18  Prover 13: stopped
% 3.88/1.19  Prover 7: stopped
% 3.88/1.19  Prover 10: Warning: ignoring some quantifiers
% 3.88/1.20  Prover 10: Constructing countermodel ...
% 3.88/1.20  Prover 10: stopped
% 3.88/1.20  Prover 8: Warning: ignoring some quantifiers
% 4.11/1.21  Prover 8: Constructing countermodel ...
% 4.11/1.21  Prover 8: stopped
% 4.11/1.21  
% 4.11/1.21  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.11/1.21  
% 4.11/1.22  % SZS output start Proof for theBenchmark
% 4.11/1.22  Assumptions after simplification:
% 4.11/1.22  ---------------------------------
% 4.11/1.22  
% 4.11/1.22    (owl_eqdis_differentfrom)
% 4.28/1.26    $i(uri_owl_differentFrom) &  ! [v0: $i] :  ! [v1: $i] :  ! [v2: int] : (v2 = 0
% 4.28/1.26      | v1 = v0 |  ~ (iext(uri_owl_differentFrom, v0, v1) = v2) |  ~ $i(v1) |  ~
% 4.28/1.26      $i(v0)) &  ! [v0: $i] : ( ~ (iext(uri_owl_differentFrom, v0, v0) = 0) |  ~
% 4.28/1.26      $i(v0))
% 4.28/1.26  
% 4.28/1.26    (owl_eqdis_propertydisjointwith)
% 4.28/1.26    $i(uri_owl_propertyDisjointWith) &  ! [v0: $i] :  ! [v1: $i] :  ! [v2: int] :
% 4.28/1.26    (v2 = 0 |  ~ (iext(uri_owl_propertyDisjointWith, v0, v1) = v2) |  ~ $i(v1) | 
% 4.28/1.26      ~ $i(v0) |  ? [v3: any] :  ? [v4: any] : (ip(v1) = v4 & ip(v0) = v3 & ( ~
% 4.28/1.26          (v4 = 0) |  ~ (v3 = 0))) |  ? [v3: $i] :  ? [v4: $i] : (iext(v1, v3, v4)
% 4.28/1.26        = 0 & iext(v0, v3, v4) = 0 & $i(v4) & $i(v3))) &  ! [v0: $i] :  ! [v1: $i]
% 4.28/1.26    : ( ~ (iext(uri_owl_propertyDisjointWith, v0, v1) = 0) |  ~ $i(v1) |  ~ $i(v0)
% 4.28/1.26      | (ip(v1) = 0 & ip(v0) = 0 &  ! [v2: $i] :  ! [v3: $i] : ( ~ (iext(v0, v2,
% 4.28/1.26              v3) = 0) |  ~ $i(v3) |  ~ $i(v2) |  ? [v4: int] : ( ~ (v4 = 0) &
% 4.28/1.26            iext(v1, v2, v3) = v4))))
% 4.28/1.26  
% 4.28/1.26    (testcase_conclusion_fullish_017_Built_in_Based_Definitions)
% 4.28/1.26    $i(uri_ex_u) & $i(uri_ex_w) & $i(uri_owl_differentFrom) &  ? [v0: int] : ( ~
% 4.28/1.26      (v0 = 0) & iext(uri_owl_differentFrom, uri_ex_w, uri_ex_u) = v0)
% 4.28/1.26  
% 4.28/1.26    (testcase_premise_fullish_017_Built_in_Based_Definitions)
% 4.28/1.27    iext(uri_rdf_type, uri_ex_w, uri_ex_c) = 0 & iext(uri_ex_notInstanceOf,
% 4.28/1.27      uri_ex_u, uri_ex_c) = 0 & iext(uri_owl_propertyDisjointWith,
% 4.28/1.27      uri_ex_notInstanceOf, uri_rdf_type) = 0 & $i(uri_ex_c) & $i(uri_rdf_type) &
% 4.28/1.27    $i(uri_ex_notInstanceOf) & $i(uri_ex_u) & $i(uri_ex_w) &
% 4.28/1.27    $i(uri_owl_propertyDisjointWith)
% 4.28/1.27  
% 4.28/1.27    (function-axioms)
% 4.28/1.27     ! [v0: MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i] :  !
% 4.28/1.27    [v3: $i] :  ! [v4: $i] : (v1 = v0 |  ~ (iext(v4, v3, v2) = v1) |  ~ (iext(v4,
% 4.28/1.27          v3, v2) = v0)) &  ! [v0: MultipleValueBool] :  ! [v1: MultipleValueBool]
% 4.28/1.27    :  ! [v2: $i] : (v1 = v0 |  ~ (ip(v2) = v1) |  ~ (ip(v2) = v0))
% 4.28/1.27  
% 4.28/1.27  Those formulas are unsatisfiable:
% 4.28/1.27  ---------------------------------
% 4.28/1.27  
% 4.28/1.27  Begin of proof
% 4.28/1.27  | 
% 4.28/1.27  | ALPHA: (owl_eqdis_differentfrom) implies:
% 4.28/1.27  |   (1)   ! [v0: $i] :  ! [v1: $i] :  ! [v2: int] : (v2 = 0 | v1 = v0 |  ~
% 4.28/1.27  |          (iext(uri_owl_differentFrom, v0, v1) = v2) |  ~ $i(v1) |  ~ $i(v0))
% 4.28/1.27  | 
% 4.28/1.27  | ALPHA: (owl_eqdis_propertydisjointwith) implies:
% 4.28/1.28  |   (2)   ! [v0: $i] :  ! [v1: $i] : ( ~ (iext(uri_owl_propertyDisjointWith, v0,
% 4.28/1.28  |              v1) = 0) |  ~ $i(v1) |  ~ $i(v0) | (ip(v1) = 0 & ip(v0) = 0 &  !
% 4.28/1.28  |            [v2: $i] :  ! [v3: $i] : ( ~ (iext(v0, v2, v3) = 0) |  ~ $i(v3) | 
% 4.28/1.28  |              ~ $i(v2) |  ? [v4: int] : ( ~ (v4 = 0) & iext(v1, v2, v3) =
% 4.28/1.28  |                v4))))
% 4.28/1.28  | 
% 4.28/1.28  | ALPHA: (testcase_premise_fullish_017_Built_in_Based_Definitions) implies:
% 4.28/1.28  |   (3)  $i(uri_ex_notInstanceOf)
% 4.28/1.28  |   (4)  $i(uri_rdf_type)
% 4.28/1.28  |   (5)  $i(uri_ex_c)
% 4.28/1.28  |   (6)  iext(uri_owl_propertyDisjointWith, uri_ex_notInstanceOf, uri_rdf_type)
% 4.28/1.28  |        = 0
% 4.28/1.28  |   (7)  iext(uri_ex_notInstanceOf, uri_ex_u, uri_ex_c) = 0
% 4.28/1.28  |   (8)  iext(uri_rdf_type, uri_ex_w, uri_ex_c) = 0
% 4.28/1.28  | 
% 4.28/1.28  | ALPHA: (testcase_conclusion_fullish_017_Built_in_Based_Definitions) implies:
% 4.28/1.28  |   (9)  $i(uri_ex_w)
% 4.28/1.28  |   (10)  $i(uri_ex_u)
% 4.28/1.28  |   (11)   ? [v0: int] : ( ~ (v0 = 0) & iext(uri_owl_differentFrom, uri_ex_w,
% 4.28/1.28  |             uri_ex_u) = v0)
% 4.28/1.28  | 
% 4.28/1.28  | ALPHA: (function-axioms) implies:
% 4.28/1.28  |   (12)   ! [v0: MultipleValueBool] :  ! [v1: MultipleValueBool] :  ! [v2: $i]
% 4.28/1.28  |         :  ! [v3: $i] :  ! [v4: $i] : (v1 = v0 |  ~ (iext(v4, v3, v2) = v1) | 
% 4.28/1.28  |           ~ (iext(v4, v3, v2) = v0))
% 4.28/1.28  | 
% 4.28/1.28  | DELTA: instantiating (11) with fresh symbol all_6_0 gives:
% 4.28/1.28  |   (13)   ~ (all_6_0 = 0) & iext(uri_owl_differentFrom, uri_ex_w, uri_ex_u) =
% 4.28/1.28  |         all_6_0
% 4.28/1.28  | 
% 4.28/1.28  | ALPHA: (13) implies:
% 4.28/1.28  |   (14)   ~ (all_6_0 = 0)
% 4.28/1.29  |   (15)  iext(uri_owl_differentFrom, uri_ex_w, uri_ex_u) = all_6_0
% 4.28/1.29  | 
% 4.28/1.29  | GROUND_INST: instantiating (1) with uri_ex_w, uri_ex_u, all_6_0, simplifying
% 4.28/1.29  |              with (9), (10), (15) gives:
% 4.28/1.29  |   (16)  all_6_0 = 0 | uri_ex_u = uri_ex_w
% 4.28/1.29  | 
% 4.28/1.29  | GROUND_INST: instantiating (2) with uri_ex_notInstanceOf, uri_rdf_type,
% 4.28/1.29  |              simplifying with (3), (4), (6) gives:
% 4.28/1.29  |   (17)  ip(uri_rdf_type) = 0 & ip(uri_ex_notInstanceOf) = 0 &  ! [v0: $i] :  !
% 4.28/1.29  |         [v1: $i] : ( ~ (iext(uri_ex_notInstanceOf, v0, v1) = 0) |  ~ $i(v1) | 
% 4.28/1.29  |           ~ $i(v0) |  ? [v2: int] : ( ~ (v2 = 0) & iext(uri_rdf_type, v0, v1)
% 4.28/1.29  |             = v2))
% 4.28/1.29  | 
% 4.28/1.29  | ALPHA: (17) implies:
% 4.28/1.29  |   (18)   ! [v0: $i] :  ! [v1: $i] : ( ~ (iext(uri_ex_notInstanceOf, v0, v1) =
% 4.28/1.29  |             0) |  ~ $i(v1) |  ~ $i(v0) |  ? [v2: int] : ( ~ (v2 = 0) &
% 4.28/1.29  |             iext(uri_rdf_type, v0, v1) = v2))
% 4.28/1.29  | 
% 4.28/1.29  | GROUND_INST: instantiating (18) with uri_ex_u, uri_ex_c, simplifying with (5),
% 4.28/1.29  |              (7), (10) gives:
% 4.28/1.29  |   (19)   ? [v0: int] : ( ~ (v0 = 0) & iext(uri_rdf_type, uri_ex_u, uri_ex_c) =
% 4.28/1.29  |           v0)
% 4.28/1.29  | 
% 4.28/1.29  | DELTA: instantiating (19) with fresh symbol all_15_0 gives:
% 4.28/1.29  |   (20)   ~ (all_15_0 = 0) & iext(uri_rdf_type, uri_ex_u, uri_ex_c) = all_15_0
% 4.28/1.29  | 
% 4.28/1.29  | ALPHA: (20) implies:
% 4.28/1.29  |   (21)   ~ (all_15_0 = 0)
% 4.28/1.29  |   (22)  iext(uri_rdf_type, uri_ex_u, uri_ex_c) = all_15_0
% 4.28/1.29  | 
% 4.28/1.29  | BETA: splitting (16) gives:
% 4.28/1.29  | 
% 4.28/1.29  | Case 1:
% 4.28/1.29  | | 
% 4.28/1.29  | |   (23)  uri_ex_u = uri_ex_w
% 4.28/1.29  | | 
% 4.28/1.29  | | REDUCE: (22), (23) imply:
% 4.28/1.30  | |   (24)  iext(uri_rdf_type, uri_ex_w, uri_ex_c) = all_15_0
% 4.28/1.30  | | 
% 4.28/1.30  | | GROUND_INST: instantiating (12) with 0, all_15_0, uri_ex_c, uri_ex_w,
% 4.28/1.30  | |              uri_rdf_type, simplifying with (8), (24) gives:
% 4.28/1.30  | |   (25)  all_15_0 = 0
% 4.28/1.30  | | 
% 4.28/1.30  | | REDUCE: (21), (25) imply:
% 4.28/1.30  | |   (26)  $false
% 4.28/1.30  | | 
% 4.28/1.30  | | CLOSE: (26) is inconsistent.
% 4.28/1.30  | | 
% 4.28/1.30  | Case 2:
% 4.28/1.30  | | 
% 4.28/1.30  | |   (27)  all_6_0 = 0
% 4.28/1.30  | | 
% 4.28/1.30  | | REDUCE: (14), (27) imply:
% 4.28/1.30  | |   (28)  $false
% 4.28/1.30  | | 
% 4.28/1.30  | | CLOSE: (28) is inconsistent.
% 4.28/1.30  | | 
% 4.28/1.30  | End of split
% 4.28/1.30  | 
% 4.28/1.30  End of proof
% 4.28/1.30  % SZS output end Proof for theBenchmark
% 4.28/1.30  
% 4.28/1.30  795ms
%------------------------------------------------------------------------------