0.03/0.09	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.10	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.10/0.30	Computer   : n017.cluster.edu
0.10/0.30	Model      : x86_64 x86_64
0.10/0.30	CPUModel   : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.30	RAMPerCPU  : 8042.1875MB
0.10/0.30	OS         : Linux 3.10.0-693.el7.x86_64
0.10/0.30	% CPULimit   : 960
0.10/0.30	% WCLimit    : 120
0.10/0.30	% DateTime   : Tue Aug  9 05:43:00 EDT 2022
0.10/0.30	% CPUTime    : 
0.15/0.33	# No SInE strategy applied
0.15/0.33	# Auto-Mode selected heuristic H_____047_B31_F1_PI_AE_R4_CS_SP_S2S
0.15/0.33	# and selection function SelectNewComplexAHP.
0.15/0.33	#
0.15/0.33	# Number of axioms: 15 Number of unprocessed: 15
0.15/0.33	# Tableaux proof search.
0.15/0.33	# APR header successfully linked.
0.15/0.33	# Hello from C++
1.82/2.04	# The folding up rule is enabled...
1.82/2.04	# Local unification is enabled...
1.82/2.04	# Any saturation attempts will use folding labels...
1.82/2.04	# 15 beginning clauses after preprocessing and clausification
1.82/2.04	# Creating start rules for all 1 conjectures.
1.82/2.04	# There are 1 start rule candidates:
1.82/2.04	# Found 8 unit axioms.
1.82/2.04	# 1 start rule tableaux created.
1.82/2.04	# 7 extension rule candidate clauses
1.82/2.04	# 8 unit axiom clauses
1.82/2.04	
1.82/2.04	# Requested 8, 32 cores available to the main process.
1.82/2.04	# There are not enough tableaux to fork, creating more from the initial 1
23.60/23.90	# Creating equality axioms
23.60/23.90	# Ran out of tableaux, making start rules for all clauses
23.60/23.90	# Returning from population with 23 new_tableaux and 0 remaining starting tableaux.
23.60/23.90	# We now have 23 tableaux to operate on
39.37/25.91	# There were 31 total branch saturation attempts.
39.37/25.91	# There were 16 of these attempts blocked.
39.37/25.91	# There were 0 deferred branch saturation attempts.
39.37/25.91	# There were 0 free duplicated saturations.
39.37/25.91	# There were 1 total successful branch saturations.
39.37/25.91	# There were 0 successful branch saturations in interreduction.
39.37/25.91	# There were 0 successful branch saturations on the branch.
39.37/25.91	# There were 1 successful branch saturations after the branch.
39.37/25.91	# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
39.37/25.91	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
39.37/25.91	# Begin clausification derivation
39.37/25.91	
39.37/25.91	# End clausification derivation
39.37/25.91	# Begin listing active clauses obtained from FOF to CNF conversion
39.37/25.91	cnf(i_0_6, plain, ('+'(X1,'1')='1')).
39.37/25.91	cnf(i_0_11, plain, ('>='(X1,'0'))).
39.37/25.91	cnf(i_0_2, plain, ('+'(X1,'0')=X1)).
39.37/25.91	cnf(i_0_7, plain, ('>='(X1,X1))).
39.37/25.91	cnf(i_0_5, plain, ('+'(X1,X2)='+'(X2,X1))).
39.37/25.91	cnf(i_0_12, plain, (X1=X2|~'>='(X2,X1)|~'>='(X1,X2))).
39.37/25.91	cnf(i_0_8, plain, ('>='(X3,X2)|~'>='(X3,X1)|~'>='(X1,X2))).
39.37/25.91	cnf(i_0_4, plain, ('+'('+'(X1,X2),X3)='+'(X1,'+'(X2,X3)))).
39.37/25.91	cnf(i_0_1, plain, ('==>'('==>'(X1,X2),X2)='==>'('==>'(X2,X1),X1))).
39.37/25.91	cnf(i_0_14, plain, ('>='('==>'(X3,X1),'==>'(X3,X2))|~'>='(X1,X2))).
39.37/25.91	cnf(i_0_3, plain, ('>='('==>'(X2,X3),'==>'(X1,X3))|~'>='(X1,X2))).
39.37/25.91	cnf(i_0_15, plain, ('>='('+'(X1,X3),'+'(X2,X3))|~'>='(X1,X2))).
39.37/25.91	cnf(i_0_13, negated_conjecture, ('+'(esk1_0,'==>'(esk1_0,esk2_0))!='+'(esk2_0,'==>'(esk2_0,esk1_0)))).
39.37/25.91	cnf(i_0_9, plain, ('>='(X2,'==>'(X1,X3))|~'>='('+'(X1,X2),X3))).
39.37/25.91	cnf(i_0_10, plain, ('>='('+'(X2,X1),X3)|~'>='(X1,'==>'(X2,X3)))).
39.37/25.91	cnf(i_0_3175637, plain, (X53=X53)).
39.37/25.91	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
39.37/25.91	# Begin printing tableau
39.37/25.91	# Found 6 steps
39.37/25.91	cnf(i_0_6, plain, ('+'(X6,'1')='1'), inference(start_rule)).
39.37/25.91	cnf(i_0_3175644, plain, ('+'(X6,'1')='1'), inference(extension_rule, [i_0_3175641])).
39.37/25.91	cnf(i_0_3175694, plain, ('+'('==>'('1','1'),'1')!='1'), inference(closure_rule, [i_0_6])).
39.37/25.91	cnf(i_0_3175692, plain, ('==>'('+'(X6,'1'),'+'('==>'('1','1'),'1'))='==>'('1','1')), inference(extension_rule, [i_0_3175640])).
39.37/25.91	cnf(i_0_3175724, plain, ('==>'('1','1')!='+'('==>'('1','1'),'0')), inference(closure_rule, [i_0_2])).
39.37/25.91	cnf(i_0_3175722, plain, ('==>'('+'(X6,'1'),'+'('==>'('1','1'),'1'))='+'('==>'('1','1'),'0')), inference(etableau_closure_rule, [i_0_3175722, ...])).
39.37/25.91	# End printing tableau
39.37/25.91	# SZS output end
39.37/25.91	# Branches closed with saturation will be marked with an "s"
39.37/25.92	# Child (12635) has found a proof.
39.37/25.92	
39.37/25.92	# Proof search is over...
39.37/25.92	# Freeing feature tree
39.37/25.94	EOF