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