TSTP Solution File: SYN557-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN557-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 : n019.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:26 EDT 2022
% Result : Unsatisfiable 0.21s 0.38s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN557-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.34 % Computer : n019.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 : Tue Jul 12 08:00:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic G_E___107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S071I
% 0.13/0.37 # and selection function SelectCQArEqLast.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 13 Number of unprocessed: 13
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.13/0.37 # The folding up rule is enabled...
% 0.13/0.37 # Local unification is enabled...
% 0.13/0.37 # Any saturation attempts will use folding labels...
% 0.13/0.37 # 13 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 13 conjectures.
% 0.13/0.37 # There are 13 start rule candidates:
% 0.13/0.37 # Found 7 unit axioms.
% 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.37 # 13 start rule tableaux created.
% 0.13/0.37 # 6 extension rule candidate clauses
% 0.13/0.37 # 7 unit axiom clauses
% 0.13/0.37
% 0.13/0.37 # Requested 8, 32 cores available to the main process.
% 0.21/0.38 # There were 1 total branch saturation attempts.
% 0.21/0.38 # There were 0 of these attempts blocked.
% 0.21/0.38 # There were 0 deferred branch saturation attempts.
% 0.21/0.38 # There were 0 free duplicated saturations.
% 0.21/0.38 # There were 1 total successful branch saturations.
% 0.21/0.38 # There were 0 successful branch saturations in interreduction.
% 0.21/0.38 # There were 0 successful branch saturations on the branch.
% 0.21/0.38 # There were 1 successful branch saturations after the branch.
% 0.21/0.38 # There were 1 total branch saturation attempts.
% 0.21/0.38 # There were 0 of these attempts blocked.
% 0.21/0.38 # There were 0 deferred branch saturation attempts.
% 0.21/0.38 # There were 0 free duplicated saturations.
% 0.21/0.38 # There were 1 total successful branch saturations.
% 0.21/0.38 # There were 0 successful branch saturations in interreduction.
% 0.21/0.38 # There were 0 successful branch saturations on the branch.
% 0.21/0.38 # There were 1 successful branch saturations after the branch.
% 0.21/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.38 # Begin clausification derivation
% 0.21/0.38
% 0.21/0.38 # End clausification derivation
% 0.21/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.38 cnf(i_0_14, negated_conjecture, (p2(X1,X1))).
% 0.21/0.38 cnf(i_0_15, negated_conjecture, (p4(X1,X1))).
% 0.21/0.38 cnf(i_0_17, negated_conjecture, (p2(f3(X1,X2),f3(X2,X1)))).
% 0.21/0.38 cnf(i_0_25, negated_conjecture, (p2(f3(c6,f5(c7)),f3(c8,f3(f5(c7),f5(c9)))))).
% 0.21/0.38 cnf(i_0_23, negated_conjecture, (p2(f3(X1,f3(X2,X3)),f3(X2,f3(X1,X3))))).
% 0.21/0.38 cnf(i_0_24, negated_conjecture, (p2(f3(f3(X1,X2),X3),f3(X1,f3(X2,X3))))).
% 0.21/0.38 cnf(i_0_16, negated_conjecture, (~p2(c6,f3(c8,f5(c9))))).
% 0.21/0.38 cnf(i_0_18, negated_conjecture, (p2(f5(X1),f5(X2))|~p4(X1,X2))).
% 0.21/0.38 cnf(i_0_19, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.21/0.38 cnf(i_0_20, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))).
% 0.21/0.38 cnf(i_0_22, negated_conjecture, (p2(f3(X1,X2),f3(X3,X2))|~p2(X1,X3))).
% 0.21/0.38 cnf(i_0_21, negated_conjecture, (p2(X1,X2)|~p2(f3(X1,X3),f3(X2,X3)))).
% 0.21/0.38 cnf(i_0_26, negated_conjecture, (p2(f3(X1,X2),f3(X3,X4))|~p2(X2,X4)|~p2(X1,X3))).
% 0.21/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.38 # Begin printing tableau
% 0.21/0.38 # Found 5 steps
% 0.21/0.38 cnf(i_0_16, negated_conjecture, (~p2(c6,f3(c8,f5(c9)))), inference(start_rule)).
% 0.21/0.38 cnf(i_0_42, plain, (~p2(c6,f3(c8,f5(c9)))), inference(extension_rule, [i_0_21])).
% 0.21/0.38 cnf(i_0_53, plain, (~p2(f3(c6,f3(X2,X3)),f3(f3(c8,f5(c9)),f3(X2,X3)))), inference(extension_rule, [i_0_19])).
% 0.21/0.38 cnf(i_0_63, plain, (~p2(f3(f3(f3(c8,f5(c9)),X2),X3),f3(f3(c8,f5(c9)),f3(X2,X3)))), inference(closure_rule, [i_0_24])).
% 0.21/0.38 cnf(i_0_64, plain, (~p2(f3(f3(f3(c8,f5(c9)),X2),X3),f3(c6,f3(X2,X3)))), inference(etableau_closure_rule, [i_0_64, ...])).
% 0.21/0.38 # End printing tableau
% 0.21/0.38 # SZS output end
% 0.21/0.38 # Branches closed with saturation will be marked with an "s"
% 0.21/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.38 # Begin clausification derivation
% 0.21/0.38
% 0.21/0.38 # End clausification derivation
% 0.21/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.38 cnf(i_0_14, negated_conjecture, (p2(X1,X1))).
% 0.21/0.38 cnf(i_0_15, negated_conjecture, (p4(X1,X1))).
% 0.21/0.38 cnf(i_0_17, negated_conjecture, (p2(f3(X1,X2),f3(X2,X1)))).
% 0.21/0.38 cnf(i_0_25, negated_conjecture, (p2(f3(c6,f5(c7)),f3(c8,f3(f5(c7),f5(c9)))))).
% 0.21/0.38 cnf(i_0_23, negated_conjecture, (p2(f3(X1,f3(X2,X3)),f3(X2,f3(X1,X3))))).
% 0.21/0.38 cnf(i_0_24, negated_conjecture, (p2(f3(f3(X1,X2),X3),f3(X1,f3(X2,X3))))).
% 0.21/0.38 cnf(i_0_16, negated_conjecture, (~p2(c6,f3(c8,f5(c9))))).
% 0.21/0.38 cnf(i_0_18, negated_conjecture, (p2(f5(X1),f5(X2))|~p4(X1,X2))).
% 0.21/0.38 cnf(i_0_19, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.21/0.38 cnf(i_0_20, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))).
% 0.21/0.38 cnf(i_0_22, negated_conjecture, (p2(f3(X1,X2),f3(X3,X2))|~p2(X1,X3))).
% 0.21/0.38 cnf(i_0_21, negated_conjecture, (p2(X1,X2)|~p2(f3(X1,X3),f3(X2,X3)))).
% 0.21/0.38 cnf(i_0_26, negated_conjecture, (p2(f3(X1,X2),f3(X3,X4))|~p2(X2,X4)|~p2(X1,X3))).
% 0.21/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.38 # Begin printing tableau
% 0.21/0.38 # Found 7 steps
% 0.21/0.38 cnf(i_0_20, negated_conjecture, (p4(X9,X9)|~p4(X9,X9)|~p4(X9,X9)), inference(start_rule)).
% 0.21/0.38 cnf(i_0_35, plain, (~p4(X9,X9)), inference(closure_rule, [i_0_15])).
% 0.21/0.38 cnf(i_0_36, plain, (~p4(X9,X9)), inference(closure_rule, [i_0_15])).
% 0.21/0.38 cnf(i_0_34, plain, (p4(X9,X9)), inference(extension_rule, [i_0_18])).
% 0.21/0.38 cnf(i_0_62, plain, (p2(f5(X9),f5(X9))), inference(extension_rule, [i_0_26])).
% 0.21/0.38 cnf(i_0_66, plain, (~p2(f3(f3(X1,X2),X3),f3(X1,f3(X2,X3)))), inference(closure_rule, [i_0_24])).
% 0.21/0.38 cnf(i_0_64, plain, (p2(f3(f3(f3(X1,X2),X3),f5(X9)),f3(f3(X1,f3(X2,X3)),f5(X9)))), inference(etableau_closure_rule, [i_0_64, ...])).
% 0.21/0.38 # End printing tableau
% 0.21/0.38 # SZS output end
% 0.21/0.38 # Branches closed with saturation will be marked with an "s"
% 0.21/0.38 # There were 1 total branch saturation attempts.
% 0.21/0.38 # There were 0 of these attempts blocked.
% 0.21/0.38 # There were 0 deferred branch saturation attempts.
% 0.21/0.38 # There were 0 free duplicated saturations.
% 0.21/0.38 # There were 1 total successful branch saturations.
% 0.21/0.38 # There were 0 successful branch saturations in interreduction.
% 0.21/0.38 # There were 0 successful branch saturations on the branch.
% 0.21/0.38 # There were 1 successful branch saturations after the branch.
% 0.21/0.38 # There were 1 total branch saturation attempts.
% 0.21/0.38 # There were 0 of these attempts blocked.
% 0.21/0.38 # There were 0 deferred branch saturation attempts.
% 0.21/0.38 # There were 0 free duplicated saturations.
% 0.21/0.38 # There were 1 total successful branch saturations.
% 0.21/0.38 # There were 0 successful branch saturations in interreduction.
% 0.21/0.38 # There were 0 successful branch saturations on the branch.
% 0.21/0.38 # There were 1 successful branch saturations after the branch.
% 0.21/0.38 # There were 1 total branch saturation attempts.
% 0.21/0.38 # There were 0 of these attempts blocked.
% 0.21/0.38 # There were 0 deferred branch saturation attempts.
% 0.21/0.38 # There were 0 free duplicated saturations.
% 0.21/0.38 # There were 1 total successful branch saturations.
% 0.21/0.38 # There were 0 successful branch saturations in interreduction.
% 0.21/0.38 # There were 0 successful branch saturations on the branch.
% 0.21/0.38 # There were 1 successful branch saturations after the branch.
% 0.21/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.38 # Begin clausification derivation
% 0.21/0.38
% 0.21/0.38 # End clausification derivation
% 0.21/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.38 cnf(i_0_14, negated_conjecture, (p2(X1,X1))).
% 0.21/0.38 cnf(i_0_15, negated_conjecture, (p4(X1,X1))).
% 0.21/0.38 cnf(i_0_17, negated_conjecture, (p2(f3(X1,X2),f3(X2,X1)))).
% 0.21/0.38 cnf(i_0_25, negated_conjecture, (p2(f3(c6,f5(c7)),f3(c8,f3(f5(c7),f5(c9)))))).
% 0.21/0.38 cnf(i_0_23, negated_conjecture, (p2(f3(X1,f3(X2,X3)),f3(X2,f3(X1,X3))))).
% 0.21/0.38 cnf(i_0_24, negated_conjecture, (p2(f3(f3(X1,X2),X3),f3(X1,f3(X2,X3))))).
% 0.21/0.38 cnf(i_0_16, negated_conjecture, (~p2(c6,f3(c8,f5(c9))))).
% 0.21/0.38 cnf(i_0_18, negated_conjecture, (p2(f5(X1),f5(X2))|~p4(X1,X2))).
% 0.21/0.38 cnf(i_0_19, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.21/0.38 cnf(i_0_20, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))).
% 0.21/0.38 cnf(i_0_22, negated_conjecture, (p2(f3(X1,X2),f3(X3,X2))|~p2(X1,X3))).
% 0.21/0.38 cnf(i_0_21, negated_conjecture, (p2(X1,X2)|~p2(f3(X1,X3),f3(X2,X3)))).
% 0.21/0.38 cnf(i_0_26, negated_conjecture, (p2(f3(X1,X2),f3(X3,X4))|~p2(X2,X4)|~p2(X1,X3))).
% 0.21/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.38 # Begin printing tableau
% 0.21/0.38 # Found 6 steps
% 0.21/0.38 cnf(i_0_18, negated_conjecture, (p2(f5(X7),f5(X7))|~p4(X7,X7)), inference(start_rule)).
% 0.21/0.38 cnf(i_0_41, plain, (~p4(X7,X7)), inference(closure_rule, [i_0_15])).
% 0.21/0.38 cnf(i_0_40, plain, (p2(f5(X7),f5(X7))), inference(extension_rule, [i_0_26])).
% 0.21/0.38 cnf(i_0_51, plain, (~p2(f3(f3(X11,X10),X8),f3(X11,f3(X10,X8)))), inference(closure_rule, [i_0_24])).
% 0.21/0.38 cnf(i_0_49, plain, (p2(f3(f3(f3(X11,X10),X8),f5(X7)),f3(f3(X11,f3(X10,X8)),f5(X7)))), inference(extension_rule, [i_0_22])).
% 0.21/0.38 cnf(i_0_54, plain, (p2(f3(f3(f3(f3(X11,X10),X8),f5(X7)),X5),f3(f3(f3(X11,f3(X10,X8)),f5(X7)),X5))), inference(etableau_closure_rule, [i_0_54, ...])).
% 0.21/0.38 # End printing tableau
% 0.21/0.38 # SZS output end
% 0.21/0.38 # Branches closed with saturation will be marked with an "s"
% 0.21/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.38 # Begin clausification derivation
% 0.21/0.38
% 0.21/0.38 # End clausification derivation
% 0.21/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.38 cnf(i_0_14, negated_conjecture, (p2(X1,X1))).
% 0.21/0.38 cnf(i_0_15, negated_conjecture, (p4(X1,X1))).
% 0.21/0.38 cnf(i_0_17, negated_conjecture, (p2(f3(X1,X2),f3(X2,X1)))).
% 0.21/0.38 cnf(i_0_25, negated_conjecture, (p2(f3(c6,f5(c7)),f3(c8,f3(f5(c7),f5(c9)))))).
% 0.21/0.38 cnf(i_0_23, negated_conjecture, (p2(f3(X1,f3(X2,X3)),f3(X2,f3(X1,X3))))).
% 0.21/0.38 cnf(i_0_24, negated_conjecture, (p2(f3(f3(X1,X2),X3),f3(X1,f3(X2,X3))))).
% 0.21/0.38 cnf(i_0_16, negated_conjecture, (~p2(c6,f3(c8,f5(c9))))).
% 0.21/0.38 cnf(i_0_18, negated_conjecture, (p2(f5(X1),f5(X2))|~p4(X1,X2))).
% 0.21/0.38 cnf(i_0_19, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.21/0.38 cnf(i_0_20, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))).
% 0.21/0.38 cnf(i_0_22, negated_conjecture, (p2(f3(X1,X2),f3(X3,X2))|~p2(X1,X3))).
% 0.21/0.38 cnf(i_0_21, negated_conjecture, (p2(X1,X2)|~p2(f3(X1,X3),f3(X2,X3)))).
% 0.21/0.38 cnf(i_0_26, negated_conjecture, (p2(f3(X1,X2),f3(X3,X4))|~p2(X2,X4)|~p2(X1,X3))).
% 0.21/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.38 # Begin printing tableau
% 0.21/0.38 # Found 5 steps
% 0.21/0.38 cnf(i_0_24, negated_conjecture, (p2(f3(f3(X7,X8),X12),f3(X7,f3(X8,X12)))), inference(start_rule)).
% 0.21/0.38 cnf(i_0_43, plain, (p2(f3(f3(X7,X8),X12),f3(X7,f3(X8,X12)))), inference(extension_rule, [i_0_26])).
% 0.21/0.38 cnf(i_0_51, plain, (~p2(f3(f3(X15,X14),X13),f3(X15,f3(X14,X13)))), inference(closure_rule, [i_0_24])).
% 0.21/0.38 cnf(i_0_49, plain, (p2(f3(f3(f3(X15,X14),X13),f3(f3(X7,X8),X12)),f3(f3(X15,f3(X14,X13)),f3(X7,f3(X8,X12))))), inference(extension_rule, [i_0_22])).
% 0.21/0.38 cnf(i_0_54, plain, (p2(f3(f3(f3(f3(X15,X14),X13),f3(f3(X7,X8),X12)),X5),f3(f3(f3(X15,f3(X14,X13)),f3(X7,f3(X8,X12))),X5))), inference(etableau_closure_rule, [i_0_54, ...])).
% 0.21/0.38 # End printing tableau
% 0.21/0.38 # SZS output end
% 0.21/0.38 # Branches closed with saturation will be marked with an "s"
% 0.21/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.38 # Begin clausification derivation
% 0.21/0.38
% 0.21/0.38 # End clausification derivation
% 0.21/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.38 cnf(i_0_14, negated_conjecture, (p2(X1,X1))).
% 0.21/0.38 cnf(i_0_15, negated_conjecture, (p4(X1,X1))).
% 0.21/0.38 cnf(i_0_17, negated_conjecture, (p2(f3(X1,X2),f3(X2,X1)))).
% 0.21/0.38 cnf(i_0_25, negated_conjecture, (p2(f3(c6,f5(c7)),f3(c8,f3(f5(c7),f5(c9)))))).
% 0.21/0.38 cnf(i_0_23, negated_conjecture, (p2(f3(X1,f3(X2,X3)),f3(X2,f3(X1,X3))))).
% 0.21/0.38 cnf(i_0_24, negated_conjecture, (p2(f3(f3(X1,X2),X3),f3(X1,f3(X2,X3))))).
% 0.21/0.38 cnf(i_0_16, negated_conjecture, (~p2(c6,f3(c8,f5(c9))))).
% 0.21/0.38 cnf(i_0_18, negated_conjecture, (p2(f5(X1),f5(X2))|~p4(X1,X2))).
% 0.21/0.38 cnf(i_0_19, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.21/0.38 cnf(i_0_20, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))).
% 0.21/0.38 cnf(i_0_22, negated_conjecture, (p2(f3(X1,X2),f3(X3,X2))|~p2(X1,X3))).
% 0.21/0.38 cnf(i_0_21, negated_conjecture, (p2(X1,X2)|~p2(f3(X1,X3),f3(X2,X3)))).
% 0.21/0.38 cnf(i_0_26, negated_conjecture, (p2(f3(X1,X2),f3(X3,X4))|~p2(X2,X4)|~p2(X1,X3))).
% 0.21/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.38 # Begin printing tableau
% 0.21/0.38 # Found 7 steps
% 0.21/0.38 cnf(i_0_19, negated_conjecture, (p2(c6,f3(c8,f5(c9)))|~p2(f3(f5(c9),c8),f3(c8,f5(c9)))|~p2(f3(f5(c9),c8),c6)), inference(start_rule)).
% 0.21/0.38 cnf(i_0_37, plain, (p2(c6,f3(c8,f5(c9)))), inference(closure_rule, [i_0_16])).
% 0.21/0.38 cnf(i_0_38, plain, (~p2(f3(f5(c9),c8),f3(c8,f5(c9)))), inference(closure_rule, [i_0_17])).
% 0.21/0.38 cnf(i_0_39, plain, (~p2(f3(f5(c9),c8),c6)), inference(extension_rule, [i_0_21])).
% 0.21/0.38 cnf(i_0_53, plain, (~p2(f3(f3(f5(c9),c8),f3(X2,X3)),f3(c6,f3(X2,X3)))), inference(extension_rule, [i_0_19])).
% 0.21/0.38 cnf(i_0_63, plain, (~p2(f3(f3(c6,X2),X3),f3(c6,f3(X2,X3)))), inference(closure_rule, [i_0_24])).
% 0.21/0.38 cnf(i_0_64, plain, (~p2(f3(f3(c6,X2),X3),f3(f3(f5(c9),c8),f3(X2,X3)))), inference(etableau_closure_rule, [i_0_64, ...])).
% 0.21/0.38 # End printing tableau
% 0.21/0.38 # SZS output end
% 0.21/0.38 # Branches closed with saturation will be marked with an "s"
% 0.21/0.38 # There were 1 total branch saturation attempts.
% 0.21/0.38 # There were 0 of these attempts blocked.
% 0.21/0.38 # There were 0 deferred branch saturation attempts.
% 0.21/0.38 # There were 0 free duplicated saturations.
% 0.21/0.38 # There were 1 total successful branch saturations.
% 0.21/0.38 # There were 0 successful branch saturations in interreduction.
% 0.21/0.38 # There were 0 successful branch saturations on the branch.
% 0.21/0.38 # There were 1 successful branch saturations after the branch.
% 0.21/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.38 # Begin clausification derivation
% 0.21/0.38
% 0.21/0.38 # End clausification derivation
% 0.21/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.38 cnf(i_0_14, negated_conjecture, (p2(X1,X1))).
% 0.21/0.38 cnf(i_0_15, negated_conjecture, (p4(X1,X1))).
% 0.21/0.38 cnf(i_0_17, negated_conjecture, (p2(f3(X1,X2),f3(X2,X1)))).
% 0.21/0.38 cnf(i_0_25, negated_conjecture, (p2(f3(c6,f5(c7)),f3(c8,f3(f5(c7),f5(c9)))))).
% 0.21/0.38 cnf(i_0_23, negated_conjecture, (p2(f3(X1,f3(X2,X3)),f3(X2,f3(X1,X3))))).
% 0.21/0.38 cnf(i_0_24, negated_conjecture, (p2(f3(f3(X1,X2),X3),f3(X1,f3(X2,X3))))).
% 0.21/0.38 cnf(i_0_16, negated_conjecture, (~p2(c6,f3(c8,f5(c9))))).
% 0.21/0.38 cnf(i_0_18, negated_conjecture, (p2(f5(X1),f5(X2))|~p4(X1,X2))).
% 0.21/0.38 cnf(i_0_19, negated_conjecture, (p2(X1,X2)|~p2(X3,X2)|~p2(X3,X1))).
% 0.21/0.38 cnf(i_0_20, negated_conjecture, (p4(X1,X2)|~p4(X3,X2)|~p4(X3,X1))).
% 0.21/0.38 cnf(i_0_22, negated_conjecture, (p2(f3(X1,X2),f3(X3,X2))|~p2(X1,X3))).
% 0.21/0.38 cnf(i_0_21, negated_conjecture, (p2(X1,X2)|~p2(f3(X1,X3),f3(X2,X3)))).
% 0.21/0.38 cnf(i_0_26, negated_conjecture, (p2(f3(X1,X2),f3(X3,X4))|~p2(X2,X4)|~p2(X1,X3))).
% 0.21/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.38 # Begin printing tableau
% 0.21/0.38 # Found 6 steps
% 0.21/0.38 cnf(i_0_22, negated_conjecture, (p2(f3(f3(f3(X8,X9),X10),X7),f3(f3(X8,f3(X9,X10)),X7))|~p2(f3(f3(X8,X9),X10),f3(X8,f3(X9,X10)))), inference(start_rule)).
% 0.21/0.38 cnf(i_0_33, plain, (~p2(f3(f3(X8,X9),X10),f3(X8,f3(X9,X10)))), inference(closure_rule, [i_0_24])).
% 0.21/0.38 cnf(i_0_32, plain, (p2(f3(f3(f3(X8,X9),X10),X7),f3(f3(X8,f3(X9,X10)),X7))), inference(extension_rule, [i_0_26])).
% 0.21/0.38 cnf(i_0_51, plain, (~p2(f3(f3(X17,X16),X15),f3(X17,f3(X16,X15)))), inference(closure_rule, [i_0_24])).
% 0.21/0.38 cnf(i_0_49, plain, (p2(f3(f3(f3(X17,X16),X15),f3(f3(f3(X8,X9),X10),X7)),f3(f3(X17,f3(X16,X15)),f3(f3(X8,f3(X9,X10)),X7)))), inference(extension_rule, [i_0_22])).
% 0.21/0.38 cnf(i_0_54, plain, (p2(f3(f3(f3(f3(X17,X16),X15),f3(f3(f3(X8,X9),X10),X7)),X5),f3(f3(f3(X17,f3(X16,X15)),f3(f3(X8,f3(X9,X10)),X7)),X5))), inference(etableau_closure_rule, [i_0_54, ...])).
% 0.21/0.38 # End printing tableau
% 0.21/0.38 # SZS output end
% 0.21/0.38 # Branches closed with saturation will be marked with an "s"
% 0.21/0.38 # Child (7770) has found a proof.
% 0.21/0.38
% 0.21/0.38 # Proof search is over...
% 0.21/0.38 # Freeing feature tree
%------------------------------------------------------------------------------