TSTP Solution File: SYN575-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN575-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 : n015.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:34 EDT 2022
% Result : Unsatisfiable 0.19s 0.38s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN575-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33 % Computer : n015.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jul 11 23:25:09 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.36 # No SInE strategy applied
% 0.19/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.19/0.36 #
% 0.19/0.36 # Presaturation interreduction done
% 0.19/0.36 # Number of axioms: 22 Number of unprocessed: 22
% 0.19/0.36 # Tableaux proof search.
% 0.19/0.36 # APR header successfully linked.
% 0.19/0.36 # Hello from C++
% 0.19/0.37 # The folding up rule is enabled...
% 0.19/0.37 # Local unification is enabled...
% 0.19/0.37 # Any saturation attempts will use folding labels...
% 0.19/0.37 # 22 beginning clauses after preprocessing and clausification
% 0.19/0.37 # Creating start rules for all 22 conjectures.
% 0.19/0.37 # There are 22 start rule candidates:
% 0.19/0.37 # Found 8 unit axioms.
% 0.19/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.19/0.37 # 22 start rule tableaux created.
% 0.19/0.37 # 14 extension rule candidate clauses
% 0.19/0.37 # 8 unit axiom clauses
% 0.19/0.37
% 0.19/0.37 # Requested 8, 32 cores available to the main process.
% 0.19/0.38 # There were 2 total branch saturation attempts.
% 0.19/0.38 # There were 0 of these attempts blocked.
% 0.19/0.38 # There were 0 deferred branch saturation attempts.
% 0.19/0.38 # There were 0 free duplicated saturations.
% 0.19/0.38 # There were 2 total successful branch saturations.
% 0.19/0.38 # There were 0 successful branch saturations in interreduction.
% 0.19/0.38 # There were 0 successful branch saturations on the branch.
% 0.19/0.38 # There were 2 successful branch saturations after the branch.
% 0.19/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.38 # Begin clausification derivation
% 0.19/0.38
% 0.19/0.38 # End clausification derivation
% 0.19/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.38 cnf(i_0_27, negated_conjecture, (p9(c12,c13))).
% 0.19/0.38 cnf(i_0_28, negated_conjecture, (p11(c14,c15))).
% 0.19/0.38 cnf(i_0_23, negated_conjecture, (p10(X1,X1))).
% 0.19/0.38 cnf(i_0_24, negated_conjecture, (p7(X1,X1))).
% 0.19/0.38 cnf(i_0_25, negated_conjecture, (p3(X1,X1))).
% 0.19/0.38 cnf(i_0_26, negated_conjecture, (p2(X1,X1))).
% 0.19/0.38 cnf(i_0_29, negated_conjecture, (p3(f4(f5(X1)),f4(X1)))).
% 0.19/0.38 cnf(i_0_30, negated_conjecture, (p3(f6(f5(X1)),f6(X1)))).
% 0.19/0.38 cnf(i_0_31, negated_conjecture, (p9(X1,c13)|~p9(X1,f6(c14)))).
% 0.19/0.38 cnf(i_0_32, negated_conjecture, (p9(X1,f6(c14))|~p9(X1,c13))).
% 0.19/0.38 cnf(i_0_36, negated_conjecture, (p10(X1,X2)|~p10(X3,X2)|~p10(X3,X1))).
% 0.19/0.38 cnf(i_0_37, negated_conjecture, (p7(X1,X2)|~p7(X3,X2)|~p7(X3,X1))).
% 0.19/0.38 cnf(i_0_38, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))).
% 0.19/0.38 cnf(i_0_35, negated_conjecture, (p3(f4(X1),f4(X2))|~p2(X1,X2))).
% 0.19/0.38 cnf(i_0_34, negated_conjecture, (p3(f6(X1),f6(X2))|~p2(X1,X2))).
% 0.19/0.38 cnf(i_0_33, negated_conjecture, (p2(f5(X1),f5(X2))|~p2(X1,X2))).
% 0.19/0.38 cnf(i_0_39, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.19/0.38 cnf(i_0_42, negated_conjecture, (p7(f8(X1,X2),f8(X3,X4))|~p2(X2,X4)|~p3(X1,X3))).
% 0.19/0.38 cnf(i_0_41, negated_conjecture, (p9(X1,X2)|~p9(X3,X4)|~p3(X4,X2)|~p7(X3,X1))).
% 0.19/0.38 cnf(i_0_40, negated_conjecture, (p11(X1,X2)|~p11(X3,X4)|~p2(X3,X1)|~p10(X4,X2))).
% 0.19/0.38 cnf(i_0_44, negated_conjecture, (~p11(X1,c15)|~p9(f8(X2,X3),f6(X3))|~p9(f8(X2,X3),X2)|~p9(c12,X2)|~p2(X3,f5(X1)))).
% 0.19/0.38 cnf(i_0_43, negated_conjecture, (p9(f8(X1,X2),f6(X2))|p9(f8(X1,X2),X1)|~p11(X3,c15)|~p9(c12,X1)|~p2(X2,f5(X3)))).
% 0.19/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.38 # Begin printing tableau
% 0.19/0.38 # Found 10 steps
% 0.19/0.38 cnf(i_0_43, negated_conjecture, (p9(f8(c13,f5(c14)),f6(f5(c14)))|p9(f8(c13,f5(c14)),c13)|~p11(c14,c15)|~p9(c12,c13)|~p2(f5(c14),f5(c14))), inference(start_rule)).
% 0.19/0.38 cnf(i_0_47, plain, (~p11(c14,c15)), inference(closure_rule, [i_0_28])).
% 0.19/0.38 cnf(i_0_48, plain, (~p9(c12,c13)), inference(closure_rule, [i_0_27])).
% 0.19/0.38 cnf(i_0_49, plain, (~p2(f5(c14),f5(c14))), inference(closure_rule, [i_0_26])).
% 0.19/0.38 cnf(i_0_45, plain, (p9(f8(c13,f5(c14)),f6(f5(c14)))), inference(extension_rule, [i_0_41])).
% 0.19/0.38 cnf(i_0_112, plain, (~p3(f6(f5(c14)),f6(c14))), inference(closure_rule, [i_0_30])).
% 0.19/0.38 cnf(i_0_113, plain, (~p7(f8(c13,f5(c14)),f8(c13,f5(c14)))), inference(closure_rule, [i_0_24])).
% 0.19/0.38 cnf(i_0_110, plain, (p9(f8(c13,f5(c14)),f6(c14))), inference(extension_rule, [i_0_31])).
% 0.19/0.38 cnf(i_0_46, plain, (p9(f8(c13,f5(c14)),c13)), inference(etableau_closure_rule, [i_0_46, ...])).
% 0.19/0.38 cnf(i_0_151, plain, (p9(f8(c13,f5(c14)),c13)), inference(etableau_closure_rule, [i_0_151, ...])).
% 0.19/0.38 # End printing tableau
% 0.19/0.38 # SZS output end
% 0.19/0.38 # Branches closed with saturation will be marked with an "s"
% 0.19/0.38 # There were 2 total branch saturation attempts.
% 0.19/0.38 # There were 0 of these attempts blocked.
% 0.19/0.38 # There were 0 deferred branch saturation attempts.
% 0.19/0.38 # There were 0 free duplicated saturations.
% 0.19/0.38 # There were 2 total successful branch saturations.
% 0.19/0.38 # There were 0 successful branch saturations in interreduction.
% 0.19/0.38 # There were 0 successful branch saturations on the branch.
% 0.19/0.38 # There were 2 successful branch saturations after the branch.
% 0.19/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.38 # Begin clausification derivation
% 0.19/0.38
% 0.19/0.38 # End clausification derivation
% 0.19/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.38 cnf(i_0_27, negated_conjecture, (p9(c12,c13))).
% 0.19/0.38 cnf(i_0_28, negated_conjecture, (p11(c14,c15))).
% 0.19/0.38 cnf(i_0_23, negated_conjecture, (p10(X1,X1))).
% 0.19/0.38 cnf(i_0_24, negated_conjecture, (p7(X1,X1))).
% 0.19/0.38 cnf(i_0_25, negated_conjecture, (p3(X1,X1))).
% 0.19/0.38 cnf(i_0_26, negated_conjecture, (p2(X1,X1))).
% 0.19/0.38 cnf(i_0_29, negated_conjecture, (p3(f4(f5(X1)),f4(X1)))).
% 0.19/0.38 cnf(i_0_30, negated_conjecture, (p3(f6(f5(X1)),f6(X1)))).
% 0.19/0.38 cnf(i_0_31, negated_conjecture, (p9(X1,c13)|~p9(X1,f6(c14)))).
% 0.19/0.38 cnf(i_0_32, negated_conjecture, (p9(X1,f6(c14))|~p9(X1,c13))).
% 0.19/0.38 cnf(i_0_36, negated_conjecture, (p10(X1,X2)|~p10(X3,X2)|~p10(X3,X1))).
% 0.19/0.38 cnf(i_0_37, negated_conjecture, (p7(X1,X2)|~p7(X3,X2)|~p7(X3,X1))).
% 0.19/0.38 cnf(i_0_38, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))).
% 0.19/0.38 cnf(i_0_35, negated_conjecture, (p3(f4(X1),f4(X2))|~p2(X1,X2))).
% 0.19/0.38 cnf(i_0_34, negated_conjecture, (p3(f6(X1),f6(X2))|~p2(X1,X2))).
% 0.19/0.38 cnf(i_0_33, negated_conjecture, (p2(f5(X1),f5(X2))|~p2(X1,X2))).
% 0.19/0.38 cnf(i_0_39, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.19/0.38 cnf(i_0_42, negated_conjecture, (p7(f8(X1,X2),f8(X3,X4))|~p2(X2,X4)|~p3(X1,X3))).
% 0.19/0.38 cnf(i_0_41, negated_conjecture, (p9(X1,X2)|~p9(X3,X4)|~p3(X4,X2)|~p7(X3,X1))).
% 0.19/0.38 cnf(i_0_40, negated_conjecture, (p11(X1,X2)|~p11(X3,X4)|~p2(X3,X1)|~p10(X4,X2))).
% 0.19/0.38 cnf(i_0_44, negated_conjecture, (~p11(X1,c15)|~p9(f8(X2,X3),f6(X3))|~p9(f8(X2,X3),X2)|~p9(c12,X2)|~p2(X3,f5(X1)))).
% 0.19/0.38 cnf(i_0_43, negated_conjecture, (p9(f8(X1,X2),f6(X2))|p9(f8(X1,X2),X1)|~p11(X3,c15)|~p9(c12,X1)|~p2(X2,f5(X3)))).
% 0.19/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.38 # Begin printing tableau
% 0.19/0.38 # Found 12 steps
% 0.19/0.38 cnf(i_0_40, negated_conjecture, (p11(c14,c15)|~p11(c14,c15)|~p2(c14,c14)|~p10(c15,c15)), inference(start_rule)).
% 0.19/0.38 cnf(i_0_56, plain, (~p11(c14,c15)), inference(closure_rule, [i_0_28])).
% 0.19/0.38 cnf(i_0_57, plain, (~p2(c14,c14)), inference(closure_rule, [i_0_26])).
% 0.19/0.38 cnf(i_0_58, plain, (~p10(c15,c15)), inference(closure_rule, [i_0_23])).
% 0.19/0.38 cnf(i_0_55, plain, (p11(c14,c15)), inference(extension_rule, [i_0_43])).
% 0.19/0.38 cnf(i_0_99, plain, (~p9(c12,c13)), inference(closure_rule, [i_0_27])).
% 0.19/0.38 cnf(i_0_100, plain, (~p2(f5(c14),f5(c14))), inference(closure_rule, [i_0_26])).
% 0.19/0.38 cnf(i_0_96, plain, (p9(f8(c13,f5(c14)),f6(f5(c14)))), inference(extension_rule, [i_0_41])).
% 0.19/0.38 cnf(i_0_112, plain, (~p3(f6(f5(c14)),f6(c14))), inference(closure_rule, [i_0_30])).
% 0.19/0.38 cnf(i_0_113, plain, (~p7(f8(c13,f5(c14)),f8(c13,f5(c14)))), inference(closure_rule, [i_0_24])).
% 0.19/0.38 cnf(i_0_97, plain, (p9(f8(c13,f5(c14)),c13)), inference(etableau_closure_rule, [i_0_97, ...])).
% 0.19/0.38 cnf(i_0_110, plain, (p9(f8(c13,f5(c14)),f6(c14))), inference(etableau_closure_rule, [i_0_110, ...])).
% 0.19/0.38 # End printing tableau
% 0.19/0.38 # SZS output end
% 0.19/0.38 # Branches closed with saturation will be marked with an "s"
% 0.19/0.38 # There were 2 total branch saturation attempts.
% 0.19/0.38 # There were 0 of these attempts blocked.
% 0.19/0.38 # There were 0 deferred branch saturation attempts.
% 0.19/0.38 # There were 0 free duplicated saturations.
% 0.19/0.38 # There were 2 total successful branch saturations.
% 0.19/0.38 # There were 0 successful branch saturations in interreduction.
% 0.19/0.38 # There were 0 successful branch saturations on the branch.
% 0.19/0.38 # There were 2 successful branch saturations after the branch.
% 0.19/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.38 # Begin clausification derivation
% 0.19/0.38
% 0.19/0.38 # End clausification derivation
% 0.19/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.38 cnf(i_0_27, negated_conjecture, (p9(c12,c13))).
% 0.19/0.38 cnf(i_0_28, negated_conjecture, (p11(c14,c15))).
% 0.19/0.38 cnf(i_0_23, negated_conjecture, (p10(X1,X1))).
% 0.19/0.38 cnf(i_0_24, negated_conjecture, (p7(X1,X1))).
% 0.19/0.38 cnf(i_0_25, negated_conjecture, (p3(X1,X1))).
% 0.19/0.38 cnf(i_0_26, negated_conjecture, (p2(X1,X1))).
% 0.19/0.38 cnf(i_0_29, negated_conjecture, (p3(f4(f5(X1)),f4(X1)))).
% 0.19/0.38 cnf(i_0_30, negated_conjecture, (p3(f6(f5(X1)),f6(X1)))).
% 0.19/0.38 cnf(i_0_31, negated_conjecture, (p9(X1,c13)|~p9(X1,f6(c14)))).
% 0.19/0.38 cnf(i_0_32, negated_conjecture, (p9(X1,f6(c14))|~p9(X1,c13))).
% 0.19/0.38 cnf(i_0_36, negated_conjecture, (p10(X1,X2)|~p10(X3,X2)|~p10(X3,X1))).
% 0.19/0.38 cnf(i_0_37, negated_conjecture, (p7(X1,X2)|~p7(X3,X2)|~p7(X3,X1))).
% 0.19/0.38 cnf(i_0_38, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))).
% 0.19/0.38 cnf(i_0_35, negated_conjecture, (p3(f4(X1),f4(X2))|~p2(X1,X2))).
% 0.19/0.38 cnf(i_0_34, negated_conjecture, (p3(f6(X1),f6(X2))|~p2(X1,X2))).
% 0.19/0.38 cnf(i_0_33, negated_conjecture, (p2(f5(X1),f5(X2))|~p2(X1,X2))).
% 0.19/0.38 cnf(i_0_39, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.19/0.38 cnf(i_0_42, negated_conjecture, (p7(f8(X1,X2),f8(X3,X4))|~p2(X2,X4)|~p3(X1,X3))).
% 0.19/0.38 cnf(i_0_41, negated_conjecture, (p9(X1,X2)|~p9(X3,X4)|~p3(X4,X2)|~p7(X3,X1))).
% 0.19/0.38 cnf(i_0_40, negated_conjecture, (p11(X1,X2)|~p11(X3,X4)|~p2(X3,X1)|~p10(X4,X2))).
% 0.19/0.38 cnf(i_0_44, negated_conjecture, (~p11(X1,c15)|~p9(f8(X2,X3),f6(X3))|~p9(f8(X2,X3),X2)|~p9(c12,X2)|~p2(X3,f5(X1)))).
% 0.19/0.38 cnf(i_0_43, negated_conjecture, (p9(f8(X1,X2),f6(X2))|p9(f8(X1,X2),X1)|~p11(X3,c15)|~p9(c12,X1)|~p2(X2,f5(X3)))).
% 0.19/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.38 # Begin printing tableau
% 0.19/0.38 # Found 12 steps
% 0.19/0.38 cnf(i_0_41, negated_conjecture, (p9(c12,c13)|~p9(c12,c13)|~p3(c13,c13)|~p7(c12,c12)), inference(start_rule)).
% 0.19/0.38 cnf(i_0_60, plain, (~p9(c12,c13)), inference(closure_rule, [i_0_27])).
% 0.19/0.38 cnf(i_0_61, plain, (~p3(c13,c13)), inference(closure_rule, [i_0_25])).
% 0.19/0.38 cnf(i_0_62, plain, (~p7(c12,c12)), inference(closure_rule, [i_0_24])).
% 0.19/0.38 cnf(i_0_59, plain, (p9(c12,c13)), inference(extension_rule, [i_0_43])).
% 0.19/0.38 cnf(i_0_98, plain, (~p11(c14,c15)), inference(closure_rule, [i_0_28])).
% 0.19/0.38 cnf(i_0_100, plain, (~p2(f5(c14),f5(c14))), inference(closure_rule, [i_0_26])).
% 0.19/0.38 cnf(i_0_96, plain, (p9(f8(c13,f5(c14)),f6(f5(c14)))), inference(extension_rule, [i_0_41])).
% 0.19/0.38 cnf(i_0_112, plain, (~p3(f6(f5(c14)),f6(c14))), inference(closure_rule, [i_0_30])).
% 0.19/0.38 cnf(i_0_113, plain, (~p7(f8(c13,f5(c14)),f8(c13,f5(c14)))), inference(closure_rule, [i_0_24])).
% 0.19/0.38 cnf(i_0_97, plain, (p9(f8(c13,f5(c14)),c13)), inference(etableau_closure_rule, [i_0_97, ...])).
% 0.19/0.38 cnf(i_0_110, plain, (p9(f8(c13,f5(c14)),f6(c14))), inference(etableau_closure_rule, [i_0_110, ...])).
% 0.19/0.38 # End printing tableau
% 0.19/0.38 # SZS output end
% 0.19/0.38 # Branches closed with saturation will be marked with an "s"
% 0.19/0.38 # There were 2 total branch saturation attempts.
% 0.19/0.38 # There were 0 of these attempts blocked.
% 0.19/0.38 # There were 0 deferred branch saturation attempts.
% 0.19/0.38 # There were 0 free duplicated saturations.
% 0.19/0.38 # There were 2 total successful branch saturations.
% 0.19/0.38 # There were 0 successful branch saturations in interreduction.
% 0.19/0.38 # There were 0 successful branch saturations on the branch.
% 0.19/0.38 # There were 2 successful branch saturations after the branch.
% 0.19/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.38 # Begin clausification derivation
% 0.19/0.38
% 0.19/0.38 # End clausification derivation
% 0.19/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.38 cnf(i_0_27, negated_conjecture, (p9(c12,c13))).
% 0.19/0.38 cnf(i_0_28, negated_conjecture, (p11(c14,c15))).
% 0.19/0.38 cnf(i_0_23, negated_conjecture, (p10(X1,X1))).
% 0.19/0.38 cnf(i_0_24, negated_conjecture, (p7(X1,X1))).
% 0.19/0.38 cnf(i_0_25, negated_conjecture, (p3(X1,X1))).
% 0.19/0.38 cnf(i_0_26, negated_conjecture, (p2(X1,X1))).
% 0.19/0.38 cnf(i_0_29, negated_conjecture, (p3(f4(f5(X1)),f4(X1)))).
% 0.19/0.38 cnf(i_0_30, negated_conjecture, (p3(f6(f5(X1)),f6(X1)))).
% 0.19/0.38 cnf(i_0_31, negated_conjecture, (p9(X1,c13)|~p9(X1,f6(c14)))).
% 0.19/0.38 cnf(i_0_32, negated_conjecture, (p9(X1,f6(c14))|~p9(X1,c13))).
% 0.19/0.38 cnf(i_0_36, negated_conjecture, (p10(X1,X2)|~p10(X3,X2)|~p10(X3,X1))).
% 0.19/0.38 cnf(i_0_37, negated_conjecture, (p7(X1,X2)|~p7(X3,X2)|~p7(X3,X1))).
% 0.19/0.38 cnf(i_0_38, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))).
% 0.19/0.38 cnf(i_0_35, negated_conjecture, (p3(f4(X1),f4(X2))|~p2(X1,X2))).
% 0.19/0.38 cnf(i_0_34, negated_conjecture, (p3(f6(X1),f6(X2))|~p2(X1,X2))).
% 0.19/0.38 cnf(i_0_33, negated_conjecture, (p2(f5(X1),f5(X2))|~p2(X1,X2))).
% 0.19/0.38 cnf(i_0_39, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.19/0.38 cnf(i_0_42, negated_conjecture, (p7(f8(X1,X2),f8(X3,X4))|~p2(X2,X4)|~p3(X1,X3))).
% 0.19/0.38 cnf(i_0_41, negated_conjecture, (p9(X1,X2)|~p9(X3,X4)|~p3(X4,X2)|~p7(X3,X1))).
% 0.19/0.38 cnf(i_0_40, negated_conjecture, (p11(X1,X2)|~p11(X3,X4)|~p2(X3,X1)|~p10(X4,X2))).
% 0.19/0.38 cnf(i_0_44, negated_conjecture, (~p11(X1,c15)|~p9(f8(X2,X3),f6(X3))|~p9(f8(X2,X3),X2)|~p9(c12,X2)|~p2(X3,f5(X1)))).
% 0.19/0.38 cnf(i_0_43, negated_conjecture, (p9(f8(X1,X2),f6(X2))|p9(f8(X1,X2),X1)|~p11(X3,c15)|~p9(c12,X1)|~p2(X2,f5(X3)))).
% 0.19/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.38 # Begin printing tableau
% 0.19/0.38 # Found 11 steps
% 0.19/0.38 cnf(i_0_39, negated_conjecture, (p2(f5(c14),f5(c14))|~p2(f5(c14),f5(c14))|~p2(f5(c14),f5(c14))), inference(start_rule)).
% 0.19/0.38 cnf(i_0_67, plain, (~p2(f5(c14),f5(c14))), inference(closure_rule, [i_0_26])).
% 0.19/0.38 cnf(i_0_68, plain, (~p2(f5(c14),f5(c14))), inference(closure_rule, [i_0_26])).
% 0.19/0.38 cnf(i_0_66, plain, (p2(f5(c14),f5(c14))), inference(extension_rule, [i_0_43])).
% 0.19/0.38 cnf(i_0_98, plain, (~p11(c14,c15)), inference(closure_rule, [i_0_28])).
% 0.19/0.38 cnf(i_0_99, plain, (~p9(c12,c13)), inference(closure_rule, [i_0_27])).
% 0.19/0.38 cnf(i_0_96, plain, (p9(f8(c13,f5(c14)),f6(f5(c14)))), inference(extension_rule, [i_0_41])).
% 0.19/0.38 cnf(i_0_112, plain, (~p3(f6(f5(c14)),f6(c14))), inference(closure_rule, [i_0_30])).
% 0.19/0.38 cnf(i_0_113, plain, (~p7(f8(c13,f5(c14)),f8(c13,f5(c14)))), inference(closure_rule, [i_0_24])).
% 0.19/0.38 cnf(i_0_97, plain, (p9(f8(c13,f5(c14)),c13)), inference(etableau_closure_rule, [i_0_97, ...])).
% 0.19/0.38 cnf(i_0_110, plain, (p9(f8(c13,f5(c14)),f6(c14))), inference(etableau_closure_rule, [i_0_110, ...])).
% 0.19/0.38 # End printing tableau
% 0.19/0.38 # SZS output end
% 0.19/0.38 # Branches closed with saturation will be marked with an "s"
% 0.19/0.38 # Child (21164) has found a proof.
% 0.19/0.38
% 0.19/0.38 # Proof search is over...
% 0.19/0.38 # Freeing feature tree
%------------------------------------------------------------------------------