0.02/0.09	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.02/0.09	% Command    : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
0.09/0.28	% Computer   : n008.cluster.edu
0.09/0.28	% Model      : x86_64 x86_64
0.09/0.28	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.09/0.28	% Memory     : 8042.1875MB
0.09/0.28	% OS         : Linux 3.10.0-693.el7.x86_64
0.09/0.28	% CPULimit   : 1200
0.09/0.28	% WCLimit    : 120
0.09/0.28	% DateTime   : Wed Jul 14 14:08:44 EDT 2021
0.09/0.28	% CPUTime    : 
0.09/0.30	# No SInE strategy applied
0.09/0.30	# Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
0.09/0.30	# and selection function SelectComplexExceptUniqMaxHorn.
0.09/0.30	#
0.09/0.30	# Presaturation interreduction done
0.09/0.30	# Number of axioms: 22 Number of unprocessed: 22
0.09/0.30	# Tableaux proof search.
0.09/0.30	# APR header successfully linked.
0.09/0.30	# Hello from C++
0.09/0.30	# The folding up rule is enabled...
0.09/0.30	# Local unification is enabled...
0.09/0.30	# Any saturation attempts will use folding labels...
0.09/0.30	# 22 beginning clauses after preprocessing and clausification
0.09/0.30	# Creating start rules for all 1 conjectures.
0.09/0.30	# There are 1 start rule candidates:
0.09/0.30	# Found 15 unit axioms.
0.09/0.30	# 1 start rule tableaux created.
0.09/0.30	# 7 extension rule candidate clauses
0.09/0.30	# 15 unit axiom clauses
0.09/0.30	
0.09/0.30	# Requested 8, 32 cores available to the main process.
0.09/0.30	# There are not enough tableaux to fork, creating more from the initial 1
0.09/0.30	# Creating equality axioms
0.09/0.30	# Ran out of tableaux, making start rules for all clauses
0.09/0.30	# Returning from population with 34 new_tableaux and 0 remaining starting tableaux.
0.09/0.30	# We now have 34 tableaux to operate on
0.13/0.33	# There were 1 total branch saturation attempts.
0.13/0.33	# There were 0 of these attempts blocked.
0.13/0.33	# There were 0 deferred branch saturation attempts.
0.13/0.33	# There were 0 free duplicated saturations.
0.13/0.33	# There were 1 total successful branch saturations.
0.13/0.33	# There were 0 successful branch saturations in interreduction.
0.13/0.33	# There were 0 successful branch saturations on the branch.
0.13/0.33	# There were 1 successful branch saturations after the branch.
0.13/0.33	# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
0.13/0.33	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.13/0.33	# Begin clausification derivation
0.13/0.33	
0.13/0.33	# End clausification derivation
0.13/0.33	# Begin listing active clauses obtained from FOF to CNF conversion
0.13/0.33	cnf(i_0_17, plain, (public(a))).
0.13/0.33	cnf(i_0_4, plain, (public(imp))).
0.13/0.33	cnf(i_0_11, plain, (public(k3))).
0.13/0.33	cnf(i_0_3, plain, (public(data))).
0.13/0.33	cnf(i_0_5, plain, (public(pin))).
0.13/0.33	cnf(i_0_19, plain, (public(z))).
0.13/0.33	cnf(i_0_15, plain, (xor(X1,X1)=z)).
0.13/0.33	cnf(i_0_7, plain, (xor(X1,z)=X1)).
0.13/0.33	cnf(i_0_2, plain, (enc(X1,enc(inv(X1),X2))=X2)).
0.13/0.33	cnf(i_0_18, plain, (public(enc(xor(pin,kek),pp)))).
0.13/0.33	cnf(i_0_12, plain, (xor(xor(X1,X2),X3)=xor(X1,xor(X2,X3)))).
0.13/0.33	cnf(i_0_1, plain, (public(enc(xor(km,kp(imp)),xor(kek,k3))))).
0.13/0.33	cnf(i_0_13, plain, (public(enc(xor(km,imp),xor(kek,xor(data,pin)))))).
0.13/0.33	cnf(i_0_6, plain, (xor(X1,X2)=xor(X2,X1))).
0.13/0.33	cnf(i_0_20, negated_conjecture, (~public(enc(pp,a)))).
0.13/0.33	cnf(i_0_22, plain, (public(kp(X1))|~public(X1))).
0.13/0.33	cnf(i_0_16, plain, (public(xor(X1,X2))|~public(X1)|~public(X2))).
0.13/0.33	cnf(i_0_9, plain, (public(enc(X1,X2))|~public(X2)|~public(X1))).
0.13/0.33	cnf(i_0_8, plain, (public(enc(inv(X1),X2))|~public(X2)|~public(X1))).
0.13/0.33	cnf(i_0_10, plain, (public(enc(enc(inv(xor(km,data)),X1),X2))|~public(X2)|~public(X1))).
0.13/0.33	cnf(i_0_14, plain, (public(enc(xor(km,X1),X2))|~public(enc(xor(km,imp),X3))|~public(enc(xor(X3,X1),X2))|~public(X1))).
0.13/0.33	cnf(i_0_21, plain, (public(enc(xor(km,X1),xor(X2,X3)))|~public(enc(xor(km,kp(X1)),X2))|~public(kp(X1))|~public(X3))).
0.13/0.33	cnf(i_0_68, plain, (X28=X28)).
0.13/0.33	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.13/0.33	# Begin printing tableau
0.13/0.33	# Found 5 steps
0.13/0.33	cnf(i_0_17, plain, (public(a)), inference(start_rule)).
0.13/0.33	cnf(i_0_77, plain, (public(a)), inference(extension_rule, [i_0_8])).
0.13/0.33	cnf(i_0_125, plain, (~public(a)), inference(closure_rule, [i_0_17])).
0.13/0.33	cnf(i_0_123, plain, (public(enc(inv(a),a))), inference(extension_rule, [i_0_22])).
0.13/0.33	cnf(i_0_157, plain, (public(kp(enc(inv(a),a)))), inference(etableau_closure_rule, [i_0_157, ...])).
0.13/0.33	# End printing tableau
0.13/0.33	# SZS output end
0.13/0.33	# Branches closed with saturation will be marked with an "s"
0.13/0.33	# There were 1 total branch saturation attempts.
0.13/0.33	# There were 0 of these attempts blocked.
0.13/0.33	# There were 0 deferred branch saturation attempts.
0.13/0.33	# There were 0 free duplicated saturations.
0.13/0.33	# There were 1 total successful branch saturations.
0.13/0.33	# There were 0 successful branch saturations in interreduction.
0.13/0.33	# There were 0 successful branch saturations on the branch.
0.13/0.33	# There were 1 successful branch saturations after the branch.
0.13/0.33	# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
0.13/0.33	# SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
0.13/0.33	# Begin clausification derivation
0.13/0.33	
0.13/0.33	# End clausification derivation
0.13/0.33	# Begin listing active clauses obtained from FOF to CNF conversion
0.13/0.33	cnf(i_0_17, plain, (public(a))).
0.13/0.33	cnf(i_0_4, plain, (public(imp))).
0.13/0.33	cnf(i_0_11, plain, (public(k3))).
0.13/0.33	cnf(i_0_3, plain, (public(data))).
0.13/0.33	cnf(i_0_5, plain, (public(pin))).
0.13/0.33	cnf(i_0_19, plain, (public(z))).
0.13/0.33	cnf(i_0_15, plain, (xor(X1,X1)=z)).
0.13/0.33	cnf(i_0_7, plain, (xor(X1,z)=X1)).
0.13/0.33	cnf(i_0_2, plain, (enc(X1,enc(inv(X1),X2))=X2)).
0.13/0.33	cnf(i_0_18, plain, (public(enc(xor(pin,kek),pp)))).
0.13/0.33	cnf(i_0_12, plain, (xor(xor(X1,X2),X3)=xor(X1,xor(X2,X3)))).
0.13/0.33	cnf(i_0_1, plain, (public(enc(xor(km,kp(imp)),xor(kek,k3))))).
0.13/0.33	cnf(i_0_13, plain, (public(enc(xor(km,imp),xor(kek,xor(data,pin)))))).
0.13/0.33	cnf(i_0_6, plain, (xor(X1,X2)=xor(X2,X1))).
0.13/0.33	cnf(i_0_20, negated_conjecture, (~public(enc(pp,a)))).
0.13/0.33	cnf(i_0_22, plain, (public(kp(X1))|~public(X1))).
0.13/0.33	cnf(i_0_16, plain, (public(xor(X1,X2))|~public(X1)|~public(X2))).
0.13/0.33	cnf(i_0_9, plain, (public(enc(X1,X2))|~public(X2)|~public(X1))).
0.13/0.33	cnf(i_0_8, plain, (public(enc(inv(X1),X2))|~public(X2)|~public(X1))).
0.13/0.33	cnf(i_0_10, plain, (public(enc(enc(inv(xor(km,data)),X1),X2))|~public(X2)|~public(X1))).
0.13/0.33	cnf(i_0_14, plain, (public(enc(xor(km,X1),X2))|~public(enc(xor(km,imp),X3))|~public(enc(xor(X3,X1),X2))|~public(X1))).
0.13/0.33	cnf(i_0_21, plain, (public(enc(xor(km,X1),xor(X2,X3)))|~public(enc(xor(km,kp(X1)),X2))|~public(kp(X1))|~public(X3))).
0.13/0.33	cnf(i_0_68, plain, (X28=X28)).
0.13/0.33	# End listing active clauses.  There is an equivalent clause to each of these in the clausification!
0.13/0.33	# Begin printing tableau
0.13/0.33	# Found 5 steps
0.13/0.33	cnf(i_0_17, plain, (public(a)), inference(start_rule)).
0.13/0.33	cnf(i_0_77, plain, (public(a)), inference(extension_rule, [i_0_10])).
0.13/0.33	cnf(i_0_128, plain, (~public(a)), inference(closure_rule, [i_0_17])).
0.13/0.33	cnf(i_0_126, plain, (public(enc(enc(inv(xor(km,data)),a),a))), inference(extension_rule, [i_0_22])).
0.13/0.33	cnf(i_0_157, plain, (public(kp(enc(enc(inv(xor(km,data)),a),a)))), inference(etableau_closure_rule, [i_0_157, ...])).
0.13/0.33	# End printing tableau
0.13/0.33	# SZS output end
0.13/0.33	# Branches closed with saturation will be marked with an "s"
0.13/0.33	# Child (32660) has found a proof.
0.13/0.33	
0.13/0.33	# Proof search is over...
0.13/0.33	# Freeing feature tree
0.13/0.33	EOF