0.02/0.07	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.02/0.07	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.06/0.26	% Computer   : n004.cluster.edu
0.06/0.26	% Model      : x86_64 x86_64
0.06/0.26	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.06/0.26	% Memory     : 8042.1875MB
0.06/0.26	% OS         : Linux 3.10.0-693.el7.x86_64
0.06/0.26	% CPULimit   : 1200
0.06/0.26	% WCLimit    : 120
0.06/0.26	% DateTime   : Tue Jul 13 16:19:38 EDT 2021
0.06/0.26	% CPUTime    : 
0.10/0.30	# No SInE strategy applied
0.10/0.30	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
0.10/0.30	# and selection function SelectComplexExceptUniqMaxHorn.
0.10/0.30	#
0.10/0.30	# Presaturation interreduction done
0.10/0.30	# Number of axioms: 135 Number of unprocessed: 117
0.10/0.30	# Tableaux proof search.
0.10/0.30	# APR header successfully linked.
0.10/0.30	# Hello from C++
0.10/0.31	# The folding up rule is enabled...
0.10/0.31	# Local unification is enabled...
0.10/0.31	# Any saturation attempts will use folding labels...
0.10/0.31	# 117 beginning clauses after preprocessing and clausification
0.10/0.31	# Creating start rules for all 1 conjectures.
0.10/0.31	# There are 1 start rule candidates:
0.10/0.31	# Found 29 unit axioms.
0.10/0.31	# 1 start rule tableaux created.
0.10/0.31	# 88 extension rule candidate clauses
0.10/0.31	# 29 unit axiom clauses
0.10/0.31	
0.10/0.31	# Requested 8, 32 cores available to the main process.
0.10/0.31	# There are not enough tableaux to fork, creating more from the initial 1
0.10/0.31	# Creating equality axioms
0.10/0.31	# Ran out of tableaux, making start rules for all clauses
0.10/0.31	# Returning from population with 117 new_tableaux and 0 remaining starting tableaux.
0.10/0.31	# We now have 117 tableaux to operate on
111.58/15.67	# There were 13 total branch saturation attempts.
111.58/15.67	# There were 0 of these attempts blocked.
111.58/15.67	# There were 0 deferred branch saturation attempts.
111.58/15.67	# There were 0 free duplicated saturations.
111.58/15.67	# There were 7 total successful branch saturations.
111.58/15.67	# There were 0 successful branch saturations in interreduction.
111.58/15.67	# There were 0 successful branch saturations on the branch.
111.58/15.67	# There were 7 successful branch saturations after the branch.
111.58/15.67	# SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
111.58/15.67	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
111.58/15.67	# Begin clausification derivation
111.58/15.67	
111.58/15.67	# End clausification derivation
111.58/15.67	# Begin listing active clauses obtained from FOF to CNF conversion
111.58/15.67	cnf(i_0_135, plain, (substitution_of_equivalents)).
111.58/15.67	cnf(i_0_132, plain, (op_implies_and)).
111.58/15.67	cnf(i_0_126, plain, (op_or)).
111.58/15.67	cnf(i_0_124, plain, (op_equiv)).
111.58/15.67	cnf(i_0_122, plain, (axiom_m3)).
111.58/15.67	cnf(i_0_130, plain, (modus_ponens_strict_implies)).
111.58/15.67	cnf(i_0_123, plain, (axiom_m1)).
111.58/15.67	cnf(i_0_118, plain, (adjunction)).
111.58/15.67	cnf(i_0_119, plain, (axiom_m2)).
111.58/15.67	cnf(i_0_117, plain, (substitution_strict_equiv)).
111.58/15.67	cnf(i_0_128, plain, (axiom_m5)).
111.58/15.67	cnf(i_0_129, plain, (axiom_m4)).
111.58/15.67	cnf(i_0_125, plain, (op_strict_equiv)).
111.58/15.67	cnf(i_0_127, plain, (op_strict_implies)).
111.58/15.67	cnf(i_0_121, plain, (op_possibly)).
111.58/15.67	cnf(i_0_120, plain, (op_implies)).
111.58/15.67	cnf(i_0_116, plain, (not(necessarily(not(X1)))=possibly(X1))).
111.58/15.67	cnf(i_0_114, plain, (necessarily(implies(X1,X2))=strict_implies(X1,X2))).
111.58/15.67	cnf(i_0_105, plain, (is_a_theorem(strict_implies(X1,and(X1,X1))))).
111.58/15.67	cnf(i_0_57, plain, (not(and(X1,not(X2)))=implies(X1,X2))).
111.58/15.67	cnf(i_0_88, plain, (is_a_theorem(strict_implies(and(X1,X2),X1)))).
111.58/15.67	cnf(i_0_58, plain, (implies(not(X1),X2)=or(X1,X2))).
111.58/15.67	cnf(i_0_82, plain, (is_a_theorem(strict_implies(and(X1,X2),and(X2,X1))))).
111.58/15.67	cnf(i_0_113, plain, (and(strict_implies(X1,X2),strict_implies(X2,X1))=strict_equiv(X1,X2))).
111.58/15.67	cnf(i_0_63, plain, (is_a_theorem(strict_implies(and(and(X1,X2),X3),and(X1,and(X2,X3)))))).
111.58/15.67	cnf(i_0_98, plain, (is_a_theorem(strict_implies(and(strict_implies(X1,X2),strict_implies(X2,X3)),strict_implies(X1,X3))))).
111.58/15.67	cnf(i_0_59, plain, (and(implies(X1,X2),implies(X2,X1))=equiv(X1,X2))).
111.58/15.67	cnf(i_0_131, negated_conjecture, (~or_1)).
111.58/15.67	cnf(i_0_35, plain, (~is_a_theorem(implies(esk34_0,or(esk34_0,esk35_0))))).
111.58/15.67	cnf(i_0_10, plain, (modus_ponens|~is_a_theorem(esk12_0))).
111.58/15.67	cnf(i_0_11, plain, (modus_ponens|is_a_theorem(esk11_0))).
111.58/15.67	cnf(i_0_103, plain, (necessitation|~is_a_theorem(necessarily(esk88_0)))).
111.58/15.67	cnf(i_0_104, plain, (necessitation|is_a_theorem(esk88_0))).
111.58/15.67	cnf(i_0_92, plain, (axiom_m6|~is_a_theorem(strict_implies(esk78_0,possibly(esk78_0))))).
111.58/15.67	cnf(i_0_109, plain, (axiom_M|~is_a_theorem(implies(necessarily(esk92_0),esk92_0)))).
111.58/15.67	cnf(i_0_102, plain, (is_a_theorem(necessarily(X1))|~necessitation|~is_a_theorem(X1))).
111.58/15.67	cnf(i_0_12, plain, (modus_ponens|is_a_theorem(implies(esk11_0,esk12_0)))).
111.58/15.67	cnf(i_0_70, plain, (axiom_B|~is_a_theorem(implies(esk63_0,necessarily(possibly(esk63_0)))))).
111.58/15.67	cnf(i_0_31, plain, (kn1|~is_a_theorem(implies(esk31_0,and(esk31_0,esk31_0))))).
111.58/15.67	cnf(i_0_33, plain, (or_2|~is_a_theorem(implies(esk33_0,or(esk32_0,esk33_0))))).
111.58/15.67	cnf(i_0_53, plain, (X1=X2|~is_a_theorem(equiv(X1,X2)))).
111.58/15.67	cnf(i_0_95, plain, (X1=X2|~is_a_theorem(strict_equiv(X1,X2)))).
111.58/15.67	cnf(i_0_47, plain, (implies_1|~is_a_theorem(implies(esk49_0,implies(esk50_0,esk49_0))))).
111.58/15.67	cnf(i_0_49, plain, (r2|~is_a_theorem(implies(esk52_0,or(esk51_0,esk52_0))))).
111.58/15.67	cnf(i_0_6, plain, (and_1|~is_a_theorem(implies(and(esk7_0,esk8_0),esk7_0)))).
111.58/15.67	cnf(i_0_22, plain, (r1|~is_a_theorem(implies(or(esk21_0,esk21_0),esk21_0)))).
111.58/15.67	cnf(i_0_23, plain, (and_2|~is_a_theorem(implies(and(esk22_0,esk23_0),esk23_0)))).
111.58/15.67	cnf(i_0_115, plain, (not(possibly(not(X1)))=necessarily(X1)|~op_necessarily)).
111.58/15.67	cnf(i_0_42, plain, (kn2|~is_a_theorem(implies(and(esk42_0,esk43_0),esk42_0)))).
111.58/15.67	cnf(i_0_9, plain, (is_a_theorem(X1)|~modus_ponens|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2))).
111.58/15.67	cnf(i_0_65, plain, (is_a_theorem(X1)|~is_a_theorem(strict_implies(X2,X1))|~is_a_theorem(X2))).
111.58/15.67	cnf(i_0_91, plain, (is_a_theorem(strict_implies(X1,possibly(X1)))|~axiom_m6)).
111.58/15.67	cnf(i_0_110, plain, (is_a_theorem(implies(necessarily(X1),X1))|~axiom_M)).
111.58/15.67	cnf(i_0_76, plain, (axiom_5|~is_a_theorem(implies(possibly(esk67_0),necessarily(possibly(esk67_0)))))).
111.58/15.67	cnf(i_0_78, plain, (axiom_m10|~is_a_theorem(strict_implies(possibly(esk68_0),necessarily(possibly(esk68_0)))))).
111.58/15.67	cnf(i_0_56, plain, (or(not(X1),X2)=implies(X1,X2)|~op_implies_or)).
111.58/15.67	cnf(i_0_79, plain, (axiom_s4|~is_a_theorem(strict_implies(necessarily(esk69_0),necessarily(necessarily(esk69_0)))))).
111.58/15.67	cnf(i_0_100, plain, (axiom_4|~is_a_theorem(implies(necessarily(esk87_0),necessarily(necessarily(esk87_0)))))).
111.58/15.67	cnf(i_0_72, plain, (axiom_m9|~is_a_theorem(strict_implies(possibly(possibly(esk64_0)),possibly(esk64_0))))).
111.58/15.67	cnf(i_0_69, plain, (is_a_theorem(implies(X1,necessarily(possibly(X1))))|~axiom_B)).
111.58/15.67	cnf(i_0_73, plain, (axiom_m7|~is_a_theorem(strict_implies(possibly(and(esk65_0,esk66_0)),esk65_0)))).
111.58/15.67	cnf(i_0_86, plain, (is_a_theorem(and(X1,X2))|~is_a_theorem(X1)|~is_a_theorem(X2))).
111.58/15.67	cnf(i_0_48, plain, (is_a_theorem(implies(X1,implies(X2,X1)))|~implies_1)).
111.58/15.67	cnf(i_0_25, plain, (r3|~is_a_theorem(implies(or(esk24_0,esk25_0),or(esk25_0,esk24_0))))).
111.58/15.67	cnf(i_0_27, plain, (and_3|~is_a_theorem(implies(esk26_0,implies(esk27_0,and(esk26_0,esk27_0)))))).
111.58/15.67	cnf(i_0_32, plain, (is_a_theorem(implies(X1,and(X1,X1)))|~kn1)).
111.58/15.67	cnf(i_0_34, plain, (is_a_theorem(implies(X1,or(X2,X1)))|~or_2)).
111.58/15.67	cnf(i_0_50, plain, (is_a_theorem(implies(X1,or(X2,X1)))|~r2)).
111.58/15.67	cnf(i_0_24, plain, (is_a_theorem(implies(and(X1,X2),X2))|~and_2)).
111.58/15.67	cnf(i_0_5, plain, (is_a_theorem(implies(and(X1,X2),X1))|~and_1)).
111.58/15.67	cnf(i_0_41, plain, (is_a_theorem(implies(and(X1,X2),X1))|~kn2)).
111.58/15.67	cnf(i_0_21, plain, (is_a_theorem(implies(or(X1,X1),X1))|~r1)).
111.58/15.67	cnf(i_0_107, plain, (axiom_m8|~is_a_theorem(strict_implies(strict_implies(esk90_0,esk91_0),strict_implies(possibly(esk90_0),possibly(esk91_0)))))).
111.58/15.67	cnf(i_0_75, plain, (is_a_theorem(implies(possibly(X1),necessarily(possibly(X1))))|~axiom_5)).
111.58/15.67	cnf(i_0_101, plain, (is_a_theorem(implies(necessarily(X1),necessarily(necessarily(X1))))|~axiom_4)).
111.58/15.67	cnf(i_0_77, plain, (is_a_theorem(strict_implies(possibly(X1),necessarily(possibly(X1))))|~axiom_m10)).
111.58/15.67	cnf(i_0_80, plain, (is_a_theorem(strict_implies(necessarily(X1),necessarily(necessarily(X1))))|~axiom_s4)).
111.58/15.67	cnf(i_0_71, plain, (is_a_theorem(strict_implies(possibly(possibly(X1)),possibly(X1)))|~axiom_m9)).
111.58/15.67	cnf(i_0_14, plain, (cn2|~is_a_theorem(implies(esk13_0,or(esk13_0,esk14_0))))).
111.58/15.67	cnf(i_0_8, plain, (implies_2|~is_a_theorem(implies(implies(esk9_0,implies(esk9_0,esk10_0)),implies(esk9_0,esk10_0))))).
111.58/15.67	cnf(i_0_13, plain, (is_a_theorem(implies(X1,or(X1,X2)))|~cn2)).
111.58/15.67	cnf(i_0_52, plain, (is_a_theorem(implies(or(X1,X1),X1))|~cn3)).
111.58/15.67	cnf(i_0_74, plain, (is_a_theorem(strict_implies(possibly(and(X1,X2)),X1))|~axiom_m7)).
111.58/15.67	cnf(i_0_60, plain, (not(or(not(X1),not(X2)))=and(X1,X2)|~op_and)).
111.58/15.67	cnf(i_0_51, plain, (cn3|~is_a_theorem(implies(or(esk53_0,esk53_0),esk53_0)))).
111.58/15.67	cnf(i_0_44, plain, (modus_tollens|~is_a_theorem(implies(or(esk45_0,not(esk44_0)),implies(esk44_0,esk45_0))))).
111.58/15.67	cnf(i_0_62, plain, (axiom_s2|~is_a_theorem(strict_implies(possibly(and(esk56_0,esk57_0)),and(possibly(esk56_0),possibly(esk57_0)))))).
111.58/15.67	cnf(i_0_111, plain, (axiom_K|~is_a_theorem(implies(strict_implies(esk93_0,esk94_0),implies(necessarily(esk93_0),necessarily(esk94_0)))))).
111.58/15.67	cnf(i_0_15, plain, (is_a_theorem(implies(equiv(X1,X2),implies(X2,X1)))|~equivalence_2)).
111.58/15.67	cnf(i_0_20, plain, (is_a_theorem(implies(equiv(X1,X2),implies(X1,X2)))|~equivalence_1)).
111.58/15.67	cnf(i_0_26, plain, (is_a_theorem(implies(or(X1,X2),or(X2,X1)))|~r3)).
111.58/15.67	cnf(i_0_28, plain, (is_a_theorem(implies(X1,implies(X2,and(X1,X2))))|~and_3)).
111.58/15.67	cnf(i_0_89, plain, (axiom_s3|~is_a_theorem(strict_implies(strict_implies(esk76_0,esk77_0),strict_implies(not(possibly(esk77_0)),not(possibly(esk76_0))))))).
111.58/15.67	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)))))).
111.58/15.67	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)))))).
111.58/15.67	cnf(i_0_17, plain, (equivalence_3|~is_a_theorem(implies(implies(esk17_0,esk18_0),implies(implies(esk18_0,esk17_0),and(implies(esk17_0,esk18_0),implies(esk18_0,esk17_0))))))).
111.58/15.67	cnf(i_0_16, plain, (equivalence_2|~is_a_theorem(implies(and(implies(esk15_0,esk16_0),implies(esk16_0,esk15_0)),implies(esk16_0,esk15_0))))).
111.58/15.67	cnf(i_0_108, plain, (is_a_theorem(strict_implies(strict_implies(X1,X2),strict_implies(possibly(X1),possibly(X2))))|~axiom_m8)).
111.58/15.67	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)))))).
111.58/15.67	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)))))).
111.58/15.67	cnf(i_0_43, plain, (is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1)))|~modus_tollens)).
111.58/15.67	cnf(i_0_19, plain, (equivalence_1|~is_a_theorem(implies(and(implies(esk19_0,esk20_0),implies(esk20_0,esk19_0)),implies(esk19_0,esk20_0))))).
111.58/15.67	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)))))).
111.58/15.67	cnf(i_0_29, plain, (kn3|~is_a_theorem(implies(implies(esk28_0,esk29_0),or(and(esk29_0,esk30_0),not(and(esk30_0,esk28_0))))))).
111.58/15.67	cnf(i_0_7, plain, (is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))|~implies_2)).
111.58/15.67	cnf(i_0_112, plain, (is_a_theorem(implies(strict_implies(X1,X2),implies(necessarily(X1),necessarily(X2))))|~axiom_K)).
111.58/15.67	cnf(i_0_61, plain, (is_a_theorem(strict_implies(possibly(and(X1,X2)),and(possibly(X1),possibly(X2))))|~axiom_s2)).
111.58/15.67	cnf(i_0_97, plain, (axiom_s1|~is_a_theorem(implies(and(strict_implies(esk81_0,esk82_0),strict_implies(esk82_0,esk83_0)),strict_implies(esk81_0,esk83_0))))).
111.58/15.67	cnf(i_0_2, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))|~implies_3)).
111.58/15.67	cnf(i_0_3, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))|~cn1)).
111.58/15.67	cnf(i_0_18, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X1),equiv(X1,X2))))|~equivalence_3)).
111.58/15.67	cnf(i_0_90, plain, (is_a_theorem(strict_implies(strict_implies(X1,X2),strict_implies(not(possibly(X2)),not(possibly(X1)))))|~axiom_s3)).
111.58/15.67	cnf(i_0_37, plain, (is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))|~r5)).
111.58/15.67	cnf(i_0_40, plain, (is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))|~r4)).
111.58/15.67	cnf(i_0_45, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X2),implies(or(X1,X3),X2))))|~or_3)).
111.58/15.67	cnf(i_0_30, plain, (is_a_theorem(implies(implies(X1,X2),or(and(X2,X3),not(and(X3,X1)))))|~kn3)).
111.58/15.67	cnf(i_0_96, plain, (is_a_theorem(implies(and(strict_implies(X1,X2),strict_implies(X2,X3)),strict_implies(X1,X3)))|~axiom_s1)).
111.58/15.67	cnf(i_0_318, plain, (X211=X211)).
111.58/15.67	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
111.58/15.67	# Begin printing tableau
111.58/15.67	# Found 14 steps
111.58/15.67	cnf(i_0_88, plain, (is_a_theorem(strict_implies(and(esk34_0,or(esk34_0,esk35_0)),esk34_0))), inference(start_rule)).
111.58/15.67	cnf(i_0_352, plain, (is_a_theorem(strict_implies(and(esk34_0,or(esk34_0,esk35_0)),esk34_0))), inference(extension_rule, [i_0_9])).
111.58/15.67	cnf(i_0_550857, plain, (is_a_theorem(implies(esk34_0,or(esk34_0,esk35_0)))), inference(closure_rule, [i_0_35])).
111.58/15.67	cnf(i_0_550858, plain, (~modus_ponens), inference(extension_rule, [i_0_11])).
111.58/15.67	cnf(i_0_551023, plain, (is_a_theorem(esk11_0)), inference(extension_rule, [i_0_102])).
111.58/15.67	cnf(i_0_550859, plain, (~is_a_theorem(implies(strict_implies(and(esk34_0,or(esk34_0,esk35_0)),esk34_0),implies(esk34_0,or(esk34_0,esk35_0))))), inference(extension_rule, [i_0_323])).
111.58/15.67	cnf(i_0_553936, plain, (implies(strict_implies(and(esk34_0,or(esk34_0,esk35_0)),esk34_0),not(and(esk34_0,not(or(esk34_0,esk35_0)))))!=implies(strict_implies(and(esk34_0,or(esk34_0,esk35_0)),esk34_0),implies(esk34_0,or(esk34_0,esk35_0)))), inference(extension_rule, [i_0_322])).
111.58/15.67	cnf(i_0_554878, plain, ($false), inference(closure_rule, [i_0_318])).
111.58/15.67	cnf(i_0_554879, plain, (not(and(esk34_0,not(or(esk34_0,esk35_0))))!=implies(esk34_0,or(esk34_0,esk35_0))), inference(closure_rule, [i_0_57])).
111.58/15.67	cnf(i_0_551221, plain, (is_a_theorem(necessarily(esk11_0))), inference(etableau_closure_rule, [i_0_551221, ...])).
111.58/15.67	cnf(i_0_551222, plain, (~necessitation), inference(etableau_closure_rule, [i_0_551222, ...])).
111.58/15.67	cnf(i_0_553937, plain, (~is_a_theorem(implies(strict_implies(and(esk34_0,or(esk34_0,esk35_0)),esk34_0),not(and(esk34_0,not(or(esk34_0,esk35_0))))))), inference(extension_rule, [i_0_323])).
111.58/15.67	cnf(i_0_954820, plain, (~is_a_theorem(strict_implies(and(esk34_0,or(esk34_0,esk35_0)),esk34_0))), inference(closure_rule, [i_0_352])).
111.58/15.67	cnf(i_0_954819, plain, (strict_implies(and(esk34_0,or(esk34_0,esk35_0)),esk34_0)!=implies(strict_implies(and(esk34_0,or(esk34_0,esk35_0)),esk34_0),not(and(esk34_0,not(or(esk34_0,esk35_0)))))), inference(etableau_closure_rule, [i_0_954819, ...])).
111.58/15.67	# End printing tableau
111.58/15.67	# SZS output end
111.58/15.67	# Branches closed with saturation will be marked with an "s"
111.58/15.69	# Child (3597) has found a proof.
111.58/15.69	
111.58/15.69	# Proof search is over...
111.58/15.69	# Freeing feature tree
112.02/15.73	EOF