0.06/0.09	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.09	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.09/0.29	% Computer   : n003.cluster.edu
0.09/0.29	% Model      : x86_64 x86_64
0.09/0.29	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.09/0.29	% Memory     : 8042.1875MB
0.09/0.29	% OS         : Linux 3.10.0-693.el7.x86_64
0.09/0.29	% CPULimit   : 1200
0.09/0.29	% WCLimit    : 120
0.09/0.29	% DateTime   : Tue Jul 13 16:25:54 EDT 2021
0.09/0.29	% CPUTime    : 
0.09/0.32	# No SInE strategy applied
0.09/0.32	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
0.09/0.32	# and selection function SelectComplexExceptUniqMaxHorn.
0.09/0.32	#
0.09/0.32	# Presaturation interreduction done
0.09/0.32	# Number of axioms: 74 Number of unprocessed: 61
0.09/0.32	# Tableaux proof search.
0.09/0.32	# APR header successfully linked.
0.09/0.32	# Hello from C++
0.09/0.32	# The folding up rule is enabled...
0.09/0.32	# Local unification is enabled...
0.09/0.32	# Any saturation attempts will use folding labels...
0.09/0.32	# 61 beginning clauses after preprocessing and clausification
0.09/0.32	# Creating start rules for all 1 conjectures.
0.09/0.32	# There are 1 start rule candidates:
0.09/0.32	# Found 24 unit axioms.
0.09/0.32	# 1 start rule tableaux created.
0.09/0.32	# 37 extension rule candidate clauses
0.09/0.32	# 24 unit axiom clauses
0.09/0.32	
0.09/0.32	# Requested 8, 32 cores available to the main process.
0.09/0.32	# There are not enough tableaux to fork, creating more from the initial 1
0.09/0.32	# Creating equality axioms
0.09/0.32	# Ran out of tableaux, making start rules for all clauses
0.09/0.32	# Returning from population with 61 new_tableaux and 0 remaining starting tableaux.
0.09/0.32	# We now have 61 tableaux to operate on
0.13/0.44	# There were 1 total branch saturation attempts.
0.13/0.44	# There were 0 of these attempts blocked.
0.13/0.44	# There were 0 deferred branch saturation attempts.
0.13/0.44	# There were 0 free duplicated saturations.
0.13/0.44	# There were 1 total successful branch saturations.
0.13/0.44	# There were 0 successful branch saturations in interreduction.
0.13/0.44	# There were 0 successful branch saturations on the branch.
0.13/0.44	# There were 1 successful branch saturations after the branch.
0.13/0.44	# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
0.13/0.44	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.13/0.44	# Begin clausification derivation
0.13/0.44	
0.13/0.44	# End clausification derivation
0.13/0.44	# Begin listing active clauses obtained from FOF to CNF conversion
0.13/0.44	cnf(i_0_67, plain, (modus_ponens)).
0.13/0.44	cnf(i_0_65, plain, (r1)).
0.13/0.44	cnf(i_0_61, plain, (r3)).
0.13/0.44	cnf(i_0_63, plain, (r5)).
0.13/0.44	cnf(i_0_70, plain, (r4)).
0.13/0.44	cnf(i_0_66, plain, (r2)).
0.13/0.44	cnf(i_0_62, plain, (substitution_of_equivalents)).
0.13/0.44	cnf(i_0_69, plain, (op_implies_or)).
0.13/0.44	cnf(i_0_72, plain, (op_or)).
0.13/0.44	cnf(i_0_64, plain, (op_equiv)).
0.13/0.44	cnf(i_0_68, plain, (op_and)).
0.13/0.44	cnf(i_0_73, plain, (op_implies)).
0.13/0.44	cnf(i_0_56, plain, (or(not(X1),X2)=implies(X1,X2))).
0.13/0.44	cnf(i_0_50, plain, (is_a_theorem(implies(X1,or(X2,X1))))).
0.13/0.44	cnf(i_0_33, plain, (or_2)).
0.13/0.44	cnf(i_0_21, plain, (is_a_theorem(implies(or(X1,X1),X1)))).
0.13/0.44	cnf(i_0_58, plain, (not(and(not(X1),not(X2)))=or(X1,X2))).
0.13/0.44	cnf(i_0_60, plain, (not(implies(X1,not(X2)))=and(X1,X2))).
0.13/0.44	cnf(i_0_26, plain, (is_a_theorem(implies(or(X1,X2),or(X2,X1))))).
0.13/0.44	cnf(i_0_59, plain, (and(implies(X1,X2),implies(X2,X1))=equiv(X1,X2))).
0.13/0.44	cnf(i_0_37, plain, (is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))))).
0.13/0.44	cnf(i_0_40, plain, (is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))))).
0.13/0.44	cnf(i_0_74, negated_conjecture, (~cn3)).
0.13/0.44	cnf(i_0_51, plain, (~is_a_theorem(implies(implies(not(esk53_0),esk53_0),esk53_0)))).
0.13/0.44	cnf(i_0_53, plain, (X1=X2|~is_a_theorem(equiv(X1,X2)))).
0.13/0.44	cnf(i_0_31, plain, (kn1|~is_a_theorem(implies(esk31_0,and(esk31_0,esk31_0))))).
0.13/0.44	cnf(i_0_35, plain, (or_1|~is_a_theorem(implies(esk34_0,or(esk34_0,esk35_0))))).
0.13/0.44	cnf(i_0_47, plain, (implies_1|~is_a_theorem(implies(esk49_0,implies(esk50_0,esk49_0))))).
0.13/0.44	cnf(i_0_6, plain, (and_1|~is_a_theorem(implies(and(esk7_0,esk8_0),esk7_0)))).
0.13/0.44	cnf(i_0_48, plain, (is_a_theorem(implies(X1,implies(X2,X1)))|~implies_1)).
0.13/0.44	cnf(i_0_23, plain, (and_2|~is_a_theorem(implies(and(esk22_0,esk23_0),esk23_0)))).
0.13/0.44	cnf(i_0_42, plain, (kn2|~is_a_theorem(implies(and(esk42_0,esk43_0),esk42_0)))).
0.13/0.44	cnf(i_0_9, plain, (is_a_theorem(X1)|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2))).
0.13/0.44	cnf(i_0_32, plain, (is_a_theorem(implies(X1,and(X1,X1)))|~kn1)).
0.13/0.44	cnf(i_0_14, plain, (cn2|~is_a_theorem(implies(esk13_0,implies(not(esk13_0),esk14_0))))).
0.13/0.44	cnf(i_0_16, plain, (equivalence_2|~is_a_theorem(implies(equiv(esk15_0,esk16_0),implies(esk16_0,esk15_0))))).
0.13/0.44	cnf(i_0_19, plain, (equivalence_1|~is_a_theorem(implies(equiv(esk19_0,esk20_0),implies(esk19_0,esk20_0))))).
0.13/0.44	cnf(i_0_57, plain, (not(and(X1,not(X2)))=implies(X1,X2)|~op_implies_and)).
0.13/0.44	cnf(i_0_27, plain, (and_3|~is_a_theorem(implies(esk26_0,implies(esk27_0,and(esk26_0,esk27_0)))))).
0.13/0.44	cnf(i_0_36, plain, (is_a_theorem(implies(X1,or(X1,X2)))|~or_1)).
0.13/0.44	cnf(i_0_24, plain, (is_a_theorem(implies(and(X1,X2),X2))|~and_2)).
0.13/0.44	cnf(i_0_5, plain, (is_a_theorem(implies(and(X1,X2),X1))|~and_1)).
0.13/0.44	cnf(i_0_41, plain, (is_a_theorem(implies(and(X1,X2),X1))|~kn2)).
0.13/0.44	cnf(i_0_13, plain, (is_a_theorem(implies(X1,implies(not(X1),X2)))|~cn2)).
0.13/0.44	cnf(i_0_44, plain, (modus_tollens|~is_a_theorem(implies(implies(not(esk45_0),not(esk44_0)),implies(esk44_0,esk45_0))))).
0.13/0.44	cnf(i_0_8, plain, (implies_2|~is_a_theorem(implies(implies(esk9_0,implies(esk9_0,esk10_0)),implies(esk9_0,esk10_0))))).
0.13/0.44	cnf(i_0_15, plain, (is_a_theorem(implies(equiv(X1,X2),implies(X2,X1)))|~equivalence_2)).
0.13/0.44	cnf(i_0_20, plain, (is_a_theorem(implies(equiv(X1,X2),implies(X1,X2)))|~equivalence_1)).
0.13/0.44	cnf(i_0_28, plain, (is_a_theorem(implies(X1,implies(X2,and(X1,X2))))|~and_3)).
0.13/0.44	cnf(i_0_1, plain, (implies_3|~is_a_theorem(implies(implies(esk1_0,esk2_0),implies(implies(esk2_0,esk3_0),implies(esk1_0,esk3_0)))))).
0.13/0.44	cnf(i_0_4, plain, (cn1|~is_a_theorem(implies(implies(esk4_0,esk5_0),implies(implies(esk5_0,esk6_0),implies(esk4_0,esk6_0)))))).
0.13/0.44	cnf(i_0_43, plain, (is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1)))|~modus_tollens)).
0.13/0.44	cnf(i_0_17, plain, (equivalence_3|~is_a_theorem(implies(implies(esk17_0,esk18_0),implies(implies(esk18_0,esk17_0),equiv(esk17_0,esk18_0)))))).
0.13/0.44	cnf(i_0_46, plain, (or_3|~is_a_theorem(implies(implies(esk46_0,esk48_0),implies(implies(esk47_0,esk48_0),implies(or(esk46_0,esk47_0),esk48_0)))))).
0.13/0.44	cnf(i_0_7, plain, (is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))|~implies_2)).
0.13/0.44	cnf(i_0_29, plain, (kn3|~is_a_theorem(implies(implies(esk28_0,esk29_0),implies(not(and(esk29_0,esk30_0)),not(and(esk30_0,esk28_0))))))).
0.13/0.44	cnf(i_0_2, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))|~implies_3)).
0.13/0.44	cnf(i_0_3, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))|~cn1)).
0.13/0.44	cnf(i_0_18, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X1),equiv(X1,X2))))|~equivalence_3)).
0.13/0.44	cnf(i_0_45, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X2),implies(or(X1,X3),X2))))|~or_3)).
0.13/0.44	cnf(i_0_30, plain, (is_a_theorem(implies(implies(X1,X2),implies(not(and(X2,X3)),not(and(X3,X1)))))|~kn3)).
0.13/0.44	cnf(i_0_151, plain, (X127=X127)).
0.13/0.44	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.13/0.44	# Begin printing tableau
0.13/0.44	# Found 6 steps
0.13/0.44	cnf(i_0_56, plain, (or(not(X1),X2)=implies(X1,X2)), inference(start_rule)).
0.13/0.44	cnf(i_0_173, plain, (or(not(X1),X2)=implies(X1,X2)), inference(extension_rule, [i_0_154])).
0.13/0.44	cnf(i_0_540, plain, (or(not(X1),X2)!=implies(X1,X2)), inference(closure_rule, [i_0_56])).
0.13/0.44	cnf(i_0_538, plain, (or(not(X1),X2)=or(not(X1),X2)), inference(extension_rule, [i_0_155])).
0.13/0.44	cnf(i_0_622, plain, (or(not(X1),X2)!=implies(X1,X2)), inference(closure_rule, [i_0_56])).
0.13/0.44	cnf(i_0_620, plain, (implies(or(not(X1),X2),or(not(X1),X2))=implies(or(not(X1),X2),implies(X1,X2))), inference(etableau_closure_rule, [i_0_620, ...])).
0.13/0.44	# End printing tableau
0.13/0.44	# SZS output end
0.13/0.44	# Branches closed with saturation will be marked with an "s"
0.13/0.44	# Child (8541) has found a proof.
0.13/0.44	
0.13/0.44	# Proof search is over...
0.13/0.44	# Freeing feature tree
0.13/0.45	EOF