%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN537-1 : TPTP v8.1.0. Released v2.1.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 : n029.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 : 600s % DateTime : Thu Jul 21 06:12:14 EDT 2022 % Result : Satisfiable 0.18s 0.40s % Output : CNFRefutation 0.18s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SYN537-1 : TPTP v8.1.0. Released v2.1.0. % 0.06/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.12/0.33 % Computer : n029.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Mon Jul 11 19:17:17 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.36 # No SInE strategy applied % 0.12/0.36 # Auto-Mode selected heuristic G_N___023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y % 0.12/0.36 # and selection function SelectMaxLComplexAvoidPosPred. % 0.12/0.36 # % 0.12/0.36 # Number of axioms: 114 Number of unprocessed: 114 % 0.12/0.36 # Tableaux proof search. % 0.12/0.36 # APR header successfully linked. % 0.12/0.36 # Hello from C++ % 0.12/0.37 # The folding up rule is enabled... % 0.12/0.37 # Local unification is enabled... % 0.12/0.37 # Any saturation attempts will use folding labels... % 0.12/0.37 # 114 beginning clauses after preprocessing and clausification % 0.12/0.37 # Creating start rules for all 114 conjectures. % 0.12/0.37 # There are 114 start rule candidates: % 0.12/0.37 # Found 2 unit axioms. % 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.12/0.37 # 114 start rule tableaux created. % 0.12/0.37 # 112 extension rule candidate clauses % 0.12/0.37 # 2 unit axiom clauses % 0.12/0.37 % 0.12/0.37 # Requested 8, 32 cores available to the main process. % 0.18/0.40 # 21817 Satisfiable branch % 0.18/0.40 # Satisfiable branch found. % 0.18/0.40 # There were 2 total branch saturation attempts. % 0.18/0.40 # There were 0 of these attempts blocked. % 0.18/0.40 # There were 0 deferred branch saturation attempts. % 0.18/0.40 # There were 0 free duplicated saturations. % 0.18/0.40 # There were 1 total successful branch saturations. % 0.18/0.40 # There were 1 successful branch saturations in interreduction. % 0.18/0.40 # There were 0 successful branch saturations on the branch. % 0.18/0.40 # There were 0 successful branch saturations after the branch. % 0.18/0.40 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.18/0.40 # Begin clausification derivation % 0.18/0.40 % 0.18/0.40 # End clausification derivation % 0.18/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.18/0.40 cnf(i_0_115, negated_conjecture, (c1_0)). % 0.18/0.40 cnf(i_0_117, negated_conjecture, (~c3_0)). % 0.18/0.40 cnf(i_0_116, negated_conjecture, (ndr1_0|c5_0)). % 0.18/0.40 cnf(i_0_118, negated_conjecture, (ndr1_0|ssSkC5)). % 0.18/0.40 cnf(i_0_119, negated_conjecture, (ndr1_0|ssSkC4)). % 0.18/0.40 cnf(i_0_120, negated_conjecture, (ndr1_0|ssSkC3)). % 0.18/0.40 cnf(i_0_121, negated_conjecture, (ndr1_0|ssSkC2)). % 0.18/0.40 cnf(i_0_122, negated_conjecture, (ndr1_0|ssSkC0)). % 0.18/0.40 cnf(i_0_125, negated_conjecture, (ndr1_0|~c5_0)). % 0.18/0.40 cnf(i_0_124, negated_conjecture, (ndr1_0|~c2_0)). % 0.18/0.40 cnf(i_0_129, negated_conjecture, (c5_0|~c4_0)). % 0.18/0.40 cnf(i_0_127, negated_conjecture, (ndr1_0|c2_0|c4_0)). % 0.18/0.40 cnf(i_0_126, negated_conjecture, (ndr1_0|c2_0|~ssSkC2)). % 0.18/0.40 cnf(i_0_123, negated_conjecture, (ndr1_0|~ssSkC5|~ssSkC4)). % 0.18/0.40 cnf(i_0_174, negated_conjecture, (~c1_0|~c2_0|~c4_0)). % 0.18/0.40 cnf(i_0_128, negated_conjecture, (c5_0|c2_1(a659))). % 0.18/0.40 cnf(i_0_130, negated_conjecture, (ssSkC2|c3_1(a666))). % 0.18/0.40 cnf(i_0_132, negated_conjecture, (ssSkC0|ndr1_1(a643))). % 0.18/0.40 cnf(i_0_133, negated_conjecture, (ssSkC0|c4_1(a643))). % 0.18/0.40 cnf(i_0_135, negated_conjecture, (c2_1(a674)|~c2_0)). % 0.18/0.40 cnf(i_0_136, negated_conjecture, (ndr1_1(a669)|~c5_0)). % 0.18/0.40 cnf(i_0_134, negated_conjecture, (c4_1(a674)|~c2_0)). % 0.18/0.40 cnf(i_0_138, negated_conjecture, (c2_0|c4_0|c3_1(a665))). % 0.18/0.40 cnf(i_0_139, negated_conjecture, (c2_0|c4_0|ndr1_1(a660))). % 0.18/0.40 cnf(i_0_137, negated_conjecture, (c2_0|ndr1_1(a667)|~ssSkC2)). % 0.18/0.40 cnf(i_0_162, negated_conjecture, (c3_1(a676)|~c5_0|~c2_0)). % 0.18/0.40 cnf(i_0_161, negated_conjecture, (ndr1_1(a676)|~c5_0|~c2_0)). % 0.18/0.40 cnf(i_0_173, negated_conjecture, (ndr1_1(a651)|~c1_0|~c5_0)). % 0.18/0.40 cnf(i_0_163, negated_conjecture, (c4_1(a676)|~c5_0|~c2_0)). % 0.18/0.40 cnf(i_0_140, negated_conjecture, (c5_0|~c1_1(a659))). % 0.18/0.40 cnf(i_0_141, negated_conjecture, (ssSkC5|~c4_1(a679))). % 0.18/0.40 cnf(i_0_142, negated_conjecture, (ssSkC5|~c5_1(a679))). % 0.18/0.40 cnf(i_0_143, negated_conjecture, (ssSkC4|~c2_1(a678))). % 0.18/0.40 cnf(i_0_144, negated_conjecture, (ssSkC4|~c4_1(a678))). % 0.18/0.40 cnf(i_0_146, negated_conjecture, (ssSkC3|~c1_1(a672))). % 0.18/0.40 cnf(i_0_145, negated_conjecture, (ssSkC3|~c5_1(a672))). % 0.18/0.40 cnf(i_0_147, negated_conjecture, (ssSkC2|~c1_1(a666))). % 0.18/0.40 cnf(i_0_151, negated_conjecture, (ssSkC0|~c1_1(a643))). % 0.18/0.40 cnf(i_0_154, negated_conjecture, (~c5_0|~c1_1(a669))). % 0.18/0.40 cnf(i_0_158, negated_conjecture, (c2_0|c4_0|~c4_1(a660))). % 0.18/0.40 cnf(i_0_156, negated_conjecture, (c2_0|c4_0|~c5_1(a665))). % 0.18/0.40 cnf(i_0_155, negated_conjecture, (c2_0|~ssSkC2|~c4_1(a667))). % 0.18/0.40 cnf(i_0_152, negated_conjecture, (~ssSkC5|~ssSkC4|~c3_1(a680))). % 0.18/0.40 cnf(i_0_131, negated_conjecture, (ndr1_1(X1)|ssSkP0(X1))). % 0.18/0.40 cnf(i_0_175, negated_conjecture, (ssSkC1|c2_1(X1)|ndr1_1(X1)|~ndr1_0)). % 0.18/0.40 cnf(i_0_150, negated_conjecture, (ssSkC0|c5_2(a643,a644))). % 0.18/0.40 cnf(i_0_153, negated_conjecture, (c1_2(a669,a670)|~c5_0)). % 0.18/0.40 cnf(i_0_157, negated_conjecture, (c2_0|c4_0|c2_2(a660,a661))). % 0.18/0.40 cnf(i_0_176, negated_conjecture, (c1_2(a651,a652)|~c1_0|~c5_0)). % 0.18/0.40 cnf(i_0_191, negated_conjecture, (c1_1(X1)|c5_1(X1)|~ndr1_0|~c4_0|~c4_1(a653))). % 0.18/0.40 cnf(i_0_192, negated_conjecture, (c1_1(X1)|c5_1(X1)|~ndr1_0|~c4_0|~c1_1(a653))). % 0.18/0.40 cnf(i_0_148, negated_conjecture, (ssSkP0(X1)|c4_2(X1,a649))). % 0.18/0.40 cnf(i_0_149, negated_conjecture, (ssSkP0(X1)|c1_2(X1,a649))). % 0.18/0.40 cnf(i_0_182, negated_conjecture, (c5_0|ndr1_1(X1)|c5_1(X1)|~ndr1_0|~c2_1(X1))). % 0.18/0.40 cnf(i_0_160, negated_conjecture, (ssSkC0|~c2_2(a643,a644))). % 0.18/0.40 cnf(i_0_190, negated_conjecture, (c5_0|c3_0|ndr1_1(X1)|c1_1(X1)|~ndr1_0|~c2_1(X1))). % 0.18/0.40 cnf(i_0_164, negated_conjecture, (~c5_0|~c5_2(a669,a670))). % 0.18/0.40 cnf(i_0_165, negated_conjecture, (~c5_0|~c2_2(a669,a670))). % 0.18/0.40 cnf(i_0_171, negated_conjecture, (c2_0|c4_0|~c4_2(a660,a661))). % 0.18/0.40 cnf(i_0_168, negated_conjecture, (c2_0|c4_0|~c4_2(a660,a662))). % 0.18/0.40 cnf(i_0_169, negated_conjecture, (c2_0|c4_0|~c5_2(a660,a662))). % 0.18/0.40 cnf(i_0_170, negated_conjecture, (c2_0|c4_0|~c2_2(a660,a662))). % 0.18/0.40 cnf(i_0_172, negated_conjecture, (c2_0|c4_0|~c3_2(a660,a661))). % 0.18/0.40 cnf(i_0_187, negated_conjecture, (c4_0|c2_1(X1)|ndr1_1(X1)|~ndr1_0|~ssSkC3|~c3_1(X1))). % 0.18/0.40 cnf(i_0_166, negated_conjecture, (c2_0|~ssSkC2|~c4_2(a667,a668))). % 0.18/0.40 cnf(i_0_167, negated_conjecture, (c2_0|~ssSkC2|~c1_2(a667,a668))). % 0.18/0.40 cnf(i_0_180, negated_conjecture, (~c1_0|~c5_0|~c5_2(a651,a652))). % 0.18/0.40 cnf(i_0_181, negated_conjecture, (~c1_0|~c5_0|~c2_2(a651,a652))). % 0.18/0.40 cnf(i_0_177, negated_conjecture, (~c5_0|~c2_0|~c4_2(a676,a677))). % 0.18/0.40 cnf(i_0_178, negated_conjecture, (~c5_0|~c2_0|~c2_2(a676,a677))). % 0.18/0.40 cnf(i_0_179, negated_conjecture, (~c5_0|~c2_0|~c3_2(a676,a677))). % 0.18/0.40 cnf(i_0_183, negated_conjecture, (c3_0|ndr1_1(X1)|~ndr1_0|~ssSkP0(X1)|~c4_1(X1))). % 0.18/0.40 cnf(i_0_159, negated_conjecture, (ssSkP0(X1)|~c5_2(X1,a649))). % 0.18/0.40 cnf(i_0_184, negated_conjecture, (ssSkC1|c2_1(X1)|~ndr1_0|~c4_2(X1,a657))). % 0.18/0.40 cnf(i_0_185, negated_conjecture, (ssSkC1|c2_1(X1)|~ndr1_0|~c1_2(X1,a657))). % 0.18/0.40 cnf(i_0_186, negated_conjecture, (ssSkC1|c2_1(X1)|~ndr1_0|~c5_2(X1,a657))). % 0.18/0.40 cnf(i_0_197, negated_conjecture, (c5_0|c3_0|c1_1(X1)|c5_2(X1,a647)|~ndr1_0|~c2_1(X1))). % 0.18/0.40 cnf(i_0_189, negated_conjecture, (c3_0|c4_2(X1,a650)|~ndr1_0|~ssSkP0(X1)|~c4_1(X1))). % 0.18/0.40 cnf(i_0_188, negated_conjecture, (c3_0|c5_2(X1,a650)|~ndr1_0|~ssSkP0(X1)|~c4_1(X1))). % 0.18/0.40 cnf(i_0_194, negated_conjecture, (c5_0|c5_1(X1)|~ndr1_0|~c2_1(X1)|~c1_2(X1,a656))). % 0.18/0.40 cnf(i_0_193, negated_conjecture, (c5_0|c5_1(X1)|~ndr1_0|~c2_1(X1)|~c2_2(X1,a656))). % 0.18/0.40 cnf(i_0_195, negated_conjecture, (c5_0|c5_1(X1)|~ndr1_0|~c2_1(X1)|~c3_2(X1,a656))). % 0.18/0.40 cnf(i_0_205, negated_conjecture, (c5_0|c3_0|c1_1(X1)|~ndr1_0|~c2_1(X1)|~c1_2(X1,a647))). % 0.18/0.40 cnf(i_0_204, negated_conjecture, (c5_0|c3_0|c1_1(X1)|~ndr1_0|~c2_1(X1)|~c2_2(X1,a647))). % 0.18/0.40 cnf(i_0_202, negated_conjecture, (c4_0|c2_1(X1)|~ndr1_0|~ssSkC3|~c3_1(X1)|~c4_2(X1,a673))). % 0.18/0.40 cnf(i_0_203, negated_conjecture, (c4_0|c2_1(X1)|~ndr1_0|~ssSkC3|~c3_1(X1)|~c1_2(X1,a673))). % 0.18/0.40 cnf(i_0_201, negated_conjecture, (c4_0|c2_1(X1)|~ndr1_0|~ssSkC3|~c3_1(X1)|~c5_2(X1,a673))). % 0.18/0.40 cnf(i_0_196, negated_conjecture, (c3_0|~ndr1_0|~ssSkP0(X1)|~c4_1(X1)|~c3_2(X1,a650))). % 0.18/0.40 cnf(i_0_198, negated_conjecture, (ssSkC2|c3_2(a666,X1)|~ndr1_1(a666)|~c5_2(a666,X1))). % 0.18/0.40 cnf(i_0_200, negated_conjecture, (c2_0|c4_0|c5_2(a665,X1)|~ndr1_1(a665)|~c1_2(a665,X1))). % 0.18/0.40 cnf(i_0_199, negated_conjecture, (c2_2(a680,X1)|~ssSkC5|~ssSkC4|~ndr1_1(a680)|~c1_2(a680,X1))). % 0.18/0.40 cnf(i_0_210, negated_conjecture, (c1_1(X1)|c5_1(X1)|c1_2(a653,X2)|c3_2(a653,X2)|~ndr1_0|~c4_0|~ndr1_1(a653))). % 0.18/0.40 cnf(i_0_206, negated_conjecture, (ssSkC5|c1_2(a679,X1)|c5_2(a679,X1)|c3_2(a679,X1)|~ndr1_1(a679))). % 0.18/0.40 cnf(i_0_207, negated_conjecture, (ssSkC3|c4_2(a672,X1)|c1_2(a672,X1)|~ndr1_1(a672)|~c5_2(a672,X1))). % 0.18/0.40 cnf(i_0_208, negated_conjecture, (c2_2(a669,X1)|c3_2(a669,X1)|~c5_0|~ndr1_1(a669)|~c4_2(a669,X1))). % 0.18/0.40 cnf(i_0_212, negated_conjecture, (c5_2(a651,X1)|c3_2(a651,X1)|~c1_0|~c5_0|~ndr1_1(a651)|~c1_2(a651,X1))). % 0.18/0.40 cnf(i_0_209, negated_conjecture, (c5_0|c5_2(a659,X1)|~ndr1_1(a659)|~c1_2(a659,X1)|~c3_2(a659,X1))). % 0.18/0.40 cnf(i_0_211, negated_conjecture, (ndr1_1(a654)|c1_2(X1,X2)|c5_2(X1,X2)|~ndr1_0|~c2_0|~ndr1_1(X1)|~c4_2(X1,X2))). % 0.18/0.40 cnf(i_0_215, negated_conjecture, (c1_2(X1,X2)|c5_2(X1,X2)|~ndr1_0|~c2_0|~ndr1_1(X1)|~c1_1(a654)|~c4_2(X1,X2))). % 0.18/0.40 cnf(i_0_216, negated_conjecture, (c1_2(X1,X2)|c5_2(X1,X2)|~ndr1_0|~c2_0|~ndr1_1(X1)|~c5_1(a654)|~c4_2(X1,X2))). % 0.18/0.40 cnf(i_0_213, negated_conjecture, (c1_2(X1,X2)|c5_2(X1,X2)|c5_2(a654,a655)|~ndr1_0|~c2_0|~ndr1_1(X1)|~c4_2(X1,X2))). % 0.18/0.40 cnf(i_0_214, negated_conjecture, (c1_2(X1,X2)|c5_2(X1,X2)|c3_2(a654,a655)|~ndr1_0|~c2_0|~ndr1_1(X1)|~c4_2(X1,X2))). % 0.18/0.40 cnf(i_0_220, negated_conjecture, (c3_2(X1,X2)|~c1_0|~ndr1_0|~c4_0|~c3_1(X1)|~ndr1_1(X1)|~c4_2(X1,X2)|~c1_2(X1,X2))). % 0.18/0.40 cnf(i_0_219, negated_conjecture, (c1_2(X1,X2)|c5_2(X1,X2)|~ndr1_0|~c2_0|~ndr1_1(X1)|~c4_2(X1,X2)|~c4_2(a654,a655))). % 0.18/0.40 cnf(i_0_217, negated_conjecture, (c3_0|c4_1(X1)|c1_2(X1,X2)|c5_2(X1,X2)|c4_2(X1,a658)|~ndr1_0|~ssSkC1|~ndr1_1(X1)|~c2_2(X1,X2))). % 0.18/0.40 cnf(i_0_218, negated_conjecture, (c3_0|c4_1(X1)|c1_2(X1,X2)|c5_2(X1,X2)|c5_2(X1,a658)|~ndr1_0|~ssSkC1|~ndr1_1(X1)|~c2_2(X1,X2))). % 0.18/0.40 cnf(i_0_221, negated_conjecture, (c5_1(X1)|c3_1(a675)|c1_2(X1,X2)|~ndr1_0|~c5_0|~ndr1_1(X1)|~c1_1(X1)|~c4_2(X1,X2)|~c2_2(X1,X2))). % 0.18/0.40 cnf(i_0_222, negated_conjecture, (c5_1(X1)|c5_1(a675)|c1_2(X1,X2)|~ndr1_0|~c5_0|~ndr1_1(X1)|~c1_1(X1)|~c4_2(X1,X2)|~c2_2(X1,X2))). % 0.18/0.40 cnf(i_0_224, negated_conjecture, (c3_1(X1)|c1_1(X2)|c3_2(X2,X3)|c2_2(X2,a640)|~ndr1_0|~c5_0|~ndr1_1(X2)|~c1_1(X1)|~c5_1(X1)|~c1_2(X2,X3)|~c2_2(X2,X3))). % 0.18/0.40 cnf(i_0_225, negated_conjecture, (c3_1(X1)|c1_1(X2)|c3_2(X2,X3)|c3_2(X2,a640)|~ndr1_0|~c5_0|~ndr1_1(X2)|~c1_1(X1)|~c5_1(X1)|~c1_2(X2,X3)|~c2_2(X2,X3))). % 0.18/0.40 cnf(i_0_223, negated_conjecture, (c4_0|c1_1(X1)|c4_2(X1,X3)|c5_2(X1,X2)|c3_2(X1,X2)|~ndr1_0|~ndr1_1(X1)|~c3_1(a648)|~c1_2(X1,X3)|~c1_2(X1,X2))). % 0.18/0.40 cnf(i_0_226, negated_conjecture, (c3_1(X1)|c1_1(X2)|c3_2(X2,X3)|~ndr1_0|~c5_0|~ndr1_1(X2)|~c1_1(X1)|~c5_1(X1)|~c1_2(X2,X3)|~c2_2(X2,X3)|~c5_2(X2,a640))). % 0.18/0.40 cnf(i_0_227, negated_conjecture, (c4_0|c1_1(X1)|c4_2(X1,X3)|c5_2(X1,X2)|c3_2(X1,X2)|~ndr1_0|~ndr1_1(X1)|~ndr1_1(a648)|~c1_2(X1,X3)|~c1_2(X1,X2)|~c1_2(a648,X4)|~c3_2(a648,X4))). % 0.18/0.40 cnf(i_0_228, negated_conjecture, (c4_0|c1_1(X1)|c4_2(X1,X3)|c5_2(X1,X2)|c3_2(X1,X2)|c4_2(a648,X4)|~ndr1_0|~ndr1_1(X1)|~ndr1_1(a648)|~c1_2(X1,X3)|~c1_2(X1,X2)|~c5_2(a648,X4)|~c2_2(a648,X4))). % 0.18/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.18/0.40 # Begin printing tableau % 0.18/0.40 # Found 10 steps % 0.18/0.40 cnf(i_0_226, negated_conjecture, (c3_1(a680)|c1_1(a660)|c3_2(a660,a661)|~ndr1_0|~c5_0|~ndr1_1(a660)|~c1_1(a680)|~c5_1(a680)|~c1_2(a660,a661)|~c2_2(a660,a661)|~c5_2(a660,a640)), inference(start_rule)). % 0.18/0.40 cnf(i_0_255, plain, (c1_1(a660)), inference(closure_rule, [i_0_0])). % 0.18/0.40 cnf(i_0_254, plain, (c3_1(a680)), inference(extension_rule, [i_0_152])). % 0.18/0.40 cnf(i_0_1079, plain, (~ssSkC4), inference(extension_rule, [i_0_144])). % 0.18/0.40 cnf(i_0_13213, plain, (~c4_1(a678)), inference(extension_rule, [i_0_218])). % 0.18/0.40 cnf(i_0_13300, plain, (c3_0), inference(closure_rule, [i_0_117])). % 0.18/0.40 cnf(i_0_1078, plain, (~ssSkC5), inference(extension_rule, [i_0_142])). % 0.18/0.40 cnf(i_0_13627, plain, (~c5_1(a679)), inference(extension_rule, [i_0_222])). % 0.18/0.40 cnf(i_0_256, plain, (c3_2(a660,a661)), inference(extension_rule, [i_0_172])). % 0.18/0.40 cnf(i_0_257, plain, (~ndr1_0), inference(etableau_closure_rule, [i_0_257, ...])). % 0.18/0.40 # End printing tableau % 0.18/0.40 # SZS output end % 0.18/0.40 # Branches closed with saturation will be marked with an "s" % 0.18/0.41 # Child (21817) has found a proof. % 0.18/0.41 % 0.18/0.41 # Proof search is over... % 0.18/0.41 # Freeing feature tree %------------------------------------------------------------------------------