TSTP Solution File: GRP033-3 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP033-3 : TPTP v8.1.0. Bugfixed v4.0.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 : n023.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 : Sat Jul 16 09:04:04 EDT 2022
% Result : Unsatisfiable 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : GRP033-3 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.10/0.12 % 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 : n023.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 Jun 13 06:54:36 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 22 Number of unprocessed: 22
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.12/0.36 # The folding up rule is enabled...
% 0.12/0.36 # Local unification is enabled...
% 0.12/0.36 # Any saturation attempts will use folding labels...
% 0.12/0.36 # 22 beginning clauses after preprocessing and clausification
% 0.12/0.36 # Creating start rules for all 1 conjectures.
% 0.12/0.36 # There are 1 start rule candidates:
% 0.12/0.36 # Found 7 unit axioms.
% 0.12/0.36 # 1 start rule tableaux created.
% 0.12/0.36 # 15 extension rule candidate clauses
% 0.12/0.36 # 7 unit axiom clauses
% 0.12/0.36
% 0.12/0.36 # Requested 8, 32 cores available to the main process.
% 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 1
% 0.12/0.36 # Returning from population with 10 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.36 # We now have 10 tableaux to operate on
% 0.12/0.37 # There were 2 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 2 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 2 successful branch saturations after the branch.
% 0.12/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 # Begin clausification derivation
% 0.12/0.37
% 0.12/0.37 # End clausification derivation
% 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.37 cnf(i_0_42, hypothesis, (subgroup_member(a))).
% 0.12/0.37 cnf(i_0_23, plain, (equalish(X1,X1))).
% 0.12/0.37 cnf(i_0_34, plain, (product(X1,identity,X1))).
% 0.12/0.37 cnf(i_0_33, plain, (product(identity,X1,X1))).
% 0.12/0.37 cnf(i_0_36, plain, (product(X1,inverse(X1),identity))).
% 0.12/0.37 cnf(i_0_35, plain, (product(inverse(X1),X1,identity))).
% 0.12/0.37 cnf(i_0_37, plain, (product(X1,X2,multiply(X1,X2)))).
% 0.12/0.37 cnf(i_0_43, hypothesis, (subgroup_member(j(X1))|~subgroup_member(X1))).
% 0.12/0.37 cnf(i_0_32, plain, (subgroup_member(X1)|~subgroup_member(X2)|~equalish(X2,X1))).
% 0.12/0.37 cnf(i_0_24, plain, (equalish(X1,X2)|~equalish(X2,X1))).
% 0.12/0.37 cnf(i_0_41, plain, (subgroup_member(X1)|~subgroup_member(X2)|~subgroup_member(X3)|~product(X3,inverse(X2),X1))).
% 0.12/0.37 cnf(i_0_25, plain, (equalish(X1,X2)|~equalish(X3,X2)|~equalish(X1,X3))).
% 0.12/0.37 cnf(i_0_44, negated_conjecture, (~subgroup_member(X1)|~product(X1,j(X1),j(X1))|~product(j(X1),X1,j(X1)))).
% 0.12/0.37 cnf(i_0_26, plain, (equalish(inverse(X1),inverse(X2))|~equalish(X1,X2))).
% 0.12/0.37 cnf(i_0_38, plain, (equalish(X1,X2)|~product(X3,X4,X2)|~product(X3,X4,X1))).
% 0.12/0.37 cnf(i_0_31, plain, (product(X1,X2,X3)|~product(X1,X2,X4)|~equalish(X4,X3))).
% 0.12/0.37 cnf(i_0_28, plain, (equalish(multiply(X1,X2),multiply(X1,X3))|~equalish(X2,X3))).
% 0.12/0.37 cnf(i_0_27, plain, (equalish(multiply(X1,X2),multiply(X3,X2))|~equalish(X1,X3))).
% 0.12/0.37 cnf(i_0_30, plain, (product(X1,X2,X3)|~product(X1,X4,X3)|~equalish(X4,X2))).
% 0.12/0.37 cnf(i_0_29, plain, (product(X1,X2,X3)|~product(X4,X2,X3)|~equalish(X4,X1))).
% 0.12/0.37 cnf(i_0_40, plain, (product(X1,X2,X3)|~product(X4,X2,X5)|~product(X6,X5,X3)|~product(X6,X4,X1))).
% 0.12/0.37 cnf(i_0_39, plain, (product(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X1,X6,X4))).
% 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.37 # Begin printing tableau
% 0.12/0.37 # Found 9 steps
% 0.12/0.37 cnf(i_0_44, negated_conjecture, (~subgroup_member(a)|~product(a,j(a),j(a))|~product(j(a),a,j(a))), inference(start_rule)).
% 0.12/0.37 cnf(i_0_45, plain, (~subgroup_member(a)), inference(closure_rule, [i_0_42])).
% 0.12/0.37 cnf(i_0_47, plain, (~product(j(a),a,j(a))), inference(extension_rule, [i_0_39])).
% 0.12/0.37 cnf(i_0_128, plain, (~product(j(a),identity,j(a))), inference(closure_rule, [i_0_34])).
% 0.12/0.37 cnf(i_0_130, plain, (~product(j(a),identity,j(a))), inference(closure_rule, [i_0_34])).
% 0.12/0.37 cnf(i_0_129, plain, (~product(identity,identity,a)), inference(extension_rule, [i_0_31])).
% 0.12/0.37 cnf(i_0_154, plain, (~product(identity,identity,identity)), inference(closure_rule, [i_0_34])).
% 0.12/0.37 cnf(i_0_46, plain, (~product(a,j(a),j(a))), inference(etableau_closure_rule, [i_0_46, ...])).
% 0.12/0.37 cnf(i_0_155, plain, (~equalish(identity,a)), inference(etableau_closure_rule, [i_0_155, ...])).
% 0.12/0.37 # End printing tableau
% 0.12/0.37 # SZS output end
% 0.12/0.37 # Branches closed with saturation will be marked with an "s"
% 0.12/0.37 # There were 2 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 2 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 2 successful branch saturations after the branch.
% 0.12/0.37 # There were 2 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 2 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 2 successful branch saturations after the branch.
% 0.12/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 # Begin clausification derivation
% 0.12/0.37
% 0.12/0.37 # End clausification derivation
% 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.37 cnf(i_0_42, hypothesis, (subgroup_member(a))).
% 0.12/0.37 cnf(i_0_23, plain, (equalish(X1,X1))).
% 0.12/0.37 cnf(i_0_34, plain, (product(X1,identity,X1))).
% 0.12/0.37 cnf(i_0_33, plain, (product(identity,X1,X1))).
% 0.12/0.37 cnf(i_0_36, plain, (product(X1,inverse(X1),identity))).
% 0.12/0.37 cnf(i_0_35, plain, (product(inverse(X1),X1,identity))).
% 0.12/0.37 cnf(i_0_37, plain, (product(X1,X2,multiply(X1,X2)))).
% 0.12/0.37 cnf(i_0_43, hypothesis, (subgroup_member(j(X1))|~subgroup_member(X1))).
% 0.12/0.37 cnf(i_0_32, plain, (subgroup_member(X1)|~subgroup_member(X2)|~equalish(X2,X1))).
% 0.12/0.37 cnf(i_0_24, plain, (equalish(X1,X2)|~equalish(X2,X1))).
% 0.12/0.37 cnf(i_0_41, plain, (subgroup_member(X1)|~subgroup_member(X2)|~subgroup_member(X3)|~product(X3,inverse(X2),X1))).
% 0.12/0.37 cnf(i_0_25, plain, (equalish(X1,X2)|~equalish(X3,X2)|~equalish(X1,X3))).
% 0.12/0.37 cnf(i_0_44, negated_conjecture, (~subgroup_member(X1)|~product(X1,j(X1),j(X1))|~product(j(X1),X1,j(X1)))).
% 0.12/0.37 cnf(i_0_26, plain, (equalish(inverse(X1),inverse(X2))|~equalish(X1,X2))).
% 0.12/0.37 cnf(i_0_38, plain, (equalish(X1,X2)|~product(X3,X4,X2)|~product(X3,X4,X1))).
% 0.12/0.37 cnf(i_0_31, plain, (product(X1,X2,X3)|~product(X1,X2,X4)|~equalish(X4,X3))).
% 0.12/0.37 cnf(i_0_28, plain, (equalish(multiply(X1,X2),multiply(X1,X3))|~equalish(X2,X3))).
% 0.12/0.37 cnf(i_0_27, plain, (equalish(multiply(X1,X2),multiply(X3,X2))|~equalish(X1,X3))).
% 0.12/0.37 cnf(i_0_30, plain, (product(X1,X2,X3)|~product(X1,X4,X3)|~equalish(X4,X2))).
% 0.12/0.37 cnf(i_0_29, plain, (product(X1,X2,X3)|~product(X4,X2,X3)|~equalish(X4,X1))).
% 0.12/0.37 cnf(i_0_40, plain, (product(X1,X2,X3)|~product(X4,X2,X5)|~product(X6,X5,X3)|~product(X6,X4,X1))).
% 0.12/0.37 cnf(i_0_39, plain, (product(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X1,X6,X4))).
% 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.37 # Begin printing tableau
% 0.12/0.37 # Found 8 steps
% 0.12/0.37 cnf(i_0_44, negated_conjecture, (~subgroup_member(a)|~product(a,j(a),j(a))|~product(j(a),a,j(a))), inference(start_rule)).
% 0.12/0.37 cnf(i_0_45, plain, (~subgroup_member(a)), inference(closure_rule, [i_0_42])).
% 0.12/0.37 cnf(i_0_47, plain, (~product(j(a),a,j(a))), inference(extension_rule, [i_0_29])).
% 0.12/0.37 cnf(i_0_121, plain, (~product(j(a),a,j(a))), inference(extension_rule, [i_0_31])).
% 0.12/0.37 cnf(i_0_122, plain, (~equalish(j(a),j(a))), inference(closure_rule, [i_0_23])).
% 0.12/0.37 cnf(i_0_154, plain, (~product(j(a),a,multiply(j(a),a))), inference(closure_rule, [i_0_37])).
% 0.12/0.37 cnf(i_0_46, plain, (~product(a,j(a),j(a))), inference(etableau_closure_rule, [i_0_46, ...])).
% 0.12/0.37 cnf(i_0_155, plain, (~equalish(multiply(j(a),a),j(a))), inference(etableau_closure_rule, [i_0_155, ...])).
% 0.12/0.37 # End printing tableau
% 0.12/0.37 # SZS output end
% 0.12/0.37 # Branches closed with saturation will be marked with an "s"
% 0.12/0.37 # There were 2 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 2 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 2 successful branch saturations after the branch.
% 0.12/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 # Begin clausification derivation
% 0.12/0.37
% 0.12/0.37 # End clausification derivation
% 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.37 cnf(i_0_42, hypothesis, (subgroup_member(a))).
% 0.12/0.37 cnf(i_0_23, plain, (equalish(X1,X1))).
% 0.12/0.37 cnf(i_0_34, plain, (product(X1,identity,X1))).
% 0.12/0.37 cnf(i_0_33, plain, (product(identity,X1,X1))).
% 0.12/0.37 cnf(i_0_36, plain, (product(X1,inverse(X1),identity))).
% 0.12/0.37 cnf(i_0_35, plain, (product(inverse(X1),X1,identity))).
% 0.12/0.37 cnf(i_0_37, plain, (product(X1,X2,multiply(X1,X2)))).
% 0.12/0.37 cnf(i_0_43, hypothesis, (subgroup_member(j(X1))|~subgroup_member(X1))).
% 0.12/0.37 cnf(i_0_32, plain, (subgroup_member(X1)|~subgroup_member(X2)|~equalish(X2,X1))).
% 0.12/0.37 cnf(i_0_24, plain, (equalish(X1,X2)|~equalish(X2,X1))).
% 0.12/0.37 cnf(i_0_41, plain, (subgroup_member(X1)|~subgroup_member(X2)|~subgroup_member(X3)|~product(X3,inverse(X2),X1))).
% 0.12/0.37 cnf(i_0_25, plain, (equalish(X1,X2)|~equalish(X3,X2)|~equalish(X1,X3))).
% 0.12/0.37 cnf(i_0_44, negated_conjecture, (~subgroup_member(X1)|~product(X1,j(X1),j(X1))|~product(j(X1),X1,j(X1)))).
% 0.12/0.37 cnf(i_0_26, plain, (equalish(inverse(X1),inverse(X2))|~equalish(X1,X2))).
% 0.12/0.37 cnf(i_0_38, plain, (equalish(X1,X2)|~product(X3,X4,X2)|~product(X3,X4,X1))).
% 0.12/0.37 cnf(i_0_31, plain, (product(X1,X2,X3)|~product(X1,X2,X4)|~equalish(X4,X3))).
% 0.12/0.37 cnf(i_0_28, plain, (equalish(multiply(X1,X2),multiply(X1,X3))|~equalish(X2,X3))).
% 0.12/0.37 cnf(i_0_27, plain, (equalish(multiply(X1,X2),multiply(X3,X2))|~equalish(X1,X3))).
% 0.12/0.37 cnf(i_0_30, plain, (product(X1,X2,X3)|~product(X1,X4,X3)|~equalish(X4,X2))).
% 0.12/0.37 cnf(i_0_29, plain, (product(X1,X2,X3)|~product(X4,X2,X3)|~equalish(X4,X1))).
% 0.12/0.37 cnf(i_0_40, plain, (product(X1,X2,X3)|~product(X4,X2,X5)|~product(X6,X5,X3)|~product(X6,X4,X1))).
% 0.12/0.37 cnf(i_0_39, plain, (product(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X1,X6,X4))).
% 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.37 # Begin printing tableau
% 0.12/0.37 # Found 7 steps
% 0.12/0.37 cnf(i_0_44, negated_conjecture, (~subgroup_member(a)|~product(a,j(a),j(a))|~product(j(a),a,j(a))), inference(start_rule)).
% 0.12/0.37 cnf(i_0_45, plain, (~subgroup_member(a)), inference(closure_rule, [i_0_42])).
% 0.12/0.37 cnf(i_0_47, plain, (~product(j(a),a,j(a))), inference(extension_rule, [i_0_30])).
% 0.12/0.37 cnf(i_0_118, plain, (~product(j(a),identity,j(a))), inference(closure_rule, [i_0_34])).
% 0.12/0.37 cnf(i_0_119, plain, (~equalish(identity,a)), inference(extension_rule, [i_0_24])).
% 0.12/0.37 cnf(i_0_46, plain, (~product(a,j(a),j(a))), inference(etableau_closure_rule, [i_0_46, ...])).
% 0.12/0.37 cnf(i_0_140, plain, (~equalish(a,identity)), inference(etableau_closure_rule, [i_0_140, ...])).
% 0.12/0.37 # End printing tableau
% 0.12/0.37 # SZS output end
% 0.12/0.37 # Branches closed with saturation will be marked with an "s"
% 0.12/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 # Begin clausification derivation
% 0.12/0.37
% 0.12/0.37 # End clausification derivation
% 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.37 cnf(i_0_42, hypothesis, (subgroup_member(a))).
% 0.12/0.37 cnf(i_0_23, plain, (equalish(X1,X1))).
% 0.12/0.37 cnf(i_0_34, plain, (product(X1,identity,X1))).
% 0.12/0.37 cnf(i_0_33, plain, (product(identity,X1,X1))).
% 0.12/0.37 cnf(i_0_36, plain, (product(X1,inverse(X1),identity))).
% 0.12/0.37 cnf(i_0_35, plain, (product(inverse(X1),X1,identity))).
% 0.12/0.37 cnf(i_0_37, plain, (product(X1,X2,multiply(X1,X2)))).
% 0.12/0.37 cnf(i_0_43, hypothesis, (subgroup_member(j(X1))|~subgroup_member(X1))).
% 0.12/0.37 cnf(i_0_32, plain, (subgroup_member(X1)|~subgroup_member(X2)|~equalish(X2,X1))).
% 0.12/0.37 cnf(i_0_24, plain, (equalish(X1,X2)|~equalish(X2,X1))).
% 0.12/0.37 cnf(i_0_41, plain, (subgroup_member(X1)|~subgroup_member(X2)|~subgroup_member(X3)|~product(X3,inverse(X2),X1))).
% 0.12/0.37 cnf(i_0_25, plain, (equalish(X1,X2)|~equalish(X3,X2)|~equalish(X1,X3))).
% 0.12/0.37 cnf(i_0_44, negated_conjecture, (~subgroup_member(X1)|~product(X1,j(X1),j(X1))|~product(j(X1),X1,j(X1)))).
% 0.12/0.37 cnf(i_0_26, plain, (equalish(inverse(X1),inverse(X2))|~equalish(X1,X2))).
% 0.12/0.37 cnf(i_0_38, plain, (equalish(X1,X2)|~product(X3,X4,X2)|~product(X3,X4,X1))).
% 0.12/0.37 cnf(i_0_31, plain, (product(X1,X2,X3)|~product(X1,X2,X4)|~equalish(X4,X3))).
% 0.12/0.37 cnf(i_0_28, plain, (equalish(multiply(X1,X2),multiply(X1,X3))|~equalish(X2,X3))).
% 0.12/0.37 cnf(i_0_27, plain, (equalish(multiply(X1,X2),multiply(X3,X2))|~equalish(X1,X3))).
% 0.12/0.37 cnf(i_0_30, plain, (product(X1,X2,X3)|~product(X1,X4,X3)|~equalish(X4,X2))).
% 0.12/0.37 cnf(i_0_29, plain, (product(X1,X2,X3)|~product(X4,X2,X3)|~equalish(X4,X1))).
% 0.12/0.37 cnf(i_0_40, plain, (product(X1,X2,X3)|~product(X4,X2,X5)|~product(X6,X5,X3)|~product(X6,X4,X1))).
% 0.12/0.37 cnf(i_0_39, plain, (product(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X1,X6,X4))).
% 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.37 # Begin printing tableau
% 0.12/0.37 # Found 7 steps
% 0.12/0.37 cnf(i_0_44, negated_conjecture, (~subgroup_member(a)|~product(a,j(a),j(a))|~product(j(a),a,j(a))), inference(start_rule)).
% 0.12/0.37 cnf(i_0_45, plain, (~subgroup_member(a)), inference(closure_rule, [i_0_42])).
% 0.12/0.37 cnf(i_0_47, plain, (~product(j(a),a,j(a))), inference(extension_rule, [i_0_31])).
% 0.12/0.37 cnf(i_0_111, plain, (~product(j(a),a,multiply(j(a),a))), inference(closure_rule, [i_0_37])).
% 0.12/0.37 cnf(i_0_112, plain, (~equalish(multiply(j(a),a),j(a))), inference(extension_rule, [i_0_24])).
% 0.12/0.37 cnf(i_0_46, plain, (~product(a,j(a),j(a))), inference(etableau_closure_rule, [i_0_46, ...])).
% 0.12/0.37 cnf(i_0_140, plain, (~equalish(j(a),multiply(j(a),a))), inference(etableau_closure_rule, [i_0_140, ...])).
% 0.12/0.37 # End printing tableau
% 0.12/0.37 # SZS output end
% 0.12/0.37 # Branches closed with saturation will be marked with an "s"
% 0.12/0.37 # There were 2 total branch saturation attempts.
% 0.12/0.37 # There were 0 of these attempts blocked.
% 0.12/0.37 # There were 0 deferred branch saturation attempts.
% 0.12/0.37 # There were 0 free duplicated saturations.
% 0.12/0.37 # There were 2 total successful branch saturations.
% 0.12/0.37 # There were 0 successful branch saturations in interreduction.
% 0.12/0.37 # There were 0 successful branch saturations on the branch.
% 0.12/0.37 # There were 2 successful branch saturations after the branch.
% 0.12/0.37 # Child (8961) has found a proof.
% 0.12/0.37
% 0.12/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 # Begin clausification derivation
% 0.12/0.37
% 0.12/0.37 # End clausification derivation
% 0.12/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.37 cnf(i_0_42, hypothesis, (subgroup_member(a))).
% 0.12/0.37 cnf(i_0_23, plain, (equalish(X1,X1))).
% 0.12/0.37 cnf(i_0_34, plain, (product(X1,identity,X1))).
% 0.12/0.37 cnf(i_0_33, plain, (product(identity,X1,X1))).
% 0.12/0.37 cnf(i_0_36, plain, (product(X1,inverse(X1),identity))).
% 0.12/0.37 cnf(i_0_35, plain, (product(inverse(X1),X1,identity))).
% 0.12/0.37 cnf(i_0_37, plain, (product(X1,X2,multiply(X1,X2)))).
% 0.12/0.37 cnf(i_0_43, hypothesis, (subgroup_member(j(X1))|~subgroup_member(X1))).
% 0.12/0.37 cnf(i_0_32, plain, (subgroup_member(X1)|~subgroup_member(X2)|~equalish(X2,X1))).
% 0.12/0.37 cnf(i_0_24, plain, (equalish(X1,X2)|~equalish(X2,X1))).
% 0.12/0.37 cnf(i_0_41, plain, (subgroup_member(X1)|~subgroup_member(X2)|~subgroup_member(X3)|~product(X3,inverse(X2),X1))).
% 0.12/0.37 cnf(i_0_25, plain, (equalish(X1,X2)|~equalish(X3,X2)|~equalish(X1,X3))).
% 0.12/0.37 cnf(i_0_44, negated_conjecture, (~subgroup_member(X1)|~product(X1,j(X1),j(X1))|~product(j(X1),X1,j(X1)))).
% 0.12/0.37 cnf(i_0_26, plain, (equalish(inverse(X1),inverse(X2))|~equalish(X1,X2))).
% 0.12/0.37 cnf(i_0_38, plain, (equalish(X1,X2)|~product(X3,X4,X2)|~product(X3,X4,X1))).
% 0.12/0.37 cnf(i_0_31, plain, (product(X1,X2,X3)|~product(X1,X2,X4)|~equalish(X4,X3))).
% 0.12/0.37 cnf(i_0_28, plain, (equalish(multiply(X1,X2),multiply(X1,X3))|~equalish(X2,X3))).
% 0.12/0.37 cnf(i_0_27, plain, (equalish(multiply(X1,X2),multiply(X3,X2))|~equalish(X1,X3))).
% 0.12/0.37 cnf(i_0_30, plain, (product(X1,X2,X3)|~product(X1,X4,X3)|~equalish(X4,X2))).
% 0.12/0.37 cnf(i_0_29, plain, (product(X1,X2,X3)|~product(X4,X2,X3)|~equalish(X4,X1))).
% 0.12/0.37 cnf(i_0_40, plain, (product(X1,X2,X3)|~product(X4,X2,X5)|~product(X6,X5,X3)|~product(X6,X4,X1))).
% 0.12/0.37 cnf(i_0_39, plain, (product(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X1,X6,X4))).
% 0.12/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.37 # Begin printing tableau
% 0.12/0.37 # Found 9 steps
% 0.12/0.37 cnf(i_0_44, negated_conjecture, (~subgroup_member(a)|~product(a,j(a),j(a))|~product(j(a),a,j(a))), inference(start_rule)).
% 0.12/0.37 cnf(i_0_45, plain, (~subgroup_member(a)), inference(closure_rule, [i_0_42])).
% 0.12/0.37 cnf(i_0_46, plain, (~product(a,j(a),j(a))), inference(extension_rule, [i_0_39])).
% 0.12/0.37 cnf(i_0_85, plain, (~product(j(a),identity,j(a))), inference(closure_rule, [i_0_34])).
% 0.12/0.37 cnf(i_0_87, plain, (~product(a,j(a),j(a))), inference(extension_rule, [i_0_31])).
% 0.12/0.37 cnf(i_0_86, plain, (~product(j(a),identity,j(a))), inference(closure_rule, [i_0_34])).
% 0.12/0.37 cnf(i_0_154, plain, (~product(a,j(a),multiply(a,j(a)))), inference(closure_rule, [i_0_37])).
% 0.12/0.37 cnf(i_0_47, plain, (~product(j(a),a,j(a))), inference(etableau_closure_rule, [i_0_47, ...])).
% 0.12/0.37 cnf(i_0_155, plain, (~equalish(multiply(a,j(a)),j(a))), inference(etableau_closure_rule, [i_0_155, ...])).
% 0.12/0.37 # End printing tableau
% 0.12/0.37 # SZS output end
% 0.12/0.37 # Branches closed with saturation will be marked with an "s"
% 0.12/0.37 # Proof search is over...
% 0.12/0.37 # Freeing feature tree
%------------------------------------------------------------------------------