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