TSTP Solution File: SWB003+3 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SWB003+3 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp
% Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% Computer : n031.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:33 EDT 2023
% Result : Theorem 14.67s 2.74s
% Output : Proof 21.28s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.14 % Problem : SWB003+3 : TPTP v8.1.2. Released v5.2.0.
% 0.10/0.15 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.15/0.36 % Computer : n031.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sun Aug 27 06:54:39 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.21/0.63 ________ _____
% 0.21/0.63 ___ __ \_________(_)________________________________
% 0.21/0.63 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.21/0.63 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.21/0.63 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.21/0.63
% 0.21/0.63 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.21/0.63 (2023-06-19)
% 0.21/0.63
% 0.21/0.63 (c) Philipp Rümmer, 2009-2023
% 0.21/0.63 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.21/0.63 Amanda Stjerna.
% 0.21/0.63 Free software under BSD-3-Clause.
% 0.21/0.63
% 0.21/0.63 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.21/0.63
% 0.21/0.63 Loading /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 0.21/0.64 Running up to 7 provers in parallel.
% 0.21/0.66 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.21/0.66 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.21/0.66 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.21/0.66 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.21/0.66 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.21/0.66 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.21/0.67 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 4.05/1.32 Prover 1: Preprocessing ...
% 4.05/1.32 Prover 4: Preprocessing ...
% 4.05/1.35 Prover 5: Preprocessing ...
% 4.05/1.35 Prover 0: Preprocessing ...
% 4.05/1.35 Prover 2: Preprocessing ...
% 4.05/1.35 Prover 3: Preprocessing ...
% 4.05/1.35 Prover 6: Preprocessing ...
% 8.85/2.04 Prover 5: Proving ...
% 8.85/2.05 Prover 2: Proving ...
% 11.95/2.38 Prover 6: Proving ...
% 11.95/2.39 Prover 3: Constructing countermodel ...
% 12.24/2.40 Prover 1: Constructing countermodel ...
% 14.67/2.73 Prover 3: proved (2071ms)
% 14.67/2.73
% 14.67/2.74 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 14.67/2.74
% 14.67/2.74 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 14.67/2.74 Prover 6: stopped
% 14.67/2.74 Prover 5: stopped
% 14.67/2.75 Prover 2: stopped
% 14.67/2.76 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 14.67/2.76 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 15.08/2.77 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 15.71/2.91 Prover 10: Preprocessing ...
% 16.38/2.94 Prover 11: Preprocessing ...
% 16.38/2.95 Prover 8: Preprocessing ...
% 16.38/2.96 Prover 7: Preprocessing ...
% 16.67/2.99 Prover 1: Found proof (size 6)
% 16.67/2.99 Prover 1: proved (2343ms)
% 16.67/3.00 Prover 10: stopped
% 16.67/3.03 Prover 7: stopped
% 17.88/3.20 Prover 11: stopped
% 18.51/3.23 Prover 8: Warning: ignoring some quantifiers
% 18.51/3.24 Prover 8: Constructing countermodel ...
% 18.51/3.27 Prover 8: stopped
% 19.64/3.47 Prover 4: Constructing countermodel ...
% 19.64/3.50 Prover 4: stopped
% 20.95/3.76 Prover 0: Proving ...
% 20.95/3.77 Prover 0: stopped
% 20.95/3.77
% 20.95/3.77 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 20.95/3.77
% 20.95/3.78 % SZS output start Proof for theBenchmark
% 20.95/3.79 Assumptions after simplification:
% 20.95/3.79 ---------------------------------
% 20.95/3.79
% 20.95/3.79 (testcase_conclusion_fullish_003_Blank_Nodes_for_Literals)
% 21.28/3.84 $i(uri_ex_s) & $i(uri_ex_p) & ! [v0: $i] : ( ~ (iext(uri_ex_p, uri_ex_s, v0)
% 21.28/3.84 = 0) | ~ $i(v0))
% 21.28/3.84
% 21.28/3.84 (testcase_premise_fullish_003_Blank_Nodes_for_Literals)
% 21.28/3.84 $i(dat_str_foo) & $i(uri_ex_s) & $i(uri_ex_p) & ? [v0: $i] :
% 21.28/3.84 (literal_plain(dat_str_foo) = v0 & iext(uri_ex_p, uri_ex_s, v0) = 0 & $i(v0))
% 21.28/3.84
% 21.28/3.84 Further assumptions not needed in the proof:
% 21.28/3.84 --------------------------------------------
% 21.28/3.84 owl_bool_complementof_class, owl_bool_intersectionof_class_000,
% 21.28/3.84 owl_bool_intersectionof_class_001, owl_bool_intersectionof_class_002,
% 21.28/3.84 owl_bool_intersectionof_class_003, owl_bool_unionof_class_000,
% 21.28/3.84 owl_bool_unionof_class_001, owl_bool_unionof_class_002,
% 21.28/3.84 owl_bool_unionof_class_003, owl_class_nothing_ext, owl_class_nothing_type,
% 21.28/3.84 owl_class_thing_ext, owl_class_thing_type, owl_parts_ic_cond_inst,
% 21.28/3.84 owl_parts_ic_cond_set, owl_parts_ic_def, owl_parts_idc_cond_inst,
% 21.28/3.84 owl_parts_idc_cond_set, owl_parts_idc_def, owl_parts_ioap_cond_inst,
% 21.28/3.84 owl_parts_ioap_cond_set, owl_parts_ioap_def, owl_parts_iodp_cond_inst,
% 21.28/3.84 owl_parts_iodp_cond_set, owl_parts_iodp_def, owl_parts_ioxp_cond_inst,
% 21.28/3.84 owl_parts_ioxp_cond_set, owl_parts_ioxp_def, owl_parts_ip_cond_inst,
% 21.28/3.84 owl_parts_ip_cond_set, owl_parts_ip_def, owl_parts_ir_cond_set,
% 21.28/3.84 owl_parts_ir_def, owl_parts_ix_cond_set, owl_parts_ix_def,
% 21.28/3.84 owl_parts_lv_cond_set, owl_parts_lv_def, owl_prop_allvaluesfrom_ext,
% 21.28/3.84 owl_prop_allvaluesfrom_type, owl_prop_complementof_ext,
% 21.28/3.84 owl_prop_complementof_type, owl_prop_hasvalue_ext, owl_prop_hasvalue_type,
% 21.28/3.84 owl_prop_intersectionof_ext, owl_prop_intersectionof_type,
% 21.28/3.84 owl_prop_onproperty_ext, owl_prop_onproperty_type, owl_prop_somevaluesfrom_ext,
% 21.28/3.84 owl_prop_somevaluesfrom_type, owl_prop_unionof_ext, owl_prop_unionof_type,
% 21.28/3.84 owl_rdfsext_domain, owl_rdfsext_range, owl_rdfsext_subclassof,
% 21.28/3.84 owl_rdfsext_subpropertyof, owl_restrict_allvaluesfrom, owl_restrict_hasvalue,
% 21.28/3.84 owl_restrict_somevaluesfrom, rdf_collection_first_type, rdf_collection_nil_type,
% 21.28/3.84 rdf_collection_rest_type, rdf_container_n_type_001, rdf_container_n_type_002,
% 21.28/3.84 rdf_container_n_type_003, rdf_reification_object_type,
% 21.28/3.84 rdf_reification_predicate_type, rdf_reification_subject_type, rdf_type_ip,
% 21.28/3.84 rdf_type_type, rdf_value_type, rdfs_annotation_comment_domain,
% 21.28/3.84 rdfs_annotation_comment_range, rdfs_annotation_isdefinedby_domain,
% 21.28/3.84 rdfs_annotation_isdefinedby_range, rdfs_annotation_isdefinedby_sub,
% 21.28/3.85 rdfs_annotation_label_domain, rdfs_annotation_label_range,
% 21.28/3.85 rdfs_annotation_seealso_domain, rdfs_annotation_seealso_range, rdfs_cext_def,
% 21.28/3.85 rdfs_class_instsub_resource, rdfs_collection_first_domain,
% 21.28/3.85 rdfs_collection_first_range, rdfs_collection_rest_domain,
% 21.28/3.85 rdfs_collection_rest_range, rdfs_container_alt_sub, rdfs_container_bag_sub,
% 21.28/3.85 rdfs_container_containermembershipproperty_instsub_member,
% 21.28/3.85 rdfs_container_containermembershipproperty_sub, rdfs_container_member_domain,
% 21.28/3.85 rdfs_container_member_range, rdfs_container_n_domain_001,
% 21.28/3.85 rdfs_container_n_domain_002, rdfs_container_n_domain_003,
% 21.28/3.85 rdfs_container_n_range_001, rdfs_container_n_range_002,
% 21.28/3.85 rdfs_container_n_range_003, rdfs_container_n_type_001,
% 21.28/3.85 rdfs_container_n_type_002, rdfs_container_n_type_003, rdfs_container_seq_sub,
% 21.28/3.85 rdfs_dat_xmlliteral_sub, rdfs_dat_xmlliteral_type,
% 21.28/3.85 rdfs_datatype_instsub_literal, rdfs_datatype_sub, rdfs_domain_domain,
% 21.28/3.85 rdfs_domain_main, rdfs_domain_range, rdfs_ic_def, rdfs_ir_def, rdfs_lv_def,
% 21.28/3.85 rdfs_property_type, rdfs_range_domain, rdfs_range_main, rdfs_range_range,
% 21.28/3.85 rdfs_reification_object_domain, rdfs_reification_object_range,
% 21.28/3.85 rdfs_reification_predicate_domain, rdfs_reification_predicate_range,
% 21.28/3.85 rdfs_reification_subject_domain, rdfs_reification_subject_range,
% 21.28/3.85 rdfs_subclassof_domain, rdfs_subclassof_main, rdfs_subclassof_range,
% 21.28/3.85 rdfs_subclassof_reflex, rdfs_subclassof_trans, rdfs_subpropertyof_domain,
% 21.28/3.85 rdfs_subpropertyof_main, rdfs_subpropertyof_range, rdfs_subpropertyof_reflex,
% 21.28/3.85 rdfs_subpropertyof_trans, rdfs_type_domain, rdfs_type_range, rdfs_value_domain,
% 21.28/3.85 rdfs_value_range, simple_iext_property, simple_ir, simple_lv
% 21.28/3.85
% 21.28/3.85 Those formulas are unsatisfiable:
% 21.28/3.85 ---------------------------------
% 21.28/3.85
% 21.28/3.85 Begin of proof
% 21.28/3.85 |
% 21.28/3.85 | ALPHA: (testcase_premise_fullish_003_Blank_Nodes_for_Literals) implies:
% 21.28/3.85 | (1) ? [v0: $i] : (literal_plain(dat_str_foo) = v0 & iext(uri_ex_p,
% 21.28/3.85 | uri_ex_s, v0) = 0 & $i(v0))
% 21.28/3.85 |
% 21.28/3.85 | ALPHA: (testcase_conclusion_fullish_003_Blank_Nodes_for_Literals) implies:
% 21.28/3.85 | (2) ! [v0: $i] : ( ~ (iext(uri_ex_p, uri_ex_s, v0) = 0) | ~ $i(v0))
% 21.28/3.85 |
% 21.28/3.86 | DELTA: instantiating (1) with fresh symbol all_74_0 gives:
% 21.28/3.86 | (3) literal_plain(dat_str_foo) = all_74_0 & iext(uri_ex_p, uri_ex_s,
% 21.28/3.86 | all_74_0) = 0 & $i(all_74_0)
% 21.28/3.86 |
% 21.28/3.86 | ALPHA: (3) implies:
% 21.28/3.86 | (4) $i(all_74_0)
% 21.28/3.86 | (5) iext(uri_ex_p, uri_ex_s, all_74_0) = 0
% 21.28/3.86 |
% 21.28/3.86 | GROUND_INST: instantiating (2) with all_74_0, simplifying with (4), (5) gives:
% 21.28/3.86 | (6) $false
% 21.28/3.86 |
% 21.28/3.86 | CLOSE: (6) is inconsistent.
% 21.28/3.86 |
% 21.28/3.86 End of proof
% 21.28/3.86 % SZS output end Proof for theBenchmark
% 21.28/3.87
% 21.28/3.87 3238ms
%------------------------------------------------------------------------------