0.07/0.10	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/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   : 1200
0.10/0.30	% WCLimit    : 120
0.10/0.30	% DateTime   : Tue Jul 13 16:29:03 EDT 2021
0.10/0.30	% CPUTime    : 
0.15/0.34	# No SInE strategy applied
0.15/0.34	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
0.15/0.34	# and selection function SelectComplexExceptUniqMaxHorn.
0.15/0.34	#
0.15/0.34	# Presaturation interreduction done
0.15/0.34	# Number of axioms: 72 Number of unprocessed: 60
0.15/0.34	# Tableaux proof search.
0.15/0.34	# APR header successfully linked.
0.15/0.34	# Hello from C++
0.15/0.34	# The folding up rule is enabled...
0.15/0.34	# Local unification is enabled...
0.15/0.34	# Any saturation attempts will use folding labels...
0.15/0.34	# 60 beginning clauses after preprocessing and clausification
0.15/0.34	# Creating start rules for all 1 conjectures.
0.15/0.34	# There are 1 start rule candidates:
0.15/0.34	# Found 18 unit axioms.
0.15/0.34	# 1 start rule tableaux created.
0.15/0.34	# 42 extension rule candidate clauses
0.15/0.34	# 18 unit axiom clauses
0.15/0.34	
0.15/0.34	# Requested 8, 32 cores available to the main process.
0.15/0.34	# There are not enough tableaux to fork, creating more from the initial 1
0.15/0.34	# Creating equality axioms
0.15/0.34	# Ran out of tableaux, making start rules for all clauses
0.15/0.34	# Returning from population with 60 new_tableaux and 0 remaining starting tableaux.
0.15/0.34	# We now have 60 tableaux to operate on
2.82/0.69	# There were 1 total branch saturation attempts.
2.82/0.69	# There were 0 of these attempts blocked.
2.82/0.69	# There were 0 deferred branch saturation attempts.
2.82/0.69	# There were 0 free duplicated saturations.
2.82/0.69	# There were 1 total successful branch saturations.
2.82/0.69	# There were 0 successful branch saturations in interreduction.
2.82/0.69	# There were 0 successful branch saturations on the branch.
2.82/0.69	# There were 1 successful branch saturations after the branch.
2.82/0.69	# SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
2.82/0.69	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
2.82/0.69	# Begin clausification derivation
2.82/0.69	
2.82/0.69	# End clausification derivation
2.82/0.69	# Begin listing active clauses obtained from FOF to CNF conversion
2.82/0.69	cnf(i_0_63, plain, (modus_ponens)).
2.82/0.69	cnf(i_0_67, plain, (kn3)).
2.82/0.69	cnf(i_0_65, plain, (kn1)).
2.82/0.69	cnf(i_0_66, plain, (kn2)).
2.82/0.69	cnf(i_0_61, plain, (substitution_of_equivalents)).
2.82/0.69	cnf(i_0_62, plain, (op_implies_and)).
2.82/0.69	cnf(i_0_64, plain, (op_or)).
2.82/0.69	cnf(i_0_68, plain, (op_equiv)).
2.82/0.69	cnf(i_0_71, plain, (op_implies)).
2.82/0.69	cnf(i_0_57, plain, (not(and(X1,not(X2)))=implies(X1,X2))).
2.82/0.69	cnf(i_0_32, plain, (is_a_theorem(implies(X1,and(X1,X1))))).
2.82/0.69	cnf(i_0_58, plain, (implies(not(X1),X2)=or(X1,X2))).
2.82/0.69	cnf(i_0_41, plain, (is_a_theorem(implies(and(X1,X2),X1)))).
2.82/0.69	cnf(i_0_6, plain, (and_1)).
2.82/0.69	cnf(i_0_59, plain, (and(implies(X1,X2),implies(X2,X1))=equiv(X1,X2))).
2.82/0.69	cnf(i_0_30, plain, (is_a_theorem(implies(implies(X1,X2),or(and(X2,X3),not(and(X3,X1))))))).
2.82/0.69	cnf(i_0_69, negated_conjecture, (~cn2)).
2.82/0.69	cnf(i_0_14, plain, (~is_a_theorem(implies(esk13_0,or(esk13_0,esk14_0))))).
2.82/0.69	cnf(i_0_53, plain, (X1=X2|~is_a_theorem(equiv(X1,X2)))).
2.82/0.69	cnf(i_0_33, plain, (or_2|~is_a_theorem(implies(esk33_0,or(esk32_0,esk33_0))))).
2.82/0.69	cnf(i_0_35, plain, (or_1|~is_a_theorem(implies(esk34_0,or(esk34_0,esk35_0))))).
2.82/0.69	cnf(i_0_56, plain, (or(not(X1),X2)=implies(X1,X2)|~op_implies_or)).
2.82/0.69	cnf(i_0_47, plain, (implies_1|~is_a_theorem(implies(esk49_0,implies(esk50_0,esk49_0))))).
2.82/0.69	cnf(i_0_49, plain, (r2|~is_a_theorem(implies(esk52_0,or(esk51_0,esk52_0))))).
2.82/0.69	cnf(i_0_22, plain, (r1|~is_a_theorem(implies(or(esk21_0,esk21_0),esk21_0)))).
2.82/0.69	cnf(i_0_48, plain, (is_a_theorem(implies(X1,implies(X2,X1)))|~implies_1)).
2.82/0.69	cnf(i_0_23, plain, (and_2|~is_a_theorem(implies(and(esk22_0,esk23_0),esk23_0)))).
2.82/0.69	cnf(i_0_9, plain, (is_a_theorem(X1)|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2))).
2.82/0.69	cnf(i_0_16, plain, (equivalence_2|~is_a_theorem(implies(equiv(esk15_0,esk16_0),implies(esk16_0,esk15_0))))).
2.82/0.69	cnf(i_0_19, plain, (equivalence_1|~is_a_theorem(implies(equiv(esk19_0,esk20_0),implies(esk19_0,esk20_0))))).
2.82/0.69	cnf(i_0_25, plain, (r3|~is_a_theorem(implies(or(esk24_0,esk25_0),or(esk25_0,esk24_0))))).
2.82/0.69	cnf(i_0_27, plain, (and_3|~is_a_theorem(implies(esk26_0,implies(esk27_0,and(esk26_0,esk27_0)))))).
2.82/0.69	cnf(i_0_34, plain, (is_a_theorem(implies(X1,or(X2,X1)))|~or_2)).
2.82/0.69	cnf(i_0_50, plain, (is_a_theorem(implies(X1,or(X2,X1)))|~r2)).
2.82/0.69	cnf(i_0_36, plain, (is_a_theorem(implies(X1,or(X1,X2)))|~or_1)).
2.82/0.69	cnf(i_0_24, plain, (is_a_theorem(implies(and(X1,X2),X2))|~and_2)).
2.82/0.69	cnf(i_0_51, plain, (cn3|~is_a_theorem(implies(or(esk53_0,esk53_0),esk53_0)))).
2.82/0.69	cnf(i_0_21, plain, (is_a_theorem(implies(or(X1,X1),X1))|~r1)).
2.82/0.69	cnf(i_0_60, plain, (not(or(not(X1),not(X2)))=and(X1,X2)|~op_and)).
2.82/0.69	cnf(i_0_44, plain, (modus_tollens|~is_a_theorem(implies(or(esk45_0,not(esk44_0)),implies(esk44_0,esk45_0))))).
2.82/0.69	cnf(i_0_8, plain, (implies_2|~is_a_theorem(implies(implies(esk9_0,implies(esk9_0,esk10_0)),implies(esk9_0,esk10_0))))).
2.82/0.69	cnf(i_0_52, plain, (is_a_theorem(implies(or(X1,X1),X1))|~cn3)).
2.82/0.69	cnf(i_0_15, plain, (is_a_theorem(implies(equiv(X1,X2),implies(X2,X1)))|~equivalence_2)).
2.82/0.69	cnf(i_0_20, plain, (is_a_theorem(implies(equiv(X1,X2),implies(X1,X2)))|~equivalence_1)).
2.82/0.69	cnf(i_0_26, plain, (is_a_theorem(implies(or(X1,X2),or(X2,X1)))|~r3)).
2.82/0.69	cnf(i_0_28, plain, (is_a_theorem(implies(X1,implies(X2,and(X1,X2))))|~and_3)).
2.82/0.69	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)))))).
2.82/0.69	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)))))).
2.82/0.69	cnf(i_0_43, plain, (is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1)))|~modus_tollens)).
2.82/0.69	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)))))).
2.82/0.69	cnf(i_0_38, plain, (r5|~is_a_theorem(implies(implies(esk37_0,esk38_0),implies(or(esk36_0,esk37_0),or(esk36_0,esk38_0)))))).
2.82/0.69	cnf(i_0_39, plain, (r4|~is_a_theorem(implies(or(esk39_0,or(esk40_0,esk41_0)),or(esk40_0,or(esk39_0,esk41_0)))))).
2.82/0.69	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)))))).
2.82/0.69	cnf(i_0_7, plain, (is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))|~implies_2)).
2.82/0.69	cnf(i_0_2, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))|~implies_3)).
2.82/0.69	cnf(i_0_3, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))|~cn1)).
2.82/0.69	cnf(i_0_18, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X1),equiv(X1,X2))))|~equivalence_3)).
2.82/0.69	cnf(i_0_37, plain, (is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))|~r5)).
2.82/0.69	cnf(i_0_40, plain, (is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))|~r4)).
2.82/0.69	cnf(i_0_45, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X2),implies(or(X1,X3),X2))))|~or_3)).
2.82/0.69	cnf(i_0_159, plain, (X127=X127)).
2.82/0.69	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
2.82/0.69	# Begin printing tableau
2.82/0.69	# Found 6 steps
2.82/0.69	cnf(i_0_30, plain, (is_a_theorem(implies(implies(X7,and(X7,X7)),or(and(and(X7,X7),X5),not(and(X5,X7)))))), inference(start_rule)).
2.82/0.69	cnf(i_0_184, plain, (is_a_theorem(implies(implies(X7,and(X7,X7)),or(and(and(X7,X7),X5),not(and(X5,X7)))))), inference(extension_rule, [i_0_9])).
2.82/0.69	cnf(i_0_511, plain, (~is_a_theorem(implies(X7,and(X7,X7)))), inference(closure_rule, [i_0_32])).
2.82/0.69	cnf(i_0_509, plain, (is_a_theorem(or(and(and(X7,X7),X5),not(and(X5,X7))))), inference(extension_rule, [i_0_164])).
2.82/0.69	cnf(i_0_604, plain, (is_a_theorem(implies(esk13_0,or(esk13_0,esk14_0)))), inference(closure_rule, [i_0_14])).
2.82/0.69	cnf(i_0_605, plain, (or(and(and(X7,X7),X5),not(and(X5,X7)))!=implies(esk13_0,or(esk13_0,esk14_0))), inference(etableau_closure_rule, [i_0_605, ...])).
2.82/0.69	# End printing tableau
2.82/0.69	# SZS output end
2.82/0.69	# Branches closed with saturation will be marked with an "s"
2.82/0.70	# Child (18556) has found a proof.
2.82/0.70	
2.82/0.70	# Proof search is over...
2.82/0.70	# Freeing feature tree
2.82/0.70	EOF