TSTP Solution File: SYN618-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN618-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 : 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:52 EDT 2022
% Result : Unsatisfiable 0.21s 0.40s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SYN618-1 : TPTP v8.1.0. Released v2.5.0.
% 0.13/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.35 % Computer : n029.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jul 11 22:23:32 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.38 # No SInE strategy applied
% 0.21/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.21/0.38 #
% 0.21/0.38 # Presaturation interreduction done
% 0.21/0.38 # Number of axioms: 33 Number of unprocessed: 33
% 0.21/0.38 # Tableaux proof search.
% 0.21/0.38 # APR header successfully linked.
% 0.21/0.38 # Hello from C++
% 0.21/0.38 # The folding up rule is enabled...
% 0.21/0.38 # Local unification is enabled...
% 0.21/0.38 # Any saturation attempts will use folding labels...
% 0.21/0.38 # 33 beginning clauses after preprocessing and clausification
% 0.21/0.38 # Creating start rules for all 33 conjectures.
% 0.21/0.38 # There are 33 start rule candidates:
% 0.21/0.38 # Found 16 unit axioms.
% 0.21/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.21/0.38 # 33 start rule tableaux created.
% 0.21/0.38 # 17 extension rule candidate clauses
% 0.21/0.38 # 16 unit axiom clauses
% 0.21/0.38
% 0.21/0.38 # Requested 8, 32 cores available to the main process.
% 0.21/0.40 # There were 2 total branch saturation attempts.
% 0.21/0.40 # There were 0 of these attempts blocked.
% 0.21/0.40 # There were 0 deferred branch saturation attempts.
% 0.21/0.40 # There were 0 free duplicated saturations.
% 0.21/0.40 # There were 2 total successful branch saturations.
% 0.21/0.40 # There were 0 successful branch saturations in interreduction.
% 0.21/0.40 # There were 0 successful branch saturations on the branch.
% 0.21/0.40 # There were 2 successful branch saturations after the branch.
% 0.21/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.40 # Begin clausification derivation
% 0.21/0.40
% 0.21/0.40 # End clausification derivation
% 0.21/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.40 cnf(i_0_34, negated_conjecture, (p9(c16))).
% 0.21/0.40 cnf(i_0_40, negated_conjecture, (p12(c19,c20))).
% 0.21/0.40 cnf(i_0_44, negated_conjecture, (p12(c20,c21))).
% 0.21/0.40 cnf(i_0_42, negated_conjecture, (p13(c19,c23))).
% 0.21/0.40 cnf(i_0_43, negated_conjecture, (p13(c19,c21))).
% 0.21/0.40 cnf(i_0_41, negated_conjecture, (p13(c23,c21))).
% 0.21/0.40 cnf(i_0_45, negated_conjecture, (p2(c17,f3(c16)))).
% 0.21/0.40 cnf(i_0_35, negated_conjecture, (p10(X1,X1))).
% 0.21/0.40 cnf(i_0_36, negated_conjecture, (p5(X1,X1))).
% 0.21/0.40 cnf(i_0_37, negated_conjecture, (p4(X1,X1))).
% 0.21/0.40 cnf(i_0_38, negated_conjecture, (p2(X1,X1))).
% 0.21/0.40 cnf(i_0_46, negated_conjecture, (p11(c16,c17,c18))).
% 0.21/0.40 cnf(i_0_47, negated_conjecture, (p5(f8(c16,c20),f6(f7(c22))))).
% 0.21/0.40 cnf(i_0_49, negated_conjecture, (p5(f8(f3(c16),c23),f6(f7(c22))))).
% 0.21/0.40 cnf(i_0_39, negated_conjecture, (p14(X1,X1))).
% 0.21/0.40 cnf(i_0_50, negated_conjecture, (~p5(f8(f3(c16),c20),f6(f7(c22))))).
% 0.21/0.40 cnf(i_0_48, negated_conjecture, (p9(X1)|~p2(X2,X1)|~p9(X2))).
% 0.21/0.40 cnf(i_0_51, negated_conjecture, (p5(f6(X1),f6(X2))|~p4(X1,X2))).
% 0.21/0.40 cnf(i_0_54, negated_conjecture, (p10(X1,X2)|~p10(X3,X2)|~p10(X3,X1))).
% 0.21/0.40 cnf(i_0_55, negated_conjecture, (p5(X1,X2)|~p5(X3,X2)|~p5(X3,X1))).
% 0.21/0.40 cnf(i_0_56, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))).
% 0.21/0.40 cnf(i_0_57, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.21/0.40 cnf(i_0_53, negated_conjecture, (p4(f7(X1),f7(X2))|~p4(X1,X2))).
% 0.21/0.40 cnf(i_0_62, negated_conjecture, (p5(X1,c20)|~p15(c24,c18)|~p13(X1,c21)|~p13(c19,X1))).
% 0.21/0.40 cnf(i_0_65, negated_conjecture, (p5(X1,c20)|~p13(X1,c21)|~p13(c19,X1)|~p5(f8(c16,X1),f6(f7(c22))))).
% 0.21/0.40 cnf(i_0_64, negated_conjecture, (p5(X1,c20)|~p13(X1,c21)|~p13(c19,X1)|~p5(f8(c17,X1),f6(f7(c22))))).
% 0.21/0.40 cnf(i_0_52, negated_conjecture, (p2(f3(X1),f3(X2))|~p2(X1,X2))).
% 0.21/0.40 cnf(i_0_58, negated_conjecture, (p14(X1,X2)|~p14(X3,X2)|~p14(X3,X1))).
% 0.21/0.40 cnf(i_0_63, negated_conjecture, (p5(f8(X1,X2),f8(X3,X4))|~p2(X1,X3)|~p5(X2,X4))).
% 0.21/0.40 cnf(i_0_59, negated_conjecture, (p12(X1,X2)|~p12(X3,X4)|~p5(X4,X2)|~p5(X3,X1))).
% 0.21/0.40 cnf(i_0_61, negated_conjecture, (p13(X1,X2)|~p13(X3,X4)|~p5(X4,X2)|~p5(X3,X1))).
% 0.21/0.40 cnf(i_0_60, negated_conjecture, (p15(X1,X2)|~p15(X3,X4)|~p14(X3,X1)|~p10(X4,X2))).
% 0.21/0.40 cnf(i_0_66, negated_conjecture, (p11(X1,X2,X3)|~p11(X4,X5,X6)|~p2(X4,X1)|~p2(X5,X2)|~p10(X6,X3))).
% 0.21/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.40 # Begin printing tableau
% 0.21/0.40 # Found 11 steps
% 0.21/0.40 cnf(i_0_60, negated_conjecture, (p15(c24,c18)|~p15(c24,c18)|~p14(c24,c24)|~p10(c18,c18)), inference(start_rule)).
% 0.21/0.40 cnf(i_0_74, plain, (~p14(c24,c24)), inference(closure_rule, [i_0_39])).
% 0.21/0.40 cnf(i_0_75, plain, (~p10(c18,c18)), inference(closure_rule, [i_0_35])).
% 0.21/0.40 cnf(i_0_72, plain, (p15(c24,c18)), inference(extension_rule, [i_0_62])).
% 0.21/0.40 cnf(i_0_174, plain, (~p13(c23,c21)), inference(closure_rule, [i_0_41])).
% 0.21/0.40 cnf(i_0_175, plain, (~p13(c19,c23)), inference(closure_rule, [i_0_42])).
% 0.21/0.40 cnf(i_0_172, plain, (p5(c23,c20)), inference(extension_rule, [i_0_61])).
% 0.21/0.40 cnf(i_0_186, plain, (~p13(c19,c23)), inference(closure_rule, [i_0_42])).
% 0.21/0.40 cnf(i_0_188, plain, (~p5(c19,c19)), inference(closure_rule, [i_0_36])).
% 0.21/0.40 cnf(i_0_73, plain, (~p15(c24,c18)), inference(etableau_closure_rule, [i_0_73, ...])).
% 0.21/0.40 cnf(i_0_185, plain, (p13(c19,c20)), inference(etableau_closure_rule, [i_0_185, ...])).
% 0.21/0.40 # End printing tableau
% 0.21/0.40 # SZS output end
% 0.21/0.40 # Branches closed with saturation will be marked with an "s"
% 0.21/0.40 # There were 2 total branch saturation attempts.
% 0.21/0.40 # There were 0 of these attempts blocked.
% 0.21/0.40 # There were 0 deferred branch saturation attempts.
% 0.21/0.40 # There were 0 free duplicated saturations.
% 0.21/0.40 # There were 2 total successful branch saturations.
% 0.21/0.40 # There were 0 successful branch saturations in interreduction.
% 0.21/0.40 # There were 0 successful branch saturations on the branch.
% 0.21/0.40 # There were 2 successful branch saturations after the branch.
% 0.21/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.40 # Begin clausification derivation
% 0.21/0.40
% 0.21/0.40 # End clausification derivation
% 0.21/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.40 cnf(i_0_34, negated_conjecture, (p9(c16))).
% 0.21/0.40 cnf(i_0_40, negated_conjecture, (p12(c19,c20))).
% 0.21/0.40 cnf(i_0_44, negated_conjecture, (p12(c20,c21))).
% 0.21/0.40 cnf(i_0_42, negated_conjecture, (p13(c19,c23))).
% 0.21/0.40 cnf(i_0_43, negated_conjecture, (p13(c19,c21))).
% 0.21/0.40 cnf(i_0_41, negated_conjecture, (p13(c23,c21))).
% 0.21/0.40 cnf(i_0_45, negated_conjecture, (p2(c17,f3(c16)))).
% 0.21/0.40 cnf(i_0_35, negated_conjecture, (p10(X1,X1))).
% 0.21/0.40 cnf(i_0_36, negated_conjecture, (p5(X1,X1))).
% 0.21/0.40 cnf(i_0_37, negated_conjecture, (p4(X1,X1))).
% 0.21/0.40 cnf(i_0_38, negated_conjecture, (p2(X1,X1))).
% 0.21/0.40 cnf(i_0_46, negated_conjecture, (p11(c16,c17,c18))).
% 0.21/0.40 cnf(i_0_47, negated_conjecture, (p5(f8(c16,c20),f6(f7(c22))))).
% 0.21/0.40 cnf(i_0_49, negated_conjecture, (p5(f8(f3(c16),c23),f6(f7(c22))))).
% 0.21/0.40 cnf(i_0_39, negated_conjecture, (p14(X1,X1))).
% 0.21/0.40 cnf(i_0_50, negated_conjecture, (~p5(f8(f3(c16),c20),f6(f7(c22))))).
% 0.21/0.40 cnf(i_0_48, negated_conjecture, (p9(X1)|~p2(X2,X1)|~p9(X2))).
% 0.21/0.40 cnf(i_0_51, negated_conjecture, (p5(f6(X1),f6(X2))|~p4(X1,X2))).
% 0.21/0.40 cnf(i_0_54, negated_conjecture, (p10(X1,X2)|~p10(X3,X2)|~p10(X3,X1))).
% 0.21/0.40 cnf(i_0_55, negated_conjecture, (p5(X1,X2)|~p5(X3,X2)|~p5(X3,X1))).
% 0.21/0.40 cnf(i_0_56, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))).
% 0.21/0.40 cnf(i_0_57, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.21/0.40 cnf(i_0_53, negated_conjecture, (p4(f7(X1),f7(X2))|~p4(X1,X2))).
% 0.21/0.40 cnf(i_0_62, negated_conjecture, (p5(X1,c20)|~p15(c24,c18)|~p13(X1,c21)|~p13(c19,X1))).
% 0.21/0.40 cnf(i_0_65, negated_conjecture, (p5(X1,c20)|~p13(X1,c21)|~p13(c19,X1)|~p5(f8(c16,X1),f6(f7(c22))))).
% 0.21/0.40 cnf(i_0_64, negated_conjecture, (p5(X1,c20)|~p13(X1,c21)|~p13(c19,X1)|~p5(f8(c17,X1),f6(f7(c22))))).
% 0.21/0.40 cnf(i_0_52, negated_conjecture, (p2(f3(X1),f3(X2))|~p2(X1,X2))).
% 0.21/0.40 cnf(i_0_58, negated_conjecture, (p14(X1,X2)|~p14(X3,X2)|~p14(X3,X1))).
% 0.21/0.40 cnf(i_0_63, negated_conjecture, (p5(f8(X1,X2),f8(X3,X4))|~p2(X1,X3)|~p5(X2,X4))).
% 0.21/0.40 cnf(i_0_59, negated_conjecture, (p12(X1,X2)|~p12(X3,X4)|~p5(X4,X2)|~p5(X3,X1))).
% 0.21/0.40 cnf(i_0_61, negated_conjecture, (p13(X1,X2)|~p13(X3,X4)|~p5(X4,X2)|~p5(X3,X1))).
% 0.21/0.40 cnf(i_0_60, negated_conjecture, (p15(X1,X2)|~p15(X3,X4)|~p14(X3,X1)|~p10(X4,X2))).
% 0.21/0.40 cnf(i_0_66, negated_conjecture, (p11(X1,X2,X3)|~p11(X4,X5,X6)|~p2(X4,X1)|~p2(X5,X2)|~p10(X6,X3))).
% 0.21/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.40 # Begin printing tableau
% 0.21/0.40 # Found 10 steps
% 0.21/0.40 cnf(i_0_58, negated_conjecture, (p14(c24,c24)|~p14(c24,c24)|~p14(c24,c24)), inference(start_rule)).
% 0.21/0.40 cnf(i_0_88, plain, (~p14(c24,c24)), inference(closure_rule, [i_0_39])).
% 0.21/0.40 cnf(i_0_89, plain, (~p14(c24,c24)), inference(closure_rule, [i_0_39])).
% 0.21/0.40 cnf(i_0_87, plain, (p14(c24,c24)), inference(extension_rule, [i_0_60])).
% 0.21/0.40 cnf(i_0_147, plain, (~p10(c18,c18)), inference(closure_rule, [i_0_35])).
% 0.21/0.40 cnf(i_0_144, plain, (p15(c24,c18)), inference(extension_rule, [i_0_62])).
% 0.21/0.40 cnf(i_0_179, plain, (~p13(c23,c21)), inference(closure_rule, [i_0_41])).
% 0.21/0.40 cnf(i_0_180, plain, (~p13(c19,c23)), inference(closure_rule, [i_0_42])).
% 0.21/0.40 cnf(i_0_145, plain, (~p15(c24,c18)), inference(etableau_closure_rule, [i_0_145, ...])).
% 0.21/0.40 cnf(i_0_177, plain, (p5(c23,c20)), inference(etableau_closure_rule, [i_0_177, ...])).
% 0.21/0.40 # End printing tableau
% 0.21/0.40 # SZS output end
% 0.21/0.40 # Branches closed with saturation will be marked with an "s"
% 0.21/0.40 # There were 1 total branch saturation attempts.
% 0.21/0.40 # There were 0 of these attempts blocked.
% 0.21/0.40 # There were 0 deferred branch saturation attempts.
% 0.21/0.40 # There were 0 free duplicated saturations.
% 0.21/0.40 # There were 1 total successful branch saturations.
% 0.21/0.40 # There were 0 successful branch saturations in interreduction.
% 0.21/0.40 # There were 0 successful branch saturations on the branch.
% 0.21/0.40 # There were 1 successful branch saturations after the branch.
% 0.21/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.40 # Begin clausification derivation
% 0.21/0.40
% 0.21/0.40 # End clausification derivation
% 0.21/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.40 cnf(i_0_34, negated_conjecture, (p9(c16))).
% 0.21/0.40 cnf(i_0_40, negated_conjecture, (p12(c19,c20))).
% 0.21/0.40 cnf(i_0_44, negated_conjecture, (p12(c20,c21))).
% 0.21/0.40 cnf(i_0_42, negated_conjecture, (p13(c19,c23))).
% 0.21/0.40 cnf(i_0_43, negated_conjecture, (p13(c19,c21))).
% 0.21/0.40 cnf(i_0_41, negated_conjecture, (p13(c23,c21))).
% 0.21/0.40 cnf(i_0_45, negated_conjecture, (p2(c17,f3(c16)))).
% 0.21/0.40 cnf(i_0_35, negated_conjecture, (p10(X1,X1))).
% 0.21/0.40 cnf(i_0_36, negated_conjecture, (p5(X1,X1))).
% 0.21/0.40 cnf(i_0_37, negated_conjecture, (p4(X1,X1))).
% 0.21/0.40 cnf(i_0_38, negated_conjecture, (p2(X1,X1))).
% 0.21/0.40 cnf(i_0_46, negated_conjecture, (p11(c16,c17,c18))).
% 0.21/0.40 cnf(i_0_47, negated_conjecture, (p5(f8(c16,c20),f6(f7(c22))))).
% 0.21/0.40 cnf(i_0_49, negated_conjecture, (p5(f8(f3(c16),c23),f6(f7(c22))))).
% 0.21/0.40 cnf(i_0_39, negated_conjecture, (p14(X1,X1))).
% 0.21/0.40 cnf(i_0_50, negated_conjecture, (~p5(f8(f3(c16),c20),f6(f7(c22))))).
% 0.21/0.40 cnf(i_0_48, negated_conjecture, (p9(X1)|~p2(X2,X1)|~p9(X2))).
% 0.21/0.40 cnf(i_0_51, negated_conjecture, (p5(f6(X1),f6(X2))|~p4(X1,X2))).
% 0.21/0.40 cnf(i_0_54, negated_conjecture, (p10(X1,X2)|~p10(X3,X2)|~p10(X3,X1))).
% 0.21/0.40 cnf(i_0_55, negated_conjecture, (p5(X1,X2)|~p5(X3,X2)|~p5(X3,X1))).
% 0.21/0.40 cnf(i_0_56, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))).
% 0.21/0.40 cnf(i_0_57, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.21/0.40 cnf(i_0_53, negated_conjecture, (p4(f7(X1),f7(X2))|~p4(X1,X2))).
% 0.21/0.40 cnf(i_0_62, negated_conjecture, (p5(X1,c20)|~p15(c24,c18)|~p13(X1,c21)|~p13(c19,X1))).
% 0.21/0.40 cnf(i_0_65, negated_conjecture, (p5(X1,c20)|~p13(X1,c21)|~p13(c19,X1)|~p5(f8(c16,X1),f6(f7(c22))))).
% 0.21/0.40 cnf(i_0_64, negated_conjecture, (p5(X1,c20)|~p13(X1,c21)|~p13(c19,X1)|~p5(f8(c17,X1),f6(f7(c22))))).
% 0.21/0.40 cnf(i_0_52, negated_conjecture, (p2(f3(X1),f3(X2))|~p2(X1,X2))).
% 0.21/0.40 cnf(i_0_58, negated_conjecture, (p14(X1,X2)|~p14(X3,X2)|~p14(X3,X1))).
% 0.21/0.40 cnf(i_0_63, negated_conjecture, (p5(f8(X1,X2),f8(X3,X4))|~p2(X1,X3)|~p5(X2,X4))).
% 0.21/0.40 cnf(i_0_59, negated_conjecture, (p12(X1,X2)|~p12(X3,X4)|~p5(X4,X2)|~p5(X3,X1))).
% 0.21/0.40 cnf(i_0_61, negated_conjecture, (p13(X1,X2)|~p13(X3,X4)|~p5(X4,X2)|~p5(X3,X1))).
% 0.21/0.40 cnf(i_0_60, negated_conjecture, (p15(X1,X2)|~p15(X3,X4)|~p14(X3,X1)|~p10(X4,X2))).
% 0.21/0.40 cnf(i_0_66, negated_conjecture, (p11(X1,X2,X3)|~p11(X4,X5,X6)|~p2(X4,X1)|~p2(X5,X2)|~p10(X6,X3))).
% 0.21/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.40 # Begin printing tableau
% 0.21/0.40 # Found 11 steps
% 0.21/0.40 cnf(i_0_52, negated_conjecture, (p2(f3(X7),f3(X7))|~p2(X7,X7)), inference(start_rule)).
% 0.21/0.40 cnf(i_0_91, plain, (~p2(X7,X7)), inference(closure_rule, [i_0_38])).
% 0.21/0.40 cnf(i_0_90, plain, (p2(f3(X7),f3(X7))), inference(extension_rule, [i_0_63])).
% 0.21/0.40 cnf(i_0_1139, plain, (~p5(f8(f3(c16),c23),f6(f7(c22)))), inference(closure_rule, [i_0_49])).
% 0.21/0.40 cnf(i_0_1137, plain, (p5(f8(f3(X7),f8(f3(c16),c23)),f8(f3(X7),f6(f7(c22))))), inference(extension_rule, [i_0_55])).
% 0.21/0.40 cnf(i_0_1854, plain, (p5(f8(f3(X7),f6(f7(c22))),f8(f3(X7),f6(f7(c22))))), inference(extension_rule, [i_0_63])).
% 0.21/0.40 cnf(i_0_1900, plain, (~p2(X5,X5)), inference(closure_rule, [i_0_38])).
% 0.21/0.40 cnf(i_0_1856, plain, (~p5(f8(f3(X7),f8(f3(c16),c23)),f8(f3(X7),f6(f7(c22))))), inference(extension_rule, [i_0_63])).
% 0.21/0.40 cnf(i_0_2021, plain, (~p2(f3(X7),f3(X7))), inference(closure_rule, [i_0_38])).
% 0.21/0.40 cnf(i_0_2022, plain, (~p5(f8(f3(c16),c23),f6(f7(c22)))), inference(closure_rule, [i_0_49])).
% 0.21/0.40 cnf(i_0_1899, plain, (p5(f8(X5,f8(f3(X7),f6(f7(c22)))),f8(X5,f8(f3(X7),f6(f7(c22)))))), inference(etableau_closure_rule, [i_0_1899, ...])).
% 0.21/0.40 # End printing tableau
% 0.21/0.40 # SZS output end
% 0.21/0.40 # Branches closed with saturation will be marked with an "s"
% 0.21/0.41 # Child (20936) has found a proof.
% 0.21/0.41
% 0.21/0.41 # Proof search is over...
% 0.21/0.41 # Freeing feature tree
%------------------------------------------------------------------------------