TSTP Solution File: SYN703-1 by Etableau---0.67

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : SYN703-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 : 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:13:25 EDT 2022

% Result   : Unsatisfiable 0.20s 0.40s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN703-1 : TPTP v8.1.0. Released v2.5.0.
% 0.12/0.13  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.34  % Computer : n014.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Mon Jul 11 11:36:49 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.38  # No SInE strategy applied
% 0.20/0.38  # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.38  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.20/0.38  #
% 0.20/0.38  # Presaturation interreduction done
% 0.20/0.38  # Number of axioms: 80 Number of unprocessed: 80
% 0.20/0.38  # Tableaux proof search.
% 0.20/0.38  # APR header successfully linked.
% 0.20/0.38  # Hello from C++
% 0.20/0.38  # The folding up rule is enabled...
% 0.20/0.38  # Local unification is enabled...
% 0.20/0.38  # Any saturation attempts will use folding labels...
% 0.20/0.38  # 80 beginning clauses after preprocessing and clausification
% 0.20/0.38  # Creating start rules for all 80 conjectures.
% 0.20/0.38  # There are 80 start rule candidates:
% 0.20/0.38  # Found 29 unit axioms.
% 0.20/0.38  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.20/0.38  # 80 start rule tableaux created.
% 0.20/0.38  # 51 extension rule candidate clauses
% 0.20/0.38  # 29 unit axiom clauses
% 0.20/0.38  
% 0.20/0.38  # Requested 8, 32 cores available to the main process.
% 0.20/0.40  # There were 1 total branch saturation attempts.
% 0.20/0.40  # There were 0 of these attempts blocked.
% 0.20/0.40  # There were 0 deferred branch saturation attempts.
% 0.20/0.40  # There were 0 free duplicated saturations.
% 0.20/0.40  # There were 1 total successful branch saturations.
% 0.20/0.40  # There were 0 successful branch saturations in interreduction.
% 0.20/0.40  # There were 0 successful branch saturations on the branch.
% 0.20/0.40  # There were 1 successful branch saturations after the branch.
% 0.20/0.40  # There were 1 total branch saturation attempts.
% 0.20/0.40  # There were 0 of these attempts blocked.
% 0.20/0.40  # There were 0 deferred branch saturation attempts.
% 0.20/0.40  # There were 0 free duplicated saturations.
% 0.20/0.40  # There were 1 total successful branch saturations.
% 0.20/0.40  # There were 0 successful branch saturations in interreduction.
% 0.20/0.40  # There were 0 successful branch saturations on the branch.
% 0.20/0.40  # There were 1 successful branch saturations after the branch.
% 0.20/0.40  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.40  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.40  # Begin clausification derivation
% 0.20/0.40  
% 0.20/0.40  # End clausification derivation
% 0.20/0.40  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.40  cnf(i_0_81, negated_conjecture, (p9(X1,X1))).
% 0.20/0.40  cnf(i_0_157, negated_conjecture, (p47(f5(c48,f16(f18(c54,f8(f11(f13(c49,c50),c51),c52)),c55)),c53))).
% 0.20/0.40  cnf(i_0_82, negated_conjecture, (p10(X1,X1))).
% 0.20/0.40  cnf(i_0_83, negated_conjecture, (p12(X1,X1))).
% 0.20/0.40  cnf(i_0_84, negated_conjecture, (p14(X1,X1))).
% 0.20/0.40  cnf(i_0_85, negated_conjecture, (p15(X1,X1))).
% 0.20/0.40  cnf(i_0_86, negated_conjecture, (p17(X1,X1))).
% 0.20/0.40  cnf(i_0_87, negated_conjecture, (p19(X1,X1))).
% 0.20/0.40  cnf(i_0_88, negated_conjecture, (p2(X1,X1))).
% 0.20/0.40  cnf(i_0_89, negated_conjecture, (p21(X1,X1))).
% 0.20/0.40  cnf(i_0_90, negated_conjecture, (p23(X1,X1))).
% 0.20/0.40  cnf(i_0_91, negated_conjecture, (p25(X1,X1))).
% 0.20/0.40  cnf(i_0_92, negated_conjecture, (p27(X1,X1))).
% 0.20/0.40  cnf(i_0_93, negated_conjecture, (p29(X1,X1))).
% 0.20/0.40  cnf(i_0_94, negated_conjecture, (p3(X1,X1))).
% 0.20/0.40  cnf(i_0_95, negated_conjecture, (p31(X1,X1))).
% 0.20/0.40  cnf(i_0_96, negated_conjecture, (p33(X1,X1))).
% 0.20/0.40  cnf(i_0_97, negated_conjecture, (p35(X1,X1))).
% 0.20/0.40  cnf(i_0_98, negated_conjecture, (p37(X1,X1))).
% 0.20/0.40  cnf(i_0_99, negated_conjecture, (p39(X1,X1))).
% 0.20/0.40  cnf(i_0_100, negated_conjecture, (p4(X1,X1))).
% 0.20/0.40  cnf(i_0_101, negated_conjecture, (p41(X1,X1))).
% 0.20/0.40  cnf(i_0_102, negated_conjecture, (p43(X1,X1))).
% 0.20/0.40  cnf(i_0_103, negated_conjecture, (p45(X1,X1))).
% 0.20/0.40  cnf(i_0_104, negated_conjecture, (p6(X1,X1))).
% 0.20/0.40  cnf(i_0_105, negated_conjecture, (p7(X1,X1))).
% 0.20/0.40  cnf(i_0_160, negated_conjecture, (p3(f16(f18(c54,f8(f11(f13(c49,X1),X2),X3)),X4),f8(f11(f13(c49,f20(f22(f24(f26(c56,X1),X2),X3),X4)),f30(f32(f34(f36(c57,X1),X2),X3),X4)),f40(f42(f44(f46(c58,X1),X2),X3),X4))))).
% 0.20/0.40  cnf(i_0_131, negated_conjecture, (~p47(f5(c48,f8(f11(f13(c49,c50),c51),c52)),c53))).
% 0.20/0.40  cnf(i_0_132, negated_conjecture, (~p47(f20(f22(f24(f26(c56,X1),X2),X3),X4),X4))).
% 0.20/0.40  cnf(i_0_107, negated_conjecture, (p9(X1,X2)|~p9(X3,X2)|~p9(X3,X1))).
% 0.20/0.40  cnf(i_0_106, negated_conjecture, (p10(X1,X2)|~p10(X3,X2)|~p10(X3,X1))).
% 0.20/0.40  cnf(i_0_130, negated_conjecture, (p12(X1,X2)|~p12(X3,X2)|~p12(X3,X1))).
% 0.20/0.40  cnf(i_0_129, negated_conjecture, (p14(X1,X2)|~p14(X3,X2)|~p14(X3,X1))).
% 0.20/0.40  cnf(i_0_128, negated_conjecture, (p15(X1,X2)|~p15(X3,X2)|~p15(X3,X1))).
% 0.20/0.40  cnf(i_0_127, negated_conjecture, (p17(X1,X2)|~p17(X3,X2)|~p17(X3,X1))).
% 0.20/0.40  cnf(i_0_154, negated_conjecture, (p47(X1,X2)|~p47(f5(c48,f8(f11(f13(c49,X1),X3),X4)),X2))).
% 0.20/0.40  cnf(i_0_126, negated_conjecture, (p19(X1,X2)|~p19(X3,X2)|~p19(X3,X1))).
% 0.20/0.40  cnf(i_0_125, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.20/0.40  cnf(i_0_124, negated_conjecture, (p21(X1,X2)|~p21(X3,X2)|~p21(X3,X1))).
% 0.20/0.40  cnf(i_0_123, negated_conjecture, (p23(X1,X2)|~p23(X3,X2)|~p23(X3,X1))).
% 0.20/0.40  cnf(i_0_122, negated_conjecture, (p25(X1,X2)|~p25(X3,X2)|~p25(X3,X1))).
% 0.20/0.40  cnf(i_0_121, negated_conjecture, (p27(X1,X2)|~p27(X3,X2)|~p27(X3,X1))).
% 0.20/0.40  cnf(i_0_120, negated_conjecture, (p29(X1,X2)|~p29(X3,X2)|~p29(X3,X1))).
% 0.20/0.40  cnf(i_0_119, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))).
% 0.20/0.40  cnf(i_0_118, negated_conjecture, (p31(X1,X2)|~p31(X3,X2)|~p31(X3,X1))).
% 0.20/0.40  cnf(i_0_117, negated_conjecture, (p33(X1,X2)|~p33(X3,X2)|~p33(X3,X1))).
% 0.20/0.40  cnf(i_0_116, negated_conjecture, (p35(X1,X2)|~p35(X3,X2)|~p35(X3,X1))).
% 0.20/0.40  cnf(i_0_115, negated_conjecture, (p37(X1,X2)|~p37(X3,X2)|~p37(X3,X1))).
% 0.20/0.40  cnf(i_0_114, negated_conjecture, (p39(X1,X2)|~p39(X3,X2)|~p39(X3,X1))).
% 0.20/0.40  cnf(i_0_113, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))).
% 0.20/0.40  cnf(i_0_112, negated_conjecture, (p41(X1,X2)|~p41(X3,X2)|~p41(X3,X1))).
% 0.20/0.40  cnf(i_0_111, negated_conjecture, (p43(X1,X2)|~p43(X3,X2)|~p43(X3,X1))).
% 0.20/0.40  cnf(i_0_110, negated_conjecture, (p45(X1,X2)|~p45(X3,X2)|~p45(X3,X1))).
% 0.20/0.40  cnf(i_0_109, negated_conjecture, (p6(X1,X2)|~p6(X3,X2)|~p6(X3,X1))).
% 0.20/0.40  cnf(i_0_108, negated_conjecture, (p7(X1,X2)|~p7(X3,X2)|~p7(X3,X1))).
% 0.20/0.40  cnf(i_0_133, negated_conjecture, (p47(X1,X2)|~p47(X3,X4)|~p4(X3,X1)|~p15(X4,X2))).
% 0.20/0.40  cnf(i_0_135, negated_conjecture, (p9(f13(X1,X2),f13(X3,X4))|~p4(X2,X4)|~p12(X1,X3))).
% 0.20/0.40  cnf(i_0_155, negated_conjecture, (p47(X1,X2)|~p47(f20(f22(f24(f26(c56,X1),X3),X4),X5),X2))).
% 0.20/0.40  cnf(i_0_156, negated_conjecture, (p47(f5(c48,f8(f11(f13(c49,X1),X2),X3)),X4)|~p47(X1,X4))).
% 0.20/0.40  cnf(i_0_134, negated_conjecture, (p10(f30(X1,X2),f30(X3,X4))|~p29(X1,X3)|~p15(X2,X4))).
% 0.20/0.40  cnf(i_0_153, negated_conjecture, (p14(f18(X1,X2),f18(X3,X4))|~p3(X2,X4)|~p17(X1,X3))).
% 0.20/0.40  cnf(i_0_152, negated_conjecture, (p19(f22(X1,X2),f22(X3,X4))|~p7(X2,X4)|~p21(X1,X3))).
% 0.20/0.40  cnf(i_0_151, negated_conjecture, (p21(f24(X1,X2),f24(X3,X4))|~p23(X1,X3)|~p10(X2,X4))).
% 0.20/0.40  cnf(i_0_150, negated_conjecture, (p23(f26(X1,X2),f26(X3,X4))|~p4(X2,X4)|~p25(X1,X3))).
% 0.20/0.40  cnf(i_0_149, negated_conjecture, (p27(f28(X1,X2),f28(X3,X4))|~p15(X2,X4)|~p10(X1,X3))).
% 0.20/0.40  cnf(i_0_148, negated_conjecture, (p29(f32(X1,X2),f32(X3,X4))|~p7(X2,X4)|~p31(X1,X3))).
% 0.20/0.40  cnf(i_0_146, negated_conjecture, (p3(f8(X1,X2),f8(X3,X4))|~p7(X2,X4)|~p6(X1,X3))).
% 0.20/0.40  cnf(i_0_147, negated_conjecture, (p3(f16(X1,X2),f16(X3,X4))|~p15(X2,X4)|~p14(X1,X3))).
% 0.20/0.40  cnf(i_0_145, negated_conjecture, (p31(f34(X1,X2),f34(X3,X4))|~p33(X1,X3)|~p10(X2,X4))).
% 0.20/0.40  cnf(i_0_144, negated_conjecture, (p33(f36(X1,X2),f36(X3,X4))|~p4(X2,X4)|~p35(X1,X3))).
% 0.20/0.40  cnf(i_0_143, negated_conjecture, (p37(f38(X1,X2),f38(X3,X4))|~p7(X1,X3)|~p15(X2,X4))).
% 0.20/0.40  cnf(i_0_142, negated_conjecture, (p39(f42(X1,X2),f42(X3,X4))|~p7(X2,X4)|~p41(X1,X3))).
% 0.20/0.40  cnf(i_0_140, negated_conjecture, (p4(f5(X1,X2),f5(X3,X4))|~p3(X2,X4)|~p2(X1,X3))).
% 0.20/0.40  cnf(i_0_141, negated_conjecture, (p4(f20(X1,X2),f20(X3,X4))|~p19(X1,X3)|~p15(X2,X4))).
% 0.20/0.40  cnf(i_0_139, negated_conjecture, (p41(f44(X1,X2),f44(X3,X4))|~p43(X1,X3)|~p10(X2,X4))).
% 0.20/0.40  cnf(i_0_138, negated_conjecture, (p43(f46(X1,X2),f46(X3,X4))|~p45(X1,X3)|~p4(X2,X4))).
% 0.20/0.40  cnf(i_0_137, negated_conjecture, (p6(f11(X1,X2),f11(X3,X4))|~p10(X2,X4)|~p9(X1,X3))).
% 0.20/0.40  cnf(i_0_136, negated_conjecture, (p7(f40(X1,X2),f40(X3,X4))|~p39(X1,X3)|~p15(X2,X4))).
% 0.20/0.40  cnf(i_0_158, negated_conjecture, (p27(f28(f30(f32(f34(f36(c57,X1),X2),X3),X4),X5),f28(X2,X5))|~p47(f20(f22(f24(f26(c56,X1),X2),X3),X4),X5))).
% 0.20/0.40  cnf(i_0_159, negated_conjecture, (p37(f38(f40(f42(f44(f46(c58,X1),X2),X3),X4),X5),f38(X3,X5))|~p47(f20(f22(f24(f26(c56,X1),X2),X3),X4),X5))).
% 0.20/0.40  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.20/0.40  # Begin printing tableau
% 0.20/0.40  # Found 8 steps
% 0.20/0.40  cnf(i_0_136, negated_conjecture, (p7(f40(X12,X13),f40(X12,X13))|~p39(X12,X12)|~p15(X13,X13)), inference(start_rule)).
% 0.20/0.40  cnf(i_0_166, plain, (~p39(X12,X12)), inference(closure_rule, [i_0_99])).
% 0.20/0.40  cnf(i_0_167, plain, (~p15(X13,X13)), inference(closure_rule, [i_0_85])).
% 0.20/0.40  cnf(i_0_165, plain, (p7(f40(X12,X13),f40(X12,X13))), inference(extension_rule, [i_0_142])).
% 0.20/0.40  cnf(i_0_363, plain, (~p41(X14,X14)), inference(closure_rule, [i_0_101])).
% 0.20/0.40  cnf(i_0_361, plain, (p39(f42(X14,f40(X12,X13)),f42(X14,f40(X12,X13)))), inference(extension_rule, [i_0_136])).
% 0.20/0.40  cnf(i_0_370, plain, (~p15(X7,X7)), inference(closure_rule, [i_0_85])).
% 0.20/0.40  cnf(i_0_368, plain, (p7(f40(f42(X14,f40(X12,X13)),X7),f40(f42(X14,f40(X12,X13)),X7))), inference(etableau_closure_rule, [i_0_368, ...])).
% 0.20/0.40  # End printing tableau
% 0.20/0.40  # SZS output end
% 0.20/0.40  # Branches closed with saturation will be marked with an "s"
% 0.20/0.40  # There were 1 total branch saturation attempts.
% 0.20/0.40  # There were 0 of these attempts blocked.
% 0.20/0.40  # There were 0 deferred branch saturation attempts.
% 0.20/0.40  # There were 0 free duplicated saturations.
% 0.20/0.40  # There were 1 total successful branch saturations.
% 0.20/0.40  # There were 0 successful branch saturations in interreduction.
% 0.20/0.40  # There were 0 successful branch saturations on the branch.
% 0.20/0.40  # There were 1 successful branch saturations after the branch.
% 0.20/0.40  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.40  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.40  # Begin clausification derivation
% 0.20/0.40  
% 0.20/0.40  # End clausification derivation
% 0.20/0.40  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.40  cnf(i_0_81, negated_conjecture, (p9(X1,X1))).
% 0.20/0.40  cnf(i_0_157, negated_conjecture, (p47(f5(c48,f16(f18(c54,f8(f11(f13(c49,c50),c51),c52)),c55)),c53))).
% 0.20/0.40  cnf(i_0_82, negated_conjecture, (p10(X1,X1))).
% 0.20/0.40  cnf(i_0_83, negated_conjecture, (p12(X1,X1))).
% 0.20/0.40  cnf(i_0_84, negated_conjecture, (p14(X1,X1))).
% 0.20/0.40  cnf(i_0_85, negated_conjecture, (p15(X1,X1))).
% 0.20/0.40  cnf(i_0_86, negated_conjecture, (p17(X1,X1))).
% 0.20/0.40  cnf(i_0_87, negated_conjecture, (p19(X1,X1))).
% 0.20/0.40  cnf(i_0_88, negated_conjecture, (p2(X1,X1))).
% 0.20/0.40  cnf(i_0_89, negated_conjecture, (p21(X1,X1))).
% 0.20/0.40  cnf(i_0_90, negated_conjecture, (p23(X1,X1))).
% 0.20/0.40  cnf(i_0_91, negated_conjecture, (p25(X1,X1))).
% 0.20/0.40  cnf(i_0_92, negated_conjecture, (p27(X1,X1))).
% 0.20/0.40  cnf(i_0_93, negated_conjecture, (p29(X1,X1))).
% 0.20/0.40  cnf(i_0_94, negated_conjecture, (p3(X1,X1))).
% 0.20/0.40  cnf(i_0_95, negated_conjecture, (p31(X1,X1))).
% 0.20/0.40  cnf(i_0_96, negated_conjecture, (p33(X1,X1))).
% 0.20/0.40  cnf(i_0_97, negated_conjecture, (p35(X1,X1))).
% 0.20/0.40  cnf(i_0_98, negated_conjecture, (p37(X1,X1))).
% 0.20/0.40  cnf(i_0_99, negated_conjecture, (p39(X1,X1))).
% 0.20/0.40  cnf(i_0_100, negated_conjecture, (p4(X1,X1))).
% 0.20/0.40  cnf(i_0_101, negated_conjecture, (p41(X1,X1))).
% 0.20/0.40  cnf(i_0_102, negated_conjecture, (p43(X1,X1))).
% 0.20/0.40  cnf(i_0_103, negated_conjecture, (p45(X1,X1))).
% 0.20/0.40  cnf(i_0_104, negated_conjecture, (p6(X1,X1))).
% 0.20/0.40  cnf(i_0_105, negated_conjecture, (p7(X1,X1))).
% 0.20/0.40  cnf(i_0_160, negated_conjecture, (p3(f16(f18(c54,f8(f11(f13(c49,X1),X2),X3)),X4),f8(f11(f13(c49,f20(f22(f24(f26(c56,X1),X2),X3),X4)),f30(f32(f34(f36(c57,X1),X2),X3),X4)),f40(f42(f44(f46(c58,X1),X2),X3),X4))))).
% 0.20/0.40  cnf(i_0_131, negated_conjecture, (~p47(f5(c48,f8(f11(f13(c49,c50),c51),c52)),c53))).
% 0.20/0.40  cnf(i_0_132, negated_conjecture, (~p47(f20(f22(f24(f26(c56,X1),X2),X3),X4),X4))).
% 0.20/0.40  cnf(i_0_107, negated_conjecture, (p9(X1,X2)|~p9(X3,X2)|~p9(X3,X1))).
% 0.20/0.40  cnf(i_0_106, negated_conjecture, (p10(X1,X2)|~p10(X3,X2)|~p10(X3,X1))).
% 0.20/0.40  cnf(i_0_130, negated_conjecture, (p12(X1,X2)|~p12(X3,X2)|~p12(X3,X1))).
% 0.20/0.40  cnf(i_0_129, negated_conjecture, (p14(X1,X2)|~p14(X3,X2)|~p14(X3,X1))).
% 0.20/0.40  cnf(i_0_128, negated_conjecture, (p15(X1,X2)|~p15(X3,X2)|~p15(X3,X1))).
% 0.20/0.40  cnf(i_0_127, negated_conjecture, (p17(X1,X2)|~p17(X3,X2)|~p17(X3,X1))).
% 0.20/0.40  cnf(i_0_154, negated_conjecture, (p47(X1,X2)|~p47(f5(c48,f8(f11(f13(c49,X1),X3),X4)),X2))).
% 0.20/0.40  cnf(i_0_126, negated_conjecture, (p19(X1,X2)|~p19(X3,X2)|~p19(X3,X1))).
% 0.20/0.40  cnf(i_0_125, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.20/0.40  cnf(i_0_124, negated_conjecture, (p21(X1,X2)|~p21(X3,X2)|~p21(X3,X1))).
% 0.20/0.40  cnf(i_0_123, negated_conjecture, (p23(X1,X2)|~p23(X3,X2)|~p23(X3,X1))).
% 0.20/0.40  cnf(i_0_122, negated_conjecture, (p25(X1,X2)|~p25(X3,X2)|~p25(X3,X1))).
% 0.20/0.40  cnf(i_0_121, negated_conjecture, (p27(X1,X2)|~p27(X3,X2)|~p27(X3,X1))).
% 0.20/0.40  cnf(i_0_120, negated_conjecture, (p29(X1,X2)|~p29(X3,X2)|~p29(X3,X1))).
% 0.20/0.40  cnf(i_0_119, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))).
% 0.20/0.40  cnf(i_0_118, negated_conjecture, (p31(X1,X2)|~p31(X3,X2)|~p31(X3,X1))).
% 0.20/0.40  cnf(i_0_117, negated_conjecture, (p33(X1,X2)|~p33(X3,X2)|~p33(X3,X1))).
% 0.20/0.40  cnf(i_0_116, negated_conjecture, (p35(X1,X2)|~p35(X3,X2)|~p35(X3,X1))).
% 0.20/0.40  cnf(i_0_115, negated_conjecture, (p37(X1,X2)|~p37(X3,X2)|~p37(X3,X1))).
% 0.20/0.40  cnf(i_0_114, negated_conjecture, (p39(X1,X2)|~p39(X3,X2)|~p39(X3,X1))).
% 0.20/0.40  cnf(i_0_113, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))).
% 0.20/0.40  cnf(i_0_112, negated_conjecture, (p41(X1,X2)|~p41(X3,X2)|~p41(X3,X1))).
% 0.20/0.40  cnf(i_0_111, negated_conjecture, (p43(X1,X2)|~p43(X3,X2)|~p43(X3,X1))).
% 0.20/0.40  cnf(i_0_110, negated_conjecture, (p45(X1,X2)|~p45(X3,X2)|~p45(X3,X1))).
% 0.20/0.40  cnf(i_0_109, negated_conjecture, (p6(X1,X2)|~p6(X3,X2)|~p6(X3,X1))).
% 0.20/0.40  cnf(i_0_108, negated_conjecture, (p7(X1,X2)|~p7(X3,X2)|~p7(X3,X1))).
% 0.20/0.40  cnf(i_0_133, negated_conjecture, (p47(X1,X2)|~p47(X3,X4)|~p4(X3,X1)|~p15(X4,X2))).
% 0.20/0.40  cnf(i_0_135, negated_conjecture, (p9(f13(X1,X2),f13(X3,X4))|~p4(X2,X4)|~p12(X1,X3))).
% 0.20/0.40  cnf(i_0_155, negated_conjecture, (p47(X1,X2)|~p47(f20(f22(f24(f26(c56,X1),X3),X4),X5),X2))).
% 0.20/0.40  cnf(i_0_156, ne# There were 1 total branch saturation attempts.
% 0.20/0.40  # There were 0 of these attempts blocked.
% 0.20/0.40  # There were 0 deferred branch saturation attempts.
% 0.20/0.40  # There were 0 free duplicated saturations.
% 0.20/0.40  # There were 1 total successful branch saturations.
% 0.20/0.40  # There were 0 successful branch saturations in interreduction.
% 0.20/0.40  # There were 0 successful branch saturations on the branch.
% 0.20/0.40  # There were 1 successful branch saturations after the branch.
% 0.20/0.40  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.40  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.40  # Begin clausification derivation
% 0.20/0.40  
% 0.20/0.40  # End clausification derivation
% 0.20/0.40  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.40  cnf(i_0_81, negated_conjecture, (p9(X1,X1))).
% 0.20/0.40  cnf(i_0_157, negated_conjecture, (p47(f5(c48,f16(f18(c54,f8(f11(f13(c49,c50),c51),c52)),c55)),c53))).
% 0.20/0.40  cnf(i_0_82, negated_conjecture, (p10(X1,X1))).
% 0.20/0.40  cnf(i_0_83, negated_conjecture, (p12(X1,X1))).
% 0.20/0.40  cnf(i_0_84, negated_conjecture, (p14(X1,X1))).
% 0.20/0.40  cnf(i_0_85, negated_conjecture, (p15(X1,X1))).
% 0.20/0.40  cnf(i_0_86, negated_conjecture, (p17(X1,X1))).
% 0.20/0.40  cnf(i_0_87, negated_conjecture, (p19(X1,X1))).
% 0.20/0.40  cnf(i_0_88, negated_conjecture, (p2(X1,X1))).
% 0.20/0.40  cnf(i_0_89, negated_conjecture, (p21(X1,X1))).
% 0.20/0.40  cnf(i_0_90, negated_conjecture, (p23(X1,X1))).
% 0.20/0.40  cnf(i_0_91, negated_conjecture, (p25(X1,X1))).
% 0.20/0.40  cnf(i_0_92, negated_conjecture, (p27(X1,X1))).
% 0.20/0.40  cnf(i_0_93, negated_conjecture, (p29(X1,X1))).
% 0.20/0.40  cnf(i_0_94, negated_conjecture, (p3(X1,X1))).
% 0.20/0.40  cnf(i_0_95, negated_conjecture, (p31(X1,X1))).
% 0.20/0.40  cnf(i_0_96, negated_conjecture, (p33(X1,X1))).
% 0.20/0.40  cnf(i_0_97, negated_conjecture, (p35(X1,X1))).
% 0.20/0.40  cnf(i_0_98, negated_conjecture, (p37(X1,X1))).
% 0.20/0.40  cnf(i_0_99, negated_conjecture, (p39(X1,X1))).
% 0.20/0.40  cnf(i_0_100, negated_conjecture, (p4(X1,X1))).
% 0.20/0.40  cnf(i_0_101, negated_conjecture, (p41(X1,X1))).
% 0.20/0.40  cnf(i_0_102, negated_conjecture, (p43(X1,X1))).
% 0.20/0.40  cnf(i_0_103, negated_conjecture, (p45(X1,X1))).
% 0.20/0.40  cnf(i_0_104, negated_conjecture, (p6(X1,X1))).
% 0.20/0.40  cnf(i_0_105, negated_conjecture, (p7(X1,X1))).
% 0.20/0.40  cnf(i_0_160, negated_conjecture, (p3(f16(f18(c54,f8(f11(f13(c49,X1),X2),X3)),X4),f8(f11(f13(c49,f20(f22(f24(f26(c56,X1),X2),X3),X4)),f30(f32(f34(f36(c57,X1),X2),X3),X4)),f40(f42(f44(f46(c58,X1),X2),X3),X4))))).
% 0.20/0.40  cnf(i_0_131, negated_conjecture, (~p47(f5(c48,f8(f11(f13(c49,c50),c51),c52)),c53))).
% 0.20/0.40  cnf(i_0_132, negated_conjecture, (~p47(f20(f22(f24(f26(c56,X1),X2),X3),X4),X4))).
% 0.20/0.40  cnf(i_0_107, negated_conjecture, (p9(X1,X2)|~p9(X3,X2)|~p9(X3,X1))).
% 0.20/0.40  cnf(i_0_106, negated_conjecture, (p10(X1,X2)|~p10(X3,X2)|~p10(X3,X1))).
% 0.20/0.40  cnf(i_0_130, negated_conjecture, (p12(X1,X2)|~p12(X3,X2)|~p12(X3,X1))).
% 0.20/0.40  cnf(i_0_129, negated_conjecture, (p14(X1,X2)|~p14(X3,X2)|~p14(X3,X1))).
% 0.20/0.40  cnf(i_0_128, negated_conjecture, (p15(X1,X2)|~p15(X3,X2)|~p15(X3,X1))).
% 0.20/0.40  cnf(i_0_127, negated_conjecture, (p17(X1,X2)|~p17(X3,X2)|~p17(X3,X1))).
% 0.20/0.40  cnf(i_0_154, negated_conjecture, (p47(X1,X2)|~p47(f5(c48,f8(f11(f13(c49,X1),X3),X4)),X2))).
% 0.20/0.40  cnf(i_0_126, negated_conjecture, (p19(X1,X2)|~p19(X3,X2)|~p19(X3,X1))).
% 0.20/0.40  cnf(i_0_125, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.20/0.40  cnf(i_0_124, negated_conjecture, (p21(X1,X2)|~p21(X3,X2)|~p21(X3,X1))).
% 0.20/0.40  cnf(i_0_123, negated_conjecture, (p23(X1,X2)|~p23(X3,X2)|~p23(X3,X1))).
% 0.20/0.40  cnf(i_0_122, negated_conjecture, (p25(X1,X2)|~p25(X3,X2)|~p25(X3,X1))).
% 0.20/0.40  cnf(i_0_121, negated_conjecture, (p27(X1,X2)|~p27(X3,X2)|~p27(X3,X1))).
% 0.20/0.40  cnf(i_0_120, negated_conjecture, (p29(X1,X2)|~p29(X3,X2)|~p29(X3,X1))).
% 0.20/0.40  cnf(i_0_119, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))).
% 0.20/0.40  cnf(i_0_118, negated_conjecture, (p31(X1,X2)|~p31(X3,X2)|~p31(X3,X1))).
% 0.20/0.40  cnf(i_0_117, negated_conjecture, (p33(X1,X2)|~p33(X3,X2)|~p33(X3,X1))).
% 0.20/0.40  cnf(i_0_116, negated_conjecture, (p35(X1,X2)|~p35(X3,X2)|~p35(X3,X1))).
% 0.20/0.40  cnf(i_0_115, negated_conjecture, (p37(X1,X2)|~p37(X3,X2)|~p37(X3,X1))).
% 0.20/0.40  cnf(i_0_114, negated_conjecture, (p39(X1,X2)|~p39(X3,X2)|~p39(X3,X1))).
% 0.20/0.40  cnf(i_0_113, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))).
% 0.20/0.40  cnf(i_0_112, negated_conjecture, (p41(X1,X2)|~p41(X3,X2)|~p41(X3,X1))).
% 0.20/0.40  cnf(i_0_111, negated_conjecture, (p43(X1,X2)|~p43(X3,X2)|~p43(X3,X1))).
% 0.20/0.40  cnf(i_0_110, negated_conjecture, (p45(X1,X2)|~p45(X3,X2)|~p45(X3,X1))).
% 0.20/0.40  cnf(i_0_109, negated_conjecture, (p6(X1,X2)|~p6(X3,X2)|~p6(X3,X1))).
% 0.20/0.40  cnf(i_0_108, negated_conjecture, (p7(X1,X2)|~p7(X3,X2)|~p7(X3,X1))).
% 0.20/0.40  cnf(i_0_133, negated_conjecture, (p47(X1,X2)|~p47(X3,X4)|~p4(X3,X1)|~p15(X4,X2))).
% 0.20/0.40  cnf(i_0_135, negated_conjecture, (p9(f13(X1,X2),f13(X3,X4))|~p4(X2,X4)|~p12(X1,X3))).
% 0.20/0.40  cnf(i_0_155, negated_conjecture, (p47(X1,X2)|~p47(f20(f22(f24(f26(c56,X1),X3),X4),X5),X2))).
% 0.20/0.40  cnf(i_0_156, ne# SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.40  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.40  # Begin clausification derivation
% 0.20/0.40  
% 0.20/0.40  # End clausification derivation
% 0.20/0.40  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.40  cnf(i_0_81, negated_conjecture, (p9(X1,X1))).
% 0.20/0.40  cnf(i_0_157, negated_conjecture, (p47(f5(c48,f16(f18(c54,f8(f11(f13(c49,c50),c51),c52)),c55)),c53))).
% 0.20/0.40  cnf(i_0_82, negated_conjecture, (p10(X1,X1))).
% 0.20/0.40  cnf(i_0_83, negated_conjecture, (p12(X1,X1))).
% 0.20/0.40  cnf(i_0_84, negated_conjecture, (p14(X1,X1))).
% 0.20/0.40  cnf(i_0_85, negated_conjecture, (p15(X1,X1))).
% 0.20/0.40  cnf(i_0_86, negated_conjecture, (p17(X1,X1))).
% 0.20/0.40  cnf(i_0_87, negated_conjecture, (p19(X1,X1))).
% 0.20/0.40  cnf(i_0_88, negated_conjecture, (p2(X1,X1))).
% 0.20/0.40  cnf(i_0_89, negated_conjecture, (p21(X1,X1))).
% 0.20/0.40  cnf(i_0_90, negated_conjecture, (p23(X1,X1))).
% 0.20/0.40  cnf(i_0_91, negated_conjecture, (p25(X1,X1))).
% 0.20/0.40  cnf(i_0_92, negated_conjecture, (p27(X1,X1))).
% 0.20/0.40  cnf(i_0_93, negated_conjecture, (p29(X1,X1))).
% 0.20/0.40  cnf(i_0_94, negated_conjecture, (p3(X1,X1))).
% 0.20/0.40  cnf(i_0_95, negated_conjecture, (p31(X1,X1))).
% 0.20/0.40  cnf(i_0_96, negated_conjecture, (p33(X1,X1))).
% 0.20/0.40  cnf(i_0_97, negated_conjecture, (p35(X1,X1))).
% 0.20/0.40  cnf(i_0_98, negated_conjecture, (p37(X1,X1))).
% 0.20/0.40  cnf(i_0_99, negated_conjecture, (p39(X1,X1))).
% 0.20/0.40  cnf(i_0_100, negated_conjecture, (p4(X1,X1))).
% 0.20/0.40  cnf(i_0_101, negated_conjecture, (p41(X1,X1))).
% 0.20/0.40  cnf(i_0_102, negated_conjecture, (p43(X1,X1))).
% 0.20/0.40  cnf(i_0_103, negated_conjecture, (p45(X1,X1))).
% 0.20/0.40  cnf(i_0_104, negated_conjecture, (p6(X1,X1))).
% 0.20/0.40  cnf(i_0_105, negated_conjecture, (p7(X1,X1))).
% 0.20/0.40  cnf(i_0_160, negated_conjecture, (p3(f16(f18(c54,f8(f11(f13(c49,X1),X2),X3)),X4),f8(f11(f13(c49,f20(f22(f24(f26(c56,X1),X2),X3),X4)),f30(f32(f34(f36(c57,X1),X2),X3),X4)),f40(f42(f44(f46(c58,X1),X2),X3),X4))))).
% 0.20/0.40  cnf(i_0_131, negated_conjecture, (~p47(f5(c48,f8(f11(f13(c49,c50),c51),c52)),c53))).
% 0.20/0.40  cnf(i_0_132, negated_conjecture, (~p47(f20(f22(f24(f26(c56,X1),X2),X3),X4),X4))).
% 0.20/0.40  cnf(i_0_107, negated_conjecture, (p9(X1,X2)|~p9(X3,X2)|~p9(X3,X1))).
% 0.20/0.40  cnf(i_0_106, negated_conjecture, (p10(X1,X2)|~p10(X3,X2)|~p10(X3,X1))).
% 0.20/0.40  cnf(i_0_130, negated_conjecture, (p12(X1,X2)|~p12(X3,X2)|~p12(X3,X1))).
% 0.20/0.40  cnf(i_0_129, negated_conjecture, (p14(X1,X2)|~p14(X3,X2)|~p14(X3,X1))).
% 0.20/0.40  cnf(i_0_128, negated_conjecture, (p15(X1,X2)|~p15(X3,X2)|~p15(X3,X1))).
% 0.20/0.40  cnf(i_0_127, negated_conjecture, (p17(X1,X2)|~p17(X3,X2)|~p17(X3,X1))).
% 0.20/0.40  cnf(i_0_154, negated_conjecture, (p47(X1,X2)|~p47(f5(c48,f8(f11(f13(c49,X1),X3),X4)),X2))).
% 0.20/0.40  cnf(i_0_126, negated_conjecture, (p19(X1,X2)|~p19(X3,X2)|~p19(X3,X1))).
% 0.20/0.40  cnf(i_0_125, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.20/0.40  cnf(i_0_124, negated_conjecture, (p21(X1,X2)|~p21(X3,X2)|~p21(X3,X1))).
% 0.20/0.40  cnf(i_0_123, negated_conjecture, (p23(X1,X2)|~p23(X3,X2)|~p23(X3,X1))).
% 0.20/0.40  cnf(i_0_122, negated_conjecture, (p25(X1,X2)|~p25(X3,X2)|~p25(X3,X1))).
% 0.20/0.40  cnf(i_0_121, negated_conjecture, (p27(X1,X2)|~p27(X3,X2)|~p27(X3,X1))).
% 0.20/0.40  cnf(i_0_120, negated_conjecture, (p29(X1,X2)|~p29(X3,X2)|~p29(X3,X1))).
% 0.20/0.40  cnf(i_0_119, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))).
% 0.20/0.40  cnf(i_0_118, negated_conjecture, (p31(X1,X2)|~p31(X3,X2)|~p31(X3,X1))).
% 0.20/0.40  cnf(i_0_117, negated_conjecture, (p33(X1,X2)|~p33(X3,X2)|~p33(X3,X1))).
% 0.20/0.40  cnf(i_0_116, negated_conjecture, (p35(X1,X2)|~p35(X3,X2)|~p35(X3,X1))).
% 0.20/0.40  cnf(i_0_115, negated_conjecture, (p37(X1,X2)|~p37(X3,X2)|~p37(X3,X1))).
% 0.20/0.40  cnf(i_0_114, negated_conjecture, (p39(X1,X2)|~p39(X3,X2)|~p39(X3,X1))).
% 0.20/0.40  cnf(i_0_113, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))).
% 0.20/0.40  cnf(i_0_112, negated_conjecture, (p41(X1,X2)|~p41(X3,X2)|~p41(X3,X1))).
% 0.20/0.40  cnf(i_0_111, negated_conjecture, (p43(X1,X2)|~p43(X3,X2)|~p43(X3,X1))).
% 0.20/0.40  cnf(i_0_110, negated_conjecture, (p45(X1,X2)|~p45(X3,X2)|~p45(X3,X1))).
% 0.20/0.40  cnf(i_0_109, negated_conjecture, (p6(X1,X2)|~p6(X3,X2)|~p6(X3,X1))).
% 0.20/0.40  cnf(i_0_108, negated_conjecture, (p7(X1,X2)|~p7(X3,X2)|~p7(X3,X1))).
% 0.20/0.40  cnf(i_0_133, negated_conjecture, (p47(X1,X2)|~p47(X3,X4)|~p4(X3,X1)|~p15(X4,X2))).
% 0.20/0.40  cnf(i_0_135, negated_conjecture, (p9(f13(X1,X2),f13(X3,X4))|~p4(X2,X4)|~p12(X1,X3))).
% 0.20/0.40  cnf(i_0_155, negated_conjecture, (p47(X1,X2)|~p47(f20(f22(f24(f26(c56,X1),X3),X4),X5),X2))).
% 0.20/0.40  cnf(i_0_156, ne# There were 1 total branch saturation attempts.
% 0.20/0.40  # There were 0 of these attempts blocked.
% 0.20/0.40  # There were 0 deferred branch saturation attempts.
% 0.20/0.40  # There were 0 free duplicated saturations.
% 0.20/0.40  # There were 1 total successful branch saturations.
% 0.20/0.40  # There were 0 successful branch saturations in interreduction.
% 0.20/0.40  # There were 0 successful branch saturations on the branch.
% 0.20/0.40  # There were 1 successful branch saturations after the branch.
% 0.20/0.40  gated_conjecture, (p47(f5(c48,f8(f11(f13(c49,X1),X2),X3)),X4)|~p47(X1,X4))).
% 0.20/0.40  cnf(i_0_134, negated_conjecture, (p10(f30(X1,X2),f30(X3,X4))|~p29(X1,X3)|~p15(X2,X4))).
% 0.20/0.40  cnf(i_0_153, negated_conjecture, (p14(f18(X1,X2),f18(X3,X4))|~p3(X2,X4)|~p17(X1,X3))).
% 0.20/0.40  cnf(i_0_152, negated_conjecture, (p19(f22(X1,X2),f22(X3,X4))|~p7(X2,X4)|~p21(X1,X3))).
% 0.20/0.40  cnf(i_0_151, negated_conjecture, (p21(f24(X1,X2),f24(X3,X4))|~p23(X1,X3)|~p10(X2,X4))).
% 0.20/0.40  cnf(i_0_150, negated_conjecture, (p23(f26(X1,X2),f26(X3,X4))|~p4(X2,X4)|~p25(X1,X3))).
% 0.20/0.40  cnf(i_0_149, negated_conjecture, (p27(f28(X1,X2),f28(X3,X4))|~p15(X2,X4)|~p10(X1,X3))).
% 0.20/0.40  cnf(i_0_148, negated_conjecture, (p29(f32(X1,X2),f32(X3,X4))|~p7(X2,X4)|~p31(X1,X3))).
% 0.20/0.40  cnf(i_0_146, negated_conjecture, (p3(f8(X1,X2),f8(X3,X4))|~p7(X2,X4)|~p6(X1,X3))).
% 0.20/0.40  cnf(i_0_147, negated_conjecture, (p3(f16(X1,X2),f16(X3,X4))|~p15(X2,X4)|~p14(X1,X3))).
% 0.20/0.40  cnf(i_0_145, negated_conjecture, (p31(f34(X1,X2),f34(X3,X4))|~p33(X1,X3)|~p10(X2,X4))).
% 0.20/0.40  cnf(i_0_144, negated_conjecture, (p33(f36(X1,X2),f36(X3,X4))|~p4(X2,X4)|~p35(X1,X3))).
% 0.20/0.40  cnf(i_0_143, negated_conjecture, (p37(f38(X1,X2),f38(X3,X4))|~p7(X1,X3)|~p15(X2,X4))).
% 0.20/0.40  cnf(i_0_142, negated_conjecture, (p39(f42(X1,X2),f42(X3,X4))|~p7(X2,X4)|~p41(X1,X3))).
% 0.20/0.40  cnf(i_0_140, negated_conjecture, (p4(f5(X1,X2),f5(X3,X4))|~p3(X2,X4)|~p2(X1,X3))).
% 0.20/0.40  cnf(i_0_141, negated_conjecture, (p4(f20(X1,X2),f20(X3,X4))|~p19(X1,X3)|~p15(X2,X4))).
% 0.20/0.40  cnf(i_0_139, negated_conjecture, (p41(f44(X1,X2),f44(X3,X4))|~p43(X1,X3)|~p10(X2,X4))).
% 0.20/0.40  cnf(i_0_138, negated_conjecture, (p43(f46(X1,X2),f46(X3,X4))|~p45(X1,X3)|~p4(X2,X4))).
% 0.20/0.40  cnf(i_0_137, negated_conjecture, (p6(f11(X1,X2),f11(X3,X4))|~p10(X2,X4)|~p9(X1,X3))).
% 0.20/0.40  cnf(i_0_136, negated_conjecture, (p7(f40(X1,X2),f40(X3,X4))|~p39(X1,X3)|~p15(X2,X4))).
% 0.20/0.40  cnf(i_0_158, negated_conjecture, (p27(f28(f30(f32(f34(f36(c57,X1),X2),X3),X4),X5),f28(X2,X5))|~p47(f20(f22(f24(f26(c56,X1),X2),X3),X4),X5))).
% 0.20/0.40  cnf(i_0_159, negated_conjecture, (p37(f38(f40(f42(f44(f46(c58,X1),X2),X3),X4),X5),f38(X3,X5))|~p47(f20(f22(f24(f26(c56,X1),X2),X3),X4),X5))).
% 0.20/0.40  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.20/0.40  # Begin printing tableau
% 0.20/0.40  # Found 8 steps
% 0.20/0.40  cnf(i_0_137, negated_conjecture, (p6(f11(X14,X13),f11(X14,X13))|~p10(X13,X13)|~p9(X14,X14)), inference(start_rule)).
% 0.20/0.40  cnf(i_0_169, plain, (~p10(X13,X13)), inference(closure_rule, [i_0_82])).
% 0.20/0.40  cnf(i_0_170, plain, (~p9(X14,X14)), inference(closure_rule, [i_0_81])).
% 0.20/0.40  cnf(i_0_168, plain, (p6(f11(X14,X13),f11(X14,X13))), inference(extension_rule, [i_0_146])).
% 0.20/0.40  cnf(i_0_377, plain, (~p7(X10,X10)), inference(closure_rule, [i_0_105])).
% 0.20/0.40  cnf(i_0_376, plain, (p3(f8(f11(X14,X13),X10),f8(f11(X14,X13),X10))), inference(extension_rule, [i_0_140])).
% 0.20/0.40  cnf(i_0_400, plain, (~p2(X5,X5)), inference(closure_rule, [i_0_88])).
% 0.20/0.40  cnf(i_0_398, plain, (p4(f5(X5,f8(f11(X14,X13),X10)),f5(X5,f8(f11(X14,X13),X10)))), inference(etableau_closure_rule, [i_0_398, ...])).
% 0.20/0.40  # End printing tableau
% 0.20/0.40  # SZS output end
% 0.20/0.40  # Branches closed with saturation will be marked with an "s"
% 0.20/0.40  gated_conjecture, (p47(f5(c48,f8(f11(f13(c49,X1),X2),X3)),X4)|~p47(X1,X4))).
% 0.20/0.40  cnf(i_0_134, negated_conjecture, (p10(f30(X1,X2),f30(X3,X4))|~p29(X1,X3)|~p15(X2,X4))).
% 0.20/0.40  cnf(i_0_153, negated_conjecture, (p14(f18(X1,X2),f18(X3,X4))|~p3(X2,X4)|~p17(X1,X3))).
% 0.20/0.40  cnf(i_0_152, negated_conjecture, (p19(f22(X1,X2),f22(X3,X4))|~p7(X2,X4)|~p21(X1,X3))).
% 0.20/0.40  cnf(i_0_151, negated_conjecture, (p21(f24(X1,X2),f24(X3,X4))|~p23(X1,X3)|~p10(X2,X4))).
% 0.20/0.40  cnf(i_0_150, negated_conjecture, (p23(f26(X1,X2),f26(X3,X4))|~p4(X2,X4)|~p25(X1,X3))).
% 0.20/0.40  cnf(i_0_149, negated_conjecture, (p27(f28(X1,X2),f28(X3,X4))|~p15(X2,X4)|~p10(X1,X3))).
% 0.20/0.40  cnf(i_0_148, negated_conjecture, (p29(f32(X1,X2),f32(X3,X4))|~p7(X2,X4)|~p31(X1,X3))).
% 0.20/0.40  cnf(i_0_146, negated_conjecture, (p3(f8(X1,X2),f8(X3,X4))|~p7(X2,X4)|~p6(X1,X3))).
% 0.20/0.40  cnf(i_0_147, negated_conjecture, (p3(f16(X1,X2),f16(X3,X4))|~p15(X2,X4)|~p14(X1,X3))).
% 0.20/0.40  cnf(i_0_145, negated_conjecture, (p31(f34(X1,X2),f34(X3,X4))|~p33(X1,X3)|~p10(X2,X4))).
% 0.20/0.40  cnf(i_0_144, negated_conjecture, (p33(f36(X1,X2),f36(X3,X4))|~p4(X2,X4)|~p35(X1,X3))).
% 0.20/0.40  cnf(i_0_143, negated_conjecture, (p37(f38(X1,X2),f38(X3,X4))|~p7(X1,X3)|~p15(X2,X4))).
% 0.20/0.40  cnf(i_0_142, negated_conjecture, (p39(f42(X1,X2),f42(X3,X4))|~p7(X2,X4)|~p41(X1,X3))).
% 0.20/0.40  cnf(i_0_140, negated_conjecture, (p4(f5(X1,X2),f5(X3,X4))|~p3(X2,X4)|~p2(X1,X3))).
% 0.20/0.40  cnf(i_0_141, negated_conjecture, (p4(f20(X1,X2),f20(X3,X4))|~p19(X1,X3)|~p15(X2,X4))).
% 0.20/0.40  cnf(i_0_139, negated_conjecture, (p41(f44(X1,X2),f44(X3,X4))|~p43(X1,X3)|~p10(X2,X4))).
% 0.20/0.40  cnf(i_0_138, negated_conjecture, (p43(f46(X1,X2),f46(X3,X4))|~p45(X1,X3)|~p4(X2,X4))).
% 0.20/0.40  cnf(i_0_137, negated_conjecture, (p6(f11(X1,X2),f11(X3,X4))|~p10(X2,X4)|~p9(X1,X3))).
% 0.20/0.40  cnf(i_0_136, negated_conjecture, (p7(f40(X1,X2),f40(X3,X4))|~p39(X1,X3)|~p15(X2,X4))).
% 0.20/0.40  cnf(i_0_158, negated_conjecture, (p27(f28(f30(f32(f34(f36(c57,X1),X2),X3),X4),X5),f28(X2,X5))|~p47(f20(f22(f24(f26(c56,X1),X2),X3),X4),X5))).
% 0.20/0.40  cnf(i_0_159, negated_conjecture, (p37(f38(f40(f42(f44(f46(c58,X1),X2),X3),X4),X5),f38(X3,X5))|~p47(f20(f22(f24(f26(c56,X1),X2),X3),X4),X5))).
% 0.20/0.40  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.20/0.40  # Begin printing tableau
% 0.20/0.40  # Found 8 steps
% 0.20/0.40  cnf(i_0_139, negated_conjecture, (p41(f44(X14,X13),f44(X14,X13))|~p43(X14,X14)|~p10(X13,X13)), inference(start_rule)).
% 0.20/0.40  cnf(i_0_175, plain, (~p43(X14,X14)), inference(closure_rule, [i_0_102])).
% 0.20/0.40  cnf(i_0_176, plain, (~p10(X13,X13)), inference(closure_rule, [i_0_82])).
% 0.20/0.40  cnf(i_0_174, plain, (p41(f44(X14,X13),f44(X14,X13))), inference(extension_rule, [i_0_142])).
% 0.20/0.40  cnf(i_0_362, plain, (~p7(X10,X10)), inference(closure_rule, [i_0_105])).
% 0.20/0.40  cnf(i_0_361, plain, (p39(f42(f44(X14,X13),X10),f42(f44(X14,X13),X10))), inference(extension_rule, [i_0_136])).
% 0.20/0.40  cnf(i_0_370, plain, (~p15(X7,X7)), inference(closure_rule, [i_0_85])).
% 0.20/0.40  cnf(i_0_368, plain, (p7(f40(f42(f44(X14,X13),X10),X7),f40(f42(f44(X14,X13),X10),X7))), inference(etableau_closure_rule, [i_0_368, ...])).
% 0.20/0.40  # End printing tableau
% 0.20/0.40  # SZS output end
% 0.20/0.40  # Branches closed with saturation will be marked with an "s"
% 0.20/0.40  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.40  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.40  # Begin clausification derivation
% 0.20/0.40  
% 0.20/0.40  # End clausification derivation
% 0.20/0.40  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.40  cnf(i_0_81, negated_conjecture, (p9(X1,X1))).
% 0.20/0.40  cnf(i_0_157, negated_conjecture, (p47(f5(c48,f16(f18(c54,f8(f11(f13(c49,c50),c51),c52)),c55)),c53))).
% 0.20/0.40  cnf(i_0_82, negated_conjecture, (p10(X1,X1))).
% 0.20/0.40  cnf(i_0_83, negated_conjecture, (p12(X1,X1))).
% 0.20/0.40  cnf(i_0_84, negated_conjecture, (p14(X1,X1))).
% 0.20/0.40  cnf(i_0_85, negated_conjecture, (p15(X1,X1))).
% 0.20/0.40  cnf(i_0_86, negated_conjecture, (p17(X1,X1))).
% 0.20/0.40  cnf(i_0_87, negated_conjecture, (p19(X1,X1))).
% 0.20/0.40  cnf(i_0_88, negated_conjecture, (p2(X1,X1))).
% 0.20/0.40  cnf(i_0_89, negated_conjecture, (p21(X1,X1))).
% 0.20/0.40  cnf(i_0_90, negated_conjecture, (p23(X1,X1))).
% 0.20/0.40  cnf(i_0_91, negated_conjecture, (p25(X1,X1))).
% 0.20/0.40  cnf(i_0_92, negated_conjecture, (p27(X1,X1))).
% 0.20/0.40  cnf(i_0_93, negated_conjecture, (p29(X1,X1))).
% 0.20/0.40  cnf(i_0_94, negated_conjecture, (p3(X1,X1))).
% 0.20/0.40  cnf(i_0_95, negated_conjecture, (p31(X1,X1))).
% 0.20/0.40  cnf(i_0_96, negated_conjecture, (p33(X1,X1))).
% 0.20/0.40  cnf(i_0_97, negated_conjecture, (p35(X1,X1))).
% 0.20/0.40  cnf(i_0_98, negated_conjecture, (p37(X1,X1))).
% 0.20/0.40  cnf(i_0_99, negated_conjecture, (p39(X1,X1))).
% 0.20/0.40  cnf(i_0_100, negated_conjecture, (p4(X1,X1))).
% 0.20/0.40  cnf(i_0_101, negated_conjecture, (p41(X1,X1))).
% 0.20/0.40  cnf(i_0_102, negated_conjecture, (p43(X1,X1))).
% 0.20/0.40  cnf(i_0_103, negated_conjecture, (p45(X1,X1))).
% 0.20/0.40  cnf(i_0_104, negated_conjecture, (p6(X1,X1))).
% 0.20/0.40  cnf(i_0_105, negated_conjecture, (p7(X1,X1))).
% 0.20/0.40  cnf(i_0_160, negated_conjecture, (p3(f16(f18(c54,f8(f11(f13(c49,X1),X2),X3)),X4),f8(f11(f13(c49,f20(f22(f24(f26(c56,X1),X2),X3),X4)),f30(f32(f34(f36(c57,X1),X2),X3),X4)),f40(f42(f44(f46(c58,X1),X2),X3),X4))))).
% 0.20/0.40  cnf(i_0_131, negated_conjecture, (~p47(f5(c48,f8(f11(f13(c49,c50),c51),c52)),c53))).
% 0.20/0.40  cnf(i_0_132, negated_conjecture, (~p47(f20(f22(f24(f26(c56,X1),X2),X3),X4),X4))).
% 0.20/0.40  cnf(i_0_107, negated_conjecture, (p9(X1,X2)|~p9(X3,X2)|~p9(X3,X1))).
% 0.20/0.40  cnf(i_0_106, negated_conjecture, (p10(X1,X2)|~p10(X3,X2)|~p10(X3,X1))).
% 0.20/0.40  cnf(i_0_130, negated_conjecture, (p12(X1,X2)|~p12(X3,X2)|~p12(X3,X1))).
% 0.20/0.40  cnf(i_0_129, negated_conjecture, (p14(X1,X2)|~p14(X3,X2)|~p14(X3,X1))).
% 0.20/0.40  cnf(i_0_128, negated_conjecture, (p15(X1,X2)|~p15(X3,X2)|~p15(X3,X1))).
% 0.20/0.40  cnf(i_0_127, negated_conjecture, (p17(X1,X2)|~p17(X3,X2)|~p17(X3,X1))).
% 0.20/0.40  cnf(i_0_154, negated_conjecture, (p47(X1,X2)|~p47(f5(c48,f8(f11(f13(c49,X1),X3),X4)),X2))).
% 0.20/0.40  cnf(i_0_126, negated_conjecture, (p19(X1,X2)|~p19(X3,X2)|~p19(X3,X1))).
% 0.20/0.40  cnf(i_0_125, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.20/0.40  cnf(i_0_124, negated_conjecture, (p21(X1,X2)|~p21(X3,X2)|~p21(X3,X1))).
% 0.20/0.40  cnf(i_0_123, negated_conjecture, (p23(X1,X2)|~p23(X3,X2)|~p23(X3,X1))).
% 0.20/0.40  cnf(i_0_122, negated_conjecture, (p25(X1,X2)|~p25(X3,X2)|~p25(X3,X1))).
% 0.20/0.40  cnf(i_0_121, negated_conjecture, (p27(X1,X2)|~p27(X3,X2)|~p27(X3,X1))).
% 0.20/0.40  cnf(i_0_120, negated_conjecture, (p29(X1,X2)|~p29(X3,X2)|~p29(X3,X1))).
% 0.20/0.40  cnf(i_0_119, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))).
% 0.20/0.40  cnf(i_0_118, negated_conjecture, (p31(X1,X2)|~p31(X3,X2)|~p31(X3,X1))).
% 0.20/0.40  cnf(i_0_117, negated_conjecture, (p33(X1,X2)|~p33(X3,X2)|~p33(X3,X1))).
% 0.20/0.40  cnf(i_0_116, negated_conjecture, (p35(X1,X2)|~p35(X3,X2)|~p35(X3,X1))).
% 0.20/0.40  cnf(i_0_115, negated_conjecture, (p37(X1,X2)|~p37(X3,X2)|~p37(X3,X1))).
% 0.20/0.40  cnf(i_0_114, negated_conjecture, (p39(X1,X2)|~p39(X3,X2)|~p39(X3,X1))).
% 0.20/0.40  cnf(i_0_113, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))).
% 0.20/0.40  cnf(i_0_112, negated_conjecture, (p41(X1,X2)|~p41(X3,X2)|~p41(X3,X1))).
% 0.20/0.40  cnf(i_0_111, negated_conjecture, (p43(X1,X2)|~p43(X3,X2)|~p43(X3,X1))).
% 0.20/0.40  cnf(i_0_110, negated_conjecture, (p45(X1,X2)|~p45(X3,X2)|~p45(X3,X1))).
% 0.20/0.40  cnf(i_0_109, negated_conjecture, (p6(X1,X2)|~p6(X3,X2)|~p6(X3,X1))).
% 0.20/0.40  cnf(i_0_108, negated_conjecture, (p7(X1,X2)|~p7(X3,X2)|~p7(X3,X1))).
% 0.20/0.40  cnf(i_0_133, negated_conjecture, (p47(X1,X2)|~p47(X3,X4)|~p4(X3,X1)|~p15(X4,X2))).
% 0.20/0.40  cnf(i_0_135, negated_conjecture, (p9(f13(X1,X2),f13(X3,X4))|~p4(X2,X4)|~p12(X1,X3))).
% 0.20/0.40  cnf(i_0_155, negated_conjecture, (p47(X1,X2)|~p47(f20(f22(f24(f26(c56,X1),X3),X4),X5),X2))).
% 0.20/0.40  cnf(i_0_156, negated_conjecture, (p47(f5(c48,f8(f11(f13(c49,X1),X2),X3)),X4)|~p47(X1,X4))).
% 0.20/0.40  cnf(i_0_134, negated_conjecture, (p10(f30(X1,X2),f30(X3,X4))|~p29(X1,X3)|~p15(X2,X4))).
% 0.20/0.40  cnf(i_0_153, negated_conjecture, (p14(f18(X1,X2),f18(X3,X4))|~p3(X2,X4)|~p17(X1,X3))).
% 0.20/0.40  cnf(i_0_152, negated_conjecture, (p19(f22(X1,X2),f22(X3,X4))|~p7(X2,X4)|~p21(X1,X3))).
% 0.20/0.40  cnf(i_0_151, negated_conjecture, (p21(f24(X1,X2),f24(X3,X4))|~p23(X1,X3)|~p10(X2,X4))).
% 0.20/0.40  cnf(i_0_150, negated_conjecture, (p23(f26(X1,X2),f26(X3,X4))|~p4(X2,X4)|~p25(X1,X3))).
% 0.20/0.40  cnf(i_0_149, negated_conjecture, (p27(f28(X1,X2),f28(X3,X4))|~p15(X2,X4)|~p10(X1,X3))).
% 0.20/0.40  cnf(i_0_148, negated_conjecture, (p29(f32(X1,X2),f32(X3,X4))|~p7(X2,X4)|~p31(X1,X3))).
% 0.20/0.40  cnf(i_0_146, negated_conjecture, (p3(f8(X1,X2),f8(X3,X4))|~p7(X2,X4)|~p6(X1,X3))).
% 0.20/0.40  cnf(i_0_147, negated_conjecture, (p3(f16(X1,X2),f16(X3,X4))|~p15(X2,X4)|~p14(X1,X3))).
% 0.20/0.40  cnf(i_0_145, negated_conjecture, (p31(f34(X1,X2),f34(X3,X4))|~p33(X1,X3)|~p10(X2,X4))).
% 0.20/0.40  cnf(i_0_144, negated_conjecture, (p33(f36(X1,X2),f36(X3,X4))|~p4(X2,X4)|~p35(X1,X3))).
% 0.20/0.40  cnf(i_0_143, negated_conjecture, (p37(f38(X1,X2),f38(X3,X4))|~p7(X1,X3)|~p15(X2,X4))).
% 0.20/0.40  cnf(i_0_142, negated_conjecture, (p39(f42(X1,X2),f42(X3,X4))|~p7(X2,X4)|~p41(X1,X3))).
% 0.20/0.40  cnf(i_0_140, negated_conjecture, (p4(f5(X1,X2),f5(X3,X4))|~p3(X2,X4)|~p2(X1,X3))).
% 0.20/0.40  cnf(i_0_141, negated_conjecture, (p4(f20(X1,X2),f20(X3,X4))|~p19(X1,X3)|~p15(X2,X4))).
% 0.20/0.40  cnf(i_0_139, negated_conjecture, (p41(f44(X1,X2),f44(X3,X4))|~p43(X1,X3)|~p10(X2,X4))).
% 0.20/0.40  cnf(i_0_138, negated_conjecture, (p43(f46(X1,X2),f46(X3,X4))|~p45(X1,X3)|~p4(X2,X4))).
% 0.20/0.40  cnf(i_0_137, negated_conjecture, (p6(f11(X1,X2),f11(X3,X4))|~p10(X2,X4)|~p9(X1,X3))).
% 0.20/0.40  cnf(i_0_136, negated_conjecture, (p7(f40(X1,X2),f40(X3,X4))|~p39(X1,X3)|~p15(X2,X4))).
% 0.20/0.40  cnf(i_0_158, negated_conjecture, (p27(f28(f30(f32(f34(f36(c57,X1),X2),X3),X4),X5),f28(X2,X5))|~p47(f20(f22(f24(f26(c56,X1),X2),X3),X4),X5))).
% 0.20/0.40  cnf(i_0_159, negated_conjecture, (p37(f38(f40(f42(f44(f46(c58,X1),X2),X3),X4),X5),f38(X3,X5))|~p47(f20(f22(f24(f26(c56,X1),X2),X3),X4),X5))).
% 0.20/0.40  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.20/0.40  # Begin printing tableau
% 0.20/0.40  # Found 8 steps
% 0.20/0.40  cnf(i_0_141, negated_conjecture, (p4(f20(X10,X13),f20(X10,X13))|~p19(X10,X10)|~p15(X13,X13)), inference(start_rule)).
% 0.20/0.40  cnf(i_0_178, plain, (~p19(X10,X10)), inference(closure_rule, [i_0_87])).
% 0.20/0.40  cnf(i_0_179, plain, (~p15(X13,X13)), inference(closure_rule, [i_0_85])).
% 0.20/0.40  cnf(i_0_177, plain, (p4(f20(X10,X13),f20(X10,X13))), inference(extension_rule, [i_0_138])).
% 0.20/0.40  cnf(i_0_350, plain, (~p45(X14,X14)), inference(closure_rule, [i_0_103])).
% 0.20/0.40  cnf(i_0_349, plain, (p43(f46(X14,f20(X10,X13)),f46(X14,f20(X10,X13)))), inference(extension_rule, [i_0_139])).
% 0.20/0.40  cnf(i_0_364, plain, (~p10(X7,X7)), inference(closure_rule, [i_0_82])).
% 0.20/0.40  cnf(i_0_362, plain, (p41(f44(f46(X14,f20(X10,X13)),X7),f44(f46(X14,f20(X10,X13)),X7))), inference(etableau_closure_rule, [i_0_362, ...])).
% 0.20/0.40  # End printing tableau
% 0.20/0.40  # SZS output end
% 0.20/0.40  # Branches closed with saturation will be marked with an "s"
% 0.20/0.40  # Child (12814) has found a proof.
% 0.20/0.40  
% 0.20/0.40  # Proof search is over...
% 0.20/0.40  # Freeing feature tree
%------------------------------------------------------------------------------