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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : SWB005+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 : n032.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:21 EDT 2022

% Result   : Theorem 0.14s 0.32s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem  : SWB005+2 : TPTP v8.1.0. Released v5.2.0.
% 0.09/0.10  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.10/0.30  % Computer : n032.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit : 300
% 0.10/0.30  % WCLimit  : 600
% 0.10/0.30  % DateTime : Wed Jun  1 05:57:29 EDT 2022
% 0.10/0.30  % CPUTime  : 
% 0.14/0.32  # No SInE strategy applied
% 0.14/0.32  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.32  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.14/0.32  #
% 0.14/0.32  # Presaturation interreduction done
% 0.14/0.32  # Number of axioms: 11 Number of unprocessed: 11
% 0.14/0.32  # Tableaux proof search.
% 0.14/0.32  # APR header successfully linked.
% 0.14/0.32  # Hello from C++
% 0.14/0.32  # The folding up rule is enabled...
% 0.14/0.32  # Local unification is enabled...
% 0.14/0.32  # Any saturation attempts will use folding labels...
% 0.14/0.32  # 11 beginning clauses after preprocessing and clausification
% 0.14/0.32  # Creating start rules for all 1 conjectures.
% 0.14/0.32  # There are 1 start rule candidates:
% 0.14/0.32  # Found 3 unit axioms.
% 0.14/0.32  # 1 start rule tableaux created.
% 0.14/0.32  # 8 extension rule candidate clauses
% 0.14/0.32  # 3 unit axiom clauses
% 0.14/0.32  
% 0.14/0.32  # Requested 8, 32 cores available to the main process.
% 0.14/0.32  # There are not enough tableaux to fork, creating more from the initial 1
% 0.14/0.32  # Returning from population with 8 new_tableaux and 0 remaining starting tableaux.
% 0.14/0.32  # We now have 8 tableaux to operate on
% 0.14/0.32  # Ran out of tableaux, making start rules for all clauses
% 0.14/0.32  # There were 5 total branch saturation attempts.
% 0.14/0.32  # There were 0 of these attempts blocked.
% 0.14/0.32  # There were 0 deferred branch saturation attempts.
% 0.14/0.32  # There were 0 free duplicated saturations.
% 0.14/0.32  # There were 5 total successful branch saturations.
% 0.14/0.32  # There were 0 successful branch saturations in interreduction.
% 0.14/0.32  # There were 0 successful branch saturations on the branch.
% 0.14/0.32  # There were 5 successful branch saturations after the branch.
% 0.14/0.32  # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.32  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.32  # Begin clausification derivation
% 0.14/0.32  
% 0.14/0.32  # End clausification derivation
% 0.14/0.32  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.32  cnf(i_0_14, plain, (iext(uri_ex_p,uri_ex_s,uri_ex_o))).
% 0.14/0.32  cnf(i_0_8, plain, (icext(uri_rdfs_Resource,X1))).
% 0.14/0.32  cnf(i_0_9, plain, (icext(uri_owl_Thing,X1))).
% 0.14/0.32  cnf(i_0_13, negated_conjecture, (~iext(uri_rdf_type,uri_ex_s,uri_rdfs_Resource)|~iext(uri_rdf_type,uri_ex_s,uri_owl_Thing)|~iext(uri_rdf_type,uri_ex_p,uri_rdf_Property)|~iext(uri_rdf_type,uri_ex_p,uri_rdfs_Resource)|~iext(uri_rdf_type,uri_ex_p,uri_owl_Thing)|~iext(uri_rdf_type,uri_ex_p,uri_owl_ObjectProperty)|~iext(uri_rdf_type,uri_ex_o,uri_rdfs_Resource)|~iext(uri_rdf_type,uri_ex_o,uri_owl_Thing))).
% 0.14/0.32  cnf(i_0_3, plain, (iext(uri_rdf_type,X1,uri_rdf_Property)|~ip(X1))).
% 0.14/0.32  cnf(i_0_11, plain, (icext(uri_owl_ObjectProperty,X1)|~ip(X1))).
% 0.14/0.32  cnf(i_0_12, plain, (ip(X1)|~icext(uri_owl_ObjectProperty,X1))).
% 0.14/0.32  cnf(i_0_4, plain, (ip(X1)|~iext(uri_rdf_type,X1,uri_rdf_Property))).
% 0.14/0.32  cnf(i_0_2, plain, (ip(X1)|~iext(X1,X2,X3))).
% 0.14/0.32  cnf(i_0_5, plain, (iext(uri_rdf_type,X1,X2)|~icext(X2,X1))).
% 0.14/0.32  cnf(i_0_6, plain, (icext(X1,X2)|~iext(uri_rdf_type,X2,X1))).
% 0.14/0.32  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.14/0.32  # Begin printing tableau
% 0.14/0.32  # Found 14 steps
% 0.14/0.32  cnf(i_0_13, negated_conjecture, (~iext(uri_rdf_type,uri_ex_s,uri_rdfs_Resource)|~iext(uri_rdf_type,uri_ex_s,uri_owl_Thing)|~iext(uri_rdf_type,uri_ex_p,uri_rdf_Property)|~iext(uri_rdf_type,uri_ex_p,uri_rdfs_Resource)|~iext(uri_rdf_type,uri_ex_p,uri_owl_Thing)|~iext(uri_rdf_type,uri_ex_p,uri_owl_ObjectProperty)|~iext(uri_rdf_type,uri_ex_o,uri_rdfs_Resource)|~iext(uri_rdf_type,uri_ex_o,uri_owl_Thing)), inference(start_rule)).
% 0.14/0.32  cnf(i_0_19, plain, (~iext(uri_rdf_type,uri_ex_p,uri_owl_Thing)), inference(extension_rule, [i_0_5])).
% 0.14/0.32  cnf(i_0_122, plain, (~icext(uri_owl_Thing,uri_ex_p)), inference(closure_rule, [i_0_9])).
% 0.14/0.32  cnf(i_0_15, plain, (~iext(uri_rdf_type,uri_ex_s,uri_rdfs_Resource)), inference(extension_rule, [i_0_5])).
% 0.14/0.32  cnf(i_0_188, plain, (~icext(uri_rdfs_Resource,uri_ex_s)), inference(closure_rule, [i_0_8])).
% 0.14/0.32  cnf(i_0_16, plain, (~iext(uri_rdf_type,uri_ex_s,uri_owl_Thing)), inference(extension_rule, [i_0_5])).
% 0.14/0.32  cnf(i_0_210, plain, (~icext(uri_owl_Thing,uri_ex_s)), inference(closure_rule, [i_0_9])).
% 0.14/0.32  cnf(i_0_17, plain, (~iext(uri_rdf_type,uri_ex_p,uri_rdf_Property)), inference(extension_rule, [i_0_3])).
% 0.14/0.32  cnf(i_0_212, plain, (~ip(uri_ex_p)), inference(extension_rule, [i_0_12])).
% 0.14/0.32  cnf(i_0_18, plain, (~iext(uri_rdf_type,uri_ex_p,uri_rdfs_Resource)), inference(etableau_closure_rule, [i_0_18, ...])).
% 0.14/0.32  cnf(i_0_20, plain, (~iext(uri_rdf_type,uri_ex_p,uri_owl_ObjectProperty)), inference(etableau_closure_rule, [i_0_20, ...])).
% 0.14/0.32  cnf(i_0_21, plain, (~iext(uri_rdf_type,uri_ex_o,uri_rdfs_Resource)), inference(etableau_closure_rule, [i_0_21, ...])).
% 0.14/0.32  cnf(i_0_22, plain, (~iext(uri_rdf_type,uri_ex_o,uri_owl_Thing)), inference(etableau_closure_rule, [i_0_22, ...])).
% 0.14/0.32  cnf(i_0_216, plain, (~icext(uri_owl_ObjectProperty,uri_ex_p)), inference(etableau_closure_rule, [i_0_216, ...])).
% 0.14/0.32  # End printing tableau
% 0.14/0.32  # SZS output end
% 0.14/0.32  # Branches closed with saturation will be marked with an "s"
% 0.14/0.33  # Child (18155) has found a proof.
% 0.14/0.33  
% 0.14/0.33  # Proof search is over...
% 0.14/0.33  # Freeing feature tree
%------------------------------------------------------------------------------