↑ Up

Etableau---0.67.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : SWX239-1 : TPTP v9.3.0. Released v9.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s

% Computer : n010.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue May  5 07:00:47 PM UTC 2026

% Result   : Unsatisfiable 1.32s 0.56s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWX239-1 : TPTP v9.3.0. Released v9.3.0.
% 0.12/0.13  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.17/0.34  % Computer : n010.cluster.edu
% 0.17/0.34  % Model    : x86_64 x86_64
% 0.17/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34  % Memory   : 8042.1875MB
% 0.17/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34  % CPULimit : 300
% 0.17/0.34  % WCLimit  : 300
% 0.17/0.34  % DateTime : Tue May  5 13:19:06 EDT 2026
% 0.17/0.34  % CPUTime  : 
% 0.19/0.38  # No SInE strategy applied
% 0.19/0.38  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.38  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.19/0.38  #
% 0.19/0.38  # Presaturation interreduction done
% 0.19/0.38  # Number of axioms: 110 Number of unprocessed: 110
% 0.19/0.38  # Tableaux proof search.
% 0.19/0.38  # APR header successfully linked.
% 0.19/0.38  # Hello from C++
% 0.19/0.40  # The folding up rule is enabled...
% 0.19/0.40  # Local unification is enabled...
% 0.19/0.40  # Any saturation attempts will use folding labels...
% 0.19/0.40  # 110 beginning clauses after preprocessing and clausification
% 0.19/0.40  # Creating start rules for all 1 conjectures.
% 0.19/0.40  # There are 1 start rule candidates:
% 0.19/0.40  # Found 110 unit axioms.
% 0.19/0.40  # 1 start rule tableaux created.
% 0.19/0.40  # 0 extension rule candidate clauses
% 0.19/0.40  # 110 unit axiom clauses
% 0.19/0.40  
% 0.19/0.40  # Requested 8, 32 cores available to the main process.
% 0.19/0.40  # There are not enough tableaux to fork, creating more from the initial 1
% 0.19/0.40  # Creating equality axioms
% 0.19/0.40  # Ran out of tableaux, making start rules for all clauses
% 0.19/0.40  # Returning from population with 161 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.40  # We now have 161 tableaux to operate on
% 1.32/0.56  # There were 1 total branch saturation attempts.
% 1.32/0.56  # There were 0 of these attempts blocked.
% 1.32/0.56  # There were 0 deferred branch saturation attempts.
% 1.32/0.56  # There were 0 free duplicated saturations.
% 1.32/0.56  # There were 1 total successful branch saturations.
% 1.32/0.56  # There were 0 successful branch saturations in interreduction.
% 1.32/0.56  # There were 0 successful branch saturations on the branch.
% 1.32/0.56  # There were 1 successful branch saturations after the branch.
% 1.32/0.56  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.32/0.56  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.32/0.56  # Begin clausification derivation
% 1.32/0.56  
% 1.32/0.56  # End clausification derivation
% 1.32/0.56  # Begin listing active clauses obtained from FOF to CNF conversion
% 1.32/0.56  cnf(i_0_185, plain, (notb(btrue)=bfalse)).
% 1.32/0.56  cnf(i_0_223, plain, (eq2(btrue,bfalse)=bfalse)).
% 1.32/0.56  cnf(i_0_222, plain, (eq2(bfalse,btrue)=bfalse)).
% 1.32/0.56  cnf(i_0_186, plain, (notb(bfalse)=btrue)).
% 1.32/0.56  cnf(i_0_183, plain, (or2(nil3)=bfalse)).
% 1.32/0.56  cnf(i_0_189, plain, (rec(eps,nil2)=btrue)).
% 1.32/0.56  cnf(i_0_193, plain, (rec(nil4,nil2)=bfalse)).
% 1.32/0.56  cnf(i_0_225, plain, (eq2(X1,X1)=btrue)).
% 1.32/0.56  cnf(i_0_121, plain, (z(eps,X1)=X1)).
% 1.32/0.56  cnf(i_0_146, plain, (x2(nil4,X1)=X1)).
% 1.32/0.56  cnf(i_0_182, plain, (orb(bfalse,X1)=X1)).
% 1.32/0.56  cnf(i_0_206, plain, (reck2(eps,nil2)=btrue)).
% 1.32/0.56  cnf(i_0_181, plain, (orb(btrue,X1)=btrue)).
% 1.32/0.56  cnf(i_0_188, plain, (andb(bfalse,X1)=bfalse)).
% 1.32/0.56  cnf(i_0_205, plain, (reck2(nil4,X1)=bfalse)).
% 1.32/0.56  cnf(i_0_187, plain, (andb(btrue,X1)=X1)).
% 1.32/0.56  cnf(i_0_147, plain, (x2(eps,nil4)=eps)).
% 1.32/0.56  cnf(i_0_177, plain, (splits(X1,nil)=nil)).
% 1.32/0.56  cnf(i_0_200, plain, (step(eps,X1)=nil4)).
% 1.32/0.56  cnf(i_0_199, plain, (step(nil4,X1)=nil4)).
% 1.32/0.56  cnf(i_0_120, plain, (z(nil4,X1)=nil4)).
% 1.32/0.56  cnf(i_0_114, plain, (aux(X1,X2,btrue)=eps)).
% 1.32/0.56  cnf(i_0_192, plain, (rec(star(X1),nil2)=btrue)).
% 1.32/0.56  cnf(i_0_194, plain, (rec(atom(X1),nil2)=bfalse)).
% 1.32/0.56  cnf(i_0_213, plain, (reck2(star(X1),nil2)=btrue)).
% 1.32/0.56  cnf(i_0_208, plain, (reck2(atom(X1),nil2)=bfalse)).
% 1.32/0.56  cnf(i_0_140, plain, (z(star(X1),nil4)=nil4)).
% 1.32/0.56  cnf(i_0_115, plain, (aux(X1,X2,bfalse)=nil4)).
% 1.32/0.56  cnf(i_0_203, plain, (reck(X1,X2,nil)=nil3)).
% 1.32/0.56  cnf(i_0_122, plain, (z(atom(X1),nil4)=nil4)).
% 1.32/0.56  cnf(i_0_148, plain, (x2(eps,eps)=x(eps,eps))).
% 1.32/0.56  cnf(i_0_141, plain, (z(star(X1),eps)=star(X1))).
% 1.32/0.56  cnf(i_0_207, plain, (reck2(eps,cons2(X1,X2))=bfalse)).
% 1.32/0.56  cnf(i_0_119, plain, (aux3(X1,X2,X3,bfalse)=bfalse)).
% 1.32/0.56  cnf(i_0_216, plain, (reck2(atom(a),cons2(b,nil2))=bfalse)).
% 1.32/0.56  cnf(i_0_217, plain, (reck2(atom(a),cons2(c,nil2))=bfalse)).
% 1.32/0.56  cnf(i_0_218, plain, (reck2(atom(b),cons2(a,nil2))=bfalse)).
% 1.32/0.56  cnf(i_0_123, plain, (z(atom(X1),eps)=atom(X1))).
% 1.32/0.56  cnf(i_0_171, plain, (x2(star(X1),nil4)=star(X1))).
% 1.32/0.56  cnf(i_0_153, plain, (x2(atom(X1),nil4)=atom(X1))).
% 1.32/0.56  cnf(i_0_134, plain, (z(y(X1,X2),nil4)=nil4)).
% 1.32/0.56  cnf(i_0_128, plain, (z(x(X1,X2),nil4)=nil4)).
% 1.32/0.56  cnf(i_0_184, plain, (or2(cons3(X1,X2))=orb(X1,or2(X2)))).
% 1.32/0.56  cnf(i_0_219, plain, (reck2(atom(b),cons2(c,nil2))=bfalse)).
% 1.32/0.56  cnf(i_0_220, plain, (reck2(atom(c),cons2(a,nil2))=bfalse)).
% 1.32/0.56  cnf(i_0_221, plain, (reck2(atom(c),cons2(b,nil2))=bfalse)).
% 1.32/0.56  cnf(i_0_224, plain, (reck2(atom(X1),cons2(X1,nil2))=btrue)).
% 1.32/0.56  cnf(i_0_179, plain, (cons(pair2(nil2,nil2),nil)=splits2(nil2))).
% 1.32/0.56  cnf(i_0_152, plain, (x2(eps,star(X1))=x(eps,star(X1)))).
% 1.32/0.56  cnf(i_0_149, plain, (x2(eps,atom(X1))=x(eps,atom(X1)))).
% 1.32/0.56  cnf(i_0_172, plain, (x2(star(X1),eps)=x(star(X1),eps))).
% 1.32/0.56  cnf(i_0_154, plain, (x2(atom(X1),eps)=x(atom(X1),eps))).
% 1.32/0.56  cnf(i_0_135, plain, (z(y(X1,X2),eps)=y(X1,X2))).
% 1.32/0.56  cnf(i_0_129, plain, (z(x(X1,X2),eps)=x(X1,X2))).
% 1.32/0.56  cnf(i_0_165, plain, (x2(y(X1,X2),nil4)=y(X1,X2))).
% 1.32/0.56  cnf(i_0_202, plain, (rec(X1,cons2(X2,X3))=rec(step(X1,X2),X3))).
% 1.32/0.56  cnf(i_0_159, plain, (x2(x(X1,X2),nil4)=x(X1,X2))).
% 1.32/0.56  cnf(i_0_210, plain, (reck2(atom(X1),cons2(X2,cons2(X3,X4)))=bfalse)).
% 1.32/0.56  cnf(i_0_191, plain, (andb(rec(X1,nil2),rec(X2,nil2))=rec(y(X1,X2),nil2))).
% 1.32/0.56  cnf(i_0_145, plain, (z(star(X1),star(X2))=y(star(X1),star(X2)))).
% 1.32/0.56  cnf(i_0_142, plain, (z(star(X1),atom(X2))=y(star(X1),atom(X2)))).
% 1.32/0.56  cnf(i_0_127, plain, (z(atom(X1),star(X2))=y(atom(X1),star(X2)))).
% 1.32/0.56  cnf(i_0_124, plain, (z(atom(X1),atom(X2))=y(atom(X1),atom(X2)))).
% 1.32/0.56  cnf(i_0_176, plain, (x2(star(X1),star(X2))=x(star(X1),star(X2)))).
% 1.32/0.56  cnf(i_0_173, plain, (x2(star(X1),atom(X2))=x(star(X1),atom(X2)))).
% 1.32/0.56  cnf(i_0_158, plain, (x2(atom(X1),star(X2))=x(atom(X1),star(X2)))).
% 1.32/0.56  cnf(i_0_190, plain, (orb(rec(X1,nil2),rec(X2,nil2))=rec(x(X1,X2),nil2))).
% 1.32/0.56  cnf(i_0_211, plain, (orb(reck2(X1,X2),reck2(X3,X2))=reck2(x(X1,X3),X2))).
% 1.32/0.56  cnf(i_0_155, plain, (x2(atom(X1),atom(X2))=x(atom(X1),atom(X2)))).
% 1.32/0.56  cnf(i_0_151, plain, (x2(eps,y(X1,X2))=x(eps,y(X1,X2)))).
% 1.32/0.56  cnf(i_0_198, plain, (y(step(X1,X2),star(X1))=step(star(X1),X2))).
% 1.32/0.56  cnf(i_0_150, plain, (x2(eps,x(X1,X2))=x(eps,x(X1,X2)))).
% 1.32/0.56  cnf(i_0_166, plain, (x2(y(X1,X2),eps)=x(y(X1,X2),eps))).
% 1.32/0.56  cnf(i_0_160, plain, (x2(x(X1,X2),eps)=x(x(X1,X2),eps))).
% 1.32/0.56  cnf(i_0_212, plain, (or2(reck(X1,X2,splits2(X3)))=reck2(y(X1,X2),X3))).
% 1.32/0.56  cnf(i_0_117, plain, (aux2(X1,X2,X3,bfalse)=x(y(step(X2,X1),X3),nil4))).
% 1.32/0.56  cnf(i_0_197, plain, (aux2(X1,X2,X3,rec(X2,nil2))=step(y(X2,X3),X1))).
% 1.32/0.56  cnf(i_0_118, plain, (rec(step(y(X1,star(X1)),X2),X3)=aux3(X1,X2,X3,btrue))).
% 1.32/0.56  cnf(i_0_144, plain, (z(star(X1),y(X2,X3))=y(star(X1),y(X2,X3)))).
% 1.32/0.56  cnf(i_0_143, plain, (z(star(X1),x(X2,X3))=y(star(X1),x(X2,X3)))).
% 1.32/0.56  cnf(i_0_126, plain, (z(atom(X1),y(X2,X3))=y(atom(X1),y(X2,X3)))).
% 1.32/0.56  cnf(i_0_125, plain, (z(atom(X1),x(X2,X3))=y(atom(X1),x(X2,X3)))).
% 1.32/0.56  cnf(i_0_175, plain, (x2(star(X1),y(X2,X3))=x(star(X1),y(X2,X3)))).
% 1.32/0.56  cnf(i_0_174, plain, (x2(star(X1),x(X2,X3))=x(star(X1),x(X2,X3)))).
% 1.32/0.56  cnf(i_0_157, plain, (x2(atom(X1),y(X2,X3))=x(atom(X1),y(X2,X3)))).
% 1.32/0.56  cnf(i_0_156, plain, (x2(atom(X1),x(X2,X3))=x(atom(X1),x(X2,X3)))).
% 1.32/0.56  cnf(i_0_139, plain, (z(y(X1,X2),star(X3))=y(y(X1,X2),star(X3)))).
% 1.32/0.56  cnf(i_0_136, plain, (z(y(X1,X2),atom(X3))=y(y(X1,X2),atom(X3)))).
% 1.32/0.56  cnf(i_0_133, plain, (z(x(X1,X2),star(X3))=y(x(X1,X2),star(X3)))).
% 1.32/0.56  cnf(i_0_130, plain, (z(x(X1,X2),atom(X3))=y(x(X1,X2),atom(X3)))).
% 1.32/0.56  cnf(i_0_170, plain, (x2(y(X1,X2),star(X3))=x(y(X1,X2),star(X3)))).
% 1.32/0.56  cnf(i_0_167, plain, (x2(y(X1,X2),atom(X3))=x(y(X1,X2),atom(X3)))).
% 1.32/0.56  cnf(i_0_164, plain, (x2(x(X1,X2),star(X3))=x(x(X1,X2),star(X3)))).
% 1.32/0.56  cnf(i_0_161, plain, (x2(x(X1,X2),atom(X3))=x(x(X1,X2),atom(X3)))).
% 1.32/0.56  cnf(i_0_196, plain, (x(step(X1,X2),step(X3,X2))=step(x(X1,X3),X2))).
% 1.32/0.56  cnf(i_0_138, plain, (z(y(X1,X2),y(X3,X4))=y(y(X1,X2),y(X3,X4)))).
% 1.32/0.56  cnf(i_0_137, plain, (z(y(X1,X2),x(X3,X4))=y(y(X1,X2),x(X3,X4)))).
% 1.32/0.56  cnf(i_0_132, plain, (z(x(X1,X2),y(X3,X4))=y(x(X1,X2),y(X3,X4)))).
% 1.32/0.56  cnf(i_0_195, plain, (aux(X1,X2,reck2(atom(X2),cons2(X1,nil2)))=step(atom(X2),X1))).
% 1.32/0.56  cnf(i_0_214, plain, (aux3(X1,X2,X3,notb(rec(X1,nil2)))=reck2(star(X1),cons2(X2,X3)))).
% 1.32/0.56  cnf(i_0_131, plain, (z(x(X1,X2),x(X3,X4))=y(x(X1,X2),x(X3,X4)))).
% 1.32/0.56  cnf(i_0_169, plain, (x2(y(X1,X2),y(X3,X4))=x(y(X1,X2),y(X3,X4)))).
% 1.32/0.56  cnf(i_0_168, plain, (x2(y(X1,X2),x(X3,X4))=x(y(X1,X2),x(X3,X4)))).
% 1.32/0.56  cnf(i_0_163, plain, (x2(x(X1,X2),y(X3,X4))=x(x(X1,X2),y(X3,X4)))).
% 1.32/0.56  cnf(i_0_162, plain, (x2(x(X1,X2),x(X3,X4))=x(x(X1,X2),x(X3,X4)))).
% 1.32/0.56  cnf(i_0_116, plain, (x(y(step(X1,X2),X3),step(X3,X2))=aux2(X2,X1,X3,btrue))).
% 1.32/0.56  cnf(i_0_178, plain, (cons(pair2(cons2(X1,X2),X3),splits(X1,X4))=splits(X1,cons(pair2(X2,X3),X4)))).
% 1.32/0.56  cnf(i_0_180, plain, (cons(pair2(nil2,cons2(X1,X2)),splits(X1,splits2(X2)))=splits2(cons2(X1,X2)))).
% 1.32/0.56  cnf(i_0_204, plain, (cons3(andb(reck2(X1,X2),rec(X3,X4)),reck(X1,X3,X5))=reck(X1,X3,cons(pair2(X2,X4),X5)))).
% 1.32/0.56  cnf(i_0_226, negated_conjecture, (eq2(eq2(rec(X1,X2),reck2(X1,X2)),bfalse)!=btrue)).
% 1.32/0.56  cnf(i_0_228, plain, (X6=X6)).
% 1.32/0.56  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 1.32/0.56  # Begin printing tableau
% 1.32/0.56  # Found 7 steps
% 1.32/0.56  cnf(i_0_185, plain, (notb(btrue)=bfalse), inference(start_rule)).
% 1.32/0.56  cnf(i_0_256, plain, (notb(btrue)=bfalse), inference(extension_rule, [i_0_253])).
% 1.32/0.56  cnf(i_0_439, plain, (notb(btrue)!=bfalse), inference(closure_rule, [i_0_185])).
% 1.32/0.56  cnf(i_0_440, plain, (notb(btrue)!=bfalse), inference(closure_rule, [i_0_185])).
% 1.32/0.56  cnf(i_0_437, plain, (reck(notb(btrue),notb(btrue),notb(btrue))=reck(bfalse,bfalse,bfalse)), inference(extension_rule, [i_0_231])).
% 1.32/0.56  cnf(i_0_453, plain, (reck(bfalse,bfalse,bfalse)!=z(eps,reck(bfalse,bfalse,bfalse))), inference(closure_rule, [i_0_121])).
% 1.32/0.56  cnf(i_0_451, plain, (reck(notb(btrue),notb(btrue),notb(btrue))=z(eps,reck(bfalse,bfalse,bfalse))), inference(etableau_closure_rule, [i_0_451, ...])).
% 1.32/0.56  # End printing tableau
% 1.32/0.56  # SZS output end
% 1.32/0.56  # Branches closed with saturation will be marked with an "s"
% 1.32/0.56  # Child (8474) has found a proof.
% 1.32/0.56  
% 1.32/0.56  # Proof search is over...
% 1.32/0.56  # Freeing feature tree
%------------------------------------------------------------------------------