0.09/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.09/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.35	% Computer   : n026.cluster.edu
0.11/0.35	% Model      : x86_64 x86_64
0.11/0.35	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.35	% Memory     : 8042.1875MB
0.11/0.35	% OS         : Linux 3.10.0-693.el7.x86_64
0.11/0.35	% CPULimit   : 1200
0.11/0.35	% WCLimit    : 120
0.11/0.35	% DateTime   : Tue Jul 13 14:20:59 EDT 2021
0.11/0.35	% CPUTime    : 
0.11/0.38	# No SInE strategy applied
0.11/0.38	# Auto-Mode selected heuristic G_____X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S
0.11/0.38	# and selection function SelectNewComplexAHP.
0.11/0.38	#
0.11/0.38	# Presaturation interreduction done
0.11/0.38	# Number of axioms: 6 Number of unprocessed: 6
0.11/0.38	# Tableaux proof search.
0.11/0.38	# APR header successfully linked.
0.11/0.38	# Hello from C++
0.11/0.38	# The folding up rule is enabled...
0.11/0.38	# Local unification is enabled...
0.11/0.38	# Any saturation attempts will use folding labels...
0.11/0.38	# 6 beginning clauses after preprocessing and clausification
0.11/0.38	# Creating start rules for all 1 conjectures.
0.11/0.38	# There are 1 start rule candidates:
0.11/0.38	# Found 6 unit axioms.
0.11/0.38	# 1 start rule tableaux created.
0.11/0.38	# 0 extension rule candidate clauses
0.11/0.38	# 6 unit axiom clauses
0.11/0.38	
0.11/0.38	# Requested 8, 32 cores available to the main process.
0.11/0.38	# There are not enough tableaux to fork, creating more from the initial 1
0.11/0.38	# Creating equality axioms
0.11/0.38	# Ran out of tableaux, making start rules for all clauses
0.11/0.38	# Returning from population with 14 new_tableaux and 0 remaining starting tableaux.
0.11/0.38	# We now have 14 tableaux to operate on
14.79/2.24	# There were 1 total branch saturation attempts.
14.79/2.24	# There were 0 of these attempts blocked.
14.79/2.24	# There were 0 deferred branch saturation attempts.
14.79/2.24	# There were 0 free duplicated saturations.
14.79/2.24	# There were 1 total successful branch saturations.
14.79/2.24	# There were 0 successful branch saturations in interreduction.
14.79/2.24	# There were 0 successful branch saturations on the branch.
14.79/2.24	# There were 1 successful branch saturations after the branch.
14.79/2.24	# SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
14.79/2.24	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
14.79/2.24	# Begin clausification derivation
14.79/2.24	
14.79/2.24	# End clausification derivation
14.79/2.24	# Begin listing active clauses obtained from FOF to CNF conversion
14.79/2.24	cnf(i_0_8, plain, (ifeq(X1,X1,X2,X3)=X2)).
14.79/2.24	cnf(i_0_12, plain, (ifeq(is_a_theorem(equivalent(X1,X2)),true,ifeq(is_a_theorem(X1),true,is_a_theorem(X2),true),true)=true)).
14.79/2.24	cnf(i_0_7, plain, (is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X4),X4))=true)).
14.79/2.24	cnf(i_0_11, plain, (is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),X3),X4),equivalent(equivalent(equivalent(X1,X5),X3),equivalent(equivalent(X2,X5),X4))))=true)).
14.79/2.24	cnf(i_0_10, plain, (is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4),equivalent(equivalent(X2,X3),X4)),X5),X5))=true)).
14.79/2.24	cnf(i_0_9, negated_conjecture, (is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,b),a)),c),c))!=true)).
14.79/2.24	cnf(i_0_14, plain, (X6=X6)).
14.79/2.24	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
14.79/2.24	# Begin printing tableau
14.79/2.24	# Found 8 steps
14.79/2.24	cnf(i_0_8, plain, (ifeq(X14,X14,X5,X12)=X5), inference(start_rule)).
14.79/2.24	cnf(i_0_21, plain, (ifeq(X14,X14,X5,X12)=X5), inference(extension_rule, [i_0_20])).
14.79/2.24	cnf(i_0_42, plain, (ifeq(X5,X5,X5,X11)!=X5), inference(closure_rule, [i_0_8])).
14.79/2.24	cnf(i_0_43, plain, (ifeq(X5,X5,X10,X11)!=X10), inference(closure_rule, [i_0_8])).
14.79/2.24	cnf(i_0_44, plain, (ifeq(X5,X5,X11,X11)!=X11), inference(closure_rule, [i_0_8])).
14.79/2.24	cnf(i_0_40, plain, (ifeq(ifeq(X14,X14,X5,X12),ifeq(X5,X5,X5,X11),ifeq(X5,X5,X10,X11),ifeq(X5,X5,X11,X11))=ifeq(X5,X5,X10,X11)), inference(extension_rule, [i_0_17])).
14.79/2.24	cnf(i_0_51, plain, (ifeq(X5,X5,X10,X11)!=X10), inference(closure_rule, [i_0_8])).
14.79/2.24	cnf(i_0_49, plain, (ifeq(ifeq(X14,X14,X5,X12),ifeq(X5,X5,X5,X11),ifeq(X5,X5,X10,X11),ifeq(X5,X5,X11,X11))=X10), inference(etableau_closure_rule, [i_0_49, ...])).
14.79/2.24	# End printing tableau
14.79/2.24	# SZS output end
14.79/2.24	# Branches closed with saturation will be marked with an "s"
14.79/2.26	# There were 1 total branch saturation attempts.
14.79/2.26	# There were 0 of these attempts blocked.
14.79/2.26	# There were 0 deferred branch saturation attempts.
14.79/2.26	# There were 0 free duplicated saturations.
14.79/2.26	# There were 1 total successful branch saturations.
14.79/2.26	# There were 0 successful branch saturations in interreduction.
14.79/2.26	# There were 0 successful branch saturations on the branch.
14.79/2.26	# There were 1 successful branch saturations after the branch.
14.79/2.26	# SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
14.79/2.26	# SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
14.79/2.26	# Begin clausification derivation
14.79/2.26	
14.79/2.26	# End clausification derivation
14.79/2.26	# Begin listing active clauses obtained from FOF to CNF conversion
14.79/2.26	cnf(i_0_8, plain, (ifeq(X1,X1,X2,X3)=X2)).
14.79/2.26	cnf(i_0_12, plain, (ifeq(is_a_theorem(equivalent(X1,X2)),true,ifeq(is_a_theorem(X1),true,is_a_theorem(X2),true),true)=true)).
14.79/2.26	cnf(i_0_7, plain, (is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X4),X4))=true)).
14.79/2.26	cnf(i_0_11, plain, (is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),X3),X4),equivalent(equivalent(equivalent(X1,X5),X3),equivalent(equivalent(X2,X5),X4))))=true)).
14.79/2.26	cnf(i_0_10, plain, (is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4),equivalent(equivalent(X2,X3),X4)),X5),X5))=true)).
14.79/2.26	cnf(i_0_9, negated_conjecture, (is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,b),a)),c),c))!=true)).
14.79/2.26	cnf(i_0_14, plain, (X6=X6)).
14.79/2.26	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
14.79/2.26	# Begin printing tableau
14.79/2.26	# Found 5 steps
14.79/2.26	cnf(i_0_8, plain, (ifeq(X8,X8,equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,true)),equivalent(X2,true)),X4),X4),X6)=equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,true)),equivalent(X2,true)),X4),X4)), inference(start_rule)).
14.79/2.26	cnf(i_0_21, plain, (ifeq(X8,X8,equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,true)),equivalent(X2,true)),X4),X4),X6)=equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,true)),equivalent(X2,true)),X4),X4)), inference(extension_rule, [i_0_19])).
14.79/2.26	cnf(i_0_38, plain, (is_a_theorem(ifeq(X8,X8,equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,true)),equivalent(X2,true)),X4),X4),X6))=is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,true)),equivalent(X2,true)),X4),X4))), inference(extension_rule, [i_0_17])).
14.79/2.26	cnf(i_0_51, plain, (is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,true)),equivalent(X2,true)),X4),X4))!=true), inference(closure_rule, [i_0_7])).
14.79/2.26	cnf(i_0_49, plain, (is_a_theorem(ifeq(X8,X8,equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,true)),equivalent(X2,true)),X4),X4),X6))=true), inference(etableau_closure_rule, [i_0_49, ...])).
14.79/2.26	# End printing tableau
14.79/2.26	# SZS output end
14.79/2.26	# Branches closed with saturation will be marked with an "s"
14.79/2.26	# Child (13677) has found a proof.
14.79/2.26	
14.79/2.26	# Proof search is over...
14.79/2.26	# Freeing feature tree
14.79/2.28	EOF