0.05/0.10	% 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.09/0.31	% Computer   : n025.cluster.edu
0.09/0.31	% Model      : x86_64 x86_64
0.09/0.31	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.09/0.31	% Memory     : 8042.1875MB
0.09/0.31	% OS         : Linux 3.10.0-693.el7.x86_64
0.09/0.31	% CPULimit   : 1200
0.09/0.31	% WCLimit    : 120
0.09/0.31	% DateTime   : Tue Jul 13 14:13:57 EDT 2021
0.09/0.31	% CPUTime    : 
0.15/0.34	# No SInE strategy applied
0.15/0.34	# Auto-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN
0.15/0.34	# and selection function PSelectComplexExceptUniqMaxHorn.
0.15/0.34	#
0.15/0.34	# Number of axioms: 6 Number of unprocessed: 6
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	# 6 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 6 unit axioms.
0.15/0.34	# 1 start rule tableaux created.
0.15/0.34	# 0 extension rule candidate clauses
0.15/0.34	# 6 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 16 new_tableaux and 0 remaining starting tableaux.
0.15/0.34	# We now have 16 tableaux to operate on
5.06/0.99	# There were 1 total branch saturation attempts.
5.06/0.99	# There were 0 of these attempts blocked.
5.06/0.99	# There were 0 deferred branch saturation attempts.
5.06/0.99	# There were 0 free duplicated saturations.
5.06/0.99	# There were 1 total successful branch saturations.
5.06/0.99	# There were 0 successful branch saturations in interreduction.
5.06/0.99	# There were 0 successful branch saturations on the branch.
5.06/0.99	# There were 1 successful branch saturations after the branch.
5.06/0.99	# SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
5.06/0.99	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
5.06/0.99	# Begin clausification derivation
5.06/0.99	
5.06/0.99	# End clausification derivation
5.06/0.99	# Begin listing active clauses obtained from FOF to CNF conversion
5.06/0.99	cnf(i_0_7, plain, (is_a_theorem(implies(X1,implies(not(X1),X2)))=true)).
5.06/0.99	cnf(i_0_11, plain, (is_a_theorem(implies(implies(not(X1),X1),X1))=true)).
5.06/0.99	cnf(i_0_8, plain, (ifeq(X1,X1,X2,X3)=X2)).
5.06/0.99	cnf(i_0_9, plain, (is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))=true)).
5.06/0.99	cnf(i_0_10, negated_conjecture, (is_a_theorem(implies(implies(a,implies(b,c)),implies(b,implies(a,c))))!=true)).
5.06/0.99	cnf(i_0_12, plain, (ifeq(is_a_theorem(implies(X1,X2)),true,ifeq(is_a_theorem(X1),true,is_a_theorem(X2),true),true)=true)).
5.06/0.99	cnf(i_0_14, plain, (X4=X4)).
5.06/0.99	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
5.06/0.99	# Begin printing tableau
5.06/0.99	# Found 6 steps
5.06/0.99	cnf(i_0_7, plain, (is_a_theorem(implies(X14,implies(not(X14),X13)))=true), inference(start_rule)).
5.06/0.99	cnf(i_0_22, plain, (is_a_theorem(implies(X14,implies(not(X14),X13)))=true), inference(extension_rule, [i_0_19])).
5.06/0.99	cnf(i_0_39, plain, (is_a_theorem(implies(X1,implies(not(X1),implies(true,true))))!=true), inference(closure_rule, [i_0_7])).
5.06/0.99	cnf(i_0_38, plain, (implies(is_a_theorem(implies(X1,implies(not(X1),implies(true,true)))),is_a_theorem(implies(X14,implies(not(X14),X13))))=implies(true,true)), inference(extension_rule, [i_0_17])).
5.06/0.99	cnf(i_0_54, plain, (implies(true,true)!=ifeq(X1,X1,implies(true,true),X3)), inference(closure_rule, [i_0_8])).
5.06/0.99	cnf(i_0_52, plain, (implies(is_a_theorem(implies(X1,implies(not(X1),implies(true,true)))),is_a_theorem(implies(X14,implies(not(X14),X13))))=ifeq(X1,X1,implies(true,true),X3)), inference(etableau_closure_rule, [i_0_52, ...])).
5.06/0.99	# End printing tableau
5.06/0.99	# SZS output end
5.06/0.99	# Branches closed with saturation will be marked with an "s"
5.06/1.00	# Child (28793) has found a proof.
5.06/1.00	
5.06/1.00	# Proof search is over...
5.06/1.00	# Freeing feature tree
5.06/1.00	EOF