%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWX190-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 : n006.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:41 PM UTC 2026 % Result : Unsatisfiable 0.20s 0.42s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.13 % Problem : SWX190-1 : TPTP v9.3.0. Released v9.3.0. % 0.11/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.16/0.35 % Computer : n006.cluster.edu % 0.16/0.35 % Model : x86_64 x86_64 % 0.16/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.35 % Memory : 8042.1875MB % 0.16/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.35 % CPULimit : 300 % 0.16/0.35 % WCLimit : 300 % 0.16/0.35 % DateTime : Tue May 5 09:55:45 EDT 2026 % 0.20/0.35 % CPUTime : % 0.20/0.39 # No SInE strategy applied % 0.20/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.20/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.20/0.39 # % 0.20/0.39 # Presaturation interreduction done % 0.20/0.39 # Number of axioms: 86 Number of unprocessed: 85 % 0.20/0.39 # Tableaux proof search. % 0.20/0.39 # APR header successfully linked. % 0.20/0.39 # Hello from C++ % 0.20/0.40 # The folding up rule is enabled... % 0.20/0.40 # Local unification is enabled... % 0.20/0.40 # Any saturation attempts will use folding labels... % 0.20/0.40 # 85 beginning clauses after preprocessing and clausification % 0.20/0.40 # Creating start rules for all 1 conjectures. % 0.20/0.40 # There are 1 start rule candidates: % 0.20/0.40 # Found 81 unit axioms. % 0.20/0.40 # 1 start rule tableaux created. % 0.20/0.40 # 4 extension rule candidate clauses % 0.20/0.40 # 81 unit axiom clauses % 0.20/0.40 % 0.20/0.40 # Requested 8, 32 cores available to the main process. % 0.20/0.40 # There are not enough tableaux to fork, creating more from the initial 1 % 0.20/0.40 # Creating equality axioms % 0.20/0.40 # Ran out of tableaux, making start rules for all clauses % 0.20/0.40 # Returning from population with 118 new_tableaux and 0 remaining starting tableaux. % 0.20/0.40 # We now have 118 tableaux to operate on % 0.20/0.42 # There were 1 total branch saturation attempts. % 0.20/0.42 # There were 0 of these attempts blocked. % 0.20/0.42 # There were 0 deferred branch saturation attempts. % 0.20/0.42 # There were 0 free duplicated saturations. % 0.20/0.42 # There were 1 total successful branch saturations. % 0.20/0.42 # There were 0 successful branch saturations in interreduction. % 0.20/0.42 # There were 0 successful branch saturations on the branch. % 0.20/0.42 # There were 1 successful branch saturations after the branch. % 0.20/0.42 # There were 1 total branch saturation attempts. % 0.20/0.42 # There were 0 of these attempts blocked. % 0.20/0.42 # There were 0 deferred branch saturation attempts. % 0.20/0.42 # There were 0 free duplicated saturations. % 0.20/0.42 # There were 1 total successful branch saturations. % 0.20/0.42 # There were 0 successful branch saturations in interreduction. % 0.20/0.42 # There were 0 successful branch saturations on the branch. % 0.20/0.42 # There were 1 successful branch saturations after the branch. % 0.20/0.42 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.42 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.42 # Begin clausification derivation % 0.20/0.42 % 0.20/0.42 # End clausification derivation % 0.20/0.42 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.42 cnf(i_0_156, plain, (eq3(btrue,bfalse)=bfalse)). % 0.20/0.42 cnf(i_0_155, plain, (eq3(bfalse,btrue)=bfalse)). % 0.20/0.42 cnf(i_0_153, plain, (opt(x2)=x2)). % 0.20/0.42 cnf(i_0_178, plain, (eq2(X1,X1)=btrue)). % 0.20/0.42 cnf(i_0_137, plain, (d(x2)=n(s(z)))). % 0.20/0.42 cnf(i_0_179, plain, (eq3(X1,X1)=btrue)). % 0.20/0.42 cnf(i_0_139, plain, (addNat(z,X1)=X1)). % 0.20/0.42 cnf(i_0_141, plain, (mulNat(z,X1)=z)). % 0.20/0.42 cnf(i_0_152, plain, (opt(n(X1))=n(X1))). % 0.20/0.42 cnf(i_0_134, plain, (d(n(X1))=n(z))). % 0.20/0.42 cnf(i_0_171, plain, (eq2(x2,n(X1))=bfalse)). % 0.20/0.42 cnf(i_0_164, plain, (eq2(n(X1),x2)=bfalse)). % 0.20/0.42 cnf(i_0_173, plain, (eq2(x2,y(X1,X2))=bfalse)). % 0.20/0.42 cnf(i_0_172, plain, (eq2(x2,x(X1,X2))=bfalse)). % 0.20/0.42 cnf(i_0_105, plain, (fail(X1,n(z))=X1)). % 0.20/0.42 cnf(i_0_170, plain, (eq2(y(X1,X2),x2)=bfalse)). % 0.20/0.42 cnf(i_0_108, plain, (fail(X1,x2)=fail1(X1,x2))). % 0.20/0.42 cnf(i_0_122, plain, (fail22(X1,x2)=fail32(X1,x2))). % 0.20/0.42 cnf(i_0_133, plain, (fail3(X1,x2)=fail12(X1,x2))). % 0.20/0.42 cnf(i_0_128, plain, (fail12(x2,X1)=fail22(x2,X1))). % 0.20/0.42 cnf(i_0_167, plain, (eq2(x(X1,X2),x2)=bfalse)). % 0.20/0.42 cnf(i_0_143, plain, (opt(x(n(z),X1))=X1)). % 0.20/0.42 cnf(i_0_151, plain, (fail3(x2,X1)=opt(y(x2,X1)))). % 0.20/0.42 cnf(i_0_146, plain, (fail(x2,X1)=opt(x(x2,X1)))). % 0.20/0.42 cnf(i_0_176, plain, (eq2(n(z),n(s(X1)))=bfalse)). % 0.20/0.42 cnf(i_0_130, plain, (fail3(X1,n(z))=n(z))). % 0.20/0.42 cnf(i_0_118, plain, (fail22(X1,n(s(z)))=X1)). % 0.20/0.42 cnf(i_0_124, plain, (fail12(n(s(z)),X1)=X1)). % 0.20/0.42 cnf(i_0_138, plain, (addNat(s(X1),X2)=s(addNat(X1,X2)))). % 0.20/0.42 cnf(i_0_119, plain, (fail22(X1,n(z))=fail32(X1,n(z)))). % 0.20/0.42 cnf(i_0_125, plain, (fail12(n(z),X1)=fail22(n(z),X1))). % 0.20/0.42 cnf(i_0_175, plain, (eq2(n(s(X1)),n(z))=bfalse)). % 0.20/0.42 cnf(i_0_163, plain, (eq2(n(X1),y(X2,X3))=bfalse)). % 0.20/0.42 cnf(i_0_162, plain, (eq2(n(X1),x(X2,X3))=bfalse)). % 0.20/0.42 cnf(i_0_168, plain, (eq2(y(X1,X2),n(X3))=bfalse)). % 0.20/0.42 cnf(i_0_165, plain, (eq2(x(X1,X2),n(X3))=bfalse)). % 0.20/0.42 cnf(i_0_116, plain, (y(x2,opt(X1))=fail32(x2,X1))). % 0.20/0.42 cnf(i_0_148, plain, (opt(y(n(z),X1))=n(z))). % 0.20/0.42 cnf(i_0_97, plain, (n(addNat(X1,X2))=fail1(n(X1),n(X2)))). % 0.20/0.42 cnf(i_0_110, plain, (n(mulNat(X1,X2))=fail32(n(X1),n(X2)))). % 0.20/0.42 cnf(i_0_140, plain, (addNat(X1,mulNat(X2,X1))=mulNat(s(X2),X1))). % 0.20/0.42 cnf(i_0_135, plain, (x(d(X1),d(X2))=d(x(X1,X2)))). % 0.20/0.42 cnf(i_0_95, plain, (aux(x2,X1,bfalse)=x(x2,opt(X1)))). % 0.20/0.42 cnf(i_0_169, plain, (eq2(y(X1,X2),x(X3,X4))=bfalse)). % 0.20/0.42 cnf(i_0_166, plain, (eq2(x(X1,X2),y(X3,X4))=bfalse)). % 0.20/0.42 cnf(i_0_113, plain, (fail32(n(X1),x2)=y(n(X1),x2))). % 0.20/0.42 cnf(i_0_93, plain, (aux(n(X1),X2,bfalse)=x(n(X1),opt(X2)))). % 0.20/0.42 cnf(i_0_104, plain, (fail(X1,n(s(X2)))=fail1(X1,n(s(X2))))). % 0.20/0.42 cnf(i_0_103, plain, (aux(x2,X1,eq2(x2,X1))=fail1(x2,X1))). % 0.20/0.42 cnf(i_0_107, plain, (fail(X1,y(X2,X3))=fail1(X1,y(X2,X3)))). % 0.20/0.42 cnf(i_0_106, plain, (fail(X1,x(X2,X3))=fail1(X1,x(X2,X3)))). % 0.20/0.42 cnf(i_0_121, plain, (fail22(X1,y(X2,X3))=fail32(X1,y(X2,X3)))). % 0.20/0.42 cnf(i_0_120, plain, (fail22(X1,x(X2,X3))=fail32(X1,x(X2,X3)))). % 0.20/0.42 cnf(i_0_129, plain, (fail3(X1,n(s(X2)))=fail12(X1,n(s(X2))))). % 0.20/0.42 cnf(i_0_132, plain, (fail3(X1,y(X2,X3))=fail12(X1,y(X2,X3)))). % 0.20/0.42 cnf(i_0_131, plain, (fail3(X1,x(X2,X3))=fail12(X1,x(X2,X3)))). % 0.20/0.42 cnf(i_0_174, plain, (eq2(n(s(X1)),n(s(X2)))=eq2(n(X1),n(X2)))). % 0.20/0.42 cnf(i_0_127, plain, (fail12(y(X1,X2),X3)=fail22(y(X1,X2),X3))). % 0.20/0.42 cnf(i_0_126, plain, (fail12(x(X1,X2),X3)=fail22(x(X1,X2),X3))). % 0.20/0.42 cnf(i_0_150, plain, (fail3(y(X1,X2),X3)=opt(y(y(X1,X2),X3)))). % 0.20/0.42 cnf(i_0_149, plain, (fail3(x(X1,X2),X3)=opt(y(x(X1,X2),X3)))). % 0.20/0.42 cnf(i_0_145, plain, (fail(y(X1,X2),X3)=opt(x(y(X1,X2),X3)))). % 0.20/0.42 cnf(i_0_147, plain, (fail3(n(s(X1)),X2)=opt(y(n(s(X1)),X2)))). % 0.20/0.42 cnf(i_0_142, plain, (fail(n(s(X1)),X2)=opt(x(n(s(X1)),X2)))). % 0.20/0.42 cnf(i_0_144, plain, (fail(x(X1,X2),X3)=opt(x(x(X1,X2),X3)))). % 0.20/0.42 cnf(i_0_114, plain, (opt(y(X1,y(X2,X3)))=fail32(y(X1,X2),X3))). % 0.20/0.42 cnf(i_0_92, plain, (aux(x(X1,X2),X3,bfalse)=opt(x(X1,x(X2,X3))))). % 0.20/0.42 cnf(i_0_117, plain, (fail22(X1,n(s(s(X2))))=fail32(X1,n(s(s(X2)))))). % 0.20/0.42 cnf(i_0_123, plain, (fail12(n(s(s(X1))),X2)=fail22(n(s(s(X1))),X2))). % 0.20/0.42 cnf(i_0_115, plain, (y(opt(x(X1,X2)),opt(X3))=fail32(x(X1,X2),X3))). % 0.20/0.42 cnf(i_0_94, plain, (x(opt(y(X1,X2)),o# SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.42 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.42 # Begin clausification derivation % 0.20/0.42 % 0.20/0.42 # End clausification derivation % 0.20/0.42 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.42 cnf(i_0_156, plain, (eq3(btrue,bfalse)=bfalse)). % 0.20/0.42 cnf(i_0_155, plain, (eq3(bfalse,btrue)=bfalse)). % 0.20/0.42 cnf(i_0_153, plain, (opt(x2)=x2)). % 0.20/0.42 cnf(i_0_178, plain, (eq2(X1,X1)=btrue)). % 0.20/0.42 cnf(i_0_137, plain, (d(x2)=n(s(z)))). % 0.20/0.42 cnf(i_0_179, plain, (eq3(X1,X1)=btrue)). % 0.20/0.42 cnf(i_0_139, plain, (addNat(z,X1)=X1)). % 0.20/0.42 cnf(i_0_141, plain, (mulNat(z,X1)=z)). % 0.20/0.42 cnf(i_0_152, plain, (opt(n(X1))=n(X1))). % 0.20/0.42 cnf(i_0_134, plain, (d(n(X1))=n(z))). % 0.20/0.42 cnf(i_0_171, plain, (eq2(x2,n(X1))=bfalse)). % 0.20/0.42 cnf(i_0_164, plain, (eq2(n(X1),x2)=bfalse)). % 0.20/0.42 cnf(i_0_173, plain, (eq2(x2,y(X1,X2))=bfalse)). % 0.20/0.42 cnf(i_0_172, plain, (eq2(x2,x(X1,X2))=bfalse)). % 0.20/0.42 cnf(i_0_105, plain, (fail(X1,n(z))=X1)). % 0.20/0.42 cnf(i_0_170, plain, (eq2(y(X1,X2),x2)=bfalse)). % 0.20/0.42 cnf(i_0_108, plain, (fail(X1,x2)=fail1(X1,x2))). % 0.20/0.42 cnf(i_0_122, plain, (fail22(X1,x2)=fail32(X1,x2))). % 0.20/0.42 cnf(i_0_133, plain, (fail3(X1,x2)=fail12(X1,x2))). % 0.20/0.42 cnf(i_0_128, plain, (fail12(x2,X1)=fail22(x2,X1))). % 0.20/0.42 cnf(i_0_167, plain, (eq2(x(X1,X2),x2)=bfalse)). % 0.20/0.42 cnf(i_0_143, plain, (opt(x(n(z),X1))=X1)). % 0.20/0.42 cnf(i_0_151, plain, (fail3(x2,X1)=opt(y(x2,X1)))). % 0.20/0.42 cnf(i_0_146, plain, (fail(x2,X1)=opt(x(x2,X1)))). % 0.20/0.42 cnf(i_0_176, plain, (eq2(n(z),n(s(X1)))=bfalse)). % 0.20/0.42 cnf(i_0_130, plain, (fail3(X1,n(z))=n(z))). % 0.20/0.42 cnf(i_0_118, plain, (fail22(X1,n(s(z)))=X1)). % 0.20/0.42 cnf(i_0_124, plain, (fail12(n(s(z)),X1)=X1)). % 0.20/0.42 cnf(i_0_138, plain, (addNat(s(X1),X2)=s(addNat(X1,X2)))). % 0.20/0.42 cnf(i_0_119, plain, (fail22(X1,n(z))=fail32(X1,n(z)))). % 0.20/0.42 cnf(i_0_125, plain, (fail12(n(z),X1)=fail22(n(z),X1))). % 0.20/0.42 cnf(i_0_175, plain, (eq2(n(s(X1)),n(z))=bfalse)). % 0.20/0.42 cnf(i_0_163, plain, (eq2(n(X1),y(X2,X3))=bfalse)). % 0.20/0.42 cnf(i_0_162, plain, (eq2(n(X1),x(X2,X3))=bfalse)). % 0.20/0.42 cnf(i_0_168, plain, (eq2(y(X1,X2),n(X3))=bfalse)). % 0.20/0.42 cnf(i_0_165, plain, (eq2(x(X1,X2),n(X3))=bfalse)). % 0.20/0.42 cnf(i_0_116, plain, (y(x2,opt(X1))=fail32(x2,X1))). % 0.20/0.42 cnf(i_0_148, plain, (opt(y(n(z),X1))=n(z))). % 0.20/0.42 cnf(i_0_97, plain, (n(addNat(X1,X2))=fail1(n(X1),n(X2)))). % 0.20/0.42 cnf(i_0_110, plain, (n(mulNat(X1,X2))=fail32(n(X1),n(X2)))). % 0.20/0.42 cnf(i_0_140, plain, (addNat(X1,mulNat(X2,X1))=mulNat(s(X2),X1))). % 0.20/0.42 cnf(i_0_135, plain, (x(d(X1),d(X2))=d(x(X1,X2)))). % 0.20/0.42 cnf(i_0_95, plain, (aux(x2,X1,bfalse)=x(x2,opt(X1)))). % 0.20/0.42 cnf(i_0_169, plain, (eq2(y(X1,X2),x(X3,X4))=bfalse)). % 0.20/0.42 cnf(i_0_166, plain, (eq2(x(X1,X2),y(X3,X4))=bfalse)). % 0.20/0.42 cnf(i_0_113, plain, (fail32(n(X1),x2)=y(n(X1),x2))). % 0.20/0.42 cnf(i_0_93, plain, (aux(n(X1),X2,bfalse)=x(n(X1),opt(X2)))). % 0.20/0.42 cnf(i_0_104, plain, (fail(X1,n(s(X2)))=fail1(X1,n(s(X2))))). % 0.20/0.42 cnf(i_0_103, plain, (aux(x2,X1,eq2(x2,X1))=fail1(x2,X1))). % 0.20/0.42 cnf(i_0_107, plain, (fail(X1,y(X2,X3))=fail1(X1,y(X2,X3)))). % 0.20/0.42 cnf(i_0_106, plain, (fail(X1,x(X2,X3))=fail1(X1,x(X2,X3)))). % 0.20/0.42 cnf(i_0_121, plain, (fail22(X1,y(X2,X3))=fail32(X1,y(X2,X3)))). % 0.20/0.42 cnf(i_0_120, plain, (fail22(X1,x(X2,X3))=fail32(X1,x(X2,X3)))). % 0.20/0.42 cnf(i_0_129, plain, (fail3(X1,n(s(X2)))=fail12(X1,n(s(X2))))). % 0.20/0.42 cnf(i_0_132, plain, (fail3(X1,y(X2,X3))=fail12(X1,y(X2,X3)))). % 0.20/0.42 cnf(i_0_131, plain, (fail3(X1,x(X2,X3))=fail12(X1,x(X2,X3)))). % 0.20/0.42 cnf(i_0_174, plain, (eq2(n(s(X1)),n(s(X2)))=eq2(n(X1),n(X2)))). % 0.20/0.42 cnf(i_0_127, plain, (fail12(y(X1,X2),X3)=fail22(y(X1,X2),X3))). % 0.20/0.42 cnf(i_0_126, plain, (fail12(x(X1,X2),X3)=fail22(x(X1,X2),X3))). % 0.20/0.42 cnf(i_0_150, plain, (fail3(y(X1,X2),X3)=opt(y(y(X1,X2),X3)))). % 0.20/0.42 cnf(i_0_149, plain, (fail3(x(X1,X2),X3)=opt(y(x(X1,X2),X3)))). % 0.20/0.42 cnf(i_0_145, plain, (fail(y(X1,X2),X3)=opt(x(y(X1,X2),X3)))). % 0.20/0.42 cnf(i_0_147, plain, (fail3(n(s(X1)),X2)=opt(y(n(s(X1)),X2)))). % 0.20/0.42 cnf(i_0_142, plain, (fail(n(s(X1)),X2)=opt(x(n(s(X1)),X2)))). % 0.20/0.42 cnf(i_0_144, plain, (fail(x(X1,X2),X3)=opt(x(x(X1,X2),X3)))). % 0.20/0.42 cnf(i_0_114, plain, (opt(y(X1,y(X2,X3)))=fail32(y(X1,X2),X3))). % 0.20/0.42 cnf(i_0_92, plain, (aux(x(X1,X2),X3,bfalse)=opt(x(X1,x(X2,X3))))). % 0.20/0.42 cnf(i_0_117, plain, (fail22(X1,n(s(s(X2))))=fail32(X1,n(s(s(X2)))))). % 0.20/0.42 cnf(i_0_123, plain, (fail12(n(s(s(X1))),X2)=fail22(n(s(s(X1))),X2))). % 0.20/0.42 cnf(i_0_115, plain, (y(opt(x(X1,X2)),opt(X3))=fail32(x(X1,X2),X3))). % 0.20/0.42 cnf(i_0_94, plain, (x(opt(y(X1,X2)),opt(X3))=aux(y(X1,X2),X3,bfalse))). % 0.20/0.42 cnf(i_0_136, plain, (x(y(d(X1),X2),y(X1,d(X2)))=d(y(X1,X2)))). % 0.20/0.42 cnf(i_0_100, plain, (fail1(n(X1),x2)=x(n(X1),x2))). % 0.20/0.42 cnf(i_0_112, plain, (y(n(X1),opt(y(X2,X3)))=fail32(n(X1),y(X2,X3)))). % 0.20/0.42 cnf(i_0_111, plain, (y(n(X1),opt(x(X2,X3)))=fail32(n(X1),x(X2,X3)))). % 0.20/0.42 cnf(i_0_102, plain, (aux(y(X1,X2),X3,eq2(y(X1,X2),X3))=fail1(y(X1,X2),X3))). % 0.20/0.42 cnf(i_0_101, plain, (aux(x(X1,X2),X3,eq2(x(X1,X2),X3))=fail1(x(X1,X2),X3))). % 0.20/0.42 cnf(i_0_99, plain, (fail1(n(X1),y(X2,X3))=x(n(X1),opt(y(X2,X3))))). % 0.20/0.42 cnf(i_0_98, plain, (fail1(n(X1),x(X2,X3))=x(n(X1),opt(x(X2,X3))))). % 0.20/0.42 cnf(i_0_91, plain, (aux(X1,X2,btrue)=y(n(s(s(z))),opt(X1)))). % 0.20/0.42 cnf(i_0_180, negated_conjecture, (eq3(eq2(opt(d(X1)),opt(d(opt(X1)))),bfalse)!=btrue)). % 0.20/0.42 cnf(i_0_160, plain, (eq2(y(X1,X2),y(X3,X4))=bfalse|eq2(X1,X3)!=bfalse)). % 0.20/0.42 cnf(i_0_158, plain, (eq2(x(X1,X2),x(X3,X4))=bfalse|eq2(X1,X3)!=bfalse)). % 0.20/0.42 cnf(i_0_161, plain, (eq2(y(X1,X2),y(X3,X4))=eq2(X2,X4)|eq2(X1,X3)!=btrue)). % 0.20/0.42 cnf(i_0_159, plain, (eq2(x(X1,X2),x(X3,X4))=eq2(X2,X4)|eq2(X1,X3)!=btrue)). % 0.20/0.42 cnf(i_0_190, plain, (X5=X5)). % 0.20/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.42 # Begin printing tableau % 0.20/0.42 # Found 5 steps % 0.20/0.42 cnf(i_0_156, plain, (eq3(btrue,bfalse)=bfalse), inference(start_rule)). % 0.20/0.42 cnf(i_0_211, plain, (eq3(btrue,bfalse)=bfalse), inference(extension_rule, [i_0_209])). % 0.20/0.42 cnf(i_0_359, plain, (d(eq3(btrue,bfalse))=d(bfalse)), inference(extension_rule, [i_0_193])). % 0.20/0.42 cnf(i_0_378, plain, (d(bfalse)!=addNat(z,d(bfalse))), inference(closure_rule, [i_0_139])). % 0.20/0.42 cnf(i_0_376, plain, (d(eq3(btrue,bfalse))=addNat(z,d(bfalse))), inference(etableau_closure_rule, [i_0_376, ...])). % 0.20/0.42 # End printing tableau % 0.20/0.42 # SZS output end % 0.20/0.42 # Branches closed with saturation will be marked with an "s" % 0.20/0.42 # There were 1 total branch saturation attempts. % 0.20/0.42 # There were 0 of these attempts blocked. % 0.20/0.42 # There were 0 deferred branch saturation attempts. % 0.20/0.42 # There were 0 free duplicated saturations. % 0.20/0.42 # There were 1 total successful branch saturations. % 0.20/0.42 # There were 0 successful branch saturations in interreduction. % 0.20/0.42 # There were 0 successful branch saturations on the branch. % 0.20/0.42 # There were 1 successful branch saturations after the branch. % 0.20/0.42 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.42 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.42 # Begin clausification derivation % 0.20/0.42 % 0.20/0.42 # End clausification derivation % 0.20/0.42 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.42 cnf(i_0_156, plain, (eq3(btrue,bfalse)=bfalse)). % 0.20/0.42 cnf(i_0_155, plain, (eq3(bfalse,btrue)=bfalse)). % 0.20/0.42 cnf(i_0_153, plain, (opt(x2)=x2)). % 0.20/0.42 cnf(i_0_178, plain, (eq2(X1,X1)=btrue)). % 0.20/0.42 cnf(i_0_137, plain, (d(x2)=n(s(z)))). % 0.20/0.42 cnf(i_0_179, plain, (eq3(X1,X1)=btrue)). % 0.20/0.42 cnf(i_0_139, plain, (addNat(z,X1)=X1)). % 0.20/0.42 cnf(i_0_141, plain, (mulNat(z,X1)=z)). % 0.20/0.42 cnf(i_0_152, plain, (opt(n(X1))=n(X1))). % 0.20/0.42 cnf(i_0_134, plain, (d(n(X1))=n(z))). % 0.20/0.42 cnf(i_0_171, plain, (eq2(x2,n(X1))=bfalse)). % 0.20/0.42 cnf(i_0_164, plain, (eq2(n(X1),x2)=bfalse)). % 0.20/0.42 cnf(i_0_173, plain, (eq2(x2,y(X1,X2))=bfalse)). % 0.20/0.42 cnf(i_0_172, plain, (eq2(x2,x(X1,X2))=bfalse)). % 0.20/0.42 cnf(i_0_105, plain, (fail(X1,n(z))=X1)). % 0.20/0.42 cnf(i_0_170, plain, (eq2(y(X1,X2),x2)=bfalse)). % 0.20/0.42 cnf(i_0_108, plain, (fail(X1,x2)=fail1(X1,x2))). % 0.20/0.42 cnf(i_0_122, plain, (fail22(X1,x2)=fail32(X1,x2))). % 0.20/0.42 cnf(i_0_133, plain, (fail3(X1,x2)=fail12(X1,x2))). % 0.20/0.42 cnf(i_0_128, plain, (fail12(x2,X1)=fail22(x2,X1))). % 0.20/0.42 cnf(i_0_167, plain, (eq2(x(X1,X2),x2)=bfalse)). % 0.20/0.42 cnf(i_0_143, plain, (opt(x(n(z),X1))=X1)). % 0.20/0.42 cnf(i_0_151, plain, (fail3(x2,X1)=opt(y(x2,X1)))). % 0.20/0.42 cnf(i_0_146, plain, (fail(x2,X1)=opt(x(x2,X1)))). % 0.20/0.42 cnf(i_0_176, plain, (eq2(n(z),n(s(X1)))=bfalse)). % 0.20/0.42 cnf(i_0_130, plain, (fail3(X1,n(z))=n(z))). % 0.20/0.42 cnf(i_0_118, plain, (fail22(X1,n(s(z)))=X1)). % 0.20/0.42 cnf(i_0_124, plain, (fail12(n(s(z)),X1)=X1)). % 0.20/0.42 cnf(i_0_138, plain, (addNat(s(X1),X2)=s(addNat(X1,X2)))). % 0.20/0.42 cnf(i_0_119, plain, (fail22(X1,n(z))=fail32(X1,n(z)))). % 0.20/0.42 cnf(i_0_125, plain, (fail12(n(z),X1)=fail22(n(z),X1))). % 0.20/0.42 cnf(i_0_175, plain, (eq2(n(s(X1)),n(z))=bfalse)). % 0.20/0.42 cnf(i_0_163, plain, (eq2(n(X1),y(X2,X3))=bfalse)). % 0.20/0.42 cnf(i_0_162, plain, (eq2(n(X1),x(X2,X3))=bfalse)). % 0.20/0.42 cnf(i_0_168, plain, (eq2(y(X1,X2),n(X3))=bfalse)). % 0.20/0.42 cnf(i_0_165, plain, (eq2(x(X1,X2),n(X3))=bfalse)). % 0.20/0.42 cnf(i_0_116, plain, (y(x2,opt(X1))=fail32(x2,X1))). % 0.20/0.42 cnf(i_0_148, plain, (opt(y(n(z),X1))=n(z))). % 0.20/0.42 cnf(i_0_97, plain, (n(addNat(X1,X2))=fail1(n(X1),n(X2)))). % 0.20/0.42 cnf(i_0_110, plain, (n(mulNat(X1,X2))=fail32(n(X1),n(X2)))). % 0.20/0.42 cnf(i_0_140, plain, (addNat(X1,mulNat(X2,X1))=mulNat(s(X2),X1))). % 0.20/0.42 cnf(i_0_135, plain, (x(d(X1),d(X2))=d(x(X1,X2)))). % 0.20/0.42 cnf(i_0_95, plain, (aux(x2,X1,bfalse)=x(x2,opt(X1)))). % 0.20/0.42 cnf(i_0_169, plain, (eq2(y(X1,X2),x(X3,X4))=bfalse)). % 0.20/0.42 cnf(i_0_166, plain, (eq2(x(X1,X2),y(X3,X4))=bfalse)). % 0.20/0.42 cnf(i_0_113, plain, (fail32(n(X1),x2)=y(n(X1),x2))). % 0.20/0.42 cnf(i_0_93, plain, (aux(n(X1),X2,bfalse)=x(n(X1),opt(X2)))). % 0.20/0.42 cnf(i_0_104, plain, (fail(X1,n(s(X2)))=fail1(X1,n(s(X2))))). % 0.20/0.42 cnf(i_0_103, plain, (aux(x2,X1,eq2(x2,X1))=fail1(x2,X1))). % 0.20/0.42 cnf(i_0_107, plain, (fail(X1,y(X2,X3))=fail1(X1,y(X2,X3)))). % 0.20/0.42 cnf(i_0_106, plain, (fail(X1,x(X2,X3))=fail1(X1,x(X2,X3)))). % 0.20/0.42 cnf(i_0_121, plain, (fail22(X1,y(X2,X3))=fail32(X1,y(X2,X3)))). % 0.20/0.42 cnf(i_0_120, plain, (fail22(X1,x(X2,X3))=fail32(X1,x(X2,X3)))). % 0.20/0.42 cnf(i_0_129, plain, (fail3(X1,n(s(X2)))=fail12(X1,n(s(X2))))). % 0.20/0.42 cnf(i_0_132, plain, (fail3(X1,y(X2,X3))=fail12(X1,y(X2,X3)))). % 0.20/0.42 cnf(i_0_131, plain, (fail3(X1,x(X2,X3))=fail12(X1,x(X2,X3)))). % 0.20/0.42 cnf(i_0_174, plain, (eq2(n(s(X1)),n(s(X2)))=eq2(n(X1),n(X2)))). % 0.20/0.42 cnf(i_0_127, plain, (fail12(y(X1,X2),X3)=fail22(y(X1,X2),X3))). % 0.20/0.42 cnf(i_0_126, plain, (fail12(x(X1,X2),X3)=fail22(x(X1,X2),X3))). % 0.20/0.42 cnf(i_0_150, plain, (fail3(y(X1,X2),X3)=opt(y(y(X1,X2),X3)))). % 0.20/0.42 cnf(i_0_149, plain, (fail3(x(X1,X2),X3)=opt(y(x(X1,X2),X3)))). % 0.20/0.42 cnf(i_0_145, plain, (fail(y(X1,X2),X3)=opt(x(y(X1,X2),X3)))). % 0.20/0.42 cnf(i_0_147, plain, (fail3(n(s(X1)),X2)=opt(y(n(s(X1)),X2)))). % 0.20/0.42 cnf(i_0_142, plain, (fail(n(s(X1)),X2)=opt(x(n(s(X1)),X2)))). % 0.20/0.42 cnf(i_0_144, plain, (fail(x(X1,X2),X3)=opt(x(x(X1,X2),X3)))). % 0.20/0.42 cnf(i_0_114, plain, (opt(y(X1,y(X2,X3)))=fail32(y(X1,X2),X3))). % 0.20/0.42 cnf(i_0_92, plain, (aux(x(X1,X2),X3,bfalse)=opt(x(X1,x(X2,X3))))). % 0.20/0.42 cnf(i_0_117, plain, (fail22(X1,n(s(s(X2))))=fail32(X1,n(s(s(X2)))))). % 0.20/0.42 cnf(i_0_123, plain, (fail12(n(s(s(X1))),X2)=fail22(n(s(s(X1))),X2))). % 0.20/0.42 cnf(i_0_115, plain, (y(opt(x(X1,X2)),opt(X3))=fail32(x(X1,X2),X3))). % 0.20/0.42 cnf(i_0_94, plain, (x(opt(y(X1,X2)),opt(X3))=aux(y(X1,X2),X3,bfalse))). % 0.20/0.42 cnf(i_0_136, plain, (x(y(d(X1),X2),y(X1,d(X2)))=d(y(X1,X2)))). % 0.20/0.42 cnf(i_0_100, plain, (fail1(n(X1),x2)=x(n(X1),x2))). % 0.20/0.42 cnf(i_0_112, plain, (y(n(X1),opt(y(X2,X3)))=fail32(n(X1),y(X2,X3)))). % 0.20/0.42 cnf(i_0_111, plain, (y(n(X1),opt(x(X2,X3)))=fail32(n(X1),x(X2,X3)))). % 0.20/0.42 cnf(i_0_102, plain, (aux(y(X1,X2),X3,eq2(y(X1,X2),X3))=fail1(y(X1,X2),X3))). % 0.20/0.42 cnf(i_0_101, plain, (aux(x(X1,X2),X3,eq2(x(X1,X2),X3))=fail1(x(X1,X2),X3))). % 0.20/0.42 cnf(i_0_99, plain, (fail1(n(X1),y(X2,X3))=x(n(X1),opt(y(X2,X3))))). % 0.20/0.42 cnf(i_0_98, plain, (fail1(n(X1),x(X2,X3))=x(n(X1),opt(x(X2,X3))))). % 0.20/0.42 cnf(i_0_91, plain, (aux(X1,X2,btrue)=y(n(s(s(z))),opt(X1)))). % 0.20/0.42 cnf(i_0_180, negated_conjecture, (eq3(eq2(opt(d(X1)),opt(d(opt(X1)))),bfalse)!=btrue)). % 0.20/0.42 cnf(i_0_160, plain, (eq2(y(X1,X2),y(X3,X4))=bfalse|eq2(X1,X3)!=bfalse)). % 0.20/0.42 cnf(i_0_158, plain, (eq2(x(X1,X2),x(X3,X4))=bfalse|eq2(X1,X3)!=bfalse)). % 0.20/0.42 cnf(i_0_161, plain, (eq2(y(X1,X2),y(X3,X4))=eq2(X2,X4)|eq2(X1,X3)!=btrue)). % 0.20/0.42 cnf(i_0_159, plain, (eq2(x(X1,X2),x(X3,X4))=eq2(X2,X4)|eq2(X1,X3)!=btrue)). % 0.20/0.42 cnf(i_0_190, plain, (X5=X5)). % 0.20/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.42 # Begin printing tableau % 0.20/0.42 # Found 6 steps % 0.20/0.42 cnf(i_0_156, plain, (eq3(btrue,bfalse)=bfalse), inference(start_rule)). % 0.20/0.42 cnf(i_0_211, plain, (eq3(btrue,bfalse)=bfalse), inference(extension_rule, [i_0_208])). % 0.20/0.42 cnf(i_0_357, plain, (eq3(btrue,bfalse)!=bfalse), inference(closure_rule, [i_0_156])). % 0.20/0.42 cnf(i_0_356, plain, (fail3(eq3(btrue,bfalse),eq3(btrue,bfalse))=fail3(bfalse,bfalse)), inference(extension_rule, [i_0_193])). % 0.20/0.42 cnf(i_0_378, plain, (fail3(bfalse,bfalse)!=addNat(z,fail3(bfalse,bfalse))), inference(closure_rule, [i_0_139])). % 0.20/0.42 cnf(i_0_376, plain, (fail3(eq3(btrue,bfalse),eq3(btrue,bfalse))=addNat(z,fail3(bfalse,bfalse))), inference(etableau_closure_rule, [i_0_376, ...])). % 0.20/0.42 # End printing tableau % 0.20/0.42 # SZS output end % 0.20/0.42 # Branches closed with saturation will be marked with an "s" % 0.20/0.42 # There were 1 total branch saturation attempts. % 0.20/0.42 # There were 0 of these attempts blocked. % 0.20/0.42 # There were 0 deferred branch saturation attempts. % 0.20/0.42 # There were 0 free duplicated saturations. % 0.20/0.42 # There were 1 total successful branch saturations. % 0.20/0.42 # There were 0 successful branch saturations in interreduction. % 0.20/0.42 # There were 0 successful branch saturations on the branch. % 0.20/0.42 # There were 1 successful branch saturations after the branch. % 0.20/0.42 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.42 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.42 # Begin clausification derivation % 0.20/0.42 % 0.20/0.42 # End clausification derivation % 0.20/0.42 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.42 cnf(i_0_156, plain, (eq3(btrue,bfalse)=bfalse)). % 0.20/0.42 cnf(i_0_155, plain, (eq3(bfalse,btrue)=bfalse)). % 0.20/0.42 cnf(i_0_153, plain, (opt(x2)=x2)). % 0.20/0.42 cnf(i_0_178, plain, (eq2(X1,X1)=btrue)). % 0.20/0.42 cnf(i_0_137, plain, (d(x2)=n(s(z)))). % 0.20/0.42 cnf(i_0_179, plain, (eq3(X1,X1)=btrue)). % 0.20/0.42 cnf(i_0_139, plain, (addNat(z,X1)=X1)). % 0.20/0.42 cnf(i_0_141, plain, (mulNat(z,X1)=z)). % 0.20/0.42 cnf(i_0_152, plain, (opt(n(X1))=n(X1))). % 0.20/0.42 cnf(i_0_134, plain, (d(n(X1))=n(z))). % 0.20/0.42 cnf(i_0_171, plain, (eq2(x2,n(X1))=bfalse)). % 0.20/0.42 cnf(i_0_164, plain, (eq2(n(X1),x2)=bfalse)). % 0.20/0.42 cnf(i_0_173, plain, (eq2(x2,y(X1,X2))=bfalse)). % 0.20/0.42 cnf(i_0_172, plain, (eq2(x2,x(X1,X2))=bfalse)). % 0.20/0.42 cnf(i_0_105, plain, (fail(X1,n(z))=X1)). % 0.20/0.42 cnf(i_0_170, plain, (eq2(y(X1,X2),x2)=bfalse)). % 0.20/0.42 cnf(i_0_108, plain, (fail(X1,x2)=fail1(X1,x2))). % 0.20/0.42 cnf(i_0_122, plain, (fail22(X1,x2)=fail32(X1,x2))). % 0.20/0.42 cnf(i_0_133, plain, (fail3(X1,x2)=fail12(X1,x2))). % 0.20/0.42 cnf(i_0_128, plain, (fail12(x2,X1)=fail22(x2,X1))). % 0.20/0.42 cnf(i_0_167, plain, (eq2(x(X1,X2),x2)=bfalse)). % 0.20/0.42 cnf(i_0_143, plain, (opt(x(n(z),X1))=X1)). % 0.20/0.42 cnf(i_0_151, plain, (fail3(x2,X1)=opt(y(x2,X1)))). % 0.20/0.42 cnf(i_0_146, plain, (fail(x2,X1)=opt(x(x2,X1)))). % 0.20/0.42 cnf(i_0_176, plain, (eq2(n(z),n(s(X1)))=bfalse)). % 0.20/0.42 cnf(i_0_130, plain, (fail3(X1,n(z))=n(z))). % 0.20/0.42 cnf(i_0_118, plain, (fail22(X1,n(s(z)))=X1)). % 0.20/0.42 cnf(i_0_124, plain, (fail12(n(s(z)),X1)=X1)). % 0.20/0.42 cnf(i_0_138, plain, (addNat(s(X1),X2)=s(addNat(X1,X2)))). % 0.20/0.42 cnf(i_0_119, plain, (fail22(X1,n(z))=fail32(X1,n(z)))). % 0.20/0.42 cnf(i_0_125, plain, (fail12(n(z),X1)=fail22(n(z),X1))). % 0.20/0.42 cnf(i_0_175, plain, (eq2(n(s(X1)),n(z))=bfalse)). % 0.20/0.42 cnf(i_0_163, plain, (eq2(n(X1),y(X2,X3))=bfalse)). % 0.20/0.42 cnf(i_0_162, plain, (eq2(n(X1),x(X2,X3))=bfalse)). % 0.20/0.42 cnf(i_0_168, plain, (eq2(y(X1,X2),n(X3))=bfalse)). % 0.20/0.42 cnf(i_0_165, plain, (eq2(x(X1,X2),n(X3))=bfalse)). % 0.20/0.42 cnf(i_0_116, plain, (y(x2,opt(X1))=fail32(x2,X1))). % 0.20/0.42 cnf(i_0_148, plain, (opt(y(n(z),X1))=n(z))). % 0.20/0.42 cnf(i_0_97, plain, (n(addNat(X1,X2))=fail1(n(X1),n(X2)))). % 0.20/0.42 cnf(i_0_110, plain, (n(mulNat(X1,X2))=fail32(n(X1),n(X2)))). % 0.20/0.42 cnf(i_0_140, plain, (addNat(X1,mulNat(X2,X1))=mulNat(s(X2),X1))). % 0.20/0.42 cnf(i_0_135, plain, (x(d(X1),d(X2))=d(x(X1,X2)))). % 0.20/0.42 cnf(i_0_95, plain, (aux(x2,X1,bfalse)=x(x2,opt(X1)))). % 0.20/0.42 cnf(i_0_169, plain, (eq2(y(X1,X2),x(X3,X4))=bfalse)). % 0.20/0.42 cnf(i_0_166, plain, (eq2(x(X1,X2),y(X3,X4))=bfalse)). % 0.20/0.42 cnf(i_0_113, plain, (fail32(n(X1),x2)=y(n(X1),x2))). % 0.20/0.42 cnf(i_0_93, plain, (aux(n(X1),X2,bfalse)=x(n(X1),opt(X2)))). % 0.20/0.42 cnf(i_0_104, plain, (fail(X1,n(s(X2)))=fail1(X1,n(s(X2))))). % 0.20/0.42 cnf(i_0_103, plain, (aux(x2,X1,eq2(x2,X1))=fail1(x2,X1))). % 0.20/0.42 cnf(i_0_107, plain, (fail(X1,y(X2,X3))=fail1(X1,y(X2,X3)))). % 0.20/0.42 cnf(i_0_106, plain, (fail(X1,x(X2,X3))=fail1(X1,x(X2,X3)))). % 0.20/0.42 cnf(i_0_121, plain, (fail22(X1,y(X2,X3))=fail32(X1,y(X2,X3)))). % 0.20/0.42 cnf(i_0_120, plain, (fail22(X1,x(X2,X3))=fail32(X1,x(X2,X3)))). % 0.20/0.42 cnf(i_0_129, plain, (fail3(X1,n(s(X2)))=fail12(X1,n(s(X2))))). % 0.20/0.42 cnf(i_0_132, plain, (fail3(X1,y(X2,X3))=fail12(X1,y(X2,X3)))). % 0.20/0.42 cnf(i_0_131, plain, (fail3(X1,x(X2,X3))=fail12(X1,x(X2,X3)))). % 0.20/0.42 cnf(i_0_174, plain, (eq2(n(s(X1)),n(s(X2)))=eq2(n(X1),n(X2)))). % 0.20/0.42 cnf(i_0_127, plain, (fail12(y(X1,X2),X3)=fail22(y(X1,X2),X3))). % 0.20/0.42 cnf(i_0_126, plain, (fail12(x(X1,X2),X3)=fail22(x(X1,X2),X3))). % 0.20/0.42 cnf(i_0_150, plain, (fail3(y(X1,X2),X3)=opt(y(y(X1,X2),X3)))). % 0.20/0.42 cnf(i_0_149, plain, (fail3(x(X1,X2),X3)=opt(y(x(X1,X2),X3)))). % 0.20/0.42 cnf(i_0_145, plain, (fail(y(X1,X2),X3)=opt(x(y(X1,X2),X3)))). % 0.20/0.42 cnf(i_0_147, plain, (fail3(n(s(X1)),X2)=opt(y(n(s(X1)),X2)))). % 0.20/0.42 cnf(i_0_142, plain, (fail(n(s(X1)),X2)=opt(x(n(s(X1)),X2)))). % 0.20/0.42 cnf(i_0_144, plain, (fail(x(X1,X2),X3)=opt(x(x(X1,X2),X3)))). % 0.20/0.42 cnf(i_0_114, plain, (opt(y(X1,y(X2,X3)))=fail32(y(X1,X2),X3))). % 0.20/0.42 cnf(i_0_92, plain, (aux(x(X1,X2),X3,bfalse)=opt(x(X1,x(X2,X3))))). % 0.20/0.42 cnf(i_0_117, plain, (fail22(X1,n(s(s(X2))))=fail32(X1,n(s(s(X2)))))). % 0.20/0.42 cnf(i_0_123, plain, (fail12(n(s(s(X1))),X2)=fail22(n(s(s(X1))),X2))). % 0.20/0.42 cnf(i_0_115, plain, (y(opt(x(X1,X2)),opt(X3))=fail32(x(X1,X2),X3))). % 0.20/0.42 cnf(i_0_94, plain, (x(opt(y(X1,X2)),opt(X3))=aux(y(X1,X2),X3,bfalse))). % 0.20/0.42 cnf(i_0_136, plain, (x(y(d(X1),X2),y(X1,d(X2)))=d(y(X1,X2)))). % 0.20/0.42 cnf(i_0_100, plain, (fail1(n(X1),x2)=x(n(X1),x2))). % 0.20/0.42 cnf(i_0_112, plain, (y(n(X1),opt(y(X2,X3)))=fail32(n(X1),y(X2,X3)))). % 0.20/0.42 cnf(i_0_111, plain, (y(n(X1),opt(x(X2,X3)))=fail32(n(X1),x(X2,X3)))). % 0.20/0.42 cnf(i_0_102, plain, (aux(y(X1,X2),X3,eq2(y(X1,X2),X3))=fail1(y(X1,X2),X3))). % 0.20/0.42 cnf(i_0_101, plain, (aux(x(X1,X2),X3,eq2(x(X1,X2),X3))=fail1(x(X1,X2),X3))). % 0.20/0.42 cnf(i_0_99, plain, (fail1(n(X1),y(X2,X3))=x(n(X1),opt(y(X2,X3))))). % 0.20/0.42 cnf(i_0_98, plain, (fail1(n(X1),x(X2,X3))=x(n(X1),opt(x(X2,X3))))). % 0.20/0.42 cnf(i_0_91, plain, (aux(X1,X2,btrue)=y(n(s(s(z))),opt(X1)))). % 0.20/0.42 cnf(i_0_180, negated_conjecture, (eq3(eq2(opt(d(X1)),opt(d(opt(X1)))),bfalse)!=btrue)). % 0.20/0.42 cnf(i_0_160, plain, (eq2(y(X1,X2),y(X3,X4))=bfalse|eq2(X1,X3)!=bfalse)). % 0.20/0.42 cnf(i_0_158, plain, (eq2(x(X1,X2),x(X3,X4))=bfalse|eq2(X1,X3)!=bfalse)). % 0.20/0.42 cnf(i_0_161, plain, (eq2(y(X1,X2),y(X3,X4))=eq2(X2,X4)|eq2(X1,X3)!=btrue)). % 0.20/0.42 cnf(i_0_159, plain, (eq2(x(X1,X2),x(X3,X4))=eq2(X2,X4)|eq2(X1,X3)!=btrue)). % 0.20/0.42 cnf(i_0_190, plain, (X5=X5)). % 0.20/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.42 # Begin printing tableau % 0.20/0.42 # Found 6 steps % 0.20/0.42 cnf(i_0_156, plain, (eq3(btrue,bfalse)=bfalse), inference(start_rule)). % 0.20/0.42 cnf(i_0_211, plain, (eq3(btrue,bfalse)=bfalse), inference(extension_rule, [i_0_208])). % 0.20/0.42 cnf(i_0_358, plain, (eq3(btrue,bfalse)!=bfalse), inference(closure_rule, [i_0_156])). % 0.20/0.42 cnf(i_0_356, plain, (fail3(eq3(btrue,bfalse),eq3(btrue,bfalse))=fail3(bfalse,bfalse)), inference(extension_rule, [i_0_193])). % 0.20/0.42 cnf(i_0_378, plain, (fail3(bfalse,bfalse)!=addNat(z,fail3(bfalse,bfalse))), inference(closure_rule, [i_0_139])). % 0.20/0.42 cnf(i_0_376, plain, (fail3(eq3(btrue,bfalse),eq3(btrue,bfalse))=addNat(z,fail3(bfalse,bfalse))), inference(etableau_closure_rule, [i_0_376, ...])). % 0.20/0.42 # End printing tableau % 0.20/0.42 # SZS output end % 0.20/0.42 # Branches closed with saturation will be marked with an "s" % 0.20/0.42 # There were 1 total branch saturation attempts. % 0.20/0.42 # There were 0 of these attempts blocked. % 0.20/0.42 # There were 0 deferred branch saturation attempts. % 0.20/0.42 # There were 0 free duplicated saturations. % 0.20/0.42 # There were 1 total successful branch saturations. % 0.20/0.42 # There were 0 successful branch saturations in interreduction. % 0.20/0.42 # There were 0 successful branch saturations on the branch. % 0.20/0.42 # There were 1 successful branch saturations after the branch. % 0.20/0.42 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.42 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.42 # Begin clausification derivation % 0.20/0.42 % 0.20/0.42 # End clausification derivation % 0.20/0.42 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.42 cnf(i_0_156, plain, (eq3(btrue,bfalse)=bfalse)). % 0.20/0.42 cnf(i_0_155, plain, (eq3(bfalse,btrue)=bfalse)). % 0.20/0.42 cnf(i_0_153, plain, (opt(x2)=x2)). % 0.20/0.42 cnf(i_0_178, plain, (eq2(X1,X1)=btrue)). % 0.20/0.42 cnf(i_0_137, plain, (d(x2)=n(s(z)))). % 0.20/0.42 cnf(i_0_179, plain, (eq3(X1,X1)=btrue)). % 0.20/0.42 cnf(i_0_139, plain, (addNat(z,X1)=X1)). % 0.20/0.42 cnf(i_0_141, plain, (mulNat(z,X1)=z)). % 0.20/0.42 cnf(i_0_152, plain, (opt(n(X1))=n(X1))). % 0.20/0.42 cnf(i_0_134, plain, (d(n(X1))=n(z))). % 0.20/0.42 cnf(i_0_171, plain, (eq2(x2,n(X1))=bfalse)). % 0.20/0.42 cnf(i_0_164, plain, (eq2(n(X1),x2)=bfalse)). % 0.20/0.42 cnf(i_0_173, plain, (eq2(x2,y(X1,X2))=bfalse)). % 0.20/0.42 cnf(i_0_172, plain, (eq2(x2,x(X1,X2))=bfalse)). % 0.20/0.42 cnf(i_0_105, plain, (fail(X1,n(z))=X1)). % 0.20/0.42 cnf(i_0_170, plain, (eq2(y(X1,X2),x2)=bfalse)). % 0.20/0.42 cnf(i_0_108, plain, (fail(X1,x2)=fail1(X1,x2))). % 0.20/0.42 cnf(i_0_122, plain, (fail22(X1,x2)=fail32(X1,x2))). % 0.20/0.42 cnf(i_0_133, plain, (fail3(X1,x2)=fail12(X1,x2))). % 0.20/0.42 cnf(i_0_128, plain, (fail12(x2,X1)=fail22(x2,X1))). % 0.20/0.42 cnf(i_0_167, plain, (eq2(x(X1,X2),x2)=bfalse)). % 0.20/0.42 cnf(i_0_143, plain, (opt(x(n(z),X1))=X1)). % 0.20/0.42 cnf(i_0_151, plain, (fail3(x2,X1)=opt(y(x2,X1)))). % 0.20/0.42 cnf(i_0_146, plain, (fail(x2,X1)=opt(x(x2,X1)))). % 0.20/0.42 cnf(i_0_176, plain, (eq2(n(z),n(s(X1)))=bfalse)). % 0.20/0.42 cnf(i_0_130, plain, (fail3(X1,n(z))=n(z))). % 0.20/0.42 cnf(i_0_118, plain, (fail22(X1,n(s(z)))=X1)). % 0.20/0.42 cnf(i_0_124, plain, (fail12(n(s(z)),X1)=X1)). % 0.20/0.42 cnf(i_0_138, plain, (addNat(s(X1),X2)=s(addNat(X1,X2)))). % 0.20/0.42 cnf(i_0_119, plain, (fail22(X1,n(z))=fail32(X1,n(z)))). % 0.20/0.42 cnf(i_0_125, plain, (fail12(n(z),X1)=fail22(n(z),X1))). % 0.20/0.42 cnf(i_0_175, plain, (eq2(n(s(X1)),n(z))=bfalse)). % 0.20/0.42 cnf(i_0_163, plain, (eq2(n(X1),y(X2,X3))=bfalse)). % 0.20/0.42 cnf(i_0_162, plain, (eq2(n(X1),x(X2,X3))=bfalse)). % 0.20/0.42 cnf(i_0_168, plain, (eq2(y(X1,X2),n(X3))=bfalse)). % 0.20/0.42 cnf(i_0_165, plain, (eq2(x(X1,X2),n(X3))=bfalse)). % 0.20/0.42 cnf(i_0_116, plain, (y(x2,opt(X1))=fail32(x2,X1))). % 0.20/0.42 cnf(i_0_148, plain, (opt(y(n(z),X1))=n(z))). % 0.20/0.42 cnf(i_0_97, plain, (n(addNat(X1,X2))=fail1(n(X1),n(X2)))). % 0.20/0.42 cnf(i_0_110, plain, (n(mulNat(X1,X2))=fail32(n(X1),n(X2)))). % 0.20/0.42 cnf(i_0_140, plain, (addNat(X1,mulNat(X2,X1))=mulNat(s(X2),X1))). % 0.20/0.42 cnf(i_0_135, plain, (x(d(X1),d(X2))=d(x(X1,X2)))). % 0.20/0.42 cnf(i_0_95, plain, (aux(x2,X1,bfalse)=x(x2,opt(X1)))). % 0.20/0.42 cnf(i_0_169, plain, (eq2(y(X1,X2),x(X3,X4))=bfalse)). % 0.20/0.42 cnf(i_0_166, plain, (eq2(x(X1,X2),y(X3,X4))=bfalse)). % 0.20/0.42 cnf(i_0_113, plain, (fail32(n(X1),x2)=y(n(X1),x2))). % 0.20/0.42 cnf(i_0_93, plain, (aux(n(X1),X2,bfalse)=x(n(X1),opt(X2)))). % 0.20/0.42 cnf(i_0_104, plain, (fail(X1,n(s(X2)))=fail1(X1,n(s(X2))))). % 0.20/0.42 cnf(i_0_103, plain, (aux(x2,X1,eq2(x2,X1))=fail1(x2,X1))). % 0.20/0.42 cnf(i_0_107, plain, (fail(X1,y(X2,X3))=fail1(X1,y(X2,X3)))). % 0.20/0.42 cnf(i_0_106, plain, (fail(X1,x(X2,X3))=fail1(X1,x(X2,X3)))). % 0.20/0.42 cnf(i_0_121, plain, (fail22(X1,y(X2,X3))=fail32(X1,y(X2,X3)))). % 0.20/0.42 cnf(i_0_120, plain, (fail22(X1,x(X2,X3))=fail32(X1,x(X2,X3)))). % 0.20/0.42 cnf(i_0_129, plain, (fail3(X1,n(s(X2)))=fail12(X1,n(s(X2))))). % 0.20/0.42 cnf(i_0_132, plain, (fail3(X1,y(X2,X3))=fail12(X1,y(X2,X3)))). % 0.20/0.42 cnf(i_0_131, plain, (fail3(X1,x(X2,X3))=fail12(X1,x(X2,X3)))). % 0.20/0.42 cnf(i_0_174, plain, (eq2(n(s(X1)),n(s(X2)))=eq2(n(X1),n(X2)))). % 0.20/0.42 cnf(i_0_127, plain, (fail12(y(X1,X2),X3)=fail22(y(X1,X2),X3))). % 0.20/0.42 cnf(i_0_126, plain, (fail12(x(X1,X2),X3)=fail22(x(X1,X2),X3))). % 0.20/0.42 cnf(i_0_150, plain, (fail3(y(X1,X2),X3)=opt(y(y(X1,X2),X3)))). % 0.20/0.42 cnf(i_0_149, plain, (fail3(x(X1,X2),X3)=opt(y(x(X1,X2),X3)))). % 0.20/0.42 cnf(i_0_145, plain, (fail(y(X1,X2),X3)=opt(x(y(X1,X2),X3)))). % 0.20/0.42 cnf(i_0_147, plain, (fail3(n(s(X1)),X2)=opt(y(n(s(X1)),X2)))). % 0.20/0.42 cnf(i_0_142, plain, (fail(n(s(X1)),X2)=opt(x(n(s(X1)),X2)))). % 0.20/0.42 cnf(i_0_144, plain, (fail(x(X1,X2),X3)=opt(x(x(X1,X2),X3)))). % 0.20/0.42 cnf(i_0_114, plain, (opt(y(X1,y(X2,X3)))=fail32(y(X1,X2),X3))). % 0.20/0.42 cnf(i_0_92, plain, (aux(x(X1,X2),X3,bfalse)=opt(x(X1,x(X2,X3))))). % 0.20/0.42 cnf(i_0_117, plain, (fail22(X1,n(s(s(X2))))=fail32(X1,n(s(s(X2)))))). % 0.20/0.42 cnf(i_0_123, plain, (fail12(n(s(s(X1))),X2)=fail22(n(s(s(X1))),X2))). % 0.20/0.42 cnf(i_0_115, plain, (y(opt(x(X1,X2)),opt(X3))=fail32(x(X1,X2),X3))). % 0.20/0.42 cnf(i_0_94, plain, (x(opt(y(X1,X2)),opt(X3))=aux(y(X1,X2),X3,bfalse))). % 0.20/0.42 cnf(i_0_136, plain, (x(y(d(X1),X2),y(X1,d(X2)))=d(y(X1,X2)))). % 0.20/0.42 cnf(i_0_100, plain, (fail1(n(X1),x2)=x(n(X1),x2))). % 0.20/0.42 cnf(i_0_112, plain, (y(n(X1),opt(y(X2,X3)))=fail32(n(X1),y(X2,X3)))). % 0.20/0.42 cnf(i_0_111, plain, (y(n(X1),opt(x(X2,X3)))=fail32(n(X1),x(X2,X3)))). % 0.20/0.42 cnf(i_0_102, plain, (aux(y(X1,X2),X3,eq2(y(X1,X2),X3))=fail1(y(X1,X2),X3))). % 0.20/0.42 cnf(i_0_101, plain, (aux(x(X1,X2),X3,eq2(x(X1,X2),X3))=fail1(x(X1,X2),X3))). % 0.20/0.42 cnf(i_0_99, plain, (fail1(n(X1),y(X2,X3))=x(n(X1),opt(y(X2,X3))))). % 0.20/0.42 cnf(i_0_98, plain, (fail1(n(X1),x(X2,X3))=x(n(X1),opt(x(X2,X3))))). % 0.20/0.42 cnf(i_0_91, plain, (aux(X1,X2,btrue)=y(n(s(s(z))),opt(X1)))). % 0.20/0.42 cnf(i_0_180, negated_conjecture, (eq3(eq2(opt(d(X1)),opt(d(opt(X1)))),bfalse)!=btrue)). % 0.20/0.42 cnf(i_0_160, plain, (eq2(y(X1,X2),y(X3,X4))=bfalse|eq2(X1,X3)!=bfalse)). % 0.20/0.42 cnf(i_0_158, plain, (eq2(x(X1,X2),x(X3,X4))=bfalse|eq2(X1,X3)!=bfalse)). % 0.20/0.42 cnf(i_0_161, plain, (eq2(y(X1,X2),y(X3,X4))=eq2(X2,X4)|eq2(X1,X3)!=btrue)). % 0.20/0.42 cnf(i_0_159, plain, (eq2(x(X1,X2),x(X3,X4))=eq2(X2,X4)|eq2(X1,X3)!=btrue)). % 0.20/0.42 cnf(i_0_190, plain, (X5=X5)). % 0.20/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.42 # Begin printing tableau % 0.20/0.42 # Found 6 steps % 0.20/0.42 cnf(i_0_156, plain, (eq3(btrue,bfalse)=bfalse), inference(start_rule)). % 0.20/0.42 cnf(i_0_211, plain, (eq3(btrue,bfalse)=bfalse), inference(extension_rule, [i_0_210])). % 0.20/0.42 cnf(i_0_362, plain, (eq3(btrue,bfalse)!=bfalse), inference(closure_rule, [i_0_156])). % 0.20/0.42 cnf(i_0_361, plain, (eq3(eq3(btrue,bfalse),eq3(btrue,bfalse))=eq3(bfalse,bfalse)), inference(extension_rule, [i_0_193])). % 0.20/0.42 cnf(i_0_378, plain, (eq3(bfalse,bfalse)!=btrue), inference(closure_rule, [i_0_179])). % 0.20/0.42 cnf(i_0_376, plain, (eq3(eq3(btrue,bfalse),eq3(btrue,bfalse))=btrue), inference(etableau_closure_rule, [i_0_376, ...])). % 0.20/0.42 # End printing tableau % 0.20/0.42 # SZS output end % 0.20/0.42 # Branches closed with saturation will be marked with an "s" % 0.20/0.42 pt(X3))=aux(y(X1,X2),X3,bfalse))). % 0.20/0.42 cnf(i_0_136, plain, (x(y(d(X1),X2),y(X1,d(X2)))=d(y(X1,X2)))). % 0.20/0.42 cnf(i_0_100, plain, (fail1(n(X1),x2)=x(n(X1),x2))). % 0.20/0.42 cnf(i_0_112, plain, (y(n(X1),opt(y(X2,X3)))=fail32(n(X1),y(X2,X3)))). % 0.20/0.42 cnf(i_0_111, plain, (y(n(X1),opt(x(X2,X3)))=fail32(n(X1),x(X2,X3)))). % 0.20/0.42 cnf(i_0_102, plain, (aux(y(X1,X2),X3,eq2(y(X1,X2),X3))=fail1(y(X1,X2),X3))). % 0.20/0.42 cnf(i_0_101, plain, (aux(x(X1,X2),X3,eq2(x(X1,X2),X3))=fail1(x(X1,X2),X3))). % 0.20/0.42 cnf(i_0_99, plain, (fail1(n(X1),y(X2,X3))=x(n(X1),opt(y(X2,X3))))). % 0.20/0.42 cnf(i_0_98, plain, (fail1(n(X1),x(X2,X3))=x(n(X1),opt(x(X2,X3))))). % 0.20/0.42 cnf(i_0_91, plain, (aux(X1,X2,btrue)=y(n(s(s(z))),opt(X1)))). % 0.20/0.42 cnf(i_0_180, negated_conjecture, (eq3(eq2(opt(d(X1)),opt(d(opt(X1)))),bfalse)!=btrue)). % 0.20/0.42 cnf(i_0_160, plain, (eq2(y(X1,X2),y(X3,X4))=bfalse|eq2(X1,X3)!=bfalse)). % 0.20/0.42 cnf(i_0_158, plain, (eq2(x(X1,X2),x(X3,X4))=bfalse|eq2(X1,X3)!=bfalse)). % 0.20/0.42 cnf(i_0_161, plain, (eq2(y(X1,X2),y(X3,X4))=eq2(X2,X4)|eq2(X1,X3)!=btrue)). % 0.20/0.42 cnf(i_0_159, plain, (eq2(x(X1,X2),x(X3,X4))=eq2(X2,X4)|eq2(X1,X3)!=btrue)). % 0.20/0.43 cnf(i_0_190, plain, (X5=X5)). % 0.20/0.43 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.43 # Begin printing tableau % 0.20/0.43 # Found 6 steps % 0.20/0.43 cnf(i_0_156, plain, (eq3(btrue,bfalse)=bfalse), inference(start_rule)). % 0.20/0.43 cnf(i_0_211, plain, (eq3(btrue,bfalse)=bfalse), inference(extension_rule, [i_0_206])). % 0.20/0.43 cnf(i_0_351, plain, (eq3(btrue,bfalse)!=bfalse), inference(closure_rule, [i_0_156])). % 0.20/0.43 cnf(i_0_350, plain, (fail22(eq3(btrue,bfalse),eq3(btrue,bfalse))=fail22(bfalse,bfalse)), inference(extension_rule, [i_0_193])). % 0.20/0.43 cnf(i_0_378, plain, (fail22(bfalse,bfalse)!=addNat(z,fail22(bfalse,bfalse))), inference(closure_rule, [i_0_139])). % 0.20/0.43 cnf(i_0_376, plain, (fail22(eq3(btrue,bfalse),eq3(btrue,bfalse))=addNat(z,fail22(bfalse,bfalse))), inference(etableau_closure_rule, [i_0_376, ...])). % 0.20/0.43 # End printing tableau % 0.20/0.43 # SZS output end % 0.20/0.43 # Branches closed with saturation will be marked with an "s" % 0.20/0.43 # Child (31489) has found a proof. % 0.20/0.43 % 0.20/0.43 # Proof search is over... % 0.20/0.43 # Freeing feature tree %------------------------------------------------------------------------------