0.06/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/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   : n020.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   : 1200
0.12/0.33	% WCLimit    : 120
0.12/0.33	% DateTime   : Tue Jul 13 16:14:21 EDT 2021
0.12/0.33	% CPUTime    : 
0.12/0.37	# No SInE strategy applied
0.12/0.37	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
0.12/0.37	# and selection function SelectComplexExceptUniqMaxHorn.
0.12/0.37	#
0.12/0.37	# Presaturation interreduction done
0.12/0.37	# Number of axioms: 140 Number of unprocessed: 112
0.12/0.37	# Tableaux proof search.
0.12/0.37	# APR header successfully linked.
0.12/0.37	# Hello from C++
0.18/0.38	# The folding up rule is enabled...
0.18/0.38	# Local unification is enabled...
0.18/0.38	# Any saturation attempts will use folding labels...
0.18/0.38	# 112 beginning clauses after preprocessing and clausification
0.18/0.38	# Creating start rules for all 1 conjectures.
0.18/0.38	# There are 1 start rule candidates:
0.18/0.38	# Found 49 unit axioms.
0.18/0.38	# 1 start rule tableaux created.
0.18/0.38	# 63 extension rule candidate clauses
0.18/0.38	# 49 unit axiom clauses
0.18/0.38	
0.18/0.38	# Requested 8, 32 cores available to the main process.
0.18/0.38	# There are not enough tableaux to fork, creating more from the initial 1
0.18/0.38	# Creating equality axioms
0.18/0.38	# Ran out of tableaux, making start rules for all clauses
0.18/0.38	# Returning from population with 112 new_tableaux and 0 remaining starting tableaux.
0.18/0.38	# We now have 112 tableaux to operate on
4.50/0.96	# There were 2 total branch saturation attempts.
4.50/0.96	# There were 0 of these attempts blocked.
4.50/0.96	# There were 0 deferred branch saturation attempts.
4.50/0.96	# There were 0 free duplicated saturations.
4.50/0.96	# There were 2 total successful branch saturations.
4.50/0.96	# There were 0 successful branch saturations in interreduction.
4.50/0.96	# There were 0 successful branch saturations on the branch.
4.50/0.96	# There were 2 successful branch saturations after the branch.
4.50/0.96	# SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
4.50/0.96	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
4.50/0.96	# Begin clausification derivation
4.50/0.96	
4.50/0.96	# End clausification derivation
4.50/0.96	# Begin listing active clauses obtained from FOF to CNF conversion
4.50/0.96	cnf(i_0_66, plain, (implies_3)).
4.50/0.96	cnf(i_0_62, plain, (and_1)).
4.50/0.96	cnf(i_0_67, plain, (implies_2)).
4.50/0.96	cnf(i_0_74, plain, (modus_ponens)).
4.50/0.96	cnf(i_0_71, plain, (equivalence_2)).
4.50/0.96	cnf(i_0_63, plain, (equivalence_3)).
4.50/0.96	cnf(i_0_76, plain, (equivalence_1)).
4.50/0.96	cnf(i_0_61, plain, (and_2)).
4.50/0.96	cnf(i_0_73, plain, (and_3)).
4.50/0.96	cnf(i_0_72, plain, (or_2)).
4.50/0.96	cnf(i_0_78, plain, (or_1)).
4.50/0.96	cnf(i_0_75, plain, (modus_tollens)).
4.50/0.96	cnf(i_0_68, plain, (or_3)).
4.50/0.96	cnf(i_0_64, plain, (implies_1)).
4.50/0.96	cnf(i_0_70, plain, (substitution_of_equivalents)).
4.50/0.96	cnf(i_0_65, plain, (op_implies_and)).
4.50/0.96	cnf(i_0_69, plain, (op_or)).
4.50/0.96	cnf(i_0_77, plain, (op_equiv)).
4.50/0.96	cnf(i_0_136, plain, (axiom_5)).
4.50/0.96	cnf(i_0_138, plain, (necessitation)).
4.50/0.96	cnf(i_0_135, plain, (axiom_M)).
4.50/0.96	cnf(i_0_139, plain, (axiom_K)).
4.50/0.96	cnf(i_0_137, plain, (op_possibly)).
4.50/0.96	cnf(i_0_134, plain, (not(necessarily(not(X1)))=possibly(X1))).
4.50/0.96	cnf(i_0_128, plain, (is_a_theorem(implies(necessarily(X1),X1)))).
4.50/0.96	cnf(i_0_48, plain, (is_a_theorem(implies(X1,implies(X2,X1))))).
4.50/0.96	cnf(i_0_34, plain, (is_a_theorem(implies(X1,or(X2,X1))))).
4.50/0.96	cnf(i_0_49, plain, (r2)).
4.50/0.96	cnf(i_0_36, plain, (is_a_theorem(implies(X1,or(X1,X2))))).
4.50/0.96	cnf(i_0_24, plain, (is_a_theorem(implies(and(X1,X2),X2)))).
4.50/0.96	cnf(i_0_5, plain, (is_a_theorem(implies(and(X1,X2),X1)))).
4.50/0.96	cnf(i_0_42, plain, (kn2)).
4.50/0.96	cnf(i_0_57, plain, (not(and(X1,not(X2)))=implies(X1,X2))).
4.50/0.96	cnf(i_0_58, plain, (implies(not(X1),X2)=or(X1,X2))).
4.50/0.96	cnf(i_0_14, plain, (cn2)).
4.50/0.96	cnf(i_0_93, plain, (is_a_theorem(implies(possibly(X1),necessarily(possibly(X1)))))).
4.50/0.96	cnf(i_0_15, plain, (is_a_theorem(implies(equiv(X1,X2),implies(X2,X1))))).
4.50/0.96	cnf(i_0_20, plain, (is_a_theorem(implies(equiv(X1,X2),implies(X1,X2))))).
4.50/0.96	cnf(i_0_28, plain, (is_a_theorem(implies(X1,implies(X2,and(X1,X2)))))).
4.50/0.96	cnf(i_0_43, plain, (is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1))))).
4.50/0.96	cnf(i_0_7, plain, (is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))))).
4.50/0.96	cnf(i_0_130, plain, (is_a_theorem(implies(necessarily(implies(X1,X2)),implies(necessarily(X1),necessarily(X2)))))).
4.50/0.96	cnf(i_0_2, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))))).
4.50/0.96	cnf(i_0_4, plain, (cn1)).
4.50/0.96	cnf(i_0_18, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X1),equiv(X1,X2)))))).
4.50/0.96	cnf(i_0_45, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X2),implies(or(X1,X3),X2)))))).
4.50/0.96	cnf(i_0_59, plain, (and(implies(X1,X2),implies(X2,X1))=equiv(X1,X2))).
4.50/0.96	cnf(i_0_140, negated_conjecture, (~axiom_B)).
4.50/0.96	cnf(i_0_88, plain, (~is_a_theorem(implies(esk63_0,necessarily(possibly(esk63_0)))))).
4.50/0.96	cnf(i_0_111, plain, (substitution_strict_equiv|esk80_0!=esk79_0)).
4.50/0.96	cnf(i_0_86, plain, (modus_ponens_strict_implies|is_a_theorem(esk61_0))).
4.50/0.96	cnf(i_0_84, plain, (modus_ponens_strict_implies|~is_a_theorem(esk62_0))).
4.50/0.96	cnf(i_0_102, plain, (adjunction|is_a_theorem(esk72_0))).
4.50/0.96	cnf(i_0_103, plain, (adjunction|is_a_theorem(esk73_0))).
4.50/0.96	cnf(i_0_101, plain, (adjunction|~is_a_theorem(and(esk72_0,esk73_0)))).
4.50/0.96	cnf(i_0_110, plain, (axiom_m6|~is_a_theorem(strict_implies(esk78_0,possibly(esk78_0))))).
4.50/0.96	cnf(i_0_120, plain, (is_a_theorem(necessarily(X1))|~is_a_theorem(X1))).
4.50/0.96	cnf(i_0_53, plain, (X1=X2|~is_a_theorem(equiv(X1,X2)))).
4.50/0.96	cnf(i_0_113, plain, (X1=X2|~substitution_strict_equiv|~is_a_theorem(strict_equiv(X1,X2)))).
4.50/0.96	cnf(i_0_31, plain, (kn1|~is_a_theorem(implies(esk31_0,and(esk31_0,esk31_0))))).
4.50/0.96	cnf(i_0_124, plain, (axiom_m4|~is_a_theorem(strict_implies(esk89_0,and(esk89_0,esk89_0))))).
4.50/0.96	cnf(i_0_85, plain, (modus_ponens_strict_implies|is_a_theorem(strict_implies(esk61_0,esk62_0)))).
4.50/0.96	cnf(i_0_112, plain, (substitution_strict_equiv|is_a_theorem(strict_equiv(esk79_0,esk80_0)))).
4.50/0.96	cnf(i_0_22, plain, (r1|~is_a_theorem(implies(or(esk21_0,esk21_0),esk21_0)))).
4.50/0.96	cnf(i_0_105, plain, (axiom_m2|~is_a_theorem(strict_implies(and(esk74_0,esk75_0),esk74_0)))).
4.50/0.96	cnf(i_0_109, plain, (is_a_theorem(strict_implies(X1,possibly(X1)))|~axiom_m6)).
4.50/0.96	cnf(i_0_133, plain, (not(possibly(not(X1)))=necessarily(X1)|~op_necessarily)).
4.50/0.96	cnf(i_0_56, plain, (or(not(X1),X2)=implies(X1,X2)|~op_implies_or)).
4.50/0.96	cnf(i_0_9, plain, (is_a_theorem(X1)|~is_a_theorem(implies(X2,X1))|~is_a_theorem(X2))).
4.50/0.96	cnf(i_0_83, plain, (is_a_theorem(X1)|~modus_ponens_strict_implies|~is_a_theorem(strict_implies(X2,X1))|~is_a_theorem(X2))).
4.50/0.96	cnf(i_0_96, plain, (axiom_m10|~is_a_theorem(strict_implies(possibly(esk68_0),necessarily(possibly(esk68_0)))))).
4.50/0.96	cnf(i_0_132, plain, (necessarily(implies(X1,X2))=strict_implies(X1,X2)|~op_strict_implies)).
4.50/0.96	cnf(i_0_97, plain, (axiom_s4|~is_a_theorem(strict_implies(necessarily(esk69_0),necessarily(necessarily(esk69_0)))))).
4.50/0.96	cnf(i_0_118, plain, (axiom_4|~is_a_theorem(implies(necessarily(esk87_0),necessarily(necessarily(esk87_0)))))).
4.50/0.96	cnf(i_0_90, plain, (axiom_m9|~is_a_theorem(strict_implies(possibly(possibly(esk64_0)),possibly(esk64_0))))).
4.50/0.96	cnf(i_0_104, plain, (is_a_theorem(and(X1,X2))|~adjunction|~is_a_theorem(X1)|~is_a_theorem(X2))).
4.50/0.96	cnf(i_0_91, plain, (axiom_m7|~is_a_theorem(strict_implies(possibly(and(esk65_0,esk66_0)),esk65_0)))).
4.50/0.96	cnf(i_0_32, plain, (is_a_theorem(implies(X1,and(X1,X1)))|~kn1)).
4.50/0.96	cnf(i_0_25, plain, (r3|~is_a_theorem(implies(or(esk24_0,esk25_0),or(esk25_0,esk24_0))))).
4.50/0.96	cnf(i_0_99, plain, (axiom_m1|~is_a_theorem(strict_implies(and(esk70_0,esk71_0),and(esk71_0,esk70_0))))).
4.50/0.96	cnf(i_0_123, plain, (is_a_theorem(strict_implies(X1,and(X1,X1)))|~axiom_m4)).
4.50/0.96	cnf(i_0_21, plain, (is_a_theorem(implies(or(X1,X1),X1))|~r1)).
4.50/0.96	cnf(i_0_106, plain, (is_a_theorem(strict_implies(and(X1,X2),X1))|~axiom_m2)).
4.50/0.96	cnf(i_0_125, plain, (axiom_m8|~is_a_theorem(strict_implies(strict_implies(esk90_0,esk91_0),strict_implies(possibly(esk90_0),possibly(esk91_0)))))).
4.50/0.96	cnf(i_0_51, plain, (cn3|~is_a_theorem(implies(or(esk53_0,esk53_0),esk53_0)))).
4.50/0.96	cnf(i_0_119, plain, (is_a_theorem(implies(necessarily(X1),necessarily(necessarily(X1))))|~axiom_4)).
4.50/0.96	cnf(i_0_95, plain, (is_a_theorem(strict_implies(possibly(X1),necessarily(possibly(X1))))|~axiom_m10)).
4.50/0.96	cnf(i_0_98, plain, (is_a_theorem(strict_implies(necessarily(X1),necessarily(necessarily(X1))))|~axiom_s4)).
4.50/0.96	cnf(i_0_60, plain, (not(or(not(X1),not(X2)))=and(X1,X2)|~op_and)).
4.50/0.96	cnf(i_0_89, plain, (is_a_theorem(strict_implies(possibly(possibly(X1)),possibly(X1)))|~axiom_m9)).
4.50/0.96	cnf(i_0_52, plain, (is_a_theorem(implies(or(X1,X1),X1))|~cn3)).
4.50/0.96	cnf(i_0_92, plain, (is_a_theorem(strict_implies(possibly(and(X1,X2)),X1))|~axiom_m7)).
4.50/0.96	cnf(i_0_80, plain, (axiom_s2|~is_a_theorem(strict_implies(possibly(and(esk56_0,esk57_0)),and(possibly(esk56_0),possibly(esk57_0)))))).
4.50/0.96	cnf(i_0_26, plain, (is_a_theorem(implies(or(X1,X2),or(X2,X1)))|~r3)).
4.50/0.96	cnf(i_0_100, plain, (is_a_theorem(strict_implies(and(X1,X2),and(X2,X1)))|~axiom_m1)).
4.50/0.96	cnf(i_0_131, plain, (and(strict_implies(X1,X2),strict_implies(X2,X1))=strict_equiv(X1,X2)|~op_strict_equiv)).
4.50/0.96	cnf(i_0_107, plain, (axiom_s3|~is_a_theorem(strict_implies(strict_implies(esk76_0,esk77_0),strict_implies(not(possibly(esk77_0)),not(possibly(esk76_0))))))).
4.50/0.96	cnf(i_0_126, plain, (is_a_theorem(strict_implies(strict_implies(X1,X2),strict_implies(possibly(X1),possibly(X2))))|~axiom_m8)).
4.50/0.96	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)))))).
4.50/0.96	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)))))).
4.50/0.96	cnf(i_0_82, plain, (axiom_m3|~is_a_theorem(strict_implies(and(and(esk58_0,esk59_0),esk60_0),and(esk58_0,and(esk59_0,esk60_0)))))).
4.50/0.96	cnf(i_0_117, plain, (axiom_m5|~is_a_theorem(strict_implies(and(strict_implies(esk84_0,esk85_0),strict_implies(esk85_0,esk86_0)),strict_implies(esk84_0,esk86_0))))).
4.50/0.96	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))))))).
4.50/0.96	cnf(i_0_115, plain, (axiom_s1|~is_a_theorem(implies(and(necessarily(implies(esk81_0,esk82_0)),necessarily(implies(esk82_0,esk83_0))),necessarily(implies(esk81_0,esk83_0)))))).
4.50/0.96	cnf(i_0_79, plain, (is_a_theorem(strict_implies(possibly(and(X1,X2)),and(possibly(X1),possibly(X2))))|~axiom_s2)).
4.50/0.96	cnf(i_0_108, plain, (is_a_theorem(strict_implies(strict_implies(X1,X2),strict_implies(not(possibly(X2)),not(possibly(X1)))))|~axiom_s3)).
4.50/0.96	cnf(i_0_37, plain, (is_a_theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))|~r5)).
4.50/0.96	cnf(i_0_40, plain, (is_a_theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))|~r4)).
4.50/0.96	cnf(i_0_81, plain, (is_a_theorem(strict_implies(and(and(X1,X2),X3),and(X1,and(X2,X3))))|~axiom_m3)).
4.50/0.96	cnf(i_0_116, plain, (is_a_theorem(strict_implies(and(strict_implies(X1,X2),strict_implies(X2,X3)),strict_implies(X1,X3)))|~axiom_m5)).
4.50/0.96	cnf(i_0_30, plain, (is_a_theorem(implies(implies(X1,X2),or(and(X2,X3),not(and(X3,X1)))))|~kn3)).
4.50/0.96	cnf(i_0_114, plain, (is_a_theorem(implies(and(necessarily(implies(X1,X2)),necessarily(implies(X2,X3))),necessarily(implies(X1,X3))))|~axiom_s1)).
4.50/0.96	cnf(i_0_274, plain, (X211=X211)).
4.50/0.96	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
4.50/0.96	# Begin printing tableau
4.50/0.96	# Found 5 steps
4.50/0.96	cnf(i_0_117, plain, (axiom_m5|~is_a_theorem(strict_implies(and(strict_implies(esk84_0,esk85_0),strict_implies(esk85_0,esk86_0)),strict_implies(esk84_0,esk86_0)))), inference(start_rule)).
4.50/0.96	cnf(i_0_447, plain, (axiom_m5), inference(extension_rule, [i_0_116])).
4.50/0.96	cnf(i_0_1094, plain, (is_a_theorem(strict_implies(and(strict_implies(X8,X7),strict_implies(X7,X3)),strict_implies(X8,X3)))), inference(extension_rule, [i_0_120])).
4.50/0.96	cnf(i_0_448, plain, (~is_a_theorem(strict_implies(and(strict_implies(esk84_0,esk85_0),strict_implies(esk85_0,esk86_0)),strict_implies(esk84_0,esk86_0)))), inference(etableau_closure_rule, [i_0_448, ...])).
4.50/0.96	cnf(i_0_1110, plain, (is_a_theorem(necessarily(strict_implies(and(strict_implies(X8,X7),strict_implies(X7,X3)),strict_implies(X8,X3))))), inference(etableau_closure_rule, [i_0_1110, ...])).
4.50/0.96	# End printing tableau
4.50/0.96	# SZS output end
4.50/0.96	# Branches closed with saturation will be marked with an "s"
4.50/0.96	# Child (4944) has found a proof.
4.50/0.96	
4.50/0.96	# Proof search is over...
4.50/0.96	# Freeing feature tree
4.50/0.97	EOF