TSTP Solution File: SYN593-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN593-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 : n009.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:41 EDT 2022
% Result : Unsatisfiable 0.20s 0.37s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN593-1 : TPTP v8.1.0. Released v2.5.0.
% 0.13/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.33 % Computer : n009.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jul 12 00:30:37 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.36 # No SInE strategy applied
% 0.20/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.20/0.36 #
% 0.20/0.36 # Presaturation interreduction done
% 0.20/0.36 # Number of axioms: 27 Number of unprocessed: 27
% 0.20/0.36 # Tableaux proof search.
% 0.20/0.36 # APR header successfully linked.
% 0.20/0.36 # Hello from C++
% 0.20/0.36 # The folding up rule is enabled...
% 0.20/0.36 # Local unification is enabled...
% 0.20/0.36 # Any saturation attempts will use folding labels...
% 0.20/0.36 # 27 beginning clauses after preprocessing and clausification
% 0.20/0.36 # Creating start rules for all 27 conjectures.
% 0.20/0.36 # There are 27 start rule candidates:
% 0.20/0.36 # Found 10 unit axioms.
% 0.20/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.20/0.36 # 27 start rule tableaux created.
% 0.20/0.36 # 17 extension rule candidate clauses
% 0.20/0.36 # 10 unit axiom clauses
% 0.20/0.36
% 0.20/0.36 # Requested 8, 32 cores available to the main process.
% 0.20/0.37 # There were 1 total branch saturation attempts.
% 0.20/0.37 # There were 0 of these attempts blocked.
% 0.20/0.37 # There were 0 deferred branch saturation attempts.
% 0.20/0.37 # There were 0 free duplicated saturations.
% 0.20/0.37 # There were 1 total successful branch saturations.
% 0.20/0.37 # There were 0 successful branch saturations in interreduction.
% 0.20/0.37 # There were 0 successful branch saturations on the branch.
% 0.20/0.37 # There were 1 successful branch saturations after the branch.
% 0.20/0.37 # There were 1 total branch saturation attempts.
% 0.20/0.37 # There were 0 of these attempts blocked.
% 0.20/0.37 # There were 0 deferred branch saturation attempts.
% 0.20/0.37 # There were 0 free duplicated saturations.
% 0.20/0.37 # There were 1 total successful branch saturations.
% 0.20/0.37 # There were 0 successful branch saturations in interreduction.
% 0.20/0.37 # There were 0 successful branch saturations on the branch.
% 0.20/0.37 # There were 1 successful branch saturations after the branch.
% 0.20/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.37 # Begin clausification derivation
% 0.20/0.37
% 0.20/0.37 # End clausification derivation
% 0.20/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.37 cnf(i_0_46, negated_conjecture, (p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),c21),c20))).
% 0.20/0.37 cnf(i_0_28, negated_conjecture, (p12(X1,X1))).
% 0.20/0.37 cnf(i_0_29, negated_conjecture, (p5(X1,X1))).
% 0.20/0.37 cnf(i_0_30, negated_conjecture, (p3(X1,X1))).
% 0.20/0.37 cnf(i_0_31, negated_conjecture, (p2(X1,X1))).
% 0.20/0.37 cnf(i_0_45, negated_conjecture, (p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),c19),c20))).
% 0.20/0.37 cnf(i_0_32, negated_conjecture, (~p3(c21,c19))).
% 0.20/0.37 cnf(i_0_33, negated_conjecture, (~p12(f13(c20),f13(c18)))).
% 0.20/0.37 cnf(i_0_50, negated_conjecture, (~p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c21)),c20))).
% 0.20/0.37 cnf(i_0_51, negated_conjecture, (~p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c19)),c20))).
% 0.20/0.37 cnf(i_0_40, negated_conjecture, (p12(X1,X2)|~p12(X3,X2)|~p12(X3,X1))).
% 0.20/0.37 cnf(i_0_41, negated_conjecture, (p5(X1,X2)|~p5(X3,X2)|~p5(X3,X1))).
% 0.20/0.37 cnf(i_0_34, negated_conjecture, (p12(f13(X1),f13(X2))|~p2(X1,X2))).
% 0.20/0.37 cnf(i_0_35, negated_conjecture, (p5(f7(X1),f7(X2))|~p3(X1,X2))).
% 0.20/0.37 cnf(i_0_36, negated_conjecture, (p5(f10(X1),f10(X2))|~p5(X1,X2))).
% 0.20/0.37 cnf(i_0_37, negated_conjecture, (p3(f9(X1),f9(X2))|~p3(X1,X2))).
% 0.20/0.37 cnf(i_0_38, negated_conjecture, (p3(f8(X1),f8(X2))|~p3(X1,X2))).
% 0.20/0.37 cnf(i_0_39, negated_conjecture, (p3(f11(X1),f11(X2))|~p3(X1,X2))).
% 0.20/0.37 cnf(i_0_42, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))).
% 0.20/0.37 cnf(i_0_43, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.20/0.37 cnf(i_0_44, negated_conjecture, (p15(X1,X2)|~p15(X3,X4)|~p2(X4,X2)|~p2(X3,X1))).
% 0.20/0.37 cnf(i_0_47, negated_conjecture, (p3(f14(X1,X2),f14(X3,X4))|~p2(X1,X3)|~p5(X2,X4))).
% 0.20/0.37 cnf(i_0_49, negated_conjecture, (p2(f6(X1,X2),f6(X3,X4))|~p2(X2,X4)|~p5(X1,X3))).
% 0.20/0.37 cnf(i_0_53, negated_conjecture, (p12(f13(X1),f13(c18))|~p15(f4(f6(f10(X2),f6(f7(f8(f9(c17))),c18)),f11(f14(X1,X2))),X1))).
% 0.20/0.37 cnf(i_0_52, negated_conjecture, (p15(f4(f6(f10(X1),f6(f7(f8(f9(c17))),c18)),f14(X2,X1)),X2)|p12(f13(X2),f13(c18)))).
% 0.20/0.37 cnf(i_0_48, negated_conjecture, (p2(f4(X1,X2),f4(X3,X4))|~p2(X1,X3)|~p3(X2,X4))).
% 0.20/0.37 cnf(i_0_54, negated_conjecture, (p15(f4(f6(f10(X1),f6(f7(f8(f9(c17))),c18)),f11(X2)),X3)|p15(f4(f6(f10(X1),f6(f7(f8(f9(c17))),c18)),f11(X4)),X3)|p3(X2,X4)|p12(f13(X3),f13(c18))|~p15(f4(f6(f10(X1),f6(f7(f8(f9(c17))),c18)),X4),X3)|~p15(f4(f6(f10(X1),f6(f7(f8(f9(c17))),c18)),X2),X3))).
% 0.20/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.37 # Begin printing tableau
% 0.20/0.37 # Found 8 steps
% 0.20/0.37 cnf(i_0_48, negated_conjecture, (p2(f4(X14,X13),f4(X14,X13))|~p2(X14,X14)|~p3(X13,X13)), inference(start_rule)).
% 0.20/0.37 cnf(i_0_62, plain, (~p2(X14,X14)), inference(closure_rule, [i_0_31])).
% 0.20/0.37 cnf(i_0_63, plain, (~p3(X13,X13)), inference(closure_rule, [i_0_30])).
% 0.20/0.37 cnf(i_0_61, plain, (p2(f4(X14,X13),f4(X14,X13))), inference(extension_rule, [i_0_48])).
% 0.20/0.37 cnf(i_0_120, plain, (~p3(X12,X12)), inference(closure_rule, [i_0_30])).
% 0.20/0.37 cnf(i_0_118, plain, (p2(f4(f4(X14,X13),X12),f4(f4(X14,X13),X12))), inference(extension_rule, [i_0_49])).
% 0.20/0.37 cnf(i_0_133, plain, (~p5(X5,X5)), inference(closure_rule, [i_0_29])).
% 0.20/0.37 cnf(i_0_131, plain, (p2(f6(X5,f4(f4(X14,X13),X12)),f6(X5,f4(f4(X14,X13),X12)))), inference(etableau_closure_rule, [i_0_131, ...])).
% 0.20/0.37 # End printing tableau
% 0.20/0.37 # SZS output end
% 0.20/0.37 # Branches closed with saturation will be marked with an "s"
% 0.20/0.37 # There were 1 total branch saturation attempts.
% 0.20/0.37 # There were 0 of these attempts blocked.
% 0.20/0.37 # There were 0 deferred branch saturation attempts.
% 0.20/0.37 # There were 0 free duplicated saturations.
% 0.20/0.37 # There were 1 total successful branch saturations.
% 0.20/0.37 # There were 0 successful branch saturations in interreduction.
% 0.20/0.37 # There were 0 successful branch saturations on the branch.
% 0.20/0.37 # There were 1 successful branch saturations after the branch.
% 0.20/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.37 # Begin clausification derivation
% 0.20/0.37
% 0.20/0.37 # End clausification derivation
% 0.20/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.37 cnf(i_0_46, negated_conjecture, (p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),c21),c20))).
% 0.20/0.37 cnf(i_0_28, negated_conjecture, (p12(X1,X1))).
% 0.20/0.37 cnf(i_0_29, negated_conjecture, (p5(X1,X1))).
% 0.20/0.37 cnf(i_0_30, negated_conjecture, (p3(X1,X1))).
% 0.20/0.37 cnf(i_0_31, negated_conjecture, (p2(X1,X1))).
% 0.20/0.37 cnf(i_0_45, negated_conjecture, (p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),c19),c20))).
% 0.20/0.37 cnf(i_0_32, negated_conjecture, (~p3(c21,c19))).
% 0.20/0.37 cnf(i_0_33, negated_conjecture, (~p12(f13(c20),f13(c18)))).
% 0.20/0.37 cnf(i_0_50, negated_conjecture, (~p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c21)),c20))).
% 0.20/0.37 cnf(i_0_51, negated_conjecture, (~p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c19)),c20))).
% 0.20/0.37 cnf(i_0_40, negated_conjecture, (p12(X1,X2)|~p12(X3,X2)|~p12(X3,X1))).
% 0.20/0.37 cnf(i_0_41, negated_conjecture, (p5(X1,X2)|~p5(X3,X2)|~p5(X3,X1))).
% 0.20/0.37 cnf(i_0_34, negated_conjecture, (p12(f13(X1),f13(X2))|~p2(X1,X2))).
% 0.20/0.37 cnf(i_0_35, negated_conjecture, (p5(f7(X1),f7(X2))|~p3(X1,X2))).
% 0.20/0.37 cnf(i_0_36, negated_conjecture, (p5(f10(X1),f10(X2))|~p5(X1,X2))).
% 0.20/0.37 cnf(i_0_37, negated_conjecture, (p3(f9(X1),f9(X2))|~p3(X1,X2))).
% 0.20/0.37 cnf(i_0_38, negated_conjecture, (p3(f8(X1),f8(X2))|~p3(X1,X2))).
% 0.20/0.37 cnf(i_0_39, negated_conjecture, (p3(f11(X1),f11(X2))|~p3(X1,X2))).
% 0.20/0.37 cnf(i_0_42, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))).
% 0.20/0.37 cnf(i_0_43, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.20/0.37 cnf(i_0_44, negated_conjecture, (p15(X1,X2)|~p15(X3,X4)|~p2(X4,X2)|~p2(X3,X1))).
% 0.20/0.37 cnf(i_0_47, negated_conjecture, (p3(f14(X1,X2),f14(X3,X4))|~p2(X1,X3)|~p5(X2,X4))).
% 0.20/0.37 cnf(i_0_49, negated_conjecture, (p2(f6(X1,X2),f6(X3,X4))|~p2(X2,X4)|~p5(X1,X3))).
% 0.20/0.37 cnf(i_0_53, negated_conjecture, (p12(f13(X1),f13(c18))|~p15(f4(f6(f10(X2),f6(f7(f8(f9(c17))),c18)),f11(f14(X1,X2))),X1))).
% 0.20/0.37 cnf(i_0_52, negated_conjecture, (p15(f4(f6(f10(X1),f6(f7(f8(f9(c17))),c18)),f14(X2,X1)),X2)|p12(f13(X2),f13(c18)))).
% 0.20/0.37 cnf(i_0_48, negated_conjecture, (p2(f4(X1,X2),f4(X3,X4))|~p2(X1,X3)|~p3(X2,X4))).
% 0.20/0.37 cnf(i_0_54, negated_conjecture, (p15(f4(f6(f10(X1),f6(f7(f8(f9(c17))),c18)),f11(X2)),X3)|p15(f4(f6(f10(X1),f6(f7(f8(f9(c17))),c18)),f11(X4)),X3)|p3(X2,X4)|p12(f13(X3),f13(c18))|~p15(f4(f6(f10(X1),f6(f7(f8(f9(c17))),c18)),X4),X3)|~p15(f4(f6(f10(X1),f6(f7(f8(f9(c17))),c18)),X2),X3))).
% 0.20/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.37 # Begin printing tableau
% 0.20/0.37 # Found 8 steps
% 0.20/0.37 cnf(i_0_49, negated_conjecture, (p2(f6(X14,X13),f6(X14,X13))|~p2(X13,X13)|~p5(X14,X14)), inference(start_rule)).
% 0.20/0.37 cnf(i_0_69, plain, (~p2(X13,X13)), inference(closure_rule, [i_0_31])).
% 0.20/0.37 cnf(i_0_70, plain, (~p5(X14,X14)), inference(closure_rule, [i_0_29])).
% 0.20/0.37 cnf(i_0_68, plain, (p2(f6(X14,X13),f6(X14,X13))), inference(extension_rule, [i_0_48])).
% 0.20/0.37 cnf(i_0_120, plain, (~p3(X12,X12)), inference(closure_rule, [i_0_30])).
% 0.20/0.37 cnf(i_0_118, plain, (p2(f4(f6(X14,X13),X12),f4(f6(X14,X13),X12))), inference(extension_rule, [i_0_49])).
% 0.20/0.37 cnf(i_0_133, plain, (~p5(X5,X5)), inference(closure_rule, [i_0_29])).
% 0.20/0.37 cnf(i_0_131, plain, (p2(f6(X5,f4(f6(X14,X13),X12)),f6(X5,f4(f6(X14,X13),X12)))), inference(etableau_closure_rule, [i_0_131, ...])).
% 0.20/0.37 # End printing tableau
% 0.20/0.37 # SZS output end
% 0.20/0.37 # Branches closed with saturation will be marked with an "s"
% 0.20/0.37 # There were 1 total branch saturation attempts.
% 0.20/0.37 # There were 0 of these attempts blocked.
% 0.20/0.37 # There were 0 deferred branch saturation attempts.
% 0.20/0.37 # There were 0 free duplicated saturations.
% 0.20/0.37 # There were 1 total successful branch saturations.
% 0.20/0.37 # There were 0 successful branch saturations in interreduction.
% 0.20/0.37 # There were 0 successful branch saturations on the branch.
% 0.20/0.37 # There were 1 successful branch saturations after the branch.
% 0.20/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.37 # Begin clausification derivation
% 0.20/0.37
% 0.20/0.37 # End clausification derivation
% 0.20/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.37 cnf(i_0_46, negated_conjecture, (p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),c21),c20))).
% 0.20/0.37 cnf(i_0_28, negated_conjecture, (p12(X1,X1))).
% 0.20/0.37 cnf(i_0_29, negated_conjecture, (p5(X1,X1))).
% 0.20/0.37 cnf(i_0_30, negated_conjecture, (p3(X1,X1))).
% 0.20/0.37 cnf(i_0_31, negated_conjecture, (p2(X1,X1))).
% 0.20/0.37 cnf(i_0_45, negated_conjecture, (p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),c19),c20))).
% 0.20/0.37 cnf(i_0_32, negated_conjecture, (~p3(c21,c19))).
% 0.20/0.37 cnf(i_0_33, negated_conjecture, (~p12(f13(c20),f13(c18)))).
% 0.20/0.37 cnf(i_0_50, negated_conjecture, (~p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c21)),c20))).
% 0.20/0.37 cnf(i_0_51, negated_conjecture, (~p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c19)),c20))).
% 0.20/0.37 cnf(i_0_40, negated_conjecture, (p12(X1,X2)|~p12(X3,X2)|~p12(X3,X1))).
% 0.20/0.37 cnf(i_0_41, negated_conjecture, (p5(X1,X2)|~p5(X3,X2)|~p5(X3,X1))).
% 0.20/0.37 cnf(i_0_34, negated_conjecture, (p12(f13(X1),f13(X2))|~p2(X1,X2))).
% 0.20/0.37 cnf(i_0_35, negated_conjecture, (p5(f7(X1),f7(X2))|~p3(X1,X2))).
% 0.20/0.37 cnf(i_0_36, negated_conjecture, (p5(f10(X1),f10(X2))|~p5(X1,X2))).
% 0.20/0.37 cnf(i_0_37, negated_conjecture, (p3(f9(X1),f9(X2))|~p3(X1,X2))).
% 0.20/0.37 cnf(i_0_38, negated_conjecture, (p3(f8(X1),f8(X2))|~p3(X1,X2))).
% 0.20/0.37 cnf(i_0_39, negated_conjecture, (p3(f11(X1),f11(X2))|~p3(X1,X2))).
% 0.20/0.37 cnf(i_0_42, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))).
% 0.20/0.37 cnf(i_0_43, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.20/0.37 cnf(i_0_44, negated_conjecture, (p15(X1,X2)|~p15(X3,X4)|~p2(X4,X2)|~p2(X3,X1))).
% 0.20/0.37 cnf(i_0_47, negated_conjecture, (p3(f14(X1,X2),f14(X3,X4))|~p2(X1,X3)|~p5(X2,X4))).
% 0.20/0.37 cnf(i_0_49, negated_conjecture, (p2(f6(X1,X2),f6(X3,X4))|~p2(X2,X4)|~p5(X1,X3))).
% 0.20/0.37 cnf(i_0_53, negated_conjecture, (p12(f13(X1),f13(c18))|~p15(f4(f6(f10(X2),f6(f7(f8(f9(c17))),c18)),f11(f14(X1,X2))),X1))).
% 0.20/0.37 cnf(i_0_52, negated_conjecture, (p15(f4(f6(f10(X1),f6(f7(f8(f9(c17))),c18)),f14(X2,X1)),X2)|p12(f13(X2),f13(c18)))).
% 0.20/0.37 cnf(i_0_48, negated_conjecture, (p2(f4(X1,X2),f4(X3,X4))|~p2(X1,X3)|~p3(X2,X4))).
% 0.20/0.37 cnf(i_0_54, negated_conjecture, (p15(f4(f6(f10(X1),f6(f7(f8(f9(c17))),c18)),f11(X2)),X3)|p15(f4(f6(f10(X1),f6(f7(f8(f9(c17))),c18)),f11(X4)),X3)|p3(X2,X4)|p12(f13(X3),f13(c18))|~p15(f4(f6(f10(X1),f6(f7(f8(f9(c17))),c18)),X4),X3)|~p15(f4(f6(f10(X1),f6(f7(f8(f9(c17))),c18)),X2),X3))).
% 0.20/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.37 # Begin printing tableau
% 0.20/0.37 # Found 8 steps
% 0.20/0.37 cnf(i_0_47, negated_conjecture, (p3(f14(X10,X13),f14(X10,X13))|~p2(X10,X10)|~p5(X13,X13)), inference(start_rule)).
% 0.20/0.37 cnf(i_0_72, plain, (~p2(X10,X10)), inference(closure_rule, [i_0_31])).
% 0.20/0.37 cnf(i_0_73, plain, (~p5(X13,X13)), inference(closure_rule, [i_0_29])).
% 0.20/0.37 cnf(i_0_71, plain, (p3(f14(X10,X13),f14(X10,X13))), inference(extension_rule, [i_0_48])).
% 0.20/0.37 cnf(i_0_119, plain, (~p2(X14,X14)), inference(closure_rule, [i_0_31])).
% 0.20/0.37 cnf(i_0_118, plain, (p2(f4(X14,f14(X10,X13)),f4(X14,f14(X10,X13)))), inference(extension_rule, [i_0_49])).
% 0.20/0.37 cnf(i_0_133, plain, (~p5(X6,X6)), inference(closure_rule, [i_0_29])).
% 0.20/0.37 cnf(i_0_131, plain, (p2(f6(X6,f4(X14,f14(X10,X13))),f6(X6,f4(X14,f14(X10,X13))))), inference(etableau_closure_rule, [i_0_131, ...])).
% 0.20/0.37 # End printing tableau
% 0.20/0.37 # SZS output end
% 0.20/0.37 # Branches closed with saturation will be marked with an "s"
% 0.20/0.37 # There were 1 total branch saturation attempts.
% 0.20/0.37 # There were 0 of these attempts blocked.
% 0.20/0.37 # There were 0 deferred branch saturation attempts.
% 0.20/0.37 # There were 0 free duplicated saturations.
% 0.20/0.37 # There were 1 total successful branch saturations.
% 0.20/0.37 # There were 0 successful branch saturations in interreduction.
% 0.20/0.37 # There were 0 successful branch saturations on the branch.
% 0.20/0.37 # There were 1 successful branch saturations after the branch.
% 0.20/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.37 # Begin clausification derivation
% 0.20/0.37
% 0.20/0.37 # End clausification derivation
% 0.20/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.37 cnf(i_0_46, negated_conjecture, (p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),c21),c20))).
% 0.20/0.37 cnf(i_0_28, negated_conjecture, (p12(X1,X1))).
% 0.20/0.37 cnf(i_0_29, negated_conjecture, (p5(X1,X1))).
% 0.20/0.37 cnf(i_0_30, negated_conjecture, (p3(X1,X1))).
% 0.20/0.37 cnf(i_0_31, negated_conjecture, (p2(X1,X1))).
% 0.20/0.37 cnf(i_0_45, negated_conjecture, (p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),c19),c20))).
% 0.20/0.37 cnf(i_0_32, negated_conjecture, (~p3(c21,c19))).
% 0.20/0.37 cnf(i_0_33, negated_conjecture, (~p12(f13(c20),f13(c18)))).
% 0.20/0.37 cnf(i_0_50, negated_conjecture, (~p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c21)),c20))).
% 0.20/0.37 cnf(i_0_51, negated_conjecture, (~p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c19)),c20))).
% 0.20/0.37 cnf(i_0_40, negated_conjecture, (p12(X1,X2)|~p12(X3,X2)|~p12(X3,X1))).
% 0.20/0.37 cnf(i_0_41, negated_conjecture, (p5(X1,X2)|~p5(X3,X2)|~p5(X3,X1))).
% 0.20/0.37 cnf(i_0_34, negated_conjecture, (p12(f13(X1),f13(X2))|~p2(X1,X2))).
% 0.20/0.37 cnf(i_0_35, negated_conjecture, (p5(f7(X1),f7(X2))|~p3(X1,X2))).
% 0.20/0.37 cnf(i_0_36, negated_conjecture, (p5(f10(X1),f10(X2))|~p5(X1,X2))).
% 0.20/0.37 cnf(i_0_37, negated_conjecture, (p3(f9(X1),f9(X2))|~p3(X1,X2))).
% 0.20/0.37 cnf(i_0_38, negated_conjecture, (p3(f8(X1),f8(X2))|~p3(X1,X2))).
% 0.20/0.37 cnf(i_0_39, negated_conjecture, (p3(f11(X1),f11(X2))|~p3(X1,X2))).
% 0.20/0.37 cnf(i_0_42, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))).
% 0.20/0.37 cnf(i_0_43, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.20/0.37 cnf(i_0_44, negated_conjecture, (p15(X1,X2)|~p15(X3,X4)|~p2(X4,X2)|~p2(X3,X1))).
% 0.20/0.37 cnf(i_0_47, negated_conjecture, (p3(f14(X1,X2),f14(X3,X4))|~p2(X1,X3)|~p5(X2,X4))).
% 0.20/0.37 cnf(i_0_49, negated_conjecture, (p2(f6(X1,X2),f6(X3,X4))|~p2(X2,X4)|~p5(X1,X3))).
% 0.20/0.37 cnf(i_0_53, negated_conjecture, (p12(f13(X1),f13(c18))|~p15(f4(f6(f10(X2),f6(f7(f8(f9(c17))),c18)),f11(f14(X1,X2))),X1))).
% 0.20/0.37 cnf(i_0_52, negated_conjecture, (p15(f4(f6(f10(X1),f6(f7(f8(f9(c17))),c18)),f14(X2,X1)),X2)|p12(f13(X2),f13(c18)))).
% 0.20/0.37 cnf(i_0_48, negated_conjecture, (p2(f4(X1,X2),f4(X3,X4))|~p2(X1,X3)|~p3(X2,X4))).
% 0.20/0.37 cnf(i_0_54, negated_conjecture, (p15(f4(f6(f10(X1),f6(f7(f8(f9(c17))),c18)),f11(X2)),X3)|p15(f4(f6(f10(X1),f6(f7(f8(f9(c17))),c18)),f11(X4)),X3)|p3(X2,X4)|p12(f13(X3),f13(c18))|~p15(f4(f6(f10(X1),f6(f7(f8(f9(c17))),c18)),X4),X3)|~p15(f4(f6(f10(X1),f6(f7(f8(f9(c17))),c18)),X2),X3))).
% 0.20/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.37 # Begin printing tableau
% 0.20/0.37 # Found 8 steps
% 0.20/0.37 cnf(i_0_53, negated_conjecture, (p12(f13(c20),f13(c18))|~p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(f14(c20,c16))),c20)), inference(start_rule)).
% 0.20/0.37 cnf(i_0_66, plain, (p12(f13(c20),f13(c18))), inference(closure_rule, [i_0_33])).
% 0.20/0.37 cnf(i_0_67, plain, (~p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(f14(c20,c16))),c20)), inference(extension_rule, [i_0_44])).
% 0.20/0.37 cnf(i_0_132, plain, (~p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),c19),c20)), inference(closure_rule, [i_0_45])).
% 0.20/0.37 cnf(i_0_133, plain, (~p2(c20,c20)), inference(closure_rule, [i_0_31])).
% 0.20/0.37 cnf(i_0_134, plain, (~p2(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),c19),f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(f14(c20,c16))))), inference(extension_rule, [i_0_48])).
% 0.20/0.37 cnf(i_0_142, plain, (~p2(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f6(f10(c16),f6(f7(f8(f9(c17))),c18)))), inference(closure_rule, [i_0_31])).
% 0.20/0.37 cnf(i_0_143, plain, (~p3(c19,f11(f14(c20,c16)))), inference(etableau_closure_rule, [i_0_143, ...])).
% 0.20/0.37 # End printing tableau
% 0.20/0.37 # SZS output end
% 0.20/0.37 # Branches closed with saturation will be marked with an "s"
% 0.20/0.37 # Child (5523) has found a proof.
% 0.20/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.37 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.37 # Begin clausification derivation
% 0.20/0.37
% 0.20/0.37 # End clausification derivation
% 0.20/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.37 cnf(i_0_46, negated_conjecture, (p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),c21),c20))).
% 0.20/0.37 cnf(i_0_28, negated_conjecture, (p12(X1,X1))).
% 0.20/0.37 cnf(i_0_29, negated_conjecture, (p5(X1,X1))).
% 0.20/0.37 cnf(i_0_30, negated_conjecture, (p3(X1,X1))).
% 0.20/0.37 cnf(i_0_31, negated_conjecture, (p2(X1,X1))).
% 0.20/0.37 cnf(i_0_45, negated_conjecture, (p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),c19),c20))).
% 0.20/0.37 cnf(i_0_32, negated_conjecture, (~p3(c21,c19))).
% 0.20/0.37 cnf(i_0_33, negated_conjecture, (~p12(f13(c20),f13(c18)))).
% 0.20/0.37 cnf(i_0_50, negated_conjecture, (~p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c21)),c20))).
% 0.20/0.37 cnf(i_0_51, negated_conjecture, (~p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c19)),c20))).
% 0.20/0.37 cnf(i_0_40, negated_conjecture, (p12(X1,X2)|~p12(X3,X2)|~p12(X3,X1))).
% 0.20/0.37 cnf(i_0_41, negated_conjecture, (p5(X1,X2)|~p5(X3,X2)|~p5(X3,X1))).
% 0.20/0.37 cnf(i_0_34, negated_conjecture, (p12(f13(X1),f13(X2))|~p2(X1,X2))).
% 0.20/0.37 cnf(i_0_35, negated_conjecture, (p5(f7(X1),f7(X2))|~p3(X1,X2))).
% 0.20/0.37 cnf(i_0_36, negated_conjecture, (p5(f10(X1),f10(X2))|~p5(X1,X2))).
% 0.20/0.37 cnf(i_0_37, negated_conjecture, (p3(f9(X1),f9(X2))|~p3(X1,X2))).
% 0.20/0.37 cnf(i_0_38, negated_conjecture, (p3(f8(X1),f8(X2))|~p3(X1,X2))).
% 0.20/0.37 cnf(i_0_39, negated_conjecture, (p3(f11(X1),f11(X2))|~p3(X1,X2))).
% 0.20/0.37 cnf(i_0_42, negated_conjecture, (p3(X1,X2)|~p3(X3,X2)|~p3(X3,X1))).
% 0.20/0.37 cnf(i_0_43, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.20/0.37 cnf(i_0_44, negated_conjecture, (p15(X1,X2)|~p15(X3,X4)|~p2(X4,X2)|~p2(X3,X1))).
% 0.20/0.37 cnf(i_0_47, negated_conjecture, (p3(f14(X1,X2),f14(X3,X4))|~p2(X1,X3)|~p5(X2,X4))).
% 0.20/0.37 cnf(i_0_49, negated_conjecture, (p2(f6(X1,X2),f6(X3,X4))|~p2(X2,X4)|~p5(X1,X3))).
% 0.20/0.37 cnf(i_0_53, negated_conjecture, (p12(f13(X1),f13(c18))|~p15(f4(f6(f10(X2),f6(f7(f8(f9(c17))),c18)),f11(f14(X1,X2))),X1))).
% 0.20/0.37 cnf(i_0_52, negated_conjecture, (p15(f4(f6(f10(X1),f6(f7(f8(f9(c17))),c18)),f14(X2,X1)),X2)|p12(f13(X2),f13(c18)))).
% 0.20/0.37 cnf(i_0_48, negated_conjecture, (p2(f4(X1,X2),f4(X3,X4))|~p2(X1,X3)|~p3(X2,X4))).
% 0.20/0.37 cnf(i_0_54, negated_conjecture, (p15(f4(f6(f10(X1),f6(f7(f8(f9(c17))),c18)),f11(X2)),X3)|p15(f4(f6(f10(X1),f6(f7(f8(f9(c17))),c18)),f11(X4)),X3)|p3(X2,X4)|p12(f13(X3),f13(c18))|~p15(f4(f6(f10(X1),f6(f7(f8(f9(c17))),c18)),X4),X3)|~p15(f4(f6(f10(X1),f6(f7(f8(f9(c17))),c18)),X2),X3))).
% 0.20/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.37 # Begin printing tableau
% 0.20/0.37 # Found 11 steps
% 0.20/0.37 cnf(i_0_54, negated_conjecture, (p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c19)),c20)|p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c19)),c20)|p3(c19,c19)|p12(f13(c20),f13(c18))|~p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),c19),c20)|~p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),c19),c20)), inference(start_rule)).
% 0.20/0.37 cnf(i_0_55, plain, (p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c19)),c20)), inference(closure_rule, [i_0_51])).
% 0.20/0.37 cnf(i_0_56, plain, (p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c19)),c20)), inference(closure_rule, [i_0_51])).
% 0.20/0.37 cnf(i_0_58, plain, (p12(f13(c20),f13(c18))), inference(closure_rule, [i_0_33])).
% 0.20/0.37 cnf(i_0_59, plain, (~p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),c19),c20)), inference(closure_rule, [i_0_45])).
% 0.20/0.37 cnf(i_0_60, plain, (~p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),c19),c20)), inference(closure_rule, [i_0_45])).
% 0.20/0.37 cnf(i_0_57, plain, (p3(c19,c19)), inference(extension_rule, [i_0_48])).
% 0.20/0.37 cnf(i_0_119, plain, (~p2(X10,X10)), inference(closure_rule, [i_0_31])).
% 0.20/0.37 cnf(i_0_118, plain, (p2(f4(X10,c19),f4(X10,c19))), inference(extension_rule, [i_0_49])).
% 0.20/0.37 cnf(i_0_133, plain, (~p5(X6,X6)), inference(closure_rule, [i_0_29])).
% 0.20/0.37 cnf(i_0_131, plain, (p2(f6(X6,f4(X10,c19)),f6(X6,f4(X10,c19)))), inference(etableau_closure_rule, [i_0_131, ...])).
% 0.20/0.37 # End printing tableau
% 0.20/0.37 # SZS output end
% 0.20/0.37 # Branches closed with saturation will be marked with an "s"
% 0.20/0.37
% 0.20/0.37 # Proof search is over...
% 0.20/0.37 # Freeing feature tree
%------------------------------------------------------------------------------