0.05/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.05/0.11	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.11/0.32	% Computer   : n031.cluster.edu
0.11/0.32	% Model      : x86_64 x86_64
0.11/0.32	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.32	% Memory     : 8042.1875MB
0.11/0.32	% OS         : Linux 3.10.0-693.el7.x86_64
0.11/0.32	% CPULimit   : 1200
0.11/0.32	% WCLimit    : 120
0.11/0.32	% DateTime   : Tue Jul 13 16:37:14 EDT 2021
0.11/0.32	% CPUTime    : 
0.11/0.35	# No SInE strategy applied
0.11/0.35	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
0.11/0.35	# and selection function SelectComplexExceptUniqMaxHorn.
0.11/0.35	#
0.11/0.35	# Presaturation interreduction done
0.11/0.35	# Number of axioms: 81 Number of unprocessed: 64
0.11/0.35	# Tableaux proof search.
0.11/0.35	# APR header successfully linked.
0.11/0.35	# Hello from C++
0.11/0.36	# The folding up rule is enabled...
0.11/0.36	# Local unification is enabled...
0.11/0.36	# Any saturation attempts will use folding labels...
0.11/0.36	# 64 beginning clauses after preprocessing and clausification
0.11/0.36	# Creating start rules for all 1 conjectures.
0.11/0.36	# There are 1 start rule candidates:
0.11/0.36	# Found 31 unit axioms.
0.11/0.36	# 1 start rule tableaux created.
0.11/0.36	# 33 extension rule candidate clauses
0.11/0.36	# 31 unit axiom clauses
0.11/0.36	
0.11/0.36	# Requested 8, 32 cores available to the main process.
0.11/0.36	# There are not enough tableaux to fork, creating more from the initial 1
0.11/0.36	# Creating equality axioms
0.11/0.36	# Ran out of tableaux, making start rules for all clauses
0.11/0.36	# Returning from population with 64 new_tableaux and 0 remaining starting tableaux.
0.11/0.36	# We now have 64 tableaux to operate on
8.39/1.60	# There were 3 total branch saturation attempts.
8.39/1.60	# There were 0 of these attempts blocked.
8.39/1.60	# There were 0 deferred branch saturation attempts.
8.39/1.60	# There were 0 free duplicated saturations.
8.39/1.60	# There were 3 total successful branch saturations.
8.39/1.60	# There were 0 successful branch saturations in interreduction.
8.39/1.60	# There were 0 successful branch saturations on the branch.
8.39/1.60	# There were 3 successful branch saturations after the branch.
8.39/1.60	# SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
8.39/1.60	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
8.39/1.60	# Begin clausification derivation
8.39/1.60	
8.39/1.60	# End clausification derivation
8.39/1.60	# Begin listing active clauses obtained from FOF to CNF conversion
8.39/1.60	cnf(i_0_77, plain, (op_implies_and)).
8.39/1.60	cnf(i_0_71, plain, (op_or)).
8.39/1.60	cnf(i_0_69, plain, (op_equiv)).
8.39/1.60	cnf(i_0_67, plain, (axiom_m3)).
8.39/1.60	cnf(i_0_75, plain, (modus_ponens_strict_implies)).
8.39/1.60	cnf(i_0_76, plain, (axiom_m10)).
8.39/1.60	cnf(i_0_68, plain, (axiom_m1)).
8.39/1.60	cnf(i_0_63, plain, (adjunction)).
8.39/1.60	cnf(i_0_64, plain, (axiom_m2)).
8.39/1.60	cnf(i_0_62, plain, (substitution_strict_equiv)).
8.39/1.60	cnf(i_0_73, plain, (axiom_m5)).
8.39/1.60	cnf(i_0_74, plain, (axiom_m4)).
8.39/1.60	cnf(i_0_70, plain, (op_strict_equiv)).
8.39/1.60	cnf(i_0_72, plain, (op_strict_implies)).
8.39/1.60	cnf(i_0_66, plain, (op_possibly)).
8.39/1.60	cnf(i_0_65, plain, (op_implies)).
8.39/1.60	cnf(i_0_81, plain, (substitution_of_equivalents)).
8.39/1.60	cnf(i_0_61, plain, (not(necessarily(not(X1)))=possibly(X1))).
8.39/1.60	cnf(i_0_59, plain, (necessarily(implies(X1,X2))=strict_implies(X1,X2))).
8.39/1.60	cnf(i_0_50, plain, (is_a_theorem(strict_implies(X1,and(X1,X1))))).
8.39/1.60	cnf(i_0_33, plain, (is_a_theorem(strict_implies(and(X1,X2),X1)))).
8.39/1.60	cnf(i_0_2, plain, (not(and(X1,not(X2)))=implies(X1,X2))).
8.39/1.60	cnf(i_0_22, plain, (is_a_theorem(strict_implies(possibly(X1),necessarily(possibly(X1)))))).
8.39/1.60	cnf(i_0_3, plain, (implies(not(X1),X2)=or(X1,X2))).
8.39/1.60	cnf(i_0_27, plain, (is_a_theorem(strict_implies(and(X1,X2),and(X2,X1))))).
8.39/1.60	cnf(i_0_4, plain, (and(implies(X1,X2),implies(X2,X1))=equiv(X1,X2))).
8.39/1.60	cnf(i_0_58, plain, (and(strict_implies(X1,X2),strict_implies(X2,X1))=strict_equiv(X1,X2))).
8.39/1.60	cnf(i_0_8, plain, (is_a_theorem(strict_implies(and(and(X1,X2),X3),and(X1,and(X2,X3)))))).
8.39/1.60	cnf(i_0_43, plain, (is_a_theorem(strict_implies(and(strict_implies(X1,X2),strict_implies(X2,X3)),strict_implies(X1,X3))))).
8.39/1.60	cnf(i_0_79, negated_conjecture, (~axiom_5)).
8.39/1.60	cnf(i_0_21, plain, (~is_a_theorem(implies(possibly(esk12_0),necessarily(possibly(esk12_0)))))).
8.39/1.60	cnf(i_0_48, plain, (necessitation|~is_a_theorem(necessarily(esk33_0)))).
8.39/1.60	cnf(i_0_49, plain, (necessitation|is_a_theorem(esk33_0))).
8.39/1.60	cnf(i_0_47, plain, (is_a_theorem(necessarily(X1))|~necessitation|~is_a_theorem(X1))).
8.39/1.60	cnf(i_0_37, plain, (axiom_m6|~is_a_theorem(strict_implies(esk23_0,possibly(esk23_0))))).
8.39/1.60	cnf(i_0_54, plain, (axiom_M|~is_a_theorem(implies(necessarily(esk37_0),esk37_0)))).
8.39/1.60	cnf(i_0_40, plain, (X1=X2|~is_a_theorem(strict_equiv(X1,X2)))).
8.39/1.60	cnf(i_0_15, plain, (axiom_B|~is_a_theorem(implies(esk8_0,necessarily(possibly(esk8_0)))))).
8.39/1.60	cnf(i_0_60, plain, (not(possibly(not(X1)))=necessarily(X1)|~op_necessarily)).
8.39/1.60	cnf(i_0_10, plain, (is_a_theorem(X1)|~is_a_theorem(strict_implies(X2,X1))|~is_a_theorem(X2))).
8.39/1.60	cnf(i_0_24, plain, (axiom_s4|~is_a_theorem(strict_implies(necessarily(esk14_0),necessarily(necessarily(esk14_0)))))).
8.39/1.60	cnf(i_0_45, plain, (axiom_4|~is_a_theorem(implies(necessarily(esk32_0),necessarily(necessarily(esk32_0)))))).
8.39/1.60	cnf(i_0_36, plain, (is_a_theorem(strict_implies(X1,possibly(X1)))|~axiom_m6)).
8.39/1.60	cnf(i_0_55, plain, (is_a_theorem(implies(necessarily(X1),X1))|~axiom_M)).
8.39/1.60	cnf(i_0_17, plain, (axiom_m9|~is_a_theorem(strict_implies(possibly(possibly(esk9_0)),possibly(esk9_0))))).
8.39/1.60	cnf(i_0_18, plain, (axiom_m7|~is_a_theorem(strict_implies(possibly(and(esk10_0,esk11_0)),esk10_0)))).
8.39/1.60	cnf(i_0_1, plain, (or(not(X1),X2)=implies(X1,X2)|~op_implies_or)).
8.39/1.60	cnf(i_0_31, plain, (is_a_theorem(and(X1,X2))|~is_a_theorem(X1)|~is_a_theorem(X2))).
8.39/1.60	cnf(i_0_14, plain, (is_a_theorem(implies(X1,necessarily(possibly(X1))))|~axiom_B)).
8.39/1.60	cnf(i_0_46, plain, (is_a_theorem(implies(necessarily(X1),necessarily(necessarily(X1))))|~axiom_4)).
8.39/1.60	cnf(i_0_25, plain, (is_a_theorem(strict_implies(necessarily(X1),necessarily(necessarily(X1))))|~axiom_s4)).
8.39/1.60	cnf(i_0_16, plain, (is_a_theorem(strict_implies(possibly(possibly(X1)),possibly(X1)))|~axiom_m9)).
8.39/1.60	cnf(i_0_52, plain, (axiom_m8|~is_a_theorem(strict_implies(strict_implies(esk35_0,esk36_0),strict_implies(possibly(esk35_0),possibly(esk36_0)))))).
8.39/1.60	cnf(i_0_19, plain, (is_a_theorem(strict_implies(possibly(and(X1,X2)),X1))|~axiom_m7)).
8.39/1.60	cnf(i_0_7, plain, (axiom_s2|~is_a_theorem(strict_implies(possibly(and(esk1_0,esk2_0)),and(possibly(esk1_0),possibly(esk2_0)))))).
8.39/1.60	cnf(i_0_56, plain, (axiom_K|~is_a_theorem(implies(strict_implies(esk38_0,esk39_0),implies(necessarily(esk38_0),necessarily(esk39_0)))))).
8.39/1.60	cnf(i_0_5, plain, (not(or(not(X1),not(X2)))=and(X1,X2)|~op_and)).
8.39/1.60	cnf(i_0_34, plain, (axiom_s3|~is_a_theorem(strict_implies(strict_implies(esk21_0,esk22_0),strict_implies(not(possibly(esk22_0)),not(possibly(esk21_0))))))).
8.39/1.60	cnf(i_0_42, plain, (axiom_s1|~is_a_theorem(implies(and(strict_implies(esk26_0,esk27_0),strict_implies(esk27_0,esk28_0)),strict_implies(esk26_0,esk28_0))))).
8.39/1.60	cnf(i_0_53, plain, (is_a_theorem(strict_implies(strict_implies(X1,X2),strict_implies(possibly(X1),possibly(X2))))|~axiom_m8)).
8.39/1.60	cnf(i_0_57, plain, (is_a_theorem(implies(strict_implies(X1,X2),implies(necessarily(X1),necessarily(X2))))|~axiom_K)).
8.39/1.60	cnf(i_0_6, plain, (is_a_theorem(strict_implies(possibly(and(X1,X2)),and(possibly(X1),possibly(X2))))|~axiom_s2)).
8.39/1.60	cnf(i_0_35, plain, (is_a_theorem(strict_implies(strict_implies(X1,X2),strict_implies(not(possibly(X2)),not(possibly(X1)))))|~axiom_s3)).
8.39/1.60	cnf(i_0_41, plain, (is_a_theorem(implies(and(strict_implies(X1,X2),strict_implies(X2,X3)),strict_implies(X1,X3)))|~axiom_s1)).
8.39/1.60	cnf(i_0_152, plain, (X100=X100)).
8.39/1.60	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
8.39/1.60	# Begin printing tableau
8.39/1.60	# Found 12 steps
8.39/1.60	cnf(i_0_25, plain, (is_a_theorem(strict_implies(necessarily(necessarily(esk33_0)),necessarily(necessarily(necessarily(esk33_0)))))|~axiom_s4), inference(start_rule)).
8.39/1.60	cnf(i_0_238, plain, (is_a_theorem(strict_implies(necessarily(necessarily(esk33_0)),necessarily(necessarily(necessarily(esk33_0)))))), inference(extension_rule, [i_0_47])).
8.39/1.60	cnf(i_0_580, plain, (is_a_theorem(necessarily(strict_implies(necessarily(necessarily(esk33_0)),necessarily(necessarily(necessarily(esk33_0))))))), inference(extension_rule, [i_0_10])).
8.39/1.60	cnf(i_0_597, plain, (is_a_theorem(implies(possibly(esk12_0),necessarily(possibly(esk12_0))))), inference(closure_rule, [i_0_21])).
8.39/1.60	cnf(i_0_598, plain, (~is_a_theorem(strict_implies(necessarily(strict_implies(necessarily(necessarily(esk33_0)),necessarily(necessarily(necessarily(esk33_0))))),implies(possibly(esk12_0),necessarily(possibly(esk12_0)))))), inference(extension_rule, [i_0_163])).
8.39/1.60	cnf(i_0_691, plain, (~is_a_theorem(strict_implies(necessarily(esk33_0),and(necessarily(esk33_0),necessarily(esk33_0))))), inference(closure_rule, [i_0_50])).
8.39/1.60	cnf(i_0_581, plain, (~necessitation), inference(extension_rule, [i_0_48])).
8.39/1.60	cnf(i_0_693, plain, (~is_a_theorem(necessarily(esk33_0))), inference(extension_rule, [i_0_10])).
8.39/1.60	cnf(i_0_790, plain, (~is_a_theorem(strict_implies(and(necessarily(esk33_0),X2),necessarily(esk33_0)))), inference(closure_rule, [i_0_33])).
8.39/1.60	cnf(i_0_239, plain, (~axiom_s4), inference(etableau_closure_rule, [i_0_239, ...])).
8.39/1.60	cnf(i_0_690, plain, (strict_implies(necessarily(esk33_0),and(necessarily(esk33_0),necessarily(esk33_0)))!=strict_implies(necessarily(strict_implies(necessarily(necessarily(esk33_0)),necessarily(necessarily(necessarily(esk33_0))))),implies(possibly(esk12_0),necessarily(possibly(esk12_0))))), inference(etableau_closure_rule, [i_0_690, ...])).
8.39/1.60	cnf(i_0_791, plain, (~is_a_theorem(and(necessarily(esk33_0),X2))), inference(etableau_closure_rule, [i_0_791, ...])).
8.39/1.60	# End printing tableau
8.39/1.60	# SZS output end
8.39/1.60	# Branches closed with saturation will be marked with an "s"
8.39/1.60	# Child (26665) has found a proof.
8.39/1.60	
8.39/1.60	# Proof search is over...
8.39/1.60	# Freeing feature tree
8.39/1.61	EOF