%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SYN613-1 : TPTP v8.1.0. Released v2.5.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 : 600s % DateTime : Thu Jul 21 06:12:49 EDT 2022 % Result : Unsatisfiable 0.14s 0.38s % Output : CNFRefutation 0.14s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SYN613-1 : TPTP v8.1.0. Released v2.5.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 : n010.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 : Tue Jul 12 06:10:45 EDT 2022 % 0.14/0.34 % CPUTime : % 0.14/0.37 # No SInE strategy applied % 0.14/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.14/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.14/0.37 # % 0.14/0.37 # Presaturation interreduction done % 0.14/0.37 # Number of axioms: 31 Number of unprocessed: 31 % 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.37 # The folding up rule is enabled... % 0.14/0.37 # Local unification is enabled... % 0.14/0.37 # Any saturation attempts will use folding labels... % 0.14/0.37 # 31 beginning clauses after preprocessing and clausification % 0.14/0.37 # Creating start rules for all 31 conjectures. % 0.14/0.37 # There are 31 start rule candidates: % 0.14/0.37 # Found 10 unit axioms. % 0.14/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.14/0.37 # 31 start rule tableaux created. % 0.14/0.37 # 21 extension rule candidate clauses % 0.14/0.37 # 10 unit axiom clauses % 0.14/0.37 % 0.14/0.37 # Requested 8, 32 cores available to the main process. % 0.14/0.38 # There were 1 total branch saturation attempts. % 0.14/0.38 # There were 0 of these attempts blocked. % 0.14/0.38 # There were 0 deferred branch saturation attempts. % 0.14/0.38 # There were 0 free duplicated saturations. % 0.14/0.38 # There were 1 total successful branch saturations. % 0.14/0.38 # There were 0 successful branch saturations in interreduction. % 0.14/0.38 # There were 0 successful branch saturations on the branch. % 0.14/0.38 # There were 1 successful branch saturations after the branch. % 0.14/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.38 # Begin clausification derivation % 0.14/0.38 % 0.14/0.38 # End clausification derivation % 0.14/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.38 cnf(i_0_32, negated_conjecture, (p11(X1,X1))). % 0.14/0.38 cnf(i_0_38, negated_conjecture, (p11(c23,f12(f9(c21))))). % 0.14/0.38 cnf(i_0_39, negated_conjecture, (p11(c24,f12(f9(c21))))). % 0.14/0.38 cnf(i_0_52, negated_conjecture, (p17(c19,f4(f7(f10(c20),f8(f9(c21),c22))),c24))). % 0.14/0.38 cnf(i_0_33, negated_conjecture, (p6(X1,X1))). % 0.14/0.38 cnf(i_0_34, negated_conjecture, (p5(X1,X1))). % 0.14/0.38 cnf(i_0_35, negated_conjecture, (p3(X1,X1))). % 0.14/0.38 cnf(i_0_36, negated_conjecture, (p2(X1,X1))). % 0.14/0.38 cnf(i_0_37, negated_conjecture, (p16(X1,X1))). % 0.14/0.38 cnf(i_0_53, negated_conjecture, (~p17(c19,f4(f7(f10(c20),f8(f9(c21),c22))),c23))). % 0.14/0.38 cnf(i_0_46, negated_conjecture, (p11(X1,X2)|~p11(X3,X2)|~p11(X3,X1))). % 0.14/0.38 cnf(i_0_41, negated_conjecture, (p11(f12(X1),f12(X2))|~p5(X1,X2))). % 0.14/0.38 cnf(i_0_58, negated_conjecture, (p18(f13(f14(X1,c25)),f13(f14(c23,c25)))|~p11(X1,f12(f9(c21))))). % 0.14/0.38 cnf(i_0_59, negated_conjecture, (p18(f13(f14(X1,c25)),f13(f14(c24,c25)))|~p11(X1,f12(f9(c21))))). % 0.14/0.38 cnf(i_0_61, negated_conjecture, (p17(c19,f4(c20),c23)|p11(f15(X1),f12(f9(c21)))|~p17(c19,f4(c20),X1)|~p11(X1,f12(f9(c21))))). % 0.14/0.38 cnf(i_0_42, negated_conjecture, (p11(f13(X1),f13(X2))|~p11(X1,X2))). % 0.14/0.38 cnf(i_0_43, negated_conjecture, (p11(f15(X1),f15(X2))|~p11(X1,X2))). % 0.14/0.38 cnf(i_0_40, negated_conjecture, (p5(f9(X1),f9(X2))|~p5(X1,X2))). % 0.14/0.38 cnf(i_0_47, negated_conjecture, (p6(X1,X2)|~p6(X3,X2)|~p6(X3,X1))). % 0.14/0.38 cnf(i_0_48, negated_conjecture, (p5(X1,X2)|~p5(X3,X2)|~p5(X3,X1))). % 0.14/0.38 cnf(i_0_49, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))). % 0.14/0.38 cnf(i_0_50, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.14/0.38 cnf(i_0_45, negated_conjecture, (p5(f10(X1),f10(X2))|~p2(X1,X2))). % 0.14/0.38 cnf(i_0_44, negated_conjecture, (p3(f4(X1),f4(X2))|~p2(X1,X2))). % 0.14/0.38 cnf(i_0_62, negated_conjecture, (p17(c19,f4(c20),c23)|~p18(f13(f14(f15(X1),c25)),f13(f14(X1,c25)))|~p17(c19,f4(c20),X1)|~p11(X1,f12(f9(c21))))). % 0.14/0.38 cnf(i_0_51, negated_conjecture, (p16(X1,X2)|~p16(X3,X2)|~p16(X3,X1))). % 0.14/0.38 cnf(i_0_55, negated_conjecture, (p11(f14(X1,X2),f14(X3,X4))|~p11(X2,X4)|~p11(X1,X3))). % 0.14/0.38 cnf(i_0_54, negated_conjecture, (p18(X1,X2)|~p18(X3,X4)|~p11(X3,X1)|~p11(X4,X2))). % 0.14/0.38 cnf(i_0_56, negated_conjecture, (p6(f8(X1,X2),f8(X3,X4))|~p5(X2,X4)|~p5(X1,X3))). % 0.14/0.38 cnf(i_0_57, negated_conjecture, (p2(f7(X1,X2),f7(X3,X4))|~p5(X1,X3)|~p6(X2,X4))). % 0.14/0.38 cnf(i_0_60, negated_conjecture, (p17(X1,X2,X3)|~p17(X4,X5,X6)|~p16(X4,X1)|~p3(X5,X2)|~p11(X6,X3))). % 0.14/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.38 # Begin printing tableau % 0.14/0.38 # Found 9 steps % 0.14/0.38 cnf(i_0_57, negated_conjecture, (p2(f7(f10(c20),f8(f9(c21),c22)),f7(f10(c20),f8(f9(c21),c22)))|~p5(f10(c20),f10(c20))|~p6(f8(f9(c21),c22),f8(f9(c21),c22))), inference(start_rule)). % 0.14/0.38 cnf(i_0_69, plain, (~p5(f10(c20),f10(c20))), inference(closure_rule, [i_0_34])). % 0.14/0.38 cnf(i_0_70, plain, (~p6(f8(f9(c21),c22),f8(f9(c21),c22))), inference(closure_rule, [i_0_33])). % 0.14/0.38 cnf(i_0_68, plain, (p2(f7(f10(c20),f8(f9(c21),c22)),f7(f10(c20),f8(f9(c21),c22)))), inference(extension_rule, [i_0_44])). % 0.14/0.38 cnf(i_0_158, plain, (p3(f4(f7(f10(c20),f8(f9(c21),c22))),f4(f7(f10(c20),f8(f9(c21),c22))))), inference(extension_rule, [i_0_60])). % 0.14/0.38 cnf(i_0_160, plain, (p17(c19,f4(f7(f10(c20),f8(f9(c21),c22))),c23)), inference(closure_rule, [i_0_53])). % 0.14/0.38 cnf(i_0_161, plain, (~p17(c19,f4(f7(f10(c20),f8(f9(c21),c22))),c24)), inference(closure_rule, [i_0_52])). % 0.14/0.38 cnf(i_0_162, plain, (~p16(c19,c19)), inference(closure_rule, [i_0_37])). % 0.14/0.38 cnf(i_0_164, plain, (~p11(c24,c23)), inference(etableau_closure_rule, [i_0_164, ...])). % 0.14/0.38 # End printing tableau % 0.14/0.38 # SZS output end % 0.14/0.38 # Branches closed with saturation will be marked with an "s" % 0.14/0.38 # There were 1 total branch saturation attempts. % 0.14/0.38 # There were 0 of these attempts blocked. % 0.14/0.38 # There were 0 deferred branch saturation attempts. % 0.14/0.38 # There were 0 free duplicated saturations. % 0.14/0.38 # There were 1 total successful branch saturations. % 0.14/0.38 # There were 0 successful branch saturations in interreduction. % 0.14/0.38 # There were 0 successful branch saturations on the branch. % 0.14/0.38 # There were 1 successful branch saturations after the branch. % 0.14/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.38 # Begin clausification derivation % 0.14/0.38 % 0.14/0.38 # End clausification derivation % 0.14/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.38 cnf(i_0_32, negated_conjecture, (p11(X1,X1))). % 0.14/0.38 cnf(i_0_38, negated_conjecture, (p11(c23,f12(f9(c21))))). % 0.14/0.38 cnf(i_0_39, negated_conjecture, (p11(c24,f12(f9(c21))))). % 0.14/0.38 cnf(i_0_52, negated_conjecture, (p17(c19,f4(f7(f10(c20),f8(f9(c21),c22))),c24))). % 0.14/0.38 cnf(i_0_33, negated_conjecture, (p6(X1,X1))). % 0.14/0.38 cnf(i_0_34, negated_conjecture, (p5(X1,X1))). % 0.14/0.38 cnf(i_0_35, negated_conjecture, (p3(X1,X1))). % 0.14/0.38 cnf(i_0_36, negated_conjecture, (p2(X1,X1))). % 0.14/0.38 cnf(i_0_37, negated_conjecture, (p16(X1,X1))). % 0.14/0.38 cnf(i_0_53, negated_conjecture, (~p17(c19,f4(f7(f10(c20),f8(f9(c21),c22))),c23))). % 0.14/0.38 cnf(i_0_46, negated_conjecture, (p11(X1,X2)|~p11(X3,X2)|~p11(X3,X1))). % 0.14/0.38 cnf(i_0_41, negated_conjecture, (p11(f12(X1),f12(X2))|~p5(X1,X2))). % 0.14/0.38 cnf(i_0_58, negated_conjecture, (p18(f13(f14(X1,c25)),f13(f14(c23,c25)))|~p11(X1,f12(f9(c21))))). % 0.14/0.38 cnf(i_0_59, negated_conjecture, (p18(f13(f14(X1,c25)),f13(f14(c24,c25)))|~p11(X1,f12(f9(c21))))). % 0.14/0.38 cnf(i_0_61, negated_conjecture, (p17(c19,f4(c20),c23)|p11(f15(X1),f12(f9(c21)))|~p17(c19,f4(c20),X1)|~p11(X1,f12(f9(c21))))). % 0.14/0.38 cnf(i_0_42, negated_conjecture, (p11(f13(X1),f13(X2))|~p11(X1,X2))). % 0.14/0.38 cnf(i_0_43, negated_conjecture, (p11(f15(X1),f15(X2))|~p11(X1,X2))). % 0.14/0.38 cnf(i_0_40, negated_conjecture, (p5(f9(X1),f9(X2))|~p5(X1,X2))). % 0.14/0.38 cnf(i_0_47, negated_conjecture, (p6(X1,X2)|~p6(X3,X2)|~p6(X3,X1))). % 0.14/0.38 cnf(i_0_48, negated_conjecture, (p5(X1,X2)|~p5(X3,X2)|~p5(X3,X1))). % 0.14/0.38 cnf(i_0_49, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))). % 0.14/0.38 cnf(i_0_50, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.14/0.38 cnf(i_0_45, negated_conjecture, (p5(f10(X1),f10(X2))|~p2(X1,X2))). % 0.14/0.38 cnf(i_0_44, negated_conjecture, (p3(f4(X1),f4(X2))|~p2(X1,X2))). % 0.14/0.38 cnf(i_0_62, negated_conjecture, (p17(c19,f4(c20),c23)|~p18(f13(f14(f15(X1),c25)),f13(f14(X1,c25)))|~p17(c19,f4(c20),X1)|~p11(X1,f12(f9(c21))))). % 0.14/0.38 cnf(i_0_51, negated_conjecture, (p16(X1,X2)|~p16(X3,X2)|~p16(X3,X1))). % 0.14/0.38 cnf(i_0_55, negated_conjecture, (p11(f14(X1,X2),f14(X3,X4))|~p11(X2,X4)|~p11(X1,X3))). % 0.14/0.38 cnf(i_0_54, negated_conjecture, (p18(X1,X2)|~p18(X3,X4)|~p11(X3,X1)|~p11(X4,X2))). % 0.14/0.38 cnf(i_0_56, negated_conjecture, (p6(f8(X1,X2),f8(X3,X4))|~p5(X2,X4)|~p5(X1,X3))). % 0.14/0.38 cnf(i_0_57, negated_conjecture, (p2(f7(X1,X2),f7(X3,X4))|~p5(X1,X3)|~p6(X2,X4))). % 0.14/0.38 cnf(i_0_60, negated_conjecture, (p17(X1,X2,X3)|~p17(X4,X5,X6)|~p16(X4,X1)|~p3(X5,X2)|~p11(X6,X3))). % 0.14/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.38 # Begin printing tableau % 0.14/0.38 # Found 10 steps % 0.14/0.38 cnf(i_0_51, negated_conjecture, (p16(c19,c19)|~p16(c19,c19)|~p16(c19,c19)), inference(start_rule)). % 0.14/0.38 cnf(i_0_82, plain, (~p16(c19,c19)), inference(closure_rule, [i_0_37])). % 0.14/0.38 cnf(i_0_83, plain, (~p16(c19,c19)), inference(closure_rule, [i_0_37])). % 0.14/0.38 cnf(i_0_81, plain, (p16(c19,c19)), inference(extension_rule, [i_0_60])). % 0.14/0.38 cnf(i_0_133, plain, (p17(c19,f4(f7(f10(c20),f8(f9(c21),c22))),c23)), inference(closure_rule, [i_0_53])). % 0.14/0.38 cnf(i_0_134, plain, (~p17(c19,f4(f7(f10(c20),f8(f9(c21),c22))),c24)), inference(closure_rule, [i_0_52])). % 0.14/0.38 cnf(i_0_136, plain, (~p3(f4(f7(f10(c20),f8(f9(c21),c22))),f4(f7(f10(c20),f8(f9(c21),c22))))), inference(closure_rule, [i_0_35])). % 0.14/0.38 cnf(i_0_137, plain, (~p11(c24,c23)), inference(extension_rule, [i_0_46])). % 0.14/0.38 cnf(i_0_191, plain, (~p11(c23,c23)), inference(closure_rule, [i_0_32])). % 0.14/0.38 cnf(i_0_192, plain, (~p11(c23,c24)), inference(etableau_closure_rule, [i_0_192, ...])). % 0.14/0.38 # End printing tableau % 0.14/0.38 # SZS output end % 0.14/0.38 # Branches closed with saturation will be marked with an "s" % 0.14/0.38 # There were 1 total branch saturation attempts. % 0.14/0.38 # There were 0 of these attempts blocked. % 0.14/0.38 # There were 0 deferred branch saturation attempts. % 0.14/0.38 # There were 0 free duplicated saturations. % 0.14/0.38 # There were 1 total successful branch saturations. % 0.14/0.38 # There were 0 successful branch saturations in interreduction. % 0.14/0.38 # There were 0 successful branch saturations on the branch. % 0.14/0.38 # There were 1 successful branch saturations after the branch. % 0.14/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.14/0.38 # Begin clausification derivation % 0.14/0.38 % 0.14/0.38 # End clausification derivation % 0.14/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.14/0.38 cnf(i_0_32, negated_conjecture, (p11(X1,X1))). % 0.14/0.38 cnf(i_0_38, negated_conjecture, (p11(c23,f12(f9(c21))))). % 0.14/0.38 cnf(i_0_39, negated_conjecture, (p11(c24,f12(f9(c21))))). % 0.14/0.38 cnf(i_0_52, negated_conjecture, (p17(c19,f4(f7(f10(c20),f8(f9(c21),c22))),c24))). % 0.14/0.38 cnf(i_0_33, negated_conjecture, (p6(X1,X1))). % 0.14/0.38 cnf(i_0_34, negated_conjecture, (p5(X1,X1))). % 0.14/0.38 cnf(i_0_35, negated_conjecture, (p3(X1,X1))). % 0.14/0.38 cnf(i_0_36, negated_conjecture, (p2(X1,X1))). % 0.14/0.38 cnf(i_0_37, negated_conjecture, (p16(X1,X1))). % 0.14/0.38 cnf(i_0_53, negated_conjecture, (~p17(c19,f4(f7(f10(c20),f8(f9(c21),c22))),c23))). % 0.14/0.38 cnf(i_0_46, negated_conjecture, (p11(X1,X2)|~p11(X3,X2)|~p11(X3,X1))). % 0.14/0.38 cnf(i_0_41, negated_conjecture, (p11(f12(X1),f12(X2))|~p5(X1,X2))). % 0.14/0.38 cnf(i_0_58, negated_conjecture, (p18(f13(f14(X1,c25)),f13(f14(c23,c25)))|~p11(X1,f12(f9(c21))))). % 0.14/0.38 cnf(i_0_59, negated_conjecture, (p18(f13(f14(X1,c25)),f13(f14(c24,c25)))|~p11(X1,f12(f9(c21))))). % 0.14/0.38 cnf(i_0_61, negated_conjecture, (p17(c19,f4(c20),c23)|p11(f15(X1),f12(f9(c21)))|~p17(c19,f4(c20),X1)|~p11(X1,f12(f9(c21))))). % 0.14/0.38 cnf(i_0_42, negated_conjecture, (p11(f13(X1),f13(X2))|~p11(X1,X2))). % 0.14/0.38 cnf(i_0_43, negated_conjecture, (p11(f15(X1),f15(X2))|~p11(X1,X2))). % 0.14/0.38 cnf(i_0_40, negated_conjecture, (p5(f9(X1),f9(X2))|~p5(X1,X2))). % 0.14/0.38 cnf(i_0_47, negated_conjecture, (p6(X1,X2)|~p6(X3,X2)|~p6(X3,X1))). % 0.14/0.38 cnf(i_0_48, negated_conjecture, (p5(X1,X2)|~p5(X3,X2)|~p5(X3,X1))). % 0.14/0.38 cnf(i_0_49, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))). % 0.14/0.38 cnf(i_0_50, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))). % 0.14/0.38 cnf(i_0_45, negated_conjecture, (p5(f10(X1),f10(X2))|~p2(X1,X2))). % 0.14/0.38 cnf(i_0_44, negated_conjecture, (p3(f4(X1),f4(X2))|~p2(X1,X2))). % 0.14/0.38 cnf(i_0_62, negated_conjecture, (p17(c19,f4(c20),c23)|~p18(f13(f14(f15(X1),c25)),f13(f14(X1,c25)))|~p17(c19,f4(c20),X1)|~p11(X1,f12(f9(c21))))). % 0.14/0.38 cnf(i_0_51, negated_conjecture, (p16(X1,X2)|~p16(X3,X2)|~p16(X3,X1))). % 0.14/0.38 cnf(i_0_55, negated_conjecture, (p11(f14(X1,X2),f14(X3,X4))|~p11(X2,X4)|~p11(X1,X3))). % 0.14/0.38 cnf(i_0_54, negated_conjecture, (p18(X1,X2)|~p18(X3,X4)|~p11(X3,X1)|~p11(X4,X2))). % 0.14/0.38 cnf(i_0_56, negated_conjecture, (p6(f8(X1,X2),f8(X3,X4))|~p5(X2,X4)|~p5(X1,X3))). % 0.14/0.38 cnf(i_0_57, negated_conjecture, (p2(f7(X1,X2),f7(X3,X4))|~p5(X1,X3)|~p6(X2,X4))). % 0.14/0.38 cnf(i_0_60, negated_conjecture, (p17(X1,X2,X3)|~p17(X4,X5,X6)|~p16(X4,X1)|~p3(X5,X2)|~p11(X6,X3))). % 0.14/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.14/0.38 # Begin printing tableau % 0.14/0.38 # Found 9 steps % 0.14/0.38 cnf(i_0_44, negated_conjecture, (p3(f4(f7(f10(c20),f8(f9(c21),c22))),f4(f7(f10(c20),f8(f9(c21),c22))))|~p2(f7(f10(c20),f8(f9(c21),c22)),f7(f10(c20),f8(f9(c21),c22)))), inference(start_rule)). % 0.14/0.38 cnf(i_0_89, plain, (~p2(f7(f10(c20),f8(f9(c21),c22)),f7(f10(c20),f8(f9(c21),c22)))), inference(closure_rule, [i_0_36])). % 0.14/0.38 cnf(i_0_88, plain, (p3(f4(f7(f10(c20),f8(f9(c21),c22))),f4(f7(f10(c20),f8(f9(c21),c22))))), inference(extension_rule, [i_0_60])). % 0.14/0.38 cnf(i_0_133, plain, (p17(c19,f4(f7(f10(c20),f8(f9(c21),c22))),c23)), inference(closure_rule, [i_0_53])). % 0.14/0.38 cnf(i_0_134, plain, (~p17(c19,f4(f7(f10(c20),f8(f9(c21),c22))),c24)), inference(closure_rule, [i_0_52])). % 0.14/0.38 cnf(i_0_135, plain, (~p16(c19,c19)), inference(closure_rule, [i_0_37])). % 0.14/0.38 cnf(i_0_137, plain, (~p11(c24,c23)), inference(extension_rule, [i_0_46])). % 0.14/0.38 cnf(i_0_191, plain, (~p11(c23,c23)), inference(closure_rule, [i_0_32])). % 0.14/0.38 cnf(i_0_192, plain, (~p11(c23,c24)), inference(etableau_closure_rule, [i_0_192, ...])). % 0.14/0.38 # End printing tableau % 0.14/0.38 # SZS output end % 0.14/0.38 # Branches closed with saturation will be marked with an "s" % 0.14/0.38 # Child (22863) has found a proof. % 0.14/0.38 % 0.14/0.38 # Proof search is over... % 0.14/0.38 # Freeing feature tree %------------------------------------------------------------------------------