%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN528-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 : n014.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:07 EDT 2022 % Result : Satisfiable 0.20s 0.48s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SYN528-1 : TPTP v8.1.0. Released v2.1.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.14/0.34 % Computer : n014.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Mon Jul 11 21:25:19 EDT 2022 % 0.14/0.34 % CPUTime : % 0.14/0.37 # No SInE strategy applied % 0.14/0.37 # Auto-Mode selected heuristic G_N___023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y % 0.14/0.37 # and selection function SelectMaxLComplexAvoidPosPred. % 0.14/0.37 # % 0.14/0.37 # Number of axioms: 121 Number of unprocessed: 121 % 0.14/0.37 # Tableaux proof search. % 0.14/0.37 # APR header successfully linked. % 0.14/0.37 # Hello from C++ % 0.14/0.38 # The folding up rule is enabled... % 0.14/0.38 # Local unification is enabled... % 0.14/0.38 # Any saturation attempts will use folding labels... % 0.14/0.38 # 121 beginning clauses after preprocessing and clausification % 0.14/0.38 # Creating start rules for all 121 conjectures. % 0.14/0.38 # There are 121 start rule candidates: % 0.14/0.38 # Found 0 unit axioms. % 0.14/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.38 # 121 start rule tableaux created. % 0.14/0.38 # 121 extension rule candidate clauses % 0.14/0.38 # 0 unit axiom clauses % 0.14/0.38 % 0.14/0.38 # Requested 8, 32 cores available to the main process. % 0.20/0.47 # 15858 Satisfiable branch % 0.20/0.48 # Satisfiable branch found. % 0.20/0.48 # There were 1 total branch saturation attempts. % 0.20/0.48 # There were 0 of these attempts blocked. % 0.20/0.48 # There were 0 deferred branch saturation attempts. % 0.20/0.48 # There were 0 free duplicated saturations. % 0.20/0.48 # There were 0 total successful branch saturations. % 0.20/0.48 # There were 0 successful branch saturations in interreduction. % 0.20/0.48 # There were 0 successful branch saturations on the branch. % 0.20/0.48 # There were 0 successful branch saturations after the branch. % 0.20/0.48 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.48 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.48 # Begin clausification derivation % 0.20/0.48 % 0.20/0.48 # End clausification derivation % 0.20/0.48 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.48 cnf(i_0_122, negated_conjecture, (ndr1_0|ssSkC6)). % 0.20/0.48 cnf(i_0_123, negated_conjecture, (ndr1_0|ssSkC5)). % 0.20/0.48 cnf(i_0_124, negated_conjecture, (ndr1_0|ssSkC3)). % 0.20/0.48 cnf(i_0_125, negated_conjecture, (ndr1_0|ssSkC2)). % 0.20/0.48 cnf(i_0_130, negated_conjecture, (c4_0|c3_0|c1_0)). % 0.20/0.48 cnf(i_0_126, negated_conjecture, (ndr1_0|c4_0|~ssSkC6)). % 0.20/0.48 cnf(i_0_127, negated_conjecture, (ndr1_0|c4_0|~ssSkC5)). % 0.20/0.48 cnf(i_0_140, negated_conjecture, (ndr1_0|c4_0|~c5_0)). % 0.20/0.48 cnf(i_0_149, negated_conjecture, (ndr1_0|c4_0|~c2_0)). % 0.20/0.48 cnf(i_0_129, negated_conjecture, (ndr1_0|c5_0|~ssSkC1)). % 0.20/0.48 cnf(i_0_152, negated_conjecture, (ndr1_0|c5_0|~c1_0)). % 0.20/0.48 cnf(i_0_150, negated_conjecture, (ndr1_0|c3_0|~c5_0)). % 0.20/0.48 cnf(i_0_146, negated_conjecture, (ndr1_0|c3_0|~c1_0)). % 0.20/0.48 cnf(i_0_145, negated_conjecture, (ndr1_0|c1_0|~c4_0)). % 0.20/0.48 cnf(i_0_128, negated_conjecture, (ndr1_0|~ssSkC3|~ssSkC2)). % 0.20/0.48 cnf(i_0_144, negated_conjecture, (ndr1_0|~c5_0|~ssSkC4)). % 0.20/0.48 cnf(i_0_131, negated_conjecture, (ssSkC6|c4_1(a312))). % 0.20/0.48 cnf(i_0_132, negated_conjecture, (ssSkC5|ndr1_1(a307))). % 0.20/0.48 cnf(i_0_134, negated_conjecture, (ssSkC2|c3_1(a294))). % 0.20/0.48 cnf(i_0_141, negated_conjecture, (c4_0|ndr1_1(a309)|~ssSkC5)). % 0.20/0.48 cnf(i_0_138, negated_conjecture, (c4_0|c3_1(a313)|~ssSkC6)). % 0.20/0.48 cnf(i_0_143, negated_conjecture, (c4_0|c3_1(a309)|~ssSkC5)). % 0.20/0.48 cnf(i_0_139, negated_conjecture, (c4_0|c5_1(a313)|~ssSkC6)). % 0.20/0.48 cnf(i_0_176, negated_conjecture, (c4_0|c5_1(a293)|~c2_0)). % 0.20/0.48 cnf(i_0_142, negated_conjecture, (c4_0|c2_1(a309)|~ssSkC5)). % 0.20/0.48 cnf(i_0_168, negated_conjecture, (c4_0|c2_1(a311)|~c5_0)). % 0.20/0.48 cnf(i_0_175, negated_conjecture, (c4_0|c2_1(a293)|~c2_0)). % 0.20/0.48 cnf(i_0_151, negated_conjecture, (c5_0|ndr1_1(a286)|~ssSkC1)). % 0.20/0.48 cnf(i_0_178, negated_conjecture, (c5_0|c2_1(a277)|~c1_0)). % 0.20/0.48 cnf(i_0_173, negated_conjecture, (c3_0|ndr1_1(a297)|~c1_0)). % 0.20/0.48 cnf(i_0_174, negated_conjecture, (c3_0|c2_1(a297)|~c1_0)). % 0.20/0.48 cnf(i_0_171, negated_conjecture, (c1_0|c5_1(a302)|~c4_0)). % 0.20/0.48 cnf(i_0_172, negated_conjecture, (c1_0|c2_1(a302)|~c4_0)). % 0.20/0.48 cnf(i_0_147, negated_conjecture, (c4_1(a296)|~ssSkC3|~ssSkC2)). % 0.20/0.48 cnf(i_0_148, negated_conjecture, (c3_1(a296)|~ssSkC3|~ssSkC2)). % 0.20/0.48 cnf(i_0_170, negated_conjecture, (c5_1(a304)|~c5_0|~ssSkC4)). % 0.20/0.48 cnf(i_0_153, negated_conjecture, (ssSkC6|~c3_1(a312))). % 0.20/0.48 cnf(i_0_157, negated_conjecture, (ssSkC5|~c3_1(a307))). % 0.20/0.48 cnf(i_0_158, negated_conjecture, (ssSkC5|~c5_1(a307))). % 0.20/0.48 cnf(i_0_162, negated_conjecture, (ssSkC3|~c2_1(a295))). % 0.20/0.48 cnf(i_0_163, negated_conjecture, (ssSkC3|~c1_1(a295))). % 0.20/0.48 cnf(i_0_165, negated_conjecture, (ssSkC2|~c4_1(a294))). % 0.20/0.48 cnf(i_0_164, negated_conjecture, (ssSkC2|~c1_1(a294))). % 0.20/0.48 cnf(i_0_185, negated_conjecture, (c4_0|~c5_0|~c3_1(a311))). % 0.20/0.48 cnf(i_0_177, negated_conjecture, (c5_0|~ssSkC1|~c2_1(a286))). % 0.20/0.48 cnf(i_0_193, negated_conjecture, (c5_0|~c1_0|~c4_1(a277))). % 0.20/0.48 cnf(i_0_190, negated_conjecture, (c3_0|~c5_0|~c1_1(a288))). % 0.20/0.48 cnf(i_0_133, negated_conjecture, (ndr1_1(X1)|ssSkP3(X1))). % 0.20/0.48 cnf(i_0_135, negated_conjecture, (ndr1_1(X1)|ssSkP2(X1))). % 0.20/0.48 cnf(i_0_136, negated_conjecture, (ndr1_1(X1)|ssSkP1(X1))). % 0.20/0.48 cnf(i_0_137, negated_conjecture, (ndr1_1(X1)|ssSkP0(X1))). % 0.20/0.48 cnf(i_0_154, negated_conjecture, (ssSkC5|c5_2(a307,a308))). % 0.20/0.48 cnf(i_0_155, negated_conjecture, (ssSkC5|c3_2(a307,a308))). % 0.20/0.48 cnf(i_0_156, negated_conjecture, (ssSkC5|c4_2(a307,a308))). % 0.20/0.48 cnf(i_0_169, negated_conjecture, (c4_0|c3_2(a309,a310)|~ssSkC5)). % 0.20/0.48 cnf(i_0_188, negated_conjecture, (c3_0|c3_2(a297,a298)|~c1_0)). % 0.20/0.48 cnf(i_0_187, negated_conjecture, (c3_0|c2_2(a297,a298)|~c1_0)). % 0.20/0.48 cnf(i_0_189, negated_conjecture, (c1_0|ndr1_1(X1)|~ndr1_0|~ssSkP2(X1))). % 0.20/0.48 cnf(i_0_201, negated_conjecture, (ndr1_1(X1)|~ndr1_0|~c2_0|~ssSkC0|~c2_1(X1))). % 0.20/0.48 cnf(i_0_159, negated_conjecture, (ssSkP3(X1)|c5_2(X1,a305))). % 0.20/0.48 cnf(i_0_160, negated_conjecture, (ssSkP3(X1)|c3_2(X1,a305))). % 0.20/0.48 cnf(i_0_161, negated_conjecture, (ssSkP3(X1)|c4_2(X1,a305))). % 0.20/0.48 cnf(i_0_166, negated_conjecture, (ssSkP2(X1)|c4_2(X1,a289))). % 0.20/0.48 cnf(i_0_167, negated_conjecture, (ssSkP1(X1)|c4_2(X1,a284))). % 0.20/0.48 cnf(i_0_186, negated_conjecture, (c4_0|~ssSkC5|~c2_2(a309,a310))). % 0.20/0.48 cnf(i_0_192, negated_conjecture, (c5_0|~ssSkC1|~c4_2(a286,a287))). % 0.20/0.48 cnf(i_0_191, negated_conjecture, (c5_0|~ssSkC1|~c1_2(a286,a287))). % 0.20/0.48 cnf(i_0_195, negated_conjecture, (c3_0|~c1_0|~c3_2(a297,a299))). % 0.20/0.48 cnf(i_0_196, negated_conjecture, (c3_0|~c1_0|~c4_2(a297,a299))). % 0.20/0.48 cnf(i_0_194, negated_conjecture, (c3_0|~c1_0|~c2_2(a297,a299))). % 0.20/0.48 cnf(i_0_197, negated_conjecture, (c3_0|~c1_0|~c1_2(a297,a298))). % 0.20/0.48 cnf(i_0_200, negated_conjecture, (ssSkC1|ndr1_1(X1)|~ndr1_0|~ssSkP1(X1)|~ssSkP0(X1))). % 0.20/0.48 cnf(i_0_208, negated_conjecture, (ssSkC4|ndr1_1(X1)|~ndr1_0|~c5_1(X1)|~c2_1(X1))). % 0.20/0.48 cnf(i_0_204, negated_conjecture, (ndr1_1(X1)|~ndr1_0|~c3_0|~c4_1(X1)|~ssSkP3(X1))). % 0.20/0.48 cnf(i_0_217, negated_conjecture, (c3_1(X1)|c1_1(X1)|~ndr1_0|~c3_0|~c4_1(X1)|~c3_1(a292))). % 0.20/0.48 cnf(i_0_207, negated_conjecture, (c4_2(X1,a279)|~ndr1_0|~c2_0|~ssSkC0|~c2_1(X1))). % 0.20/0.48 cnf(i_0_180, negated_conjecture, (ssSkP2(X1)|~c5_2(X1,a289))). % 0.20/0.48 cnf(i_0_179, negated_conjecture, (ssSkP2(X1)|~c2_2(X1,a289))). % 0.20/0.48 cnf(i_0_181, negated_conjecture, (ssSkP1(X1)|~c3_2(X1,a284))). % 0.20/0.48 cnf(i_0_182, negated_conjecture, (ssSkP1(X1)|~c1_2(X1,a284))). % 0.20/0.48 cnf(i_0_184, negated_conjecture, (ssSkP0(X1)|~c4_2(X1,a283))). % 0.20/0.48 cnf(i_0_183, negated_conjecture, (ssSkP0(X1)|~c2_2(X1,a283))). % 0.20/0.48 cnf(i_0_203, negated_conjecture, (ssSkC1|c3_2(X1,a285)|~ndr1_0|~ssSkP1(X1)|~ssSkP0(X1))). % 0.20/0.48 cnf(i_0_202, negated_conjecture, (ssSkC1|c1_2(X1,a285)|~ndr1_0|~ssSkP1(X1)|~ssSkP0(X1))). % 0.20/0.48 cnf(i_0_212, negated_conjecture, (ssSkC4|c4_2(X1,a303)|~ndr1_0|~c5_1(X1)|~c2_1(X1))). % 0.20/0.48 cnf(i_0_213, negated_conjecture, (ssSkC4|c2_2(X1,a303)|~ndr1_0|~c5_1(X1)|~c2_1(X1))). % 0.20/0.48 cnf(i_0_199, negated_conjecture, (c1_0|~ndr1_0|~ssSkP2(X1)|~c5_2(X1,a290))). % 0.20/0.48 cnf(i_0_198, negated_conjecture, (c1_0|~ndr1_0|~ssSkP2(X1)|~c4_2(X1,a290))). % 0.20/0.48 cnf(i_0_210, negated_conjecture, (c4_2(X1,a306)|~ndr1_0|~c3_0|~c4_1(X1)|~ssSkP3(X1))). % 0.20/0.48 cnf(i_0_211, negated_conjecture, (~ndr1_0|~c2_0|~ssSkC0|~c2_1(X1)|~c3_2(X1,a279))). % 0.20/0.48 cnf(i_0_205, negated_conjecture, (ssSkC3|c5_2(a295,X1)|c4_2(a295,X1)|~ndr1_1(a295))). % 0.20/0.48 cnf(i_0_206, negated_conjecture, (c5_0|c5_2(a286,X1)|c2_2(a286,X1)|~ssSkC1|~ndr1_1(a286))). % 0.20/0.48 cnf(i_0_209, negated_conjecture, (ssSkC1|~ndr1_0|~ssSkP1(X1)|~ssSkP0(X1)|~c2_2(X1,a285))). % 0.20/0.48 cnf(i_0_216, negated_conjecture, (ssSkC4|~ndr1_0|~c5_1(X1)|~c2_1(X1)|~c5_2(X1,a303))). % 0.20/0.48 cnf(i_0_214, negated_conjecture, (~ndr1_0|~c3_0|~c4_1(X1)|~ssSkP3(X1)|~c2_2(X1,a306))). % 0.20/0.48 cnf(i_0_215, negated_conjecture, (c4_0|c5_2(a311,X1)|~c5_0|~ndr1_1(a311)|~c2_2(a311,X1))). % 0.20/0.48 cnf(i_0_219, negated_conjecture, (c3_0|c4_2(a288,X1)|c2_2(a288,X1)|c1_2(a288,X1)|~c5_0|~ndr1_1(a288))). % 0.20/0.48 cnf(i_0_218, negated_conjecture, (c1_0|~c4_0|~ndr1_1(a302)|~c5_2(a302,X1)|~c2_2(a302,X1))). % 0.20/0.48 cnf(i_0_220, negated_conjecture, (c1_2(a304,X1)|~c5_0|~ssSkC4|~ndr1_1(a304)|~c5_2(a304,X1)|~c4_2(a304,X1))). % 0.20/0.48 cnf(i_0_221, negated_conjecture, (c4_1(X1)|c1_1(X1)|ndr1_1(a300)|~ndr1_0|~c4_0|~ndr1_1(X1)|~c2_2(X1,X2)|~c1_2(X1,X2))). % 0.20/0.48 cnf(i_0_222, negated_conjecture, (c4_1(X1)|c1_1(X1)|c5_1(a300)|~ndr1_0|~c4_0|~ndr1_1(X1)|~c2_2(X1,X2)|~c1_2(X1,X2))). % 0.20/0.48 cnf(i_0_238, negated_conjecture, (c3_1(X1)|c1_1(X1)|c3_2(a292,X2)|c4_2(a292,X2)|~ndr1_0|~c3_0|~c4_1(X1)|~ndr1_1(a292)|~c2_2(a292,X2))). % 0.20/0.48 cnf(i_0_223, negated_conjecture, (ndr1_1(a281)|~ndr1_0|~c4_1(X1)|~ndr1_1(X1)|~c1_1(X1)|~c4_2(X1,X2)|~c2_2(X1,X2))). % 0.20/0.48 cnf(i_0_224, negated_conjecture, (c5_1(a281)|~ndr1_0|~c4_1(X1)|~ndr1_1(X1)|~c1_1(X1)|~c4_2(X1,X2)|~c2_2(X1,X2))). % 0.20/0.48 cnf(i_0_234, negated_conjecture, (ndr1_1(X3)|c5_2(X1,X2)|~ndr1_0|~c1_0|~ndr1_1(X1)|~c5_1(X1)|~c2_1(X3)|~c2_1(X1)|~c4_2(X1,X2))). % 0.20/0.48 cnf(i_0_226, negated_conjecture, (~ndr1_0|~c4_1(X1)|~ndr1_1(X1)|~c1_1(X1)|~c4_1(a281)|~c4_2(X1,X2)|~c2_2(X1,X2))). % 0.20/0.48 cnf(i_0_240, negated_conjecture, (c3_1(X1)|c1_1(X1)|c2_2(a292,X2)|~ndr1_0|~c3_0|~c4_1(X1)|~ndr1_1(a292)|~c5_2(a292,X2)|~c3_2(a292,X2))). % 0.20/0.48 cnf(i_0_225, negated_conjecture, (c3_2(a281,a282)|~ndr1_0|~c4_1(X1)|~ndr1_1(X1)|~c1_1(X1)|~c4_2(X1,X2)|~c2_2(X1,X2))). % 0.20/0.48 cnf(i_0_239, negated_conjecture, (c5_2(X1,X2)|c1_2(X3,a291)|~ndr1_0|~c1_0|~ndr1_1(X1)|~c5_1(X1)|~c2_1(X3)|~c2_1(X1)|~c4_2(X1,X2))). % 0.20/0.48 cnf(i_0_233, negated_conjecture, (c5_0|c5_2(X1,X2)|c3_2(X1,X2)|c5_2(X1,a280)|~ndr1_0|~c3_0|~ndr1_1(X1)|~c5_1(X1)|~c1_2(X1,X2))). % 0.20/0.48 cnf(i_0_232, negated_conjecture, (c5_0|c5_2(X1,X2)|c3_2(X1,X2)|c4_2(X1,a280)|~ndr1_0|~c3_0|~ndr1_1(X1)|~c5_1(X1)|~c1_2(X1,X2))). % 0.20/0.48 cnf(i_0_228, negated_conjecture, (c4_1(X1)|c1_1(X1)|~ndr1_0|~c4_0|~ndr1_1(X1)|~c2_2(X1,X2)|~c1_2(X1,X2)|~c3_2(a300,a301))). % 0.20/0.48 cnf(i_0_229, negated_conjecture, (c4_1(X1)|c1_1(X1)|~ndr1_0|~c4_0|~ndr1_1(X1)|~c2_2(X1,X2)|~c1_2(X1,X2)|~c4_2(a300,a301))). % 0.20/0.48 cnf(i_0_227, negated_conjecture, (c4_1(X1)|c1_1(X1)|~ndr1_0|~c4_0|~ndr1_1(X1)|~c2_2(X1,X2)|~c1_2(X1,X2)|~c1_2(a300,a301))). % 0.20/0.48 cnf(i_0_231, negated_conjecture, (~ndr1_0|~c4_1(X1)|~ndr1_1(X1)|~c1_1(X1)|~c4_2(X1,X2)|~c2_2(X1,X2)|~c5_2(a281,a282))). % 0.20/0.48 cnf(i_0_230, negated_conjecture, (~ndr1_0|~c4_1(X1)|~ndr1_1(X1)|~c1_1(X1)|~c4_2(X1,X2)|~c2_2(X1,X2)|~c2_2(a281,a282))). % 0.20/0.48 cnf(i_0_242, negated_conjecture, (c5_2(X1,X2)|~ndr1_0|~c1_0|~ndr1_1(X1)|~c5_1(X1)|~c2_1(X3)|~c2_1(X1)|~c4_2(X1,X2)|~c5_2(X3,a291))). % 0.20/0.48 cnf(i_0_241, negated_conjecture, (c5_2(X1,X2)|~ndr1_0|~c1_0|~ndr1_1(X1)|~c5_1(X1)|~c2_1(X3)|~c2_1(X1)|~c4_2(X1,X2)|~c2_2(X3,a291))). % 0.20/0.48 cnf(i_0_236, negated_conjecture, (ssSkC0|c2_2(X1,X2)|~ndr1_0|~ndr1_1(X1)|~c5_2(X1,X3)|~c4_2(X1,X3)|~c1_2(X1,X2)|~c5_2(X1,a278))). % 0.20/0.48 cnf(i_0_237, negated_conjecture, (ssSkC0|c2_2(X1,X2)|~ndr1_0|~ndr1_1(X1)|~c5_2(X1,X3)|~c4_2(X1,X3)|~c1_2(X1,X2)|~c4_2(X1,a278))). % 0.20/0.48 cnf(i_0_235, negated_conjecture, (ssSkC0|c2_2(X1,X2)|~ndr1_0|~ndr1_1(X1)|~c5_2(X1,X3)|~c4_2(X1,X3)|~c1_2(X1,X2)|~c2_2(X1,a278))). % 0.20/0.48 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.48 # Begin printing tableau % 0.20/0.48 # Found 7 steps % 0.20/0.48 cnf(i_0_232, negated_conjecture, (c5_0|c5_2(a295,a289)|c3_2(a295,a289)|c4_2(a295,a280)|~ndr1_0|~c3_0|~ndr1_1(a295)|~c5_1(a295)|~c1_2(a295,a289)), inference(start_rule)). % 0.20/0.48 cnf(i_0_323, plain, (c5_0), inference(closure_rule, [i_0_0])). % 0.20/0.48 cnf(i_0_324, plain, (c5_2(a295,a289)), inference(extension_rule, [i_0_180])). % 0.20/0.48 cnf(i_0_37388, plain, (ssSkP2(a295)), inference(extension_rule, [i_0_198])). % 0.20/0.48 cnf(i_0_37569, plain, (c1_0), inference(extension_rule, [i_0_197])). % 0.20/0.48 cnf(i_0_37570, plain, (~ndr1_0), inference(extension_rule, [i_0_150])). % 0.20/0.48 cnf(i_0_37572, plain, (~c4_2(a295,a290)), inference(extension_rule, [i_0_205])). % 0.20/0.48 # End printing tableau % 0.20/0.48 # SZS output end % 0.20/0.48 # Branches closed with saturation will be marked with an "s" % 0.20/0.48 # Child (15858) has found a proof. % 0.20/0.48 % 0.20/0.48 # Proof search is over... % 0.20/0.48 # Freeing feature tree %------------------------------------------------------------------------------