%------------------------------------------------------------------------------ % File : Princess---230619 % Problem : SWB002+4 : 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 9.14s 2.02s % Output : Proof 12.23s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SWB002+4 : TPTP v8.1.2. Released v5.2.0. % 0.00/0.13 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s % 0.12/0.34 % Computer : n022.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 07:24:09 EDT 2023 % 0.12/0.34 % CPUTime : % 0.19/0.60 ________ _____ % 0.19/0.60 ___ __ \_________(_)________________________________ % 0.19/0.60 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/ % 0.19/0.60 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ ) % 0.19/0.60 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/ % 0.19/0.60 % 0.19/0.60 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic % 0.19/0.60 (2023-06-19) % 0.19/0.60 % 0.19/0.60 (c) Philipp Rümmer, 2009-2023 % 0.19/0.60 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen, % 0.19/0.60 Amanda Stjerna. % 0.19/0.60 Free software under BSD-3-Clause. % 0.19/0.60 % 0.19/0.60 For more information, visit http://www.philipp.ruemmer.org/princess.shtml % 0.19/0.60 % 0.19/0.61 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ... % 0.19/0.62 Running up to 7 provers in parallel. % 0.19/0.63 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994 % 0.19/0.63 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893 % 0.19/0.63 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423 % 0.19/0.63 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996 % 0.19/0.63 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696 % 0.19/0.63 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288 % 0.19/0.63 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365 % 3.25/1.21 Prover 4: Preprocessing ... % 3.25/1.21 Prover 1: Preprocessing ... % 3.65/1.24 Prover 2: Preprocessing ... % 3.65/1.24 Prover 6: Preprocessing ... % 3.65/1.25 Prover 0: Preprocessing ... % 3.65/1.25 Prover 3: Preprocessing ... % 3.65/1.25 Prover 5: Preprocessing ... % 4.87/1.50 Prover 2: Proving ... % 4.87/1.52 Prover 5: Proving ... % 6.87/1.68 Prover 3: Constructing countermodel ... % 6.87/1.73 Prover 6: Proving ... % 7.45/1.76 Prover 0: Proving ... % 7.78/1.81 Prover 1: Constructing countermodel ... % 8.42/1.88 Prover 4: Constructing countermodel ... % 9.14/2.02 Prover 3: proved (1389ms) % 9.14/2.02 % 9.14/2.02 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 9.14/2.02 % 9.14/2.03 Prover 0: stopped % 9.14/2.03 Prover 2: stopped % 9.14/2.03 Prover 6: stopped % 9.72/2.05 Prover 5: stopped % 9.72/2.05 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470 % 9.72/2.05 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089 % 9.72/2.05 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125 % 9.72/2.05 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984 % 9.72/2.05 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443 % 9.72/2.15 Prover 11: Preprocessing ... % 9.72/2.15 Prover 8: Preprocessing ... % 9.72/2.15 Prover 10: Preprocessing ... % 9.72/2.17 Prover 7: Preprocessing ... % 9.72/2.18 Prover 13: Preprocessing ... % 11.17/2.25 Prover 10: Warning: ignoring some quantifiers % 11.17/2.26 Prover 10: Constructing countermodel ... % 11.17/2.26 Prover 7: Warning: ignoring some quantifiers % 11.30/2.27 Prover 7: Constructing countermodel ... % 11.30/2.30 Prover 1: Found proof (size 11) % 11.30/2.30 Prover 1: proved (1674ms) % 11.30/2.30 Prover 8: Warning: ignoring some quantifiers % 11.30/2.30 Prover 13: Warning: ignoring some quantifiers % 11.30/2.31 Prover 8: Constructing countermodel ... % 11.30/2.31 Prover 13: Constructing countermodel ... % 11.63/2.32 Prover 4: stopped % 11.63/2.32 Prover 7: stopped % 11.63/2.32 Prover 10: stopped % 11.63/2.32 Prover 8: stopped % 11.63/2.33 Prover 13: stopped % 11.82/2.37 Prover 11: Constructing countermodel ... % 11.82/2.39 Prover 11: stopped % 11.82/2.39 % 11.82/2.39 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 11.82/2.39 % 11.82/2.39 % SZS output start Proof for theBenchmark % 11.82/2.39 Assumptions after simplification: % 11.82/2.39 --------------------------------- % 11.82/2.39 % 11.82/2.39 (testcase_conclusion_fullish_002_Existential_Blank_Nodes) % 11.82/2.42 $i(uri_ex_q) & $i(uri_ex_p) & ! [v0: $i] : ! [v1: $i] : ( ~ (iext(uri_ex_q, % 11.82/2.42 v1, v0) = 0) | ~ $i(v1) | ~ $i(v0) | ? [v2: int] : ( ~ (v2 = 0) & % 11.82/2.42 iext(uri_ex_p, v0, v1) = v2)) % 11.82/2.42 % 11.82/2.42 (testcase_premise_fullish_002_Existential_Blank_Nodes) % 11.82/2.42 $i(uri_ex_s) & $i(uri_ex_q) & $i(uri_ex_p) & ? [v0: $i] : (iext(uri_ex_q, v0, % 11.82/2.42 uri_ex_s) = 0 & iext(uri_ex_p, uri_ex_s, v0) = 0 & $i(v0)) % 11.82/2.42 % 11.82/2.42 (function-axioms) % 11.82/2.43 ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : ! % 11.82/2.43 [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (iext(v4, v3, v2) = v1) | ~ (iext(v4, % 11.82/2.43 v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] % 11.82/2.43 : ! [v2: $i] : ! [v3: $i] : (v1 = v0 | ~ (icext(v3, v2) = v1) | ~ % 11.82/2.43 (icext(v3, v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 11.82/2.43 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (ic(v2) = v1) | ~ (ic(v2) % 11.82/2.43 = v0)) & ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: % 11.82/2.43 $i] : (v1 = v0 | ~ (lv(v2) = v1) | ~ (lv(v2) = v0)) & ! [v0: % 11.82/2.43 MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : (v1 = v0 | % 11.82/2.43 ~ (ir(v2) = v1) | ~ (ir(v2) = v0)) & ! [v0: MultipleValueBool] : ! [v1: % 11.82/2.43 MultipleValueBool] : ! [v2: $i] : (v1 = v0 | ~ (ip(v2) = v1) | ~ (ip(v2) % 11.82/2.43 = v0)) % 11.82/2.43 % 11.82/2.43 Further assumptions not needed in the proof: % 11.82/2.43 -------------------------------------------- % 11.82/2.43 rdf_collection_first_type, rdf_collection_nil_type, rdf_collection_rest_type, % 11.82/2.43 rdf_container_n_type_001, rdf_container_n_type_002, rdf_container_n_type_003, % 11.82/2.43 rdf_reification_object_type, rdf_reification_predicate_type, % 11.82/2.43 rdf_reification_subject_type, rdf_type_ip, rdf_type_type, rdf_value_type, % 11.82/2.43 rdfs_annotation_comment_domain, rdfs_annotation_comment_range, % 11.82/2.43 rdfs_annotation_isdefinedby_domain, rdfs_annotation_isdefinedby_range, % 11.82/2.43 rdfs_annotation_isdefinedby_sub, rdfs_annotation_label_domain, % 11.82/2.43 rdfs_annotation_label_range, rdfs_annotation_seealso_domain, % 11.82/2.43 rdfs_annotation_seealso_range, rdfs_cext_def, rdfs_class_instsub_resource, % 11.82/2.43 rdfs_collection_first_domain, rdfs_collection_first_range, % 11.82/2.43 rdfs_collection_rest_domain, rdfs_collection_rest_range, rdfs_container_alt_sub, % 11.82/2.43 rdfs_container_bag_sub, % 11.82/2.43 rdfs_container_containermembershipproperty_instsub_member, % 11.82/2.43 rdfs_container_containermembershipproperty_sub, rdfs_container_member_domain, % 11.82/2.43 rdfs_container_member_range, rdfs_container_n_domain_001, % 11.82/2.43 rdfs_container_n_domain_002, rdfs_container_n_domain_003, % 11.82/2.43 rdfs_container_n_range_001, rdfs_container_n_range_002, % 11.82/2.43 rdfs_container_n_range_003, rdfs_container_n_type_001, % 11.82/2.43 rdfs_container_n_type_002, rdfs_container_n_type_003, rdfs_container_seq_sub, % 11.82/2.43 rdfs_dat_xmlliteral_sub, rdfs_dat_xmlliteral_type, % 11.82/2.43 rdfs_datatype_instsub_literal, rdfs_datatype_sub, rdfs_domain_domain, % 11.82/2.43 rdfs_domain_main, rdfs_domain_range, rdfs_ic_def, rdfs_ir_def, rdfs_lv_def, % 11.82/2.43 rdfs_property_type, rdfs_range_domain, rdfs_range_main, rdfs_range_range, % 11.82/2.43 rdfs_reification_object_domain, rdfs_reification_object_range, % 11.82/2.43 rdfs_reification_predicate_domain, rdfs_reification_predicate_range, % 11.82/2.43 rdfs_reification_subject_domain, rdfs_reification_subject_range, % 11.82/2.43 rdfs_subclassof_domain, rdfs_subclassof_main, rdfs_subclassof_range, % 11.82/2.43 rdfs_subclassof_reflex, rdfs_subclassof_trans, rdfs_subpropertyof_domain, % 11.82/2.43 rdfs_subpropertyof_main, rdfs_subpropertyof_range, rdfs_subpropertyof_reflex, % 11.82/2.43 rdfs_subpropertyof_trans, rdfs_type_domain, rdfs_type_range, rdfs_value_domain, % 11.82/2.43 rdfs_value_range, simple_iext_property, simple_ir, simple_lv % 11.82/2.43 % 11.82/2.43 Those formulas are unsatisfiable: % 11.82/2.43 --------------------------------- % 11.82/2.43 % 11.82/2.43 Begin of proof % 11.82/2.43 | % 11.82/2.43 | ALPHA: (testcase_premise_fullish_002_Existential_Blank_Nodes) implies: % 12.23/2.43 | (1) $i(uri_ex_s) % 12.23/2.43 | (2) ? [v0: $i] : (iext(uri_ex_q, v0, uri_ex_s) = 0 & iext(uri_ex_p, % 12.23/2.43 | uri_ex_s, v0) = 0 & $i(v0)) % 12.23/2.43 | % 12.23/2.43 | ALPHA: (testcase_conclusion_fullish_002_Existential_Blank_Nodes) implies: % 12.23/2.43 | (3) ! [v0: $i] : ! [v1: $i] : ( ~ (iext(uri_ex_q, v1, v0) = 0) | ~ % 12.23/2.43 | $i(v1) | ~ $i(v0) | ? [v2: int] : ( ~ (v2 = 0) & iext(uri_ex_p, v0, % 12.23/2.43 | v1) = v2)) % 12.23/2.43 | % 12.23/2.43 | ALPHA: (function-axioms) implies: % 12.23/2.43 | (4) ! [v0: MultipleValueBool] : ! [v1: MultipleValueBool] : ! [v2: $i] : % 12.23/2.43 | ! [v3: $i] : ! [v4: $i] : (v1 = v0 | ~ (iext(v4, v3, v2) = v1) | ~ % 12.23/2.43 | (iext(v4, v3, v2) = v0)) % 12.23/2.43 | % 12.23/2.43 | DELTA: instantiating (2) with fresh symbol all_24_0 gives: % 12.23/2.44 | (5) iext(uri_ex_q, all_24_0, uri_ex_s) = 0 & iext(uri_ex_p, uri_ex_s, % 12.23/2.44 | all_24_0) = 0 & $i(all_24_0) % 12.23/2.44 | % 12.23/2.44 | ALPHA: (5) implies: % 12.23/2.44 | (6) $i(all_24_0) % 12.23/2.44 | (7) iext(uri_ex_p, uri_ex_s, all_24_0) = 0 % 12.23/2.44 | (8) iext(uri_ex_q, all_24_0, uri_ex_s) = 0 % 12.23/2.44 | % 12.23/2.44 | GROUND_INST: instantiating (3) with uri_ex_s, all_24_0, simplifying with (1), % 12.23/2.44 | (6), (8) gives: % 12.23/2.44 | (9) ? [v0: int] : ( ~ (v0 = 0) & iext(uri_ex_p, uri_ex_s, all_24_0) = v0) % 12.23/2.44 | % 12.23/2.44 | DELTA: instantiating (9) with fresh symbol all_39_0 gives: % 12.23/2.44 | (10) ~ (all_39_0 = 0) & iext(uri_ex_p, uri_ex_s, all_24_0) = all_39_0 % 12.23/2.44 | % 12.23/2.44 | ALPHA: (10) implies: % 12.23/2.44 | (11) ~ (all_39_0 = 0) % 12.23/2.44 | (12) iext(uri_ex_p, uri_ex_s, all_24_0) = all_39_0 % 12.23/2.44 | % 12.23/2.44 | GROUND_INST: instantiating (4) with 0, all_39_0, all_24_0, uri_ex_s, uri_ex_p, % 12.23/2.44 | simplifying with (7), (12) gives: % 12.23/2.44 | (13) all_39_0 = 0 % 12.23/2.44 | % 12.23/2.44 | REDUCE: (11), (13) imply: % 12.23/2.44 | (14) $false % 12.23/2.44 | % 12.23/2.44 | CLOSE: (14) is inconsistent. % 12.23/2.44 | % 12.23/2.44 End of proof % 12.23/2.44 % SZS output end Proof for theBenchmark % 12.23/2.44 % 12.23/2.44 1835ms %------------------------------------------------------------------------------