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   : n008.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.34	% CPULimit   : 1200
0.13/0.34	% WCLimit    : 120
0.13/0.34	% DateTime   : Tue Jul 13 15:03:44 EDT 2021
0.13/0.34	% 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.37	# The folding up rule is enabled...
0.13/0.37	# Local unification is enabled...
0.13/0.37	# Any saturation attempts will use folding labels...
0.13/0.37	# 9 beginning clauses after preprocessing and clausification
0.13/0.37	# Creating start rules for all 1 conjectures.
0.13/0.37	# There are 1 start rule candidates:
0.13/0.37	# Found 9 unit axioms.
0.13/0.37	# 1 start rule tableaux created.
0.13/0.37	# 0 extension rule candidate clauses
0.13/0.37	# 9 unit axiom clauses
0.13/0.37	
0.13/0.37	# Requested 8, 32 cores available to the main process.
0.13/0.37	# There are not enough tableaux to fork, creating more from the initial 1
0.13/0.37	# Creating equality axioms
0.13/0.37	# Ran out of tableaux, making start rules for all clauses
0.13/0.37	# Returning from population with 20 new_tableaux and 0 remaining starting tableaux.
0.13/0.37	# We now have 20 tableaux to operate on
0.13/0.38	# There were 1 total branch saturation attempts.
0.13/0.38	# There were 0 of these attempts blocked.
0.13/0.38	# There were 0 deferred branch saturation attempts.
0.13/0.38	# There were 0 free duplicated saturations.
0.13/0.38	# There were 1 total successful branch saturations.
0.13/0.38	# There were 0 successful branch saturations in interreduction.
0.13/0.38	# There were 0 successful branch saturations on the branch.
0.13/0.38	# There were 1 successful branch saturations after the branch.
0.13/0.38	# SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
0.13/0.38	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.13/0.38	# Begin clausification derivation
0.13/0.38	
0.13/0.38	# End clausification derivation
0.13/0.38	# Begin listing active clauses obtained from FOF to CNF conversion
0.13/0.38	cnf(i_0_14, plain, (axiom(or(not(X1),or(X2,X1)))=true)).
0.13/0.38	cnf(i_0_20, plain, (axiom(or(not(or(X1,X1)),X1))=true)).
0.13/0.38	cnf(i_0_17, plain, (axiom(or(not(or(X1,X2)),or(X2,X1)))=true)).
0.13/0.38	cnf(i_0_16, plain, (ifeq(X1,X1,X2,X3)=X2)).
0.13/0.38	cnf(i_0_18, plain, (ifeq(axiom(X1),true,theorem(X1),true)=true)).
0.13/0.38	cnf(i_0_13, negated_conjecture, (theorem(not(not(or(not(p),not(not(p))))))!=true)).
0.13/0.38	cnf(i_0_12, plain, (axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3))))=true)).
0.13/0.38	cnf(i_0_21, plain, (axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2))))=true)).
0.13/0.38	cnf(i_0_15, plain, (ifeq(theorem(or(not(X1),X2)),true,ifeq(theorem(X1),true,theorem(X2),true),true)=true)).
0.13/0.38	cnf(i_0_24, plain, (X4=X4)).
0.13/0.38	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.13/0.38	# Begin printing tableau
0.13/0.38	# Found 8 steps
0.13/0.38	cnf(i_0_14, plain, (axiom(or(not(X26),or(X25,X26)))=true), inference(start_rule)).
0.13/0.38	cnf(i_0_33, plain, (axiom(or(not(X26),or(X25,X26)))=true), inference(extension_rule, [i_0_32])).
0.13/0.38	cnf(i_0_60, plain, (axiom(or(not(true),or(true,true)))!=true), inference(closure_rule, [i_0_14])).
0.13/0.38	cnf(i_0_61, plain, (axiom(or(not(true),or(true,true)))!=true), inference(closure_rule, [i_0_14])).
0.13/0.38	cnf(i_0_62, plain, (axiom(or(not(true),or(true,true)))!=true), inference(closure_rule, [i_0_14])).
0.13/0.38	cnf(i_0_59, plain, (ifeq(axiom(or(not(true),or(true,true))),axiom(or(not(true),or(true,true))),axiom(or(not(true),or(true,true))),axiom(or(not(X26),or(X25,X26))))=ifeq(true,true,true,true)), inference(extension_rule, [i_0_27])).
0.13/0.38	cnf(i_0_70, plain, (ifeq(true,true,true,true)!=true), inference(closure_rule, [i_0_16])).
0.13/0.38	cnf(i_0_68, plain, (ifeq(axiom(or(not(true),or(true,true))),axiom(or(not(true),or(true,true))),axiom(or(not(true),or(true,true))),axiom(or(not(X26),or(X25,X26))))=true), inference(etableau_closure_rule, [i_0_68, ...])).
0.13/0.38	# End printing tableau
0.13/0.38	# SZS output end
0.13/0.38	# Branches closed with saturation will be marked with an "s"
0.13/0.38	# There were 1 total branch saturation attempts.
0.13/0.38	# There were 0 of these attempts blocked.
0.13/0.38	# There were 0 deferred branch saturation attempts.
0.13/0.38	# There were 0 free duplicated saturations.
0.13/0.38	# There were 1 total successful branch saturations.
0.13/0.38	# There were 0 successful branch saturations in interreduction.
0.13/0.38	# There were 0 successful branch saturations on the branch.
0.13/0.38	# There were 1 successful branch saturations after the branch.
0.13/0.38	# There were 1 total branch saturation attempts.
0.13/0.38	# There were 0 of these attempts blocked.
0.13/0.38	# There were 0 deferred branch saturation attempts.
0.13/0.38	# There were 0 free duplicated saturations.
0.13/0.38	# There were 1 total successful branch saturations.
0.13/0.38	# There were 0 successful branch saturations in interreduction.
0.13/0.38	# There were 0 successful branch saturations on the branch.
0.13/0.38	# There were 1 successful branch saturations after the branch.
0.13/0.38	# SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
0.13/0.38	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.13/0.38	# Begin clausification derivation
0.13/0.38	
0.13/0.38	# End clausification derivation
0.13/0.38	# Begin listing active clauses obtained from FOF to CNF conversion
0.13/0.38	cnf(i_0_14, plain, (axiom(or(not(X1),or(X2,X1)))=true)).
0.13/0.38	cnf(i_0_20, plain, (axiom(or(not(or(X1,X1)),X1))=true)).
0.13/0.38	cnf(i_0_17, plain, (axiom(or(not(or(X1,X2)),or(X2,X1)))=true)).
0.13/0.38	cnf(i_0_16, plain, (ifeq(X1,X1,X2,X3)=X2)).
0.13/0.38	cnf(i_0_18, plain, (ifeq(axiom(X1),true,theorem(X1),true)=true)).
0.13/0.38	cnf(i_0_13, negated_conjecture, (theorem(not(not(or(not(p),not(not(p))))))!=true)).
0.13/0.38	cnf(i_0_12, plain, (axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3))))=true)).
0.13/0.38	cnf(i_0_21, plain, (axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2))))=true)).
0.13/0.38	cnf(i_0_15, plain, (ifeq(theorem(or(not(X1),X2)),true,ifeq(theorem(X1),true,theorem(X2),true),true)=true)).
0.13/0.38	cnf(i_0_24, plain, (X4=X4)).
0.13/0.38	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.13/0.38	# Begin printing tableau
0.13/0.38	# Found 8 steps
0.13/0.38	cnf(i_0_14, plain, (axiom(or(not(X14),or(X13,X14)))=true), inference(start_rule)).
0.13/0.38	cnf(i_0_33, plain, (axiom(or(not(X14),or(X13,X14)))=true), inference(extension_rule, [i_0_32])).
0.13/0.38	cnf(i_0_60, plain, (axiom(or(not(true),or(true,true)))!=true), inference(closure_rule, [i_0_14])).
0.13/0.38	cnf(i_0_62, plain, (axiom(or(not(true),or(true,true)))!=true), inference(closure_rule, [i_0_14])).
0.13/0.38	cnf(i_0_63, plain, (axiom(or(not(true),or(true,true)))!=true), inference(closure_rule, [i_0_14])).
0.13/0.38	cnf(i_0_59, plain, (ifeq(axiom(or(not(true),or(true,true))),axiom(or(not(X14),or(X13,X14))),axiom(or(not(true),or(true,true))),axiom(or(not(true),or(true,true))))=ifeq(true,true,true,true)), inference(extension_rule, [i_0_27])).
0.13/0.38	cnf(i_0_70, plain, (ifeq(true,true,true,true)!=true), inference(closure_rule, [i_0_16])).
0.13/0.38	cnf(i_0_68, plain, (ifeq(axiom(or(not(true),or(true,true))),axiom(or(not(X14),or(X13,X14))),axiom(or(not(true),or(true,true))),axiom(or(not(true),or(true,true))))=true), inference(etableau_closure_rule, [i_0_68, ...])).
0.13/0.38	# End printing tableau
0.13/0.38	# SZS output end
0.13/0.38	# Branches closed with saturation will be marked with an "s"
0.13/0.38	# SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
0.13/0.38	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.13/0.38	# Begin clausification derivation
0.13/0.38	
0.13/0.38	# End clausification derivation
0.13/0.38	# Begin listing active clauses obtained from FOF to CNF conversion
0.13/0.38	cnf(i_0_14, plain, (axiom(or(not(X1),or(X2,X1)))=true)).
0.13/0.38	cnf(i_0_20, plain, (axiom(or(not(or(X1,X1)),X1))=true)).
0.13/0.38	cnf(i_0_17, plain, (axiom(or(not(or(X1,X2)),or(X2,X1)))=true)).
0.13/0.38	cnf(i_0_16, plain, (ifeq(X1,X1,X2,X3)=X2)).
0.13/0.38	cnf(i_0_18, plain, (ifeq(axiom(X1),true,theorem(X1),true)=true)).
0.13/0.38	cnf(i_0_13, negated_conjecture, (theorem(not(not(or(not(p),not(not(p))))))!=true)).
0.13/0.38	cnf(i_0_12, plain, (axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3))))=true)).
0.13/0.38	cnf(i_0_21, plain, (axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2))))=true)).
0.13/0.38	cnf(i_0_15, plain, (ifeq(theorem(or(not(X1),X2)),true,ifeq(theorem(X1),true,theorem(X2),true),true)=true)).
0.13/0.38	cnf(i_0_24, plain, (X4=X4)).
0.13/0.38	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.13/0.38	# Begin printing tableau
0.13/0.38	# Found 8 steps
0.13/0.38	cnf(i_0_14, plain, (axiom(or(not(X16),or(X15,X16)))=true), inference(start_rule)).
0.13/0.38	cnf(i_0_33, plain, (axiom(or(not(X16),or(X15,X16)))=true), inference(extension_rule, [i_0_32])).
0.13/0.38	cnf(i_0_60, plain, (axiom(or(not(true),or(true,true)))!=true), inference(closure_rule, [i_0_14])).
0.13/0.38	cnf(i_0_61, plain, (axiom(or(not(true),or(true,true)))!=true), inference(closure_rule, [i_0_14])).
0.13/0.38	cnf(i_0_63, plain, (axiom(or(not(true),or(true,true)))!=true), inference(closure_rule, [i_0_14])).
0.13/0.38	cnf(i_0_59, plain, (ifeq(axiom(or(not(true),or(true,true))),axiom(or(not(true),or(true,true))),axiom(or(not(X16),or(X15,X16))),axiom(or(not(true),or(true,true))))=ifeq(true,true,true,true)), inference(extension_rule, [i_0_27])).
0.13/0.38	cnf(i_0_70, plain, (ifeq(true,true,true,true)!=true), inference(closure_rule, [i_0_16])).
0.13/0.38	cnf(i_0_68, plain, (ifeq(axiom(or(not(true),or(true,true))),axiom(or(not(true),or(true,true))),axiom(or(not(X16),or(X15,X16))),axiom(or(not(true),or(true,true))))=true), inference(etableau_closure_rule, [i_0_68, ...])).
0.13/0.38	# End printing tableau
0.13/0.38	# SZS output end
0.13/0.38	# Branches closed with saturation will be marked with an "s"
0.13/0.38	# There were 1 total branch saturation attempts.
0.13/0.38	# There were 0 of these attempts blocked.
0.13/0.38	# There were 0 deferred branch saturation attempts.
0.13/0.38	# There were 0 free duplicated saturations.
0.13/0.38	# There were 1 total successful branch saturations.
0.13/0.38	# There were 0 successful branch saturations in interreduction.
0.13/0.38	# There were 0 successful branch saturations on the branch.
0.13/0.38	# There were 1 successful branch saturations after the branch.
0.13/0.38	# SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
0.13/0.38	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.13/0.38	# Begin clausification derivation
0.13/0.38	
0.13/0.38	# End clausification derivation
0.13/0.38	# Begin listing active clauses obtained from FOF to CNF conversion
0.13/0.38	cnf(i_0_14, plain, (axiom(or(not(X1),or(X2,X1)))=true)).
0.13/0.38	cnf(i_0_20, plain, (axiom(or(not(or(X1,X1)),X1))=true)).
0.13/0.38	cnf(i_0_17, plain, (axiom(or(not(or(X1,X2)),or(X2,X1)))=true)).
0.13/0.38	cnf(i_0_16, plain, (ifeq(X1,X1,X2,X3)=X2)).
0.13/0.38	cnf(i_0_18, plain, (ifeq(axiom(X1),true,theorem(X1),true)=true)).
0.13/0.38	cnf(i_0_13, negated_conjecture, (theorem(not(not(or(not(p),not(not(p))))))!=true)).
0.13/0.38	cnf(i_0_12, plain, (axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3))))=true)).
0.13/0.38	cnf(i_0_21, plain, (axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2))))=true)).
0.13/0.38	cnf(i_0_15, plain, (ifeq(theorem(or(not(X1),X2)),true,ifeq(theorem(X1),true,theorem(X2),true),true)=true)).
0.13/0.38	cnf(i_0_24, plain, (X4=X4)).
0.13/0.38	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.13/0.38	# Begin printing tableau
0.13/0.38	# Found 8 steps
0.13/0.38	cnf(i_0_14, plain, (axiom(or(not(X12),or(X11,X12)))=true), inference(start_rule)).
0.13/0.38	cnf(i_0_33, plain, (axiom(or(not(X12),or(X11,X12)))=true), inference(extension_rule, [i_0_32])).
0.13/0.38	cnf(i_0_61, plain, (axiom(or(not(true),or(true,true)))!=true), inference(closure_rule, [i_0_14])).
0.13/0.38	cnf(i_0_62, plain, (axiom(or(not(true),or(true,true)))!=true), inference(closure_rule, [i_0_14])).
0.13/0.38	cnf(i_0_63, plain, (axiom(or(not(true),or(true,true)))!=true), inference(closure_rule, [i_0_14])).
0.13/0.38	cnf(i_0_59, plain, (ifeq(axiom(or(not(X12),or(X11,X12))),axiom(or(not(true),or(true,true))),axiom(or(not(true),or(true,true))),axiom(or(not(true),or(true,true))))=ifeq(true,true,true,true)), inference(extension_rule, [i_0_27])).
0.13/0.38	cnf(i_0_70, plain, (ifeq(true,true,true,true)!=true), inference(closure_rule, [i_0_16])).
0.13/0.38	cnf(i_0_68, plain, (ifeq(axiom(or(not(X12),or(X11,X12))),axiom(or(not(true),or(true,true))),axiom(or(not(true),or(true,true))),axiom(or(not(true),or(true,true))))=true), inference(etableau_closure_rule, [i_0_68, ...])).
0.13/0.38	# End printing tableau
0.13/0.38	# SZS output end
0.13/0.38	# Branches closed with saturation will be marked with an "s"
0.13/0.38	# Child (24066) has found a proof.
0.13/0.38	
0.13/0.38	# Proof search is over...
0.13/0.38	# Freeing feature tree
0.13/0.38	EOF