0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.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.14/0.34	% Computer   : n025.cluster.edu
0.14/0.34	% Model      : x86_64 x86_64
0.14/0.34	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.34	% Memory     : 8042.1875MB
0.14/0.34	% OS         : Linux 3.10.0-693.el7.x86_64
0.14/0.34	% CPULimit   : 1200
0.14/0.34	% WCLimit    : 120
0.14/0.34	% DateTime   : Tue Jul 13 17:32:42 EDT 2021
0.14/0.34	% CPUTime    : 
0.14/0.37	# No SInE strategy applied
0.14/0.37	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S032N
0.14/0.37	# and selection function SelectUnlessUniqMax.
0.14/0.37	#
0.14/0.37	# Presaturation interreduction done
0.14/0.37	# Number of axioms: 29 Number of unprocessed: 29
0.14/0.37	# Tableaux proof search.
0.14/0.37	# APR header successfully linked.
0.14/0.37	# Hello from C++
0.14/0.38	# The folding up rule is enabled...
0.14/0.38	# Local unification is enabled...
0.14/0.38	# Any saturation attempts will use folding labels...
0.14/0.38	# 29 beginning clauses after preprocessing and clausification
0.14/0.38	# Creating start rules for all 1 conjectures.
0.14/0.38	# There are 1 start rule candidates:
0.14/0.38	# Found 8 unit axioms.
0.14/0.38	# 1 start rule tableaux created.
0.14/0.38	# 21 extension rule candidate clauses
0.14/0.38	# 8 unit axiom clauses
0.14/0.38	
0.14/0.38	# Requested 8, 32 cores available to the main process.
0.14/0.38	# There are not enough tableaux to fork, creating more from the initial 1
0.14/0.38	# Returning from population with 8 new_tableaux and 0 remaining starting tableaux.
0.14/0.38	# We now have 8 tableaux to operate on
0.20/0.42	# There were 5 total branch saturation attempts.
0.20/0.42	# There were 0 of these attempts blocked.
0.20/0.42	# There were 0 deferred branch saturation attempts.
0.20/0.42	# There were 0 free duplicated saturations.
0.20/0.42	# There were 5 total successful branch saturations.
0.20/0.42	# There were 0 successful branch saturations in interreduction.
0.20/0.42	# There were 0 successful branch saturations on the branch.
0.20/0.42	# There were 5 successful branch saturations after the branch.
0.20/0.43	# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
0.20/0.43	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.20/0.43	# Begin clausification derivation
0.20/0.43	
0.20/0.43	# End clausification derivation
0.20/0.43	# Begin listing active clauses obtained from FOF to CNF conversion
0.20/0.43	cnf(i_0_20, plain, (iext(uri_rdf_type,uri_ex_s,esk3_0))).
0.20/0.43	cnf(i_0_13, plain, (iext(uri_rdf_type,uri_ex_p,uri_owl_ObjectProperty))).
0.20/0.43	cnf(i_0_17, plain, (iext(uri_rdf_first,esk6_0,uri_ex_o))).
0.20/0.43	cnf(i_0_14, plain, (iext(uri_owl_onProperty,esk3_0,uri_ex_p))).
0.20/0.43	cnf(i_0_16, plain, (iext(uri_rdf_rest,esk6_0,uri_rdf_nil))).
0.20/0.43	cnf(i_0_18, plain, (iext(uri_owl_oneOf,esk5_0,esk6_0))).
0.20/0.43	cnf(i_0_19, plain, (iext(uri_owl_allValuesFrom,esk3_0,esk4_0))).
0.20/0.43	cnf(i_0_15, plain, (iext(uri_owl_complementOf,esk4_0,esk5_0))).
0.20/0.43	cnf(i_0_7, negated_conjecture, (~iext(uri_rdf_type,X1,uri_owl_NegativePropertyAssertion)|~iext(uri_owl_sourceIndividual,X1,uri_ex_s)|~iext(uri_owl_targetIndividual,X1,uri_ex_o)|~iext(uri_owl_assertionProperty,X1,uri_ex_p))).
0.20/0.43	cnf(i_0_30, plain, (ip(X1)|~iext(uri_owl_onProperty,X2,X1))).
0.20/0.43	cnf(i_0_28, plain, (ic(X1)|~iext(uri_owl_complementOf,X2,X1))).
0.20/0.43	cnf(i_0_29, plain, (ic(X1)|~iext(uri_owl_complementOf,X1,X2))).
0.20/0.43	cnf(i_0_1, plain, (iext(uri_rdf_type,X1,X2)|~icext(X2,X1))).
0.20/0.43	cnf(i_0_25, plain, (icext(uri_owl_NegativePropertyAssertion,X1)|~iext(uri_owl_sourceIndividual,X1,X2))).
0.20/0.43	cnf(i_0_2, plain, (icext(X1,X2)|~iext(uri_rdf_type,X2,X1))).
0.20/0.43	cnf(i_0_31, plain, (icext(uri_owl_Restriction,X1)|~iext(uri_owl_onProperty,X1,X2))).
0.20/0.43	cnf(i_0_26, plain, (icext(X1,X2)|icext(X3,X2)|~iext(uri_owl_complementOf,X3,X1))).
0.20/0.43	cnf(i_0_6, plain, (iext(uri_owl_sourceIndividual,esk1_3(X1,X2,X3),X2)|iext(X1,X2,X3)|~ip(X1))).
0.20/0.43	cnf(i_0_27, plain, (~icext(X1,X2)|~icext(X3,X2)|~iext(uri_owl_complementOf,X3,X1))).
0.20/0.43	cnf(i_0_10, plain, (ic(X1)|~iext(uri_rdf_rest,X2,uri_rdf_nil)|~iext(uri_rdf_first,X2,X3)|~iext(uri_owl_oneOf,X1,X2))).
0.20/0.43	cnf(i_0_21, plain, (icext(X1,X2)|~icext(X3,esk7_4(X1,X4,X3,X2))|~iext(uri_owl_allValuesFrom,X1,X3)|~iext(uri_owl_onProperty,X1,X4))).
0.20/0.43	cnf(i_0_8, 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.20/0.43	cnf(i_0_5, plain, (iext(uri_owl_targetIndividual,esk1_3(X1,X2,X3),X3)|iext(X1,X2,X3)|~ip(X1))).
0.20/0.43	cnf(i_0_4, plain, (iext(uri_owl_assertionProperty,esk1_3(X1,X2,X3),X1)|iext(X1,X2,X3)|~ip(X1))).
0.20/0.43	cnf(i_0_9, 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.20/0.43	cnf(i_0_23, plain, (icext(X1,X2)|~icext(X3,X4)|~iext(uri_owl_allValuesFrom,X3,X1)|~iext(uri_owl_onProperty,X3,X5)|~iext(X5,X4,X2))).
0.20/0.43	cnf(i_0_11, plain, (esk2_3(X1,X2,X3)=X3|icext(X1,esk2_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.20/0.43	cnf(i_0_22, plain, (icext(X1,X2)|iext(X3,X2,esk7_4(X1,X3,X4,X2))|~iext(uri_owl_allValuesFrom,X1,X4)|~iext(uri_owl_onProperty,X1,X3))).
0.20/0.43	cnf(i_0_12, plain, (iext(uri_owl_oneOf,X1,X2)|esk2_3(X1,X2,X3)!=X3|~ic(X1)|~icext(X1,esk2_3(X1,X2,X3))|~iext(uri_rdf_rest,X2,uri_rdf_nil)|~iext(uri_rdf_first,X2,X3))).
0.20/0.43	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.20/0.43	# Begin printing tableau
0.20/0.43	# Found 10 steps
0.20/0.43	cnf(i_0_7, negated_conjecture, (~iext(uri_rdf_type,esk1_3(uri_owl_onProperty,uri_ex_s,uri_owl_sourceIndividual),uri_owl_NegativePropertyAssertion)|~iext(uri_owl_sourceIndividual,esk1_3(uri_owl_onProperty,uri_ex_s,uri_owl_sourceIndividual),uri_ex_s)|~iext(uri_owl_targetIndividual,esk1_3(uri_owl_onProperty,uri_ex_s,uri_owl_sourceIndividual),uri_ex_o)|~iext(uri_owl_assertionProperty,esk1_3(uri_owl_onProperty,uri_ex_s,uri_owl_sourceIndividual),uri_ex_p)), inference(start_rule)).
0.20/0.43	cnf(i_0_34, plain, (~iext(uri_owl_sourceIndividual,esk1_3(uri_owl_onProperty,uri_ex_s,uri_owl_sourceIndividual),uri_ex_s)), inference(extension_rule, [i_0_6])).
0.20/0.43	cnf(i_0_126, plain, (iext(uri_owl_onProperty,uri_ex_s,uri_owl_sourceIndividual)), inference(extension_rule, [i_0_30])).
0.20/0.43	cnf(i_0_179, plain, (ip(uri_owl_sourceIndividual)), inference(extension_rule, [i_0_6])).
0.20/0.43	cnf(i_0_197, plain, (iext(uri_owl_sourceIndividual,esk1_3(uri_owl_onProperty,uri_ex_s,uri_owl_sourceIndividual),uri_ex_s)), inference(closure_rule, [i_0_34])).
0.20/0.43	cnf(i_0_33, plain, (~iext(uri_rdf_type,esk1_3(uri_owl_onProperty,uri_ex_s,uri_owl_sourceIndividual),uri_owl_NegativePropertyAssertion)), inference(etableau_closure_rule, [i_0_33, ...])).
0.20/0.43	cnf(i_0_35, plain, (~iext(uri_owl_targetIndividual,esk1_3(uri_owl_onProperty,uri_ex_s,uri_owl_sourceIndividual),uri_ex_o)), inference(etableau_closure_rule, [i_0_35, ...])).
0.20/0.43	cnf(i_0_36, plain, (~iext(uri_owl_assertionProperty,esk1_3(uri_owl_onProperty,uri_ex_s,uri_owl_sourceIndividual),uri_ex_p)), inference(etableau_closure_rule, [i_0_36, ...])).
0.20/0.43	cnf(i_0_127, plain, (~ip(uri_owl_onProperty)), inference(etableau_closure_rule, [i_0_127, ...])).
0.20/0.43	cnf(i_0_196, plain, (iext(uri_owl_sourceIndividual,esk1_3(uri_owl_sourceIndividual,esk1_3(uri_owl_onProperty,uri_ex_s,uri_owl_sourceIndividual),uri_ex_s),esk1_3(uri_owl_onProperty,uri_ex_s,uri_owl_sourceIndividual))), inference(etableau_closure_rule, [i_0_196, ...])).
0.20/0.43	# End printing tableau
0.20/0.43	# SZS output end
0.20/0.43	# Branches closed with saturation will be marked with an "s"
0.20/0.43	# Child (11066) has found a proof.
0.20/0.43	
0.20/0.43	# Proof search is over...
0.20/0.43	# Freeing feature tree
0.20/0.43	EOF