0.00/0.09	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.10	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.09/0.30	% Computer   : n008.cluster.edu
0.09/0.30	% Model      : x86_64 x86_64
0.09/0.30	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.09/0.30	% Memory     : 8042.1875MB
0.09/0.30	% OS         : Linux 3.10.0-693.el7.x86_64
0.09/0.30	% CPULimit   : 1200
0.09/0.30	% WCLimit    : 120
0.09/0.30	% DateTime   : Tue Jul 13 15:21:14 EDT 2021
0.09/0.30	% CPUTime    : 
0.14/0.32	# No SInE strategy applied
0.14/0.32	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
0.14/0.32	# and selection function SelectComplexExceptUniqMaxHorn.
0.14/0.32	#
0.14/0.32	# Presaturation interreduction done
0.14/0.32	# Number of axioms: 10 Number of unprocessed: 10
0.14/0.32	# Tableaux proof search.
0.14/0.32	# APR header successfully linked.
0.14/0.32	# Hello from C++
0.14/0.32	# The folding up rule is enabled...
0.14/0.32	# Local unification is enabled...
0.14/0.32	# Any saturation attempts will use folding labels...
0.14/0.32	# 10 beginning clauses after preprocessing and clausification
0.14/0.32	# Creating start rules for all 1 conjectures.
0.14/0.32	# There are 1 start rule candidates:
0.14/0.32	# Found 10 unit axioms.
0.14/0.32	# 1 start rule tableaux created.
0.14/0.32	# 0 extension rule candidate clauses
0.14/0.32	# 10 unit axiom clauses
0.14/0.32	
0.14/0.32	# Requested 8, 32 cores available to the main process.
0.14/0.32	# There are not enough tableaux to fork, creating more from the initial 1
0.14/0.32	# Creating equality axioms
0.14/0.32	# Ran out of tableaux, making start rules for all clauses
0.14/0.32	# Returning from population with 20 new_tableaux and 0 remaining starting tableaux.
0.14/0.32	# We now have 20 tableaux to operate on
12.73/1.93	# There were 1 total branch saturation attempts.
12.73/1.93	# There were 0 of these attempts blocked.
12.73/1.93	# There were 0 deferred branch saturation attempts.
12.73/1.93	# There were 0 free duplicated saturations.
12.73/1.93	# There were 1 total successful branch saturations.
12.73/1.93	# There were 0 successful branch saturations in interreduction.
12.73/1.93	# There were 0 successful branch saturations on the branch.
12.73/1.93	# There were 1 successful branch saturations after the branch.
12.73/1.93	# SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
12.73/1.93	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
12.73/1.93	# Begin clausification derivation
12.73/1.93	
12.73/1.93	# End clausification derivation
12.73/1.93	# Begin listing active clauses obtained from FOF to CNF conversion
12.73/1.93	cnf(i_0_18, plain, (ifeq(X1,X1,X2,X3)=X2)).
12.73/1.93	cnf(i_0_16, plain, (axiom(or(not(X1),or(X2,X1)))=true)).
12.73/1.93	cnf(i_0_17, plain, (axiom(or(not(or(X1,X1)),X1))=true)).
12.73/1.93	cnf(i_0_20, plain, (ifeq(axiom(X1),true,theorem(X1),true)=true)).
12.73/1.93	cnf(i_0_12, plain, (axiom(or(not(or(X1,X2)),or(X2,X1)))=true)).
12.73/1.93	cnf(i_0_13, plain, (axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3))))=true)).
12.73/1.93	cnf(i_0_19, plain, (axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2))))=true)).
12.73/1.93	cnf(i_0_14, plain, (ifeq(theorem(X1),true,ifeq(axiom(or(not(X1),X2)),true,theorem(X2),true),true)=true)).
12.73/1.93	cnf(i_0_15, plain, (ifeq(theorem(or(not(X1),X2)),true,ifeq(axiom(or(not(X3),X1)),true,theorem(or(not(X3),X2)),true),true)=true)).
12.73/1.93	cnf(i_0_11, negated_conjecture, (theorem(or(not(or(not(or(p,q)),q)),or(not(p),q)))!=true)).
12.73/1.93	cnf(i_0_22, plain, (X4=X4)).
12.73/1.93	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
12.73/1.93	# Begin printing tableau
12.73/1.93	# Found 5 steps
12.73/1.93	cnf(i_0_18, plain, (ifeq(X11,X11,X13,X12)=X13), inference(start_rule)).
12.73/1.93	cnf(i_0_31, plain, (ifeq(X11,X11,X13,X12)=X13), inference(extension_rule, [i_0_28])).
12.73/1.93	cnf(i_0_54, plain, (theorem(ifeq(X11,X11,X13,X12))=theorem(X13)), inference(extension_rule, [i_0_26])).
12.73/1.93	cnf(i_0_137, plain, (X3!=ifeq(X1,X1,X3,X3)), inference(closure_rule, [i_0_18])).
12.73/1.93	cnf(i_0_135, plain, (or(theorem(ifeq(X11,X11,X13,X12)),X3)=or(theorem(X13),ifeq(X1,X1,X3,X3))), inference(etableau_closure_rule, [i_0_135, ...])).
12.73/1.93	# End printing tableau
12.73/1.93	# SZS output end
12.73/1.93	# Branches closed with saturation will be marked with an "s"
12.73/1.93	# Child (8857) has found a proof.
12.73/1.93	
12.73/1.93	# Proof search is over...
12.73/1.93	# Freeing feature tree
12.73/1.94	EOF