TSTP Solution File: SWB003+4 by Princess---230619
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Princess---230619
% Problem : SWB003+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 : n023.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 12.16s 2.40s
% Output : Proof 15.05s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.08 % Problem : SWB003+4 : TPTP v8.1.2. Released v5.2.0.
% 0.06/0.08 % Command : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.07/0.27 % Computer : n023.cluster.edu
% 0.07/0.27 % Model : x86_64 x86_64
% 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27 % Memory : 8042.1875MB
% 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 300
% 0.07/0.27 % WCLimit : 300
% 0.07/0.27 % DateTime : Sun Aug 27 07:21:41 EDT 2023
% 0.07/0.28 % CPUTime :
% 0.53/0.56 ________ _____
% 0.53/0.56 ___ __ \_________(_)________________________________
% 0.53/0.56 __ /_/ /_ ___/_ /__ __ \ ___/ _ \_ ___/_ ___/
% 0.53/0.56 _ ____/_ / _ / _ / / / /__ / __/(__ )_(__ )
% 0.53/0.56 /_/ /_/ /_/ /_/ /_/\___/ \___//____/ /____/
% 0.53/0.56
% 0.53/0.56 A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.53/0.56 (2023-06-19)
% 0.53/0.56
% 0.53/0.56 (c) Philipp Rümmer, 2009-2023
% 0.53/0.56 Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.53/0.56 Amanda Stjerna.
% 0.53/0.56 Free software under BSD-3-Clause.
% 0.53/0.56
% 0.53/0.56 For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.53/0.56
% 0.53/0.56 Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.53/0.57 Running up to 7 provers in parallel.
% 0.53/0.58 Prover 2: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.53/0.58 Prover 1: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.53/0.58 Prover 3: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.53/0.58 Prover 0: Options: +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.53/0.58 Prover 4: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.53/0.59 Prover 6: Options: -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 0.53/0.59 Prover 5: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 3.53/1.18 Prover 4: Preprocessing ...
% 3.53/1.19 Prover 1: Preprocessing ...
% 3.96/1.24 Prover 2: Preprocessing ...
% 3.96/1.24 Prover 0: Preprocessing ...
% 3.96/1.24 Prover 6: Preprocessing ...
% 3.96/1.24 Prover 5: Preprocessing ...
% 3.96/1.24 Prover 3: Preprocessing ...
% 6.36/1.64 Prover 2: Proving ...
% 6.91/1.66 Prover 5: Proving ...
% 7.91/1.80 Prover 3: Constructing countermodel ...
% 7.91/1.81 Prover 6: Proving ...
% 9.04/1.96 Prover 1: Constructing countermodel ...
% 9.45/1.98 Prover 0: Proving ...
% 9.45/2.01 Prover 4: Constructing countermodel ...
% 12.16/2.40 Prover 0: proved (1815ms)
% 12.16/2.40
% 12.16/2.40 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.16/2.40
% 12.16/2.40 Prover 3: stopped
% 12.16/2.40 Prover 5: stopped
% 12.16/2.40 Prover 2: stopped
% 12.16/2.42 Prover 6: stopped
% 12.16/2.43 Prover 8: Options: +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 12.16/2.43 Prover 7: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 12.16/2.43 Prover 10: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 12.16/2.43 Prover 11: Options: +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 12.16/2.44 Prover 13: Options: +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 13.18/2.52 Prover 10: Preprocessing ...
% 13.58/2.55 Prover 7: Preprocessing ...
% 13.64/2.55 Prover 8: Preprocessing ...
% 13.64/2.56 Prover 13: Preprocessing ...
% 13.64/2.56 Prover 4: Found proof (size 6)
% 13.64/2.56 Prover 4: proved (1978ms)
% 13.64/2.56 Prover 1: Found proof (size 6)
% 13.64/2.56 Prover 1: proved (1981ms)
% 13.64/2.56 Prover 10: stopped
% 13.64/2.57 Prover 11: Preprocessing ...
% 13.64/2.58 Prover 7: stopped
% 14.03/2.61 Prover 13: stopped
% 14.03/2.64 Prover 11: stopped
% 14.31/2.72 Prover 8: Warning: ignoring some quantifiers
% 14.31/2.73 Prover 8: Constructing countermodel ...
% 14.77/2.76 Prover 8: stopped
% 14.77/2.76
% 14.77/2.76 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 14.77/2.76
% 14.77/2.76 % SZS output start Proof for theBenchmark
% 14.77/2.77 Assumptions after simplification:
% 14.77/2.77 ---------------------------------
% 14.77/2.77
% 14.77/2.77 (testcase_conclusion_fullish_003_Blank_Nodes_for_Literals)
% 14.77/2.80 $i(uri_ex_s) & $i(uri_ex_p) & ! [v0: $i] : ( ~ (iext(uri_ex_p, uri_ex_s, v0)
% 14.77/2.80 = 0) | ~ $i(v0))
% 15.05/2.80
% 15.05/2.80 (testcase_premise_fullish_003_Blank_Nodes_for_Literals)
% 15.05/2.81 $i(dat_str_foo) & $i(uri_ex_s) & $i(uri_ex_p) & ? [v0: $i] :
% 15.05/2.81 (literal_plain(dat_str_foo) = v0 & iext(uri_ex_p, uri_ex_s, v0) = 0 & $i(v0))
% 15.05/2.81
% 15.05/2.81 Further assumptions not needed in the proof:
% 15.05/2.81 --------------------------------------------
% 15.05/2.81 rdf_collection_first_type, rdf_collection_nil_type, rdf_collection_rest_type,
% 15.05/2.81 rdf_container_n_type_001, rdf_container_n_type_002, rdf_container_n_type_003,
% 15.05/2.81 rdf_reification_object_type, rdf_reification_predicate_type,
% 15.05/2.81 rdf_reification_subject_type, rdf_type_ip, rdf_type_type, rdf_value_type,
% 15.05/2.81 rdfs_annotation_comment_domain, rdfs_annotation_comment_range,
% 15.05/2.81 rdfs_annotation_isdefinedby_domain, rdfs_annotation_isdefinedby_range,
% 15.05/2.81 rdfs_annotation_isdefinedby_sub, rdfs_annotation_label_domain,
% 15.05/2.81 rdfs_annotation_label_range, rdfs_annotation_seealso_domain,
% 15.05/2.81 rdfs_annotation_seealso_range, rdfs_cext_def, rdfs_class_instsub_resource,
% 15.05/2.81 rdfs_collection_first_domain, rdfs_collection_first_range,
% 15.05/2.81 rdfs_collection_rest_domain, rdfs_collection_rest_range, rdfs_container_alt_sub,
% 15.05/2.81 rdfs_container_bag_sub,
% 15.05/2.81 rdfs_container_containermembershipproperty_instsub_member,
% 15.05/2.81 rdfs_container_containermembershipproperty_sub, rdfs_container_member_domain,
% 15.05/2.81 rdfs_container_member_range, rdfs_container_n_domain_001,
% 15.05/2.81 rdfs_container_n_domain_002, rdfs_container_n_domain_003,
% 15.05/2.81 rdfs_container_n_range_001, rdfs_container_n_range_002,
% 15.05/2.81 rdfs_container_n_range_003, rdfs_container_n_type_001,
% 15.05/2.81 rdfs_container_n_type_002, rdfs_container_n_type_003, rdfs_container_seq_sub,
% 15.05/2.81 rdfs_dat_xmlliteral_sub, rdfs_dat_xmlliteral_type,
% 15.05/2.81 rdfs_datatype_instsub_literal, rdfs_datatype_sub, rdfs_domain_domain,
% 15.05/2.81 rdfs_domain_main, rdfs_domain_range, rdfs_ic_def, rdfs_ir_def, rdfs_lv_def,
% 15.05/2.81 rdfs_property_type, rdfs_range_domain, rdfs_range_main, rdfs_range_range,
% 15.05/2.81 rdfs_reification_object_domain, rdfs_reification_object_range,
% 15.05/2.81 rdfs_reification_predicate_domain, rdfs_reification_predicate_range,
% 15.05/2.81 rdfs_reification_subject_domain, rdfs_reification_subject_range,
% 15.05/2.81 rdfs_subclassof_domain, rdfs_subclassof_main, rdfs_subclassof_range,
% 15.05/2.81 rdfs_subclassof_reflex, rdfs_subclassof_trans, rdfs_subpropertyof_domain,
% 15.05/2.81 rdfs_subpropertyof_main, rdfs_subpropertyof_range, rdfs_subpropertyof_reflex,
% 15.05/2.81 rdfs_subpropertyof_trans, rdfs_type_domain, rdfs_type_range, rdfs_value_domain,
% 15.05/2.81 rdfs_value_range, simple_iext_property, simple_ir, simple_lv
% 15.05/2.81
% 15.05/2.81 Those formulas are unsatisfiable:
% 15.05/2.81 ---------------------------------
% 15.05/2.81
% 15.05/2.81 Begin of proof
% 15.05/2.81 |
% 15.05/2.81 | ALPHA: (testcase_premise_fullish_003_Blank_Nodes_for_Literals) implies:
% 15.05/2.81 | (1) ? [v0: $i] : (literal_plain(dat_str_foo) = v0 & iext(uri_ex_p,
% 15.05/2.81 | uri_ex_s, v0) = 0 & $i(v0))
% 15.05/2.81 |
% 15.05/2.81 | ALPHA: (testcase_conclusion_fullish_003_Blank_Nodes_for_Literals) implies:
% 15.05/2.82 | (2) ! [v0: $i] : ( ~ (iext(uri_ex_p, uri_ex_s, v0) = 0) | ~ $i(v0))
% 15.05/2.82 |
% 15.05/2.82 | DELTA: instantiating (1) with fresh symbol all_24_0 gives:
% 15.05/2.82 | (3) literal_plain(dat_str_foo) = all_24_0 & iext(uri_ex_p, uri_ex_s,
% 15.05/2.82 | all_24_0) = 0 & $i(all_24_0)
% 15.05/2.82 |
% 15.05/2.82 | ALPHA: (3) implies:
% 15.05/2.82 | (4) $i(all_24_0)
% 15.05/2.82 | (5) iext(uri_ex_p, uri_ex_s, all_24_0) = 0
% 15.05/2.82 |
% 15.05/2.82 | GROUND_INST: instantiating (2) with all_24_0, simplifying with (4), (5) gives:
% 15.05/2.82 | (6) $false
% 15.05/2.82 |
% 15.05/2.82 | CLOSE: (6) is inconsistent.
% 15.05/2.82 |
% 15.05/2.82 End of proof
% 15.05/2.83 % SZS output end Proof for theBenchmark
% 15.05/2.83
% 15.05/2.83 2260ms
%------------------------------------------------------------------------------