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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : SWB015+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 : n002.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:43 EDT 2023

% Result   : Theorem 2.73s 1.18s
% Output   : Proof 3.35s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SWB015+2 : TPTP v8.1.2. Released v5.2.0.
% 0.11/0.13  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.14/0.34  % Computer : n002.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Sun Aug 27 06:33:03 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 0.21/0.61  ________       _____
% 0.21/0.61  ___  __ \_________(_)________________________________
% 0.21/0.61  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.21/0.61  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.21/0.61  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.21/0.61  
% 0.21/0.61  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.21/0.61  (2023-06-19)
% 0.21/0.61  
% 0.21/0.61  (c) Philipp Rümmer, 2009-2023
% 0.21/0.61  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.21/0.61                Amanda Stjerna.
% 0.21/0.61  Free software under BSD-3-Clause.
% 0.21/0.61  
% 0.21/0.61  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.21/0.61  
% 0.21/0.61  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.21/0.63  Running up to 7 provers in parallel.
% 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 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 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 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 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.97/1.01  Prover 1: Preprocessing ...
% 1.97/1.01  Prover 4: Preprocessing ...
% 1.97/1.06  Prover 6: Preprocessing ...
% 1.97/1.06  Prover 5: Preprocessing ...
% 1.97/1.06  Prover 2: Preprocessing ...
% 1.97/1.06  Prover 3: Preprocessing ...
% 1.97/1.06  Prover 0: Preprocessing ...
% 2.61/1.11  Prover 1: Constructing countermodel ...
% 2.61/1.11  Prover 3: Constructing countermodel ...
% 2.61/1.11  Prover 4: Constructing countermodel ...
% 2.61/1.11  Prover 6: Constructing countermodel ...
% 2.61/1.12  Prover 2: Proving ...
% 2.61/1.12  Prover 5: Proving ...
% 2.73/1.12  Prover 0: Proving ...
% 2.73/1.18  Prover 6: proved (534ms)
% 2.73/1.18  
% 2.73/1.18  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.73/1.18  
% 2.73/1.19  Prover 3: proved (549ms)
% 2.73/1.19  
% 2.73/1.19  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.73/1.19  
% 2.73/1.19  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 2.73/1.19  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 2.73/1.19  Prover 2: proved (553ms)
% 2.73/1.19  
% 2.73/1.19  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.73/1.19  
% 2.73/1.19  Prover 5: proved (546ms)
% 2.73/1.19  
% 2.73/1.19  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.73/1.19  
% 2.73/1.19  Prover 0: proved (557ms)
% 2.73/1.19  
% 2.73/1.19  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.73/1.19  
% 2.73/1.20  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 2.73/1.20  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 2.73/1.20  Prover 4: Found proof (size 7)
% 2.73/1.20  Prover 4: proved (558ms)
% 2.73/1.20  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 2.73/1.20  Prover 1: Found proof (size 7)
% 2.73/1.20  Prover 1: proved (565ms)
% 2.73/1.20  Prover 7: Preprocessing ...
% 2.73/1.20  Prover 11: Preprocessing ...
% 2.73/1.20  Prover 10: Preprocessing ...
% 2.73/1.20  Prover 8: Preprocessing ...
% 2.73/1.21  Prover 7: Warning: ignoring some quantifiers
% 2.73/1.21  Prover 7: Constructing countermodel ...
% 2.73/1.21  Prover 10: Warning: ignoring some quantifiers
% 2.73/1.21  Prover 10: Constructing countermodel ...
% 3.35/1.21  Prover 13: Preprocessing ...
% 3.35/1.22  Prover 10: stopped
% 3.35/1.22  Prover 11: Constructing countermodel ...
% 3.35/1.22  Prover 7: stopped
% 3.35/1.22  Prover 13: Warning: ignoring some quantifiers
% 3.35/1.22  Prover 11: stopped
% 3.35/1.22  Prover 13: Constructing countermodel ...
% 3.35/1.23  Prover 8: Warning: ignoring some quantifiers
% 3.35/1.23  Prover 13: stopped
% 3.35/1.23  Prover 8: Constructing countermodel ...
% 3.35/1.23  Prover 8: stopped
% 3.35/1.23  
% 3.35/1.23  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.35/1.23  
% 3.35/1.24  % SZS output start Proof for theBenchmark
% 3.35/1.24  Assumptions after simplification:
% 3.35/1.24  ---------------------------------
% 3.35/1.24  
% 3.35/1.24    (owl_eqdis_sameas)
% 3.35/1.28    $i(uri_owl_sameAs) &  ! [v0: $i] :  ! [v1: $i] : (v1 = v0 |  ~
% 3.35/1.28      (iext(uri_owl_sameAs, v0, v1) = 0) |  ~ $i(v1) |  ~ $i(v0)) &  ! [v0: $i] : 
% 3.35/1.28    ! [v1: int] : (v1 = 0 |  ~ (iext(uri_owl_sameAs, v0, v0) = v1) |  ~ $i(v0))
% 3.35/1.28  
% 3.35/1.28    (testcase_conclusion_fullish_015_Reflective_Tautologies_I)
% 3.35/1.29    $i(uri_owl_sameAs) &  ? [v0: int] : ( ~ (v0 = 0) & iext(uri_owl_sameAs,
% 3.35/1.29        uri_owl_sameAs, uri_owl_sameAs) = v0)
% 3.35/1.29  
% 3.35/1.29  Those formulas are unsatisfiable:
% 3.35/1.29  ---------------------------------
% 3.35/1.29  
% 3.35/1.29  Begin of proof
% 3.35/1.29  | 
% 3.35/1.29  | ALPHA: (owl_eqdis_sameas) implies:
% 3.35/1.29  |   (1)   ! [v0: $i] :  ! [v1: int] : (v1 = 0 |  ~ (iext(uri_owl_sameAs, v0, v0)
% 3.35/1.29  |            = v1) |  ~ $i(v0))
% 3.35/1.29  | 
% 3.35/1.29  | ALPHA: (testcase_conclusion_fullish_015_Reflective_Tautologies_I) implies:
% 3.35/1.29  |   (2)  $i(uri_owl_sameAs)
% 3.35/1.29  |   (3)   ? [v0: int] : ( ~ (v0 = 0) & iext(uri_owl_sameAs, uri_owl_sameAs,
% 3.35/1.29  |            uri_owl_sameAs) = v0)
% 3.35/1.29  | 
% 3.35/1.29  | DELTA: instantiating (3) with fresh symbol all_5_0 gives:
% 3.35/1.29  |   (4)   ~ (all_5_0 = 0) & iext(uri_owl_sameAs, uri_owl_sameAs, uri_owl_sameAs)
% 3.35/1.29  |        = all_5_0
% 3.35/1.29  | 
% 3.35/1.29  | ALPHA: (4) implies:
% 3.35/1.29  |   (5)   ~ (all_5_0 = 0)
% 3.35/1.29  |   (6)  iext(uri_owl_sameAs, uri_owl_sameAs, uri_owl_sameAs) = all_5_0
% 3.35/1.29  | 
% 3.35/1.30  | GROUND_INST: instantiating (1) with uri_owl_sameAs, all_5_0, simplifying with
% 3.35/1.30  |              (2), (6) gives:
% 3.35/1.30  |   (7)  all_5_0 = 0
% 3.35/1.30  | 
% 3.35/1.30  | REDUCE: (5), (7) imply:
% 3.35/1.30  |   (8)  $false
% 3.35/1.30  | 
% 3.35/1.30  | CLOSE: (8) is inconsistent.
% 3.35/1.30  | 
% 3.35/1.30  End of proof
% 3.35/1.30  % SZS output end Proof for theBenchmark
% 3.35/1.30  
% 3.35/1.30  683ms
%------------------------------------------------------------------------------