%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWB002+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 : n022.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:32 EDT 2023 % Result : Theorem 14.51s 2.78s % Output : Proof 23.10s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SWB002+3 : TPTP v8.1.2. Released v5.2.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.13/0.34 % Computer : n022.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 300 % 0.13/0.34 % DateTime : Sun Aug 27 06:24:39 EDT 2023 % 0.13/0.34 % CPUTime : % 0.20/0.61 ________ _____ % 0.20/0.61 ___ __ \_________(_)________________________________ % 0.20/0.61 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.20/0.61 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.20/0.61 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.20/0.61 % 0.20/0.61 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.20/0.61 (2023-06-19) % 0.20/0.61 % 0.20/0.61 (c) Philipp Rümmer, 2009-2023 % 0.20/0.61 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.20/0.61 Amanda Stjerna. % 0.20/0.61 Free software under BSD-3-Clause. % 0.20/0.61 % 0.20/0.61 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.20/0.61 % 0.20/0.61 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.20/0.62 Running up to 7 provers in parallel. % 0.20/0.64 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.20/0.64 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.20/0.64 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.20/0.64 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.20/0.64 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.20/0.64 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.20/0.64 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.99/1.33 Prover 4: Preprocessing ... % 3.99/1.33 Prover 1: Preprocessing ... % 3.99/1.36 Prover 3: Preprocessing ... % 3.99/1.36 Prover 6: Preprocessing ... % 3.99/1.36 Prover 5: Preprocessing ... % 3.99/1.36 Prover 0: Preprocessing ... % 3.99/1.37 Prover 2: Preprocessing ... % 10.00/2.13 Prover 5: Proving ... % 10.00/2.19 Prover 2: Proving ... % 12.81/2.46 Prover 3: Constructing countermodel ... % 13.03/2.49 Prover 1: Constructing countermodel ... % 13.03/2.52 Prover 6: Proving ... % 14.51/2.78 Prover 3: proved (2142ms) % 14.51/2.78 % 14.51/2.78 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 14.51/2.78 % 14.51/2.78 Prover 6: stopped % 14.51/2.78 Prover 5: stopped % 14.51/2.79 Prover 2: stopped % 14.51/2.79 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 14.51/2.79 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 14.51/2.79 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 14.51/2.79 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 16.49/2.97 Prover 10: Preprocessing ... % 16.49/3.00 Prover 7: Preprocessing ... % 16.49/3.00 Prover 11: Preprocessing ... % 16.49/3.03 Prover 8: Preprocessing ... % 17.64/3.13 Prover 10: Warning: ignoring some quantifiers % 18.08/3.17 Prover 10: Constructing countermodel ... % 18.08/3.19 Prover 7: Warning: ignoring some quantifiers % 18.49/3.22 Prover 7: Constructing countermodel ... % 18.87/3.32 Prover 1: Found proof (size 11) % 18.87/3.32 Prover 1: proved (2689ms) % 18.87/3.33 Prover 11: stopped % 18.87/3.33 Prover 7: stopped % 19.51/3.38 Prover 10: stopped % 19.84/3.40 Prover 8: Warning: ignoring some quantifiers % 19.84/3.42 Prover 8: Constructing countermodel ... % 19.84/3.44 Prover 8: stopped % 21.99/3.82 Prover 4: Constructing countermodel ... % 22.25/3.86 Prover 4: stopped % 23.10/4.12 Prover 0: Proving ... % 23.10/4.13 Prover 0: stopped % 23.10/4.13 % 23.10/4.13 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 23.10/4.13 % 23.10/4.14 % SZS output start Proof for theBenchmark % 23.10/4.15 Assumptions after simplification: % 23.10/4.15 --------------------------------- % 23.10/4.15 % 23.10/4.15 (testcase_conclusion_fullish_002_Existential_Blank_Nodes) % 23.10/4.18 $i(uri_ex_q) & $i(uri_ex_p) & ! [v0: $i] : ! [v1: $i] : ( ~ (iext(uri_ex_q, % 23.10/4.18 v1, v0) = 0) | ~ $i(v1) | ~ $i(v0) | ? [v2: int] : ( ~ (v2 = 0) & % 23.10/4.18 iext(uri_ex_p, v0, v1) = v2)) % 23.10/4.18 % 23.10/4.18 (testcase_premise_fullish_002_Existential_Blank_Nodes) % 23.10/4.18 $i(uri_ex_s) & $i(uri_ex_q) & $i(uri_ex_p) & ? [v0: $i] : (iext(uri_ex_q, v0, % 23.10/4.18 uri_ex_s) = 0 & iext(uri_ex_p, uri_ex_s, v0) = 0 & $i(v0)) % 23.10/4.18 % 23.10/4.18 (function-axioms) % 23.10/4.19 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 23.10/4.19 [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (iext(v4, v3, v2) = v1) | ~ (iext(v4, % 23.10/4.19 v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] % 23.10/4.19 : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (icext(v3, v2) = v1) | ~ % 23.10/4.19 (icext(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 23.10/4.19 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (ioxp(v2) = v1) | ~ % 23.10/4.19 (ioxp(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : % 23.10/4.19 ! [v2: $i] : (v1 = v0 | ~ (ix(v2) = v1) | ~ (ix(v2) = v0)) & ! [v0: % 23.10/4.19 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 23.10/4.19 ~ (iodp(v2) = v1) | ~ (iodp(v2) = v0)) & ! [v0: MultipleValueBool] : ! % 23.10/4.19 [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (ip(v2) = v1) | ~ % 23.10/4.19 (ip(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : % 23.10/4.19 ! [v2: $i] : (v1 = v0 | ~ (ioap(v2) = v1) | ~ (ioap(v2) = v0)) & ! [v0: % 23.10/4.19 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 23.10/4.19 ~ (idc(v2) = v1) | ~ (idc(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 23.10/4.19 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (lv(v2) = v1) | ~ (lv(v2) % 23.10/4.19 = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 23.10/4.19 $i] : (v1 = v0 | ~ (ir(v2) = v1) | ~ (ir(v2) = v0)) & ! [v0: % 23.10/4.19 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 23.10/4.19 ~ (ic(v2) = v1) | ~ (ic(v2) = v0)) % 23.10/4.19 % 23.10/4.19 Further assumptions not needed in the proof: % 23.10/4.19 -------------------------------------------- % 23.10/4.19 owl_bool_complementof_class, owl_bool_intersectionof_class_000, % 23.10/4.19 owl_bool_intersectionof_class_001, owl_bool_intersectionof_class_002, % 23.10/4.19 owl_bool_intersectionof_class_003, owl_bool_unionof_class_000, % 23.10/4.19 owl_bool_unionof_class_001, owl_bool_unionof_class_002, % 23.10/4.19 owl_bool_unionof_class_003, owl_class_nothing_ext, owl_class_nothing_type, % 23.10/4.19 owl_class_thing_ext, owl_class_thing_type, owl_parts_ic_cond_inst, % 23.10/4.19 owl_parts_ic_cond_set, owl_parts_ic_def, owl_parts_idc_cond_inst, % 23.10/4.19 owl_parts_idc_cond_set, owl_parts_idc_def, owl_parts_ioap_cond_inst, % 23.10/4.19 owl_parts_ioap_cond_set, owl_parts_ioap_def, owl_parts_iodp_cond_inst, % 23.10/4.19 owl_parts_iodp_cond_set, owl_parts_iodp_def, owl_parts_ioxp_cond_inst, % 23.10/4.19 owl_parts_ioxp_cond_set, owl_parts_ioxp_def, owl_parts_ip_cond_inst, % 23.10/4.19 owl_parts_ip_cond_set, owl_parts_ip_def, owl_parts_ir_cond_set, % 23.10/4.19 owl_parts_ir_def, owl_parts_ix_cond_set, owl_parts_ix_def, % 23.10/4.19 owl_parts_lv_cond_set, owl_parts_lv_def, owl_prop_allvaluesfrom_ext, % 23.10/4.19 owl_prop_allvaluesfrom_type, owl_prop_complementof_ext, % 23.10/4.19 owl_prop_complementof_type, owl_prop_hasvalue_ext, owl_prop_hasvalue_type, % 23.10/4.19 owl_prop_intersectionof_ext, owl_prop_intersectionof_type, % 23.10/4.19 owl_prop_onproperty_ext, owl_prop_onproperty_type, owl_prop_somevaluesfrom_ext, % 23.10/4.19 owl_prop_somevaluesfrom_type, owl_prop_unionof_ext, owl_prop_unionof_type, % 23.10/4.19 owl_rdfsext_domain, owl_rdfsext_range, owl_rdfsext_subclassof, % 23.10/4.19 owl_rdfsext_subpropertyof, owl_restrict_allvaluesfrom, owl_restrict_hasvalue, % 23.10/4.19 owl_restrict_somevaluesfrom, rdf_collection_first_type, rdf_collection_nil_type, % 23.10/4.19 rdf_collection_rest_type, rdf_container_n_type_001, rdf_container_n_type_002, % 23.10/4.19 rdf_container_n_type_003, rdf_reification_object_type, % 23.10/4.19 rdf_reification_predicate_type, rdf_reification_subject_type, rdf_type_ip, % 23.10/4.19 rdf_type_type, rdf_value_type, rdfs_annotation_comment_domain, % 23.10/4.19 rdfs_annotation_comment_range, rdfs_annotation_isdefinedby_domain, % 23.10/4.19 rdfs_annotation_isdefinedby_range, rdfs_annotation_isdefinedby_sub, % 23.10/4.19 rdfs_annotation_label_domain, rdfs_annotation_label_range, % 23.10/4.19 rdfs_annotation_seealso_domain, rdfs_annotation_seealso_range, rdfs_cext_def, % 23.10/4.19 rdfs_class_instsub_resource, rdfs_collection_first_domain, % 23.10/4.19 rdfs_collection_first_range, rdfs_collection_rest_domain, % 23.10/4.19 rdfs_collection_rest_range, rdfs_container_alt_sub, rdfs_container_bag_sub, % 23.10/4.19 rdfs_container_containermembershipproperty_instsub_member, % 23.10/4.19 rdfs_container_containermembershipproperty_sub, rdfs_container_member_domain, % 23.10/4.19 rdfs_container_member_range, rdfs_container_n_domain_001, % 23.10/4.19 rdfs_container_n_domain_002, rdfs_container_n_domain_003, % 23.10/4.19 rdfs_container_n_range_001, rdfs_container_n_range_002, % 23.10/4.19 rdfs_container_n_range_003, rdfs_container_n_type_001, % 23.10/4.19 rdfs_container_n_type_002, rdfs_container_n_type_003, rdfs_container_seq_sub, % 23.10/4.19 rdfs_dat_xmlliteral_sub, rdfs_dat_xmlliteral_type, % 23.10/4.19 rdfs_datatype_instsub_literal, rdfs_datatype_sub, rdfs_domain_domain, % 23.10/4.19 rdfs_domain_main, rdfs_domain_range, rdfs_ic_def, rdfs_ir_def, rdfs_lv_def, % 23.10/4.19 rdfs_property_type, rdfs_range_domain, rdfs_range_main, rdfs_range_range, % 23.10/4.19 rdfs_reification_object_domain, rdfs_reification_object_range, % 23.10/4.19 rdfs_reification_predicate_domain, rdfs_reification_predicate_range, % 23.10/4.19 rdfs_reification_subject_domain, rdfs_reification_subject_range, % 23.10/4.19 rdfs_subclassof_domain, rdfs_subclassof_main, rdfs_subclassof_range, % 23.10/4.19 rdfs_subclassof_reflex, rdfs_subclassof_trans, rdfs_subpropertyof_domain, % 23.10/4.19 rdfs_subpropertyof_main, rdfs_subpropertyof_range, rdfs_subpropertyof_reflex, % 23.10/4.19 rdfs_subpropertyof_trans, rdfs_type_domain, rdfs_type_range, rdfs_value_domain, % 23.10/4.19 rdfs_value_range, simple_iext_property, simple_ir, simple_lv % 23.10/4.19 % 23.10/4.19 Those formulas are unsatisfiable: % 23.10/4.19 --------------------------------- % 23.10/4.19 % 23.10/4.19 Begin of proof % 23.10/4.19 | % 23.10/4.19 | ALPHA: (testcase_premise_fullish_002_Existential_Blank_Nodes) implies: % 23.10/4.20 | (1) $i(uri_ex_s) % 23.10/4.20 | (2) ? [v0: $i] : (iext(uri_ex_q, v0, uri_ex_s) = 0 & iext(uri_ex_p, % 23.10/4.20 | uri_ex_s, v0) = 0 & $i(v0)) % 23.10/4.20 | % 23.10/4.20 | ALPHA: (testcase_conclusion_fullish_002_Existential_Blank_Nodes) implies: % 23.10/4.20 | (3) ! [v0: $i] : ! [v1: $i] : ( ~ (iext(uri_ex_q, v1, v0) = 0) | ~ % 23.10/4.20 | $i(v1) | ~ $i(v0) | ? [v2: int] : ( ~ (v2 = 0) & iext(uri_ex_p, v0, % 23.10/4.20 | v1) = v2)) % 23.10/4.20 | % 23.10/4.20 | ALPHA: (function-axioms) implies: % 23.10/4.20 | (4) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 23.10/4.20 | ! [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (iext(v4, v3, v2) = v1) | ~ % 23.10/4.20 | (iext(v4, v3, v2) = v0)) % 23.10/4.20 | % 23.10/4.20 | DELTA: instantiating (2) with fresh symbol all_74_0 gives: % 23.10/4.20 | (5) iext(uri_ex_q, all_74_0, uri_ex_s) = 0 & iext(uri_ex_p, uri_ex_s, % 23.10/4.20 | all_74_0) = 0 & $i(all_74_0) % 23.10/4.20 | % 23.10/4.20 | ALPHA: (5) implies: % 23.10/4.20 | (6) $i(all_74_0) % 23.10/4.20 | (7) iext(uri_ex_p, uri_ex_s, all_74_0) = 0 % 23.10/4.20 | (8) iext(uri_ex_q, all_74_0, uri_ex_s) = 0 % 23.10/4.20 | % 23.10/4.20 | GROUND_INST: instantiating (3) with uri_ex_s, all_74_0, simplifying with (1), % 23.10/4.20 | (6), (8) gives: % 23.10/4.20 | (9) ? [v0: int] : ( ~ (v0 = 0) & iext(uri_ex_p, uri_ex_s, all_74_0) = v0) % 23.10/4.20 | % 23.10/4.20 | DELTA: instantiating (9) with fresh symbol all_135_0 gives: % 23.10/4.20 | (10) ~ (all_135_0 = 0) & iext(uri_ex_p, uri_ex_s, all_74_0) = all_135_0 % 23.10/4.20 | % 23.10/4.20 | ALPHA: (10) implies: % 23.10/4.20 | (11) ~ (all_135_0 = 0) % 23.10/4.20 | (12) iext(uri_ex_p, uri_ex_s, all_74_0) = all_135_0 % 23.10/4.20 | % 23.10/4.20 | GROUND_INST: instantiating (4) with 0, all_135_0, all_74_0, uri_ex_s, % 23.10/4.20 | uri_ex_p, simplifying with (7), (12) gives: % 23.10/4.20 | (13) all_135_0 = 0 % 23.10/4.20 | % 23.10/4.20 | REDUCE: (11), (13) imply: % 23.10/4.21 | (14) $false % 23.10/4.21 | % 23.10/4.21 | CLOSE: (14) is inconsistent. % 23.10/4.21 | % 23.10/4.21 End of proof % 23.10/4.21 % SZS output end Proof for theBenchmark % 23.10/4.21 % 23.10/4.21 3594ms %------------------------------------------------------------------------------