TSTP Solution File: SWB023+2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SWB023+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 : n017.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:32 EDT 2022
% Result : Theorem 0.22s 0.39s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWB023+2 : TPTP v8.1.0. Released v5.2.0.
% 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.15/0.35 % Computer : n017.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Wed Jun 1 02:50:11 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.22/0.38 # No SInE strategy applied
% 0.22/0.38 # Auto-Mode selected heuristic G_E___208_C18C___F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.22/0.38 #
% 0.22/0.38 # Presaturation interreduction done
% 0.22/0.38 # Number of axioms: 22 Number of unprocessed: 22
% 0.22/0.38 # Tableaux proof search.
% 0.22/0.38 # APR header successfully linked.
% 0.22/0.38 # Hello from C++
% 0.22/0.38 # The folding up rule is enabled...
% 0.22/0.38 # Local unification is enabled...
% 0.22/0.38 # Any saturation attempts will use folding labels...
% 0.22/0.38 # 22 beginning clauses after preprocessing and clausification
% 0.22/0.38 # Creating start rules for all 1 conjectures.
% 0.22/0.38 # There are 1 start rule candidates:
% 0.22/0.38 # Found 8 unit axioms.
% 0.22/0.38 # 1 start rule tableaux created.
% 0.22/0.38 # 14 extension rule candidate clauses
% 0.22/0.38 # 8 unit axiom clauses
% 0.22/0.38
% 0.22/0.38 # Requested 8, 32 cores available to the main process.
% 0.22/0.38 # There are not enough tableaux to fork, creating more from the initial 1
% 0.22/0.38 # Creating equality axioms
% 0.22/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.22/0.38 # Returning from population with 26 new_tableaux and 0 remaining starting tableaux.
% 0.22/0.38 # We now have 26 tableaux to operate on
% 0.22/0.39 # There were 1 total branch saturation attempts.
% 0.22/0.39 # There were 0 of these attempts blocked.
% 0.22/0.39 # There were 0 deferred branch saturation attempts.
% 0.22/0.39 # There were 0 free duplicated saturations.
% 0.22/0.39 # There were 1 total successful branch saturations.
% 0.22/0.39 # There were 0 successful branch saturations in interreduction.
% 0.22/0.39 # There were 0 successful branch saturations on the branch.
% 0.22/0.39 # There were 1 successful branch saturations after the branch.
% 0.22/0.39 # There were 1 total branch saturation attempts.
% 0.22/0.39 # There were 0 of these attempts blocked.
% 0.22/0.39 # There were 0 deferred branch saturation attempts.
% 0.22/0.39 # There were 0 free duplicated saturations.
% 0.22/0.39 # There were 1 total successful branch saturations.
% 0.22/0.39 # There were 0 successful branch saturations in interreduction.
% 0.22/0.39 # There were 0 successful branch saturations on the branch.
% 0.22/0.39 # There were 1 successful branch saturations after the branch.
% 0.22/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.39 # Begin clausification derivation
% 0.22/0.39
% 0.22/0.39 # End clausification derivation
% 0.22/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.22/0.39 cnf(i_0_21, plain, (iext(uri_rdf_type,uri_ex_w,esk5_0))).
% 0.22/0.39 cnf(i_0_18, plain, (iext(uri_rdf_first,esk6_0,uri_ex_u))).
% 0.22/0.39 cnf(i_0_17, plain, (iext(uri_rdf_first,esk6_0,uri_ex_v))).
% 0.22/0.39 cnf(i_0_22, plain, (iext(uri_rdf_type,uri_rdf_first,uri_owl_FunctionalProperty))).
% 0.22/0.39 cnf(i_0_13, plain, (iext(uri_owl_sameAs,X1,X1))).
% 0.22/0.39 cnf(i_0_20, plain, (iext(uri_rdf_type,esk5_0,uri_owl_Class))).
% 0.22/0.39 cnf(i_0_16, plain, (iext(uri_rdf_rest,esk6_0,uri_rdf_nil))).
% 0.22/0.39 cnf(i_0_19, plain, (iext(uri_owl_oneOf,esk5_0,esk6_0))).
% 0.22/0.39 cnf(i_0_15, negated_conjecture, (~iext(uri_owl_sameAs,uri_ex_w,uri_ex_u)|~iext(uri_owl_sameAs,uri_ex_w,uri_ex_v))).
% 0.22/0.39 cnf(i_0_14, plain, (X1=X2|~iext(uri_owl_sameAs,X1,X2))).
% 0.22/0.39 cnf(i_0_12, plain, (ip(X1)|~icext(uri_owl_FunctionalProperty,X1))).
% 0.22/0.39 cnf(i_0_1, plain, (iext(uri_rdf_type,X1,X2)|~icext(X2,X1))).
% 0.22/0.39 cnf(i_0_2, plain, (icext(X1,X2)|~iext(uri_rdf_type,X2,X1))).
% 0.22/0.39 cnf(i_0_8, plain, (icext(uri_owl_FunctionalProperty,X1)|esk4_1(X1)!=esk3_1(X1)|~ip(X1))).
% 0.22/0.39 cnf(i_0_7, plain, (ic(X1)|~iext(uri_rdf_rest,X2,uri_rdf_nil)|~iext(uri_rdf_first,X2,X3)|~iext(uri_owl_oneOf,X1,X2))).
% 0.22/0.39 cnf(i_0_10, plain, (icext(uri_owl_FunctionalProperty,X1)|iext(X1,esk2_1(X1),esk3_1(X1))|~ip(X1))).
% 0.22/0.39 cnf(i_0_9, plain, (icext(uri_owl_FunctionalProperty,X1)|iext(X1,esk2_1(X1),esk4_1(X1))|~ip(X1))).
% 0.22/0.39 cnf(i_0_11, plain, (X1=X2|~icext(uri_owl_FunctionalProperty,X3)|~iext(X3,X4,X2)|~iext(X3,X4,X1))).
% 0.22/0.39 cnf(i_0_6, plain, (X1=X2|~icext(X3,X1)|~iext(uri_rdf_rest,X4,uri_rdf_nil)|~iext(uri_rdf_first,X4,X2)|~iext(uri_owl_oneOf,X3,X4))).
% 0.22/0.39 cnf(i_0_5, plain, (icext(X1,X2)|~iext(uri_rdf_rest,X3,uri_rdf_nil)|~iext(uri_rdf_first,X3,X2)|~iext(uri_owl_oneOf,X1,X3))).
% 0.22/0.39 cnf(i_0_3, plain, (esk1_3(X1,X2,X3)=X3|icext(X1,esk1_3(X1,X2,X3))|iext(uri_owl_oneOf,X1,X2)|~ic(X1)|~iext(uri_rdf_rest,X2,uri_rdf_nil)|~iext(uri_rdf_first,X2,X3))).
% 0.22/0.39 cnf(i_0_4, plain, (iext(uri_owl_oneOf,X1,X2)|esk1_3(X1,X2,X3)!=X3|~ic(X1)|~icext(X1,esk1_3(X1,X2,X3))|~iext(uri_rdf_rest,X2,uri_rdf_nil)|~iext(uri_rdf_first,X2,X3))).
% 0.22/0.39 cnf(i_0_123, plain, (X32=X32)).
% 0.22/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.22/0.39 # Begin printing tableau
% 0.22/0.39 # Found 7 steps
% 0.22/0.39 cnf(i_0_21, plain, (iext(uri_rdf_type,uri_ex_w,esk5_0)), inference(start_rule)).
% 0.22/0.39 cnf(i_0_131, plain, (iext(uri_rdf_type,uri_ex_w,esk5_0)), inference(extension_rule, [i_0_127])).
% 0.22/0.39 cnf(i_0_244, plain, ($false), inference(closure_rule, [i_0_123])).
% 0.22/0.39 cnf(i_0_245, plain, ($false), inference(closure_rule, [i_0_123])).
% 0.22/0.39 cnf(i_0_243, plain, (iext(uri_rdf_type,uri_ex_w,esk5_0)), inference(extension_rule, [i_0_2])).
% 0.22/0.39 cnf(i_0_246, plain, ($false), inference(closure_rule, [i_0_123])).
% 0.22/0.39 cnf(i_0_264, plain, (icext(esk5_0,uri_ex_w)), inference(etableau_closure_rule, [i_0_264, ...])).
% 0.22/0.39 # End printing tableau
% 0.22/0.39 # SZS output end
% 0.22/0.39 # Branches closed with saturation will be marked with an "s"
% 0.22/0.39 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.39 # Begin clausification derivation
% 0.22/0.39
% 0.22/0.39 # End clausification derivation
% 0.22/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.22/0.39 cnf(i_0_21, plain, (iext(uri_rdf_type,uri_ex_w,esk5_0))).
% 0.22/0.39 cnf(i_0_18, plain, (iext(uri_rdf_first,esk6_0,uri_ex_u))).
% 0.22/0.39 cnf(i_0_17, plain, (iext(uri_rdf_first,esk6_0,uri_ex_v))).
% 0.22/0.39 cnf(i_0_22, plain, (iext(uri_rdf_type,uri_rdf_first,uri_owl_FunctionalProperty))).
% 0.22/0.39 cnf(i_0_13, plain, (iext(uri_owl_sameAs,X1,X1))).
% 0.22/0.39 cnf(i_0_20, plain, (iext(uri_rdf_type,esk5_0,uri_owl_Class))).
% 0.22/0.39 cnf(i_0_16, plain, (iext(uri_rdf_rest,esk6_0,uri_rdf_nil))).
% 0.22/0.39 cnf(i_0_19, plain, (iext(uri_owl_oneOf,esk5_0,esk6_0))).
% 0.22/0.39 cnf(i_0_15, negated_conjecture, (~iext(uri_owl_sameAs,uri_ex_w,uri_ex_u)|~iext(uri_owl_sameAs,uri_ex_w,uri_ex_v))).
% 0.22/0.39 cnf(i_0_14, plain, (X1=X2|~iext(uri_owl_sameAs,X1,X2))).
% 0.22/0.39 cnf(i_0_12, plain, (ip(X1)|~icext(uri_owl_FunctionalProperty,X1))).
% 0.22/0.39 cnf(i_0_1, plain, (iext(uri_rdf_type,X1,X2)|~icext(X2,X1))).
% 0.22/0.39 cnf(i_0_2, plain, (icext(X1,X2)|~iext(uri_rdf_type,X2,X1))).
% 0.22/0.39 cnf(i_0_8, plain, (icext(uri_owl_FunctionalProperty,X1)|esk4_1(X1)!=esk3_1(X1)|~ip(X1))).
% 0.22/0.39 cnf(i_0_7, plain, (ic(X1)|~iext(uri_rdf_rest,X2,uri_rdf_nil)|~iext(uri_rdf_first,X2,X3)|~iext(uri_owl_oneOf,X1,X2))).
% 0.22/0.39 cnf(i_0_10, plain, (icext(uri_owl_FunctionalProperty,X1)|iext(X1,esk2_1(X1),esk3_1(X1))|~ip(X1))).
% 0.22/0.39 cnf(i_0_9, plain, (icext(uri_owl_FunctionalProperty,X1)|iext(X1,esk2_1(X1),esk4_1(X1))|~ip(X1))).
% 0.22/0.39 cnf(i_0_11, plain, (X1=X2|~icext(uri_owl_FunctionalProperty,X3)|~iext(X3,X4,X2)|~iext(X3,X4,X1))).
% 0.22/0.39 cnf(i_0_6, plain, (X1=X2|~icext(X3,X1)|~iext(uri_rdf_rest,X4,uri_rdf_nil)|~iext(uri_rdf_first,X4,X2)|~iext(uri_owl_oneOf,X3,X4))).
% 0.22/0.39 cnf(i_0_5, plain, (icext(X1,X2)|~iext(uri_rdf_rest,X3,uri_rdf_nil)|~iext(uri_rdf_first,X3,X2)|~iext(uri_owl_oneOf,X1,X3))).
% 0.22/0.39 cnf(i_0_3, plain, (esk1_3(X1,X2,X3)=X3|icext(X1,esk1_3(X1,X2,X3))|iext(uri_owl_oneOf,X1,X2)|~ic(X1)|~iext(uri_rdf_rest,X2,uri_rdf_nil)|~iext(uri_rdf_first,X2,X3))).
% 0.22/0.39 cnf(i_0_4, plain, (iext(uri_owl_oneOf,X1,X2)|esk1_3(X1,X2,X3)!=X3|~ic(X1)|~icext(X1,esk1_3(X1,X2,X3))|~iext(uri_rdf_rest,X2,uri_rdf_nil)|~iext(uri_rdf_first,X2,X3))).
% 0.22/0.39 cnf(i_0_123, plain, (X32=X32)).
% 0.22/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.22/0.39 # Begin printing tableau
% 0.22/0.39 # Found 7 steps
% 0.22/0.39 cnf(i_0_21, plain, (iext(uri_rdf_type,uri_ex_w,esk5_0)), inference(start_rule)).
% 0.22/0.39 cnf(i_0_131, plain, (iext(uri_rdf_type,uri_ex_w,esk5_0)), inference(extension_rule, [i_0_2])).
% 0.22/0.39 cnf(i_0_194, plain, (icext(esk5_0,uri_ex_w)), inference(extension_rule, [i_0_6])).
% 0.22/0.39 cnf(i_0_285, plain, (~iext(uri_rdf_rest,esk6_0,uri_rdf_nil)), inference(closure_rule, [i_0_16])).
% 0.22/0.39 cnf(i_0_286, plain, (~iext(uri_rdf_first,esk6_0,uri_ex_u)), inference(closure_rule, [i_0_18])).
% 0.22/0.39 cnf(i_0_287, plain, (~iext(uri_owl_oneOf,esk5_0,esk6_0)), inference(closure_rule, [i_0_19])).
% 0.22/0.39 cnf(i_0_283, plain, (uri_ex_w=uri_ex_u), inference(etableau_closure_rule, [i_0_283, ...])).
% 0.22/0.39 # End printing tableau
% 0.22/0.39 # SZS output end
% 0.22/0.39 # Branches closed with saturation will be marked with an "s"
% 0.22/0.39 # Child (32046) has found a proof.
% 0.22/0.39
% 0.22/0.39 # Proof search is over...
% 0.22/0.39 # Freeing feature tree
%------------------------------------------------------------------------------