TSTP Solution File: SWB008+2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SWB008+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% Computer : n026.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 : 600s
% DateTime : Tue Jul 19 19:02:23 EDT 2022
% Result : Theorem 0.13s 0.37s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWB008+2 : TPTP v8.1.0. Released v5.2.0.
% 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.34 % Computer : n026.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 : 600
% 0.13/0.34 % DateTime : Wed Jun 1 02:46:41 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 14 Number of unprocessed: 14
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.13/0.37 # The folding up rule is enabled...
% 0.13/0.37 # Local unification is enabled...
% 0.13/0.37 # Any saturation attempts will use folding labels...
% 0.13/0.37 # 14 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 1 conjectures.
% 0.13/0.37 # There are 1 start rule candidates:
% 0.13/0.37 # Found 6 unit axioms.
% 0.13/0.37 # 1 start rule tableaux created.
% 0.13/0.37 # 8 extension rule candidate clauses
% 0.13/0.37 # 6 unit axiom clauses
% 0.13/0.37
% 0.13/0.37 # Requested 8, 32 cores available to the main process.
% 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 1
% 0.13/0.37 # Creating equality axioms
% 0.13/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.13/0.37 # Returning from population with 18 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.37 # We now have 18 tableaux to operate on
% 0.13/0.37 # There were 1 total branch saturation attempts.
% 0.13/0.37 # There were 0 of these attempts blocked.
% 0.13/0.37 # There were 0 deferred branch saturation attempts.
% 0.13/0.37 # There were 0 free duplicated saturations.
% 0.13/0.37 # There were 1 total successful branch saturations.
% 0.13/0.37 # There were 0 successful branch saturations in interreduction.
% 0.13/0.37 # There were 0 successful branch saturations on the branch.
% 0.13/0.37 # There were 1 successful branch saturations after the branch.
% 0.13/0.37 # There were 1 total branch saturation attempts.
% 0.13/0.37 # There were 0 of these attempts blocked.
% 0.13/0.37 # There were 0 deferred branch saturation attempts.
% 0.13/0.37 # There were 0 free duplicated saturations.
% 0.13/0.37 # There were 1 total successful branch saturations.
% 0.13/0.37 # There were 0 successful branch saturations in interreduction.
% 0.13/0.37 # There were 0 successful branch saturations on the branch.
% 0.13/0.37 # There were 1 successful branch saturations after the branch.
% 0.13/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37 # Begin clausification derivation
% 0.13/0.37
% 0.13/0.37 # End clausification derivation
% 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.37 cnf(i_0_3, plain, (iext(uri_owl_sameAs,X1,X1))).
% 0.13/0.37 cnf(i_0_13, plain, (iext(uri_rdf_type,uri_foaf_mbox_sha1sum,uri_owl_InverseFunctionalProperty))).
% 0.13/0.37 cnf(i_0_14, plain, (iext(uri_rdf_type,uri_foaf_mbox_sha1sum,uri_owl_DatatypeProperty))).
% 0.13/0.37 cnf(i_0_12, plain, (iext(uri_foaf_mbox_sha1sum,uri_ex_bob,literal_plain(dat_str_xyz)))).
% 0.13/0.37 cnf(i_0_11, plain, (iext(uri_foaf_mbox_sha1sum,uri_ex_robert,literal_plain(dat_str_xyz)))).
% 0.13/0.37 cnf(i_0_10, negated_conjecture, (~iext(uri_owl_sameAs,uri_ex_bob,uri_ex_robert))).
% 0.13/0.37 cnf(i_0_4, plain, (X1=X2|~iext(uri_owl_sameAs,X1,X2))).
% 0.13/0.37 cnf(i_0_9, plain, (ip(X1)|~icext(uri_owl_InverseFunctionalProperty,X1))).
% 0.13/0.37 cnf(i_0_1, plain, (iext(uri_rdf_type,X1,X2)|~icext(X2,X1))).
% 0.13/0.37 cnf(i_0_2, plain, (icext(X1,X2)|~iext(uri_rdf_type,X2,X1))).
% 0.13/0.37 cnf(i_0_5, plain, (icext(uri_owl_InverseFunctionalProperty,X1)|esk2_1(X1)!=esk1_1(X1)|~ip(X1))).
% 0.13/0.37 cnf(i_0_7, plain, (icext(uri_owl_InverseFunctionalProperty,X1)|iext(X1,esk1_1(X1),esk3_1(X1))|~ip(X1))).
% 0.13/0.37 cnf(i_0_6, plain, (icext(uri_owl_InverseFunctionalProperty,X1)|iext(X1,esk2_1(X1),esk3_1(X1))|~ip(X1))).
% 0.13/0.37 cnf(i_0_8, plain, (X1=X2|~icext(uri_owl_InverseFunctionalProperty,X3)|~iext(X3,X2,X4)|~iext(X3,X1,X4))).
% 0.13/0.37 cnf(i_0_38, plain, (X19=X19)).
% 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.37 # Begin printing tableau
% 0.13/0.37 # Found 4 steps
% 0.13/0.37 cnf(i_0_13, plain, (iext(uri_rdf_type,uri_foaf_mbox_sha1sum,uri_owl_InverseFunctionalProperty)), inference(start_rule)).
% 0.13/0.37 cnf(i_0_47, plain, (iext(uri_rdf_type,uri_foaf_mbox_sha1sum,uri_owl_InverseFunctionalProperty)), inference(extension_rule, [i_0_2])).
% 0.13/0.37 cnf(i_0_122, plain, (icext(uri_owl_InverseFunctionalProperty,uri_foaf_mbox_sha1sum)), inference(extension_rule, [i_0_9])).
% 0.13/0.37 cnf(i_0_126, plain, (ip(uri_foaf_mbox_sha1sum)), inference(etableau_closure_rule, [i_0_126, ...])).
% 0.13/0.37 # End printing tableau
% 0.13/0.37 # SZS output end
% 0.13/0.37 # Branches closed with saturation will be marked with an "s"
% 0.13/0.37 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37 # Begin clausification derivation
% 0.13/0.37
% 0.13/0.37 # End clausification derivation
% 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.37 cnf(i_0_3, plain, (iext(uri_owl_sameAs,X1,X1))).
% 0.13/0.37 cnf(i_0_13, plain, (iext(uri_rdf_type,uri_foaf_mbox_sha1sum,uri_owl_InverseFunctionalProperty))).
% 0.13/0.37 cnf(i_0_14, plain, (iext(uri_rdf_type,uri_foaf_mbox_sha1sum,uri_owl_DatatypeProperty))).
% 0.13/0.37 cnf(i_0_12, plain, (iext(uri_foaf_mbox_sha1sum,uri_ex_bob,literal_plain(dat_str_xyz)))).
% 0.13/0.37 cnf(i_0_11, plain, (iext(uri_foaf_mbox_sha1sum,uri_ex_robert,literal_plain(dat_str_xyz)))).
% 0.13/0.37 cnf(i_0_10, negated_conjecture, (~iext(uri_owl_sameAs,uri_ex_bob,uri_ex_robert))).
% 0.13/0.37 cnf(i_0_4, plain, (X1=X2|~iext(uri_owl_sameAs,X1,X2))).
% 0.13/0.37 cnf(i_0_9, plain, (ip(X1)|~icext(uri_owl_InverseFunctionalProperty,X1))).
% 0.13/0.37 cnf(i_0_1, plain, (iext(uri_rdf_type,X1,X2)|~icext(X2,X1))).
% 0.13/0.37 cnf(i_0_2, plain, (icext(X1,X2)|~iext(uri_rdf_type,X2,X1))).
% 0.13/0.37 cnf(i_0_5, plain, (icext(uri_owl_InverseFunctionalProperty,X1)|esk2_1(X1)!=esk1_1(X1)|~ip(X1))).
% 0.13/0.37 cnf(i_0_7, plain, (icext(uri_owl_InverseFunctionalProperty,X1)|iext(X1,esk1_1(X1),esk3_1(X1))|~ip(X1))).
% 0.13/0.37 cnf(i_0_6, plain, (icext(uri_owl_InverseFunctionalProperty,X1)|iext(X1,esk2_1(X1),esk3_1(X1))|~ip(X1))).
% 0.13/0.37 cnf(i_0_8, plain, (X1=X2|~icext(uri_owl_InverseFunctionalProperty,X3)|~iext(X3,X2,X4)|~iext(X3,X1,X4))).
% 0.13/0.37 cnf(i_0_38, plain, (X19=X19)).
% 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.37 # Begin printing tableau
% 0.13/0.37 # Found 7 steps
% 0.13/0.37 cnf(i_0_3, plain, (iext(uri_owl_sameAs,uri_owl_sameAs,uri_owl_sameAs)), inference(start_rule)).
% 0.13/0.37 cnf(i_0_46, plain, (iext(uri_owl_sameAs,uri_owl_sameAs,uri_owl_sameAs)), inference(extension_rule, [i_0_4])).
% 0.13/0.37 cnf(i_0_74, plain, (uri_owl_sameAs=uri_owl_sameAs), inference(extension_rule, [i_0_42])).
% 0.13/0.37 cnf(i_0_144, plain, (iext(uri_owl_sameAs,uri_ex_bob,uri_ex_robert)), inference(closure_rule, [i_0_10])).
% 0.13/0.37 cnf(i_0_146, plain, ($false), inference(closure_rule, [i_0_38])).
% 0.13/0.37 cnf(i_0_147, plain, ($false), inference(closure_rule, [i_0_38])).
% 0.13/0.37 cnf(i_0_148, plain, (~iext(uri_owl_sameAs,uri_ex_bob,uri_ex_robert)), inference(etableau_closure_rule, [i_0_148, ...])).
% 0.13/0.37 # End printing tableau
% 0.13/0.37 # SZS output end
% 0.13/0.37 # Branches closed with saturation will be marked with an "s"
% 0.13/0.37 # Child (1300) has found a proof.
% 0.13/0.37
% 0.13/0.37 # Proof search is over...
% 0.13/0.37 # Freeing feature tree
%------------------------------------------------------------------------------