TSTP Solution File: SWB007+2 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SWB007+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 : n018.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:37 EDT 2023
% Result : Theorem 3.42s 1.33s
% Output : Proof 4.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWB007+2 : TPTP v8.1.2. Released v5.2.0.
% 0.00/0.12 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sun Aug 27 06:40:45 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.63 ________ _____
% 0.19/0.63 ___ __ \_________(_)________________________________
% 0.19/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.19/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.19/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.19/0.63
% 0.19/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.19/0.63 (2023-06-19)
% 0.19/0.63
% 0.19/0.63 (c) Philipp Rümmer, 2009-2023
% 0.19/0.63 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.19/0.63 Amanda Stjerna.
% 0.19/0.63 Free software under BSD-3-Clause.
% 0.19/0.63
% 0.19/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.19/0.63
% 0.19/0.63 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.19/0.64 Running up to 7 provers in parallel.
% 0.19/0.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.19/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.19/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.19/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.19/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.19/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.19/0.66 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 1.57/1.03 Prover 1: Preprocessing ...
% 1.57/1.03 Prover 4: Preprocessing ...
% 2.14/1.09 Prover 6: Preprocessing ...
% 2.14/1.09 Prover 0: Preprocessing ...
% 2.14/1.09 Prover 3: Preprocessing ...
% 2.14/1.09 Prover 2: Preprocessing ...
% 2.14/1.09 Prover 5: Preprocessing ...
% 2.64/1.19 Prover 1: Constructing countermodel ...
% 2.64/1.19 Prover 4: Constructing countermodel ...
% 2.64/1.20 Prover 2: Proving ...
% 2.64/1.20 Prover 3: Constructing countermodel ...
% 2.64/1.20 Prover 5: Proving ...
% 2.64/1.21 Prover 6: Constructing countermodel ...
% 3.11/1.22 Prover 0: Proving ...
% 3.42/1.32 Prover 6: proved (659ms)
% 3.42/1.32
% 3.42/1.33 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.42/1.33
% 3.42/1.33 Prover 2: proved (668ms)
% 3.42/1.33 Prover 0: proved (676ms)
% 3.42/1.33
% 3.42/1.33 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.42/1.33
% 3.42/1.33
% 3.42/1.33 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.42/1.33
% 3.42/1.33 Prover 5: proved (668ms)
% 3.42/1.33
% 3.42/1.33 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.42/1.33
% 3.42/1.33 Prover 3: proved (673ms)
% 3.42/1.33
% 3.42/1.33 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.42/1.33
% 3.96/1.35 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 3.96/1.35 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 3.96/1.35 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 3.96/1.35 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 3.96/1.35 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 3.96/1.36 Prover 8: Preprocessing ...
% 3.96/1.36 Prover 10: Preprocessing ...
% 3.96/1.36 Prover 7: Preprocessing ...
% 3.96/1.36 Prover 11: Preprocessing ...
% 3.96/1.37 Prover 13: Preprocessing ...
% 3.96/1.40 Prover 7: Warning: ignoring some quantifiers
% 3.96/1.40 Prover 7: Constructing countermodel ...
% 3.96/1.41 Prover 13: Warning: ignoring some quantifiers
% 3.96/1.41 Prover 13: Constructing countermodel ...
% 3.96/1.41 Prover 10: Warning: ignoring some quantifiers
% 3.96/1.41 Prover 10: Constructing countermodel ...
% 3.96/1.42 Prover 4: Found proof (size 20)
% 3.96/1.42 Prover 4: proved (760ms)
% 3.96/1.42 Prover 7: stopped
% 3.96/1.42 Prover 10: stopped
% 3.96/1.42 Prover 1: Found proof (size 20)
% 3.96/1.42 Prover 1: proved (768ms)
% 3.96/1.42 Prover 13: stopped
% 3.96/1.43 Prover 11: Constructing countermodel ...
% 3.96/1.43 Prover 8: Warning: ignoring some quantifiers
% 3.96/1.43 Prover 11: stopped
% 3.96/1.43 Prover 8: Constructing countermodel ...
% 3.96/1.45 Prover 8: stopped
% 3.96/1.45
% 3.96/1.45 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.96/1.45
% 3.96/1.45 % SZS output start Proof for theBenchmark
% 3.96/1.46 Assumptions after simplification:
% 3.96/1.46 ---------------------------------
% 3.96/1.46
% 3.96/1.46 (owl_eqdis_sameas)
% 3.96/1.51 $i(uri_owl_sameAs) & ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~
% 3.96/1.51 (iext(uri_owl_sameAs, v0, v1) = 0) | ~ $i(v1) | ~ $i(v0)) & ! [v0: $i] :
% 3.96/1.51 ! [v1: int] : (v1 = 0 | ~ (iext(uri_owl_sameAs, v0, v0) = v1) | ~ $i(v0))
% 3.96/1.51
% 3.96/1.51 (testcase_conclusion_fullish_007_Equal_Classes)
% 3.96/1.51 $i(uri_ex_p) & $i(uri_rdfs_range) & $i(uri_ex_c) & $i(uri_rdfs_subClassOf) &
% 3.96/1.51 $i(uri_ex_c2) & $i(uri_ex_w) & $i(uri_rdf_type) & ? [v0: any] : ? [v1: any]
% 3.96/1.51 : ? [v2: any] : (iext(uri_rdfs_range, uri_ex_p, uri_ex_c2) = v2 &
% 3.96/1.51 iext(uri_rdfs_subClassOf, uri_ex_c, uri_ex_c2) = v1 & iext(uri_rdf_type,
% 3.96/1.51 uri_ex_w, uri_ex_c2) = v0 & ( ~ (v2 = 0) | ~ (v1 = 0) | ~ (v0 = 0)))
% 3.96/1.51
% 3.96/1.51 (testcase_premise_fullish_007_Equal_Classes)
% 3.96/1.52 iext(uri_rdfs_range, uri_ex_p, uri_ex_c1) = 0 & iext(uri_rdfs_subClassOf,
% 3.96/1.52 uri_ex_c, uri_ex_c1) = 0 & iext(uri_rdf_type, uri_ex_w, uri_ex_c1) = 0 &
% 3.96/1.52 iext(uri_owl_sameAs, uri_ex_c1, uri_ex_c2) = 0 & $i(uri_ex_c1) & $i(uri_ex_p)
% 3.96/1.52 & $i(uri_rdfs_range) & $i(uri_ex_c) & $i(uri_rdfs_subClassOf) & $i(uri_ex_c2)
% 3.96/1.52 & $i(uri_ex_w) & $i(uri_rdf_type) & $i(uri_owl_sameAs)
% 3.96/1.52
% 3.96/1.52 (function-axioms)
% 3.96/1.52 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : !
% 3.96/1.52 [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (iext(v4, v3, v2) = v1) | ~ (iext(v4,
% 3.96/1.52 v3, v2) = v0))
% 3.96/1.52
% 3.96/1.52 Those formulas are unsatisfiable:
% 3.96/1.52 ---------------------------------
% 3.96/1.52
% 3.96/1.52 Begin of proof
% 3.96/1.52 |
% 3.96/1.52 | ALPHA: (owl_eqdis_sameas) implies:
% 3.96/1.53 | (1) ! [v0: $i] : ! [v1: $i] : (v1 = v0 | ~ (iext(uri_owl_sameAs, v0, v1)
% 3.96/1.53 | = 0) | ~ $i(v1) | ~ $i(v0))
% 3.96/1.53 |
% 4.43/1.53 | ALPHA: (testcase_premise_fullish_007_Equal_Classes) implies:
% 4.43/1.53 | (2) $i(uri_ex_c1)
% 4.43/1.53 | (3) iext(uri_owl_sameAs, uri_ex_c1, uri_ex_c2) = 0
% 4.43/1.53 | (4) iext(uri_rdf_type, uri_ex_w, uri_ex_c1) = 0
% 4.43/1.53 | (5) iext(uri_rdfs_subClassOf, uri_ex_c, uri_ex_c1) = 0
% 4.43/1.53 | (6) iext(uri_rdfs_range, uri_ex_p, uri_ex_c1) = 0
% 4.43/1.53 |
% 4.43/1.53 | ALPHA: (testcase_conclusion_fullish_007_Equal_Classes) implies:
% 4.43/1.53 | (7) $i(uri_ex_c2)
% 4.43/1.53 | (8) ? [v0: any] : ? [v1: any] : ? [v2: any] : (iext(uri_rdfs_range,
% 4.43/1.53 | uri_ex_p, uri_ex_c2) = v2 & iext(uri_rdfs_subClassOf, uri_ex_c,
% 4.43/1.54 | uri_ex_c2) = v1 & iext(uri_rdf_type, uri_ex_w, uri_ex_c2) = v0 & (
% 4.43/1.54 | ~ (v2 = 0) | ~ (v1 = 0) | ~ (v0 = 0)))
% 4.43/1.54 |
% 4.43/1.54 | DELTA: instantiating (8) with fresh symbols all_5_0, all_5_1, all_5_2 gives:
% 4.43/1.54 | (9) iext(uri_rdfs_range, uri_ex_p, uri_ex_c2) = all_5_0 &
% 4.43/1.54 | iext(uri_rdfs_subClassOf, uri_ex_c, uri_ex_c2) = all_5_1 &
% 4.43/1.54 | iext(uri_rdf_type, uri_ex_w, uri_ex_c2) = all_5_2 & ( ~ (all_5_0 = 0) |
% 4.43/1.54 | ~ (all_5_1 = 0) | ~ (all_5_2 = 0))
% 4.43/1.54 |
% 4.43/1.54 | ALPHA: (9) implies:
% 4.43/1.54 | (10) iext(uri_rdf_type, uri_ex_w, uri_ex_c2) = all_5_2
% 4.43/1.54 | (11) iext(uri_rdfs_subClassOf, uri_ex_c, uri_ex_c2) = all_5_1
% 4.43/1.54 | (12) iext(uri_rdfs_range, uri_ex_p, uri_ex_c2) = all_5_0
% 4.43/1.54 | (13) ~ (all_5_0 = 0) | ~ (all_5_1 = 0) | ~ (all_5_2 = 0)
% 4.43/1.54 |
% 4.43/1.54 | GROUND_INST: instantiating (1) with uri_ex_c1, uri_ex_c2, simplifying with
% 4.43/1.54 | (2), (3), (7) gives:
% 4.43/1.55 | (14) uri_ex_c1 = uri_ex_c2
% 4.43/1.55 |
% 4.43/1.55 | REDUCE: (6), (14) imply:
% 4.43/1.55 | (15) iext(uri_rdfs_range, uri_ex_p, uri_ex_c2) = 0
% 4.43/1.55 |
% 4.43/1.55 | REDUCE: (5), (14) imply:
% 4.43/1.55 | (16) iext(uri_rdfs_subClassOf, uri_ex_c, uri_ex_c2) = 0
% 4.43/1.55 |
% 4.43/1.55 | REDUCE: (4), (14) imply:
% 4.43/1.55 | (17) iext(uri_rdf_type, uri_ex_w, uri_ex_c2) = 0
% 4.43/1.55 |
% 4.43/1.55 | GROUND_INST: instantiating (function-axioms) with all_5_2, 0, uri_ex_c2,
% 4.43/1.55 | uri_ex_w, uri_rdf_type, simplifying with (10), (17) gives:
% 4.43/1.55 | (18) all_5_2 = 0
% 4.43/1.55 |
% 4.43/1.55 | GROUND_INST: instantiating (function-axioms) with all_5_1, 0, uri_ex_c2,
% 4.43/1.55 | uri_ex_c, uri_rdfs_subClassOf, simplifying with (11), (16) gives:
% 4.43/1.55 | (19) all_5_1 = 0
% 4.43/1.55 |
% 4.43/1.55 | GROUND_INST: instantiating (function-axioms) with all_5_0, 0, uri_ex_c2,
% 4.43/1.55 | uri_ex_p, uri_rdfs_range, simplifying with (12), (15) gives:
% 4.43/1.55 | (20) all_5_0 = 0
% 4.43/1.55 |
% 4.43/1.55 | BETA: splitting (13) gives:
% 4.43/1.55 |
% 4.43/1.55 | Case 1:
% 4.43/1.55 | |
% 4.43/1.55 | | (21) ~ (all_5_0 = 0)
% 4.43/1.55 | |
% 4.43/1.55 | | REDUCE: (20), (21) imply:
% 4.43/1.55 | | (22) $false
% 4.43/1.55 | |
% 4.43/1.55 | | CLOSE: (22) is inconsistent.
% 4.43/1.55 | |
% 4.43/1.55 | Case 2:
% 4.43/1.55 | |
% 4.43/1.55 | | (23) ~ (all_5_1 = 0) | ~ (all_5_2 = 0)
% 4.43/1.55 | |
% 4.43/1.55 | | BETA: splitting (23) gives:
% 4.43/1.55 | |
% 4.43/1.55 | | Case 1:
% 4.43/1.55 | | |
% 4.43/1.55 | | | (24) ~ (all_5_1 = 0)
% 4.43/1.55 | | |
% 4.43/1.55 | | | REDUCE: (19), (24) imply:
% 4.43/1.56 | | | (25) $false
% 4.43/1.56 | | |
% 4.43/1.56 | | | CLOSE: (25) is inconsistent.
% 4.43/1.56 | | |
% 4.43/1.56 | | Case 2:
% 4.43/1.56 | | |
% 4.43/1.56 | | | (26) ~ (all_5_2 = 0)
% 4.43/1.56 | | |
% 4.43/1.56 | | | REDUCE: (18), (26) imply:
% 4.43/1.56 | | | (27) $false
% 4.43/1.56 | | |
% 4.43/1.56 | | | CLOSE: (27) is inconsistent.
% 4.43/1.56 | | |
% 4.43/1.56 | | End of split
% 4.43/1.56 | |
% 4.43/1.56 | End of split
% 4.43/1.56 |
% 4.43/1.56 End of proof
% 4.43/1.56 % SZS output end Proof for theBenchmark
% 4.43/1.56
% 4.43/1.56 927ms
%------------------------------------------------------------------------------