TSTP Solution File: SWB004+2 by Etableau---0.67

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : SWB004+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 : 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  : 600s
% DateTime : Tue Jul 19 19:02:20 EDT 2022

% Result   : Theorem 0.20s 0.39s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem  : SWB004+2 : TPTP v8.1.0. Released v5.2.0.
% 0.08/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 : 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  : 600
% 0.13/0.34  % DateTime : Wed Jun  1 11:38:37 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: 26 Number of unprocessed: 26
% 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  # 26 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 5 unit axioms.
% 0.13/0.37  # 1 start rule tableaux created.
% 0.13/0.37  # 21 extension rule candidate clauses
% 0.13/0.37  # 5 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  # Returning from population with 8 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.37  # We now have 8 tableaux to operate on
% 0.20/0.39  # There were 2 total branch saturation attempts.
% 0.20/0.39  # There were 0 of these attempts blocked.
% 0.20/0.39  # There were 0 deferred branch saturation attempts.
% 0.20/0.39  # There were 0 free duplicated saturations.
% 0.20/0.39  # There were 2 total successful branch saturations.
% 0.20/0.39  # There were 0 successful branch saturations in interreduction.
% 0.20/0.39  # There were 0 successful branch saturations on the branch.
% 0.20/0.39  # There were 2 successful branch saturations after the branch.
% 0.20/0.39  # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.39  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.39  # Begin clausification derivation
% 0.20/0.39  
% 0.20/0.39  # End clausification derivation
% 0.20/0.39  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.39  cnf(i_0_5, plain, (ic(uri_owl_Class))).
% 0.20/0.39  cnf(i_0_8, plain, (ic(uri_rdfs_Class))).
% 0.20/0.39  cnf(i_0_11, plain, (ic(uri_rdfs_Datatype))).
% 0.20/0.39  cnf(i_0_14, plain, (ic(uri_owl_Thing))).
% 0.20/0.39  cnf(i_0_15, plain, (icext(uri_owl_Thing,X1))).
% 0.20/0.39  cnf(i_0_28, negated_conjecture, (~iext(uri_rdf_type,uri_owl_Class,uri_owl_Class)|~iext(uri_rdf_type,uri_owl_Class,uri_owl_Thing)|~iext(uri_rdfs_subClassOf,uri_owl_Class,uri_owl_Thing)|~iext(uri_rdfs_subClassOf,uri_rdfs_Datatype,uri_owl_Class)|~iext(uri_owl_equivalentClass,uri_owl_Class,uri_rdfs_Class))).
% 0.20/0.39  cnf(i_0_4, plain, (ic(X1)|~idc(X1))).
% 0.20/0.39  cnf(i_0_13, plain, (idc(X1)|~icext(uri_rdfs_Datatype,X1))).
% 0.20/0.39  cnf(i_0_7, plain, (ic(X1)|~icext(uri_owl_Class,X1))).
% 0.20/0.39  cnf(i_0_10, plain, (ic(X1)|~icext(uri_rdfs_Class,X1))).
% 0.20/0.39  cnf(i_0_6, plain, (icext(uri_owl_Class,X1)|~ic(X1))).
% 0.20/0.39  cnf(i_0_9, plain, (icext(uri_rdfs_Class,X1)|~ic(X1))).
% 0.20/0.39  cnf(i_0_12, plain, (icext(uri_rdfs_Datatype,X1)|~idc(X1))).
% 0.20/0.39  cnf(i_0_20, plain, (ic(X1)|~iext(uri_rdfs_subClassOf,X2,X1))).
% 0.20/0.39  cnf(i_0_21, plain, (ic(X1)|~iext(uri_rdfs_subClassOf,X1,X2))).
% 0.20/0.39  cnf(i_0_26, plain, (ic(X1)|~iext(uri_owl_equivalentClass,X2,X1))).
% 0.20/0.39  cnf(i_0_2, plain, (iext(uri_rdf_type,X1,X2)|~icext(X2,X1))).
% 0.20/0.39  cnf(i_0_27, plain, (ic(X1)|~iext(uri_owl_equivalentClass,X1,X2))).
% 0.20/0.39  cnf(i_0_3, plain, (icext(X1,X2)|~iext(uri_rdf_type,X2,X1))).
% 0.20/0.39  cnf(i_0_19, plain, (icext(X1,X2)|~icext(X3,X2)|~iext(uri_rdfs_subClassOf,X3,X1))).
% 0.20/0.39  cnf(i_0_24, plain, (icext(X1,X2)|~icext(X3,X2)|~iext(uri_owl_equivalentClass,X1,X3))).
% 0.20/0.39  cnf(i_0_25, plain, (icext(X1,X2)|~icext(X3,X2)|~iext(uri_owl_equivalentClass,X3,X1))).
% 0.20/0.39  cnf(i_0_18, plain, (icext(X1,esk1_2(X1,X2))|iext(uri_rdfs_subClassOf,X1,X2)|~ic(X2)|~ic(X1))).
% 0.20/0.39  cnf(i_0_17, plain, (iext(uri_rdfs_subClassOf,X1,X2)|~ic(X1)|~ic(X2)|~icext(X2,esk1_2(X1,X2)))).
% 0.20/0.39  cnf(i_0_23, plain, (iext(uri_owl_equivalentClass,X1,X2)|~ic(X2)|~ic(X1)|~icext(X2,esk2_2(X1,X2))|~icext(X1,esk2_2(X1,X2)))).
% 0.20/0.39  cnf(i_0_22, plain, (icext(X1,esk2_2(X1,X2))|icext(X2,esk2_2(X1,X2))|iext(uri_owl_equivalentClass,X1,X2)|~ic(X2)|~ic(X1))).
% 0.20/0.39  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.20/0.39  # Begin printing tableau
% 0.20/0.39  # Found 16 steps
% 0.20/0.39  cnf(i_0_28, negated_conjecture, (~iext(uri_rdf_type,uri_owl_Class,uri_owl_Class)|~iext(uri_rdf_type,uri_owl_Class,uri_owl_Thing)|~iext(uri_rdfs_subClassOf,uri_owl_Class,uri_owl_Thing)|~iext(uri_rdfs_subClassOf,uri_rdfs_Datatype,uri_owl_Class)|~iext(uri_owl_equivalentClass,uri_owl_Class,uri_rdfs_Class)), inference(start_rule)).
% 0.20/0.39  cnf(i_0_31, plain, (~iext(uri_rdfs_subClassOf,uri_owl_Class,uri_owl_Thing)), inference(extension_rule, [i_0_17])).
% 0.20/0.39  cnf(i_0_190, plain, (~ic(uri_owl_Class)), inference(closure_rule, [i_0_5])).
% 0.20/0.39  cnf(i_0_191, plain, (~ic(uri_owl_Thing)), inference(closure_rule, [i_0_14])).
% 0.20/0.39  cnf(i_0_192, plain, (~icext(uri_owl_Thing,esk1_2(uri_owl_Class,uri_owl_Thing))), inference(closure_rule, [i_0_15])).
% 0.20/0.39  cnf(i_0_29, plain, (~iext(uri_rdf_type,uri_owl_Class,uri_owl_Class)), inference(extension_rule, [i_0_2])).
% 0.20/0.39  cnf(i_0_345, plain, (~icext(uri_owl_Class,uri_owl_Class)), inference(extension_rule, [i_0_6])).
% 0.20/0.39  cnf(i_0_355, plain, (~ic(uri_owl_Class)), inference(closure_rule, [i_0_5])).
% 0.20/0.39  cnf(i_0_30, plain, (~iext(uri_rdf_type,uri_owl_Class,uri_owl_Thing)), inference(extension_rule, [i_0_2])).
% 0.20/0.39  cnf(i_0_411, plain, (~icext(uri_owl_Thing,uri_owl_Class)), inference(closure_rule, [i_0_15])).
% 0.20/0.39  cnf(i_0_32, plain, (~iext(uri_rdfs_subClassOf,uri_rdfs_Datatype,uri_owl_Class)), inference(extension_rule, [i_0_18])).
% 0.20/0.39  cnf(i_0_445, plain, (~ic(uri_owl_Class)), inference(closure_rule, [i_0_5])).
% 0.20/0.39  cnf(i_0_446, plain, (~ic(uri_rdfs_Datatype)), inference(closure_rule, [i_0_11])).
% 0.20/0.39  cnf(i_0_443, plain, (icext(uri_rdfs_Datatype,esk1_2(uri_rdfs_Datatype,uri_owl_Class))), inference(extension_rule, [i_0_13])).
% 0.20/0.39  cnf(i_0_33, plain, (~iext(uri_owl_equivalentClass,uri_owl_Class,uri_rdfs_Class)), inference(etableau_closure_rule, [i_0_33, ...])).
% 0.20/0.39  cnf(i_0_449, plain, (idc(esk1_2(uri_rdfs_Datatype,uri_owl_Class))), inference(etableau_closure_rule, [i_0_449, ...])).
% 0.20/0.39  # End printing tableau
% 0.20/0.39  # SZS output end
% 0.20/0.39  # Branches closed with saturation will be marked with an "s"
% 0.20/0.39  # Child (1297) has found a proof.
% 0.20/0.39  
% 0.20/0.39  # Proof search is over...
% 0.20/0.39  # Freeing feature tree
%------------------------------------------------------------------------------