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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : SWB001+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:31 EDT 2023

% Result   : Theorem 2.08s 0.92s
% Output   : Proof 2.61s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : SWB001+2 : TPTP v8.1.2. Released v5.2.0.
% 0.00/0.11  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.11/0.30  % Computer : n032.cluster.edu
% 0.11/0.30  % Model    : x86_64 x86_64
% 0.11/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30  % Memory   : 8042.1875MB
% 0.11/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30  % CPULimit : 300
% 0.11/0.30  % WCLimit  : 300
% 0.11/0.30  % DateTime : Sun Aug 27 07:00:59 EDT 2023
% 0.11/0.31  % CPUTime  : 
% 0.16/0.53  ________       _____
% 0.16/0.53  ___  __ \_________(_)________________________________
% 0.16/0.53  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.16/0.53  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.16/0.53  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.16/0.53  
% 0.16/0.53  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.16/0.53  (2023-06-19)
% 0.16/0.53  
% 0.16/0.53  (c) Philipp Rümmer, 2009-2023
% 0.16/0.53  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.16/0.53                Amanda Stjerna.
% 0.16/0.53  Free software under BSD-3-Clause.
% 0.16/0.53  
% 0.16/0.53  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.16/0.53  
% 0.16/0.53  Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.16/0.54  Running up to 7 provers in parallel.
% 0.16/0.55  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.16/0.55  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.16/0.55  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.16/0.55  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.16/0.55  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.16/0.55  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.16/0.55  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 0.80/0.81  Prover 1: Preprocessing ...
% 0.80/0.82  Prover 4: Preprocessing ...
% 1.62/0.86  Prover 3: Preprocessing ...
% 1.62/0.86  Prover 0: Preprocessing ...
% 1.62/0.86  Prover 2: Preprocessing ...
% 1.62/0.86  Prover 6: Preprocessing ...
% 1.62/0.86  Prover 5: Preprocessing ...
% 1.62/0.89  Prover 5: Constructing countermodel ...
% 1.62/0.89  Prover 6: Constructing countermodel ...
% 1.62/0.89  Prover 0: Constructing countermodel ...
% 1.62/0.89  Prover 3: Constructing countermodel ...
% 1.62/0.89  Prover 2: Constructing countermodel ...
% 1.62/0.89  Prover 4: Constructing countermodel ...
% 1.62/0.89  Prover 1: Constructing countermodel ...
% 2.08/0.92  Prover 3: proved (369ms)
% 2.08/0.92  Prover 0: proved (373ms)
% 2.08/0.92  Prover 6: proved (367ms)
% 2.08/0.92  
% 2.08/0.92  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.08/0.92  
% 2.08/0.92  
% 2.08/0.92  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.08/0.92  
% 2.08/0.92  
% 2.08/0.92  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.08/0.92  
% 2.08/0.92  Prover 2: proved (372ms)
% 2.08/0.92  
% 2.08/0.92  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.08/0.92  
% 2.08/0.94  Prover 5: proved (369ms)
% 2.08/0.94  
% 2.08/0.94  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.08/0.94  
% 2.08/0.95  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 2.08/0.95  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 2.08/0.95  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 2.08/0.95  Prover 8: Preprocessing ...
% 2.08/0.95  Prover 7: Preprocessing ...
% 2.08/0.95  Prover 10: Preprocessing ...
% 2.08/0.95  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 2.08/0.95  Prover 10: Constructing countermodel ...
% 2.08/0.95  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 2.08/0.95  Prover 7: Constructing countermodel ...
% 2.08/0.96  Prover 13: Preprocessing ...
% 2.08/0.96  Prover 11: Preprocessing ...
% 2.08/0.97  Prover 8: Constructing countermodel ...
% 2.08/0.97  Prover 13: Constructing countermodel ...
% 2.08/0.98  Prover 11: Constructing countermodel ...
% 2.61/1.01  Prover 7: Found proof (size 7)
% 2.61/1.01  Prover 13: Found proof (size 7)
% 2.61/1.01  Prover 13: proved (59ms)
% 2.61/1.01  Prover 7: proved (83ms)
% 2.61/1.01  Prover 11: stopped
% 2.61/1.01  Prover 8: stopped
% 2.61/1.01  Prover 1: stopped
% 2.61/1.01  Prover 4: stopped
% 2.61/1.01  Prover 10: Found proof (size 7)
% 2.61/1.01  Prover 10: proved (82ms)
% 2.61/1.01  
% 2.61/1.01  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.61/1.01  
% 2.61/1.01  % SZS output start Proof for theBenchmark
% 2.61/1.01  Assumptions after simplification:
% 2.61/1.01  ---------------------------------
% 2.61/1.01  
% 2.61/1.01    (testcase_conclusion_fullish_001_Subgraph_Entailment)
% 2.61/1.02    $i(uri_ex_p) & $i(uri_owl_onProperty) & $i(uri_owl_Restriction) & $i(uri_ex_r)
% 2.61/1.02    & $i(uri_rdf_type) & ( ~ iext(uri_owl_onProperty, uri_ex_r, uri_ex_p) |  ~
% 2.61/1.02      iext(uri_rdf_type, uri_ex_r, uri_owl_Restriction))
% 2.61/1.02  
% 2.61/1.02    (testcase_premise_fullish_001_Subgraph_Entailment)
% 2.61/1.02    $i(uri_ex_d) & $i(uri_owl_someValuesFrom) & $i(uri_ex_c) &
% 2.61/1.02    $i(uri_rdfs_subClassOf) & $i(uri_ex_p) & $i(uri_owl_onProperty) &
% 2.61/1.02    $i(uri_owl_Restriction) & $i(uri_ex_r) & $i(uri_rdf_type) &
% 2.61/1.02    iext(uri_owl_someValuesFrom, uri_ex_r, uri_ex_d) & iext(uri_rdfs_subClassOf,
% 2.61/1.02      uri_ex_c, uri_ex_r) & iext(uri_owl_onProperty, uri_ex_r, uri_ex_p) &
% 2.61/1.02    iext(uri_rdf_type, uri_ex_r, uri_owl_Restriction)
% 2.61/1.03  
% 2.61/1.03  Those formulas are unsatisfiable:
% 2.61/1.03  ---------------------------------
% 2.61/1.03  
% 2.61/1.03  Begin of proof
% 2.61/1.03  | 
% 2.61/1.03  | ALPHA: (testcase_conclusion_fullish_001_Subgraph_Entailment) implies:
% 2.61/1.03  |   (1)   ~ iext(uri_owl_onProperty, uri_ex_r, uri_ex_p) |  ~ iext(uri_rdf_type,
% 2.61/1.03  |          uri_ex_r, uri_owl_Restriction)
% 2.61/1.03  | 
% 2.61/1.03  | ALPHA: (testcase_premise_fullish_001_Subgraph_Entailment) implies:
% 2.61/1.03  |   (2)  iext(uri_rdf_type, uri_ex_r, uri_owl_Restriction)
% 2.61/1.03  |   (3)  iext(uri_owl_onProperty, uri_ex_r, uri_ex_p)
% 2.61/1.03  | 
% 2.61/1.03  | BETA: splitting (1) gives:
% 2.61/1.03  | 
% 2.61/1.03  | Case 1:
% 2.61/1.03  | | 
% 2.61/1.03  | |   (4)   ~ iext(uri_owl_onProperty, uri_ex_r, uri_ex_p)
% 2.61/1.03  | | 
% 2.61/1.03  | | PRED_UNIFY: (3), (4) imply:
% 2.61/1.03  | |   (5)  $false
% 2.61/1.03  | | 
% 2.61/1.03  | | CLOSE: (5) is inconsistent.
% 2.61/1.03  | | 
% 2.61/1.03  | Case 2:
% 2.61/1.03  | | 
% 2.61/1.03  | |   (6)   ~ iext(uri_rdf_type, uri_ex_r, uri_owl_Restriction)
% 2.61/1.03  | | 
% 2.61/1.03  | | PRED_UNIFY: (2), (6) imply:
% 2.61/1.03  | |   (7)  $false
% 2.61/1.03  | | 
% 2.61/1.03  | | CLOSE: (7) is inconsistent.
% 2.61/1.03  | | 
% 2.61/1.03  | End of split
% 2.61/1.03  | 
% 2.61/1.03  End of proof
% 2.61/1.04  % SZS output end Proof for theBenchmark
% 2.61/1.04  
% 2.61/1.04  506ms
%------------------------------------------------------------------------------