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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : SWB007+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 : n024.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:22 EDT 2022

% Result   : Theorem 0.12s 0.37s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SWB007+2 : TPTP v8.1.0. Released v5.2.0.
% 0.10/0.12  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33  % Computer : n024.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Wed Jun  1 03:01:36 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.12/0.36  # No SInE strategy applied
% 0.12/0.36  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.36  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.36  #
% 0.12/0.36  # Presaturation interreduction done
% 0.12/0.36  # Number of axioms: 7 Number of unprocessed: 7
% 0.12/0.36  # Tableaux proof search.
% 0.12/0.36  # APR header successfully linked.
% 0.12/0.36  # Hello from C++
% 0.12/0.36  # The folding up rule is enabled...
% 0.12/0.36  # Local unification is enabled...
% 0.12/0.36  # Any saturation attempts will use folding labels...
% 0.12/0.36  # 7 beginning clauses after preprocessing and clausification
% 0.12/0.36  # Creating start rules for all 1 conjectures.
% 0.12/0.36  # There are 1 start rule candidates:
% 0.12/0.36  # Found 5 unit axioms.
% 0.12/0.36  # 1 start rule tableaux created.
% 0.12/0.36  # 2 extension rule candidate clauses
% 0.12/0.36  # 5 unit axiom clauses
% 0.12/0.36  
% 0.12/0.36  # Requested 8, 32 cores available to the main process.
% 0.12/0.36  # There are not enough tableaux to fork, creating more from the initial 1
% 0.12/0.36  # Creating equality axioms
% 0.12/0.36  # Ran out of tableaux, making start rules for all clauses
% 0.12/0.36  # Returning from population with 8 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.36  # We now have 8 tableaux to operate on
% 0.12/0.37  # There were 1 total branch saturation attempts.
% 0.12/0.37  # There were 0 of these attempts blocked.
% 0.12/0.37  # There were 0 deferred branch saturation attempts.
% 0.12/0.37  # There were 0 free duplicated saturations.
% 0.12/0.37  # There were 1 total successful branch saturations.
% 0.12/0.37  # There were 0 successful branch saturations in interreduction.
% 0.12/0.37  # There were 0 successful branch saturations on the branch.
% 0.12/0.37  # There were 1 successful branch saturations after the branch.
% 0.12/0.37  # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37  # Begin clausification derivation
% 0.12/0.37  
% 0.12/0.37  # End clausification derivation
% 0.12/0.37  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.37  cnf(i_0_6, plain, (iext(uri_rdf_type,uri_ex_w,uri_ex_c1))).
% 0.12/0.37  cnf(i_0_5, plain, (iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c1))).
% 0.12/0.37  cnf(i_0_4, plain, (iext(uri_rdfs_range,uri_ex_p,uri_ex_c1))).
% 0.12/0.37  cnf(i_0_7, plain, (iext(uri_owl_sameAs,uri_ex_c1,uri_ex_c2))).
% 0.12/0.37  cnf(i_0_1, plain, (iext(uri_owl_sameAs,X1,X1))).
% 0.12/0.37  cnf(i_0_3, negated_conjecture, (~iext(uri_rdf_type,uri_ex_w,uri_ex_c2)|~iext(uri_rdfs_subClassOf,uri_ex_c,uri_ex_c2)|~iext(uri_rdfs_range,uri_ex_p,uri_ex_c2))).
% 0.12/0.37  cnf(i_0_2, plain, (X1=X2|~iext(uri_owl_sameAs,X1,X2))).
% 0.12/0.37  cnf(i_0_27, plain, (X5=X5)).
% 0.12/0.37  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.12/0.37  # Begin printing tableau
% 0.12/0.37  # Found 7 steps
% 0.12/0.37  cnf(i_0_1, plain, (iext(uri_owl_sameAs,uri_rdf_type,uri_rdf_type)), inference(start_rule)).
% 0.12/0.37  cnf(i_0_36, plain, (iext(uri_owl_sameAs,uri_rdf_type,uri_rdf_type)), inference(extension_rule, [i_0_2])).
% 0.12/0.37  cnf(i_0_60, plain, (uri_rdf_type=uri_rdf_type), inference(extension_rule, [i_0_31])).
% 0.12/0.37  cnf(i_0_74, plain, ($false), inference(closure_rule, [i_0_27])).
% 0.12/0.37  cnf(i_0_75, plain, ($false), inference(closure_rule, [i_0_27])).
% 0.12/0.37  cnf(i_0_76, plain, (~iext(uri_rdf_type,uri_ex_w,uri_ex_c1)), inference(closure_rule, [i_0_6])).
% 0.12/0.37  cnf(i_0_72, plain, (iext(uri_rdf_type,uri_ex_w,uri_ex_c1)), inference(etableau_closure_rule, [i_0_72, ...])).
% 0.12/0.37  # End printing tableau
% 0.12/0.37  # SZS output end
% 0.12/0.37  # Branches closed with saturation will be marked with an "s"
% 0.12/0.37  # Child (17965) has found a proof.
% 0.12/0.37  
% 0.12/0.37  # Proof search is over...
% 0.12/0.37  # Freeing feature tree
%------------------------------------------------------------------------------