0.07/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.12	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.11/0.33	% Computer   : n026.cluster.edu
0.11/0.33	% Model      : x86_64 x86_64
0.11/0.33	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.33	% Memory     : 8042.1875MB
0.11/0.33	% OS         : Linux 3.10.0-693.el7.x86_64
0.11/0.33	% CPULimit   : 1200
0.11/0.33	% WCLimit    : 120
0.11/0.33	% DateTime   : Tue Jul 13 12:51:44 EDT 2021
0.11/0.33	% CPUTime    : 
0.11/0.36	# No SInE strategy applied
0.11/0.36	# Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN
0.11/0.36	# and selection function PSelectComplexExceptUniqMaxHorn.
0.11/0.36	#
0.11/0.36	# Number of axioms: 16 Number of unprocessed: 16
0.11/0.36	# Tableaux proof search.
0.11/0.36	# APR header successfully linked.
0.11/0.36	# 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	# 16 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 16 unit axioms.
0.11/0.36	# 1 start rule tableaux created.
0.11/0.36	# 0 extension rule candidate clauses
0.11/0.36	# 16 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 24 new_tableaux and 0 remaining starting tableaux.
0.11/0.36	# We now have 24 tableaux to operate on
49.74/6.66	# There were 1 total branch saturation attempts.
49.74/6.66	# There were 0 of these attempts blocked.
49.74/6.66	# There were 0 deferred branch saturation attempts.
49.74/6.66	# There were 0 free duplicated saturations.
49.74/6.66	# There were 1 total successful branch saturations.
49.74/6.66	# There were 0 successful branch saturations in interreduction.
49.74/6.66	# There were 0 successful branch saturations on the branch.
49.74/6.66	# There were 1 successful branch saturations after the branch.
49.74/6.66	# SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
49.74/6.66	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
49.74/6.66	# Begin clausification derivation
49.74/6.66	
49.74/6.66	# End clausification derivation
49.74/6.66	# Begin listing active clauses obtained from FOF to CNF conversion
49.74/6.66	cnf(i_0_20, plain, (not(not(X1))=X1)).
49.74/6.66	cnf(i_0_21, plain, (implies(X1,truth)=truth)).
49.74/6.66	cnf(i_0_27, plain, (implies(truth,X1)=X1)).
49.74/6.66	cnf(i_0_28, plain, (implies(X1,X1)=truth)).
49.74/6.66	cnf(i_0_32, plain, (implies(X1,not(truth))=not(X1))).
49.74/6.66	cnf(i_0_23, plain, (implies(X1,implies(X2,X1))=truth)).
49.74/6.66	cnf(i_0_26, plain, (implies(not(X2),not(X1))=implies(X1,X2))).
49.74/6.66	cnf(i_0_18, plain, (implies(X1,implies(X2,X3))=implies(X2,implies(X1,X3)))).
49.74/6.66	cnf(i_0_25, plain, (implies(implies(X1,X2),X2)=implies(implies(X2,X1),X1))).
49.74/6.66	cnf(i_0_22, plain, (implies(implies(not(X1),not(X2)),implies(X2,X1))=truth)).
49.74/6.66	cnf(i_0_19, plain, (implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2)))=truth)).
49.74/6.66	cnf(i_0_29, plain, (implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))=truth)).
49.74/6.66	cnf(i_0_17, negated_conjecture, (implies(implies(implies(a,b),implies(b,a)),implies(b,a))!=truth)).
49.74/6.66	cnf(i_0_30, plain, (ifeq(X1,X1,X2,X3)=X2)).
49.74/6.66	cnf(i_0_24, plain, (ifeq(implies(X2,X1),implies(X1,X2),X2,X1)=X1)).
49.74/6.66	cnf(i_0_31, plain, (ifeq(implies(X1,X2),implies(X2,X3),implies(X1,X3),truth)=truth)).
49.74/6.66	cnf(i_0_34, plain, (X4=X4)).
49.74/6.66	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
49.74/6.66	# Begin printing tableau
49.74/6.66	# Found 6 steps
49.74/6.66	cnf(i_0_20, plain, (not(not(truth))=truth), inference(start_rule)).
49.74/6.66	cnf(i_0_41, plain, (not(not(truth))=truth), inference(extension_rule, [i_0_37])).
49.74/6.66	cnf(i_0_62, plain, (implies(implies(implies(a,b),implies(b,a)),implies(b,a))=truth), inference(closure_rule, [i_0_17])).
49.74/6.66	cnf(i_0_63, plain, (implies(implies(implies(a,b),implies(b,a)),implies(b,a))!=not(not(truth))), inference(extension_rule, [i_0_37])).
49.74/6.66	cnf(i_0_80, plain, (implies(implies(implies(a,b),implies(b,a)),implies(b,a))!=not(not(implies(implies(implies(a,b),implies(b,a)),implies(b,a))))), inference(closure_rule, [i_0_20])).
49.74/6.66	cnf(i_0_81, plain, (not(not(implies(implies(implies(a,b),implies(b,a)),implies(b,a))))!=not(not(truth))), inference(etableau_closure_rule, [i_0_81, ...])).
49.74/6.66	# End printing tableau
49.74/6.66	# SZS output end
49.74/6.66	# Branches closed with saturation will be marked with an "s"
50.15/6.70	# Child (16227) has found a proof.
50.15/6.70	
50.15/6.70	# Proof search is over...
50.15/6.70	# Freeing feature tree
50.15/6.79	EOF