TSTP Solution File: BOO009-2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : BOO009-2 : TPTP v8.1.0. Released v1.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 : n026.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 14 23:38:23 EDT 2022
% Result : Unsatisfiable 0.21s 0.39s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : BOO009-2 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.15/0.35 % Computer : n026.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Wed Jun 1 16:03:42 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.21/0.38 # No SInE strategy applied
% 0.21/0.38 # Auto-Mode selected heuristic U_____102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.21/0.38 #
% 0.21/0.38 # Presaturation interreduction done
% 0.21/0.38 # Number of axioms: 15 Number of unprocessed: 13
% 0.21/0.38 # Tableaux proof search.
% 0.21/0.38 # APR header successfully linked.
% 0.21/0.38 # Hello from C++
% 0.21/0.38 # The folding up rule is enabled...
% 0.21/0.38 # Local unification is enabled...
% 0.21/0.38 # Any saturation attempts will use folding labels...
% 0.21/0.38 # 13 beginning clauses after preprocessing and clausification
% 0.21/0.38 # Creating start rules for all 1 conjectures.
% 0.21/0.38 # There are 1 start rule candidates:
% 0.21/0.38 # Found 13 unit axioms.
% 0.21/0.38 # 1 start rule tableaux created.
% 0.21/0.38 # 0 extension rule candidate clauses
% 0.21/0.38 # 13 unit axiom clauses
% 0.21/0.38
% 0.21/0.38 # Requested 8, 32 cores available to the main process.
% 0.21/0.38 # There are not enough tableaux to fork, creating more from the initial 1
% 0.21/0.38 # Creating equality axioms
% 0.21/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.21/0.38 # Returning from population with 19 new_tableaux and 0 remaining starting tableaux.
% 0.21/0.38 # We now have 19 tableaux to operate on
% 0.21/0.39 # There were 1 total branch saturation attempts.
% 0.21/0.39 # There were 0 of these attempts blocked.
% 0.21/0.39 # There were 0 deferred branch saturation attempts.
% 0.21/0.39 # There were 0 free duplicated saturations.
% 0.21/0.39 # There were 1 total successful branch saturations.
% 0.21/0.39 # There were 0 successful branch saturations in interreduction.
% 0.21/0.39 # There were 0 successful branch saturations on the branch.
% 0.21/0.39 # There were 1 successful branch saturations after the branch.
% 0.21/0.39 # There were 1 total branch saturation attempts.
% 0.21/0.39 # There were 0 of these attempts blocked.
% 0.21/0.39 # There were 0 deferred branch saturation attempts.
% 0.21/0.39 # There were 0 free duplicated saturations.
% 0.21/0.39 # There were 1 total successful branch saturations.
% 0.21/0.39 # There were 0 successful branch saturations in interreduction.
% 0.21/0.39 # There were 0 successful branch saturations on the branch.
% 0.21/0.39 # There were 1 successful branch saturations after the branch.
% 0.21/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.39 # Begin clausification derivation
% 0.21/0.39
% 0.21/0.39 # End clausification derivation
% 0.21/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.39 cnf(i_0_28, plain, (add(X1,additive_identity)=X1)).
% 0.21/0.39 cnf(i_0_26, plain, (multiply(X1,multiplicative_identity)=X1)).
% 0.21/0.39 cnf(i_0_29, plain, (add(additive_identity,X1)=X1)).
% 0.21/0.39 cnf(i_0_27, plain, (multiply(multiplicative_identity,X1)=X1)).
% 0.21/0.39 cnf(i_0_22, plain, (add(X1,inverse(X1))=multiplicative_identity)).
% 0.21/0.39 cnf(i_0_24, plain, (multiply(X1,inverse(X1))=additive_identity)).
% 0.21/0.39 cnf(i_0_19, plain, (multiply(add(X1,X2),add(X1,X3))=add(X1,multiply(X2,X3)))).
% 0.21/0.39 cnf(i_0_21, plain, (add(multiply(X1,X2),multiply(X1,X3))=multiply(X1,add(X2,X3)))).
% 0.21/0.39 cnf(i_0_18, plain, (multiply(add(X1,X2),add(X3,X2))=add(multiply(X1,X3),X2))).
% 0.21/0.39 cnf(i_0_20, plain, (add(multiply(X1,X2),multiply(X3,X2))=multiply(add(X1,X3),X2))).
% 0.21/0.39 cnf(i_0_16, plain, (add(X1,X2)=add(X2,X1))).
% 0.21/0.39 cnf(i_0_17, plain, (multiply(X1,X2)=multiply(X2,X1))).
% 0.21/0.39 cnf(i_0_30, negated_conjecture, (multiply(a,add(a,b))!=a)).
% 0.21/0.39 cnf(i_0_32, plain, (X4=X4)).
% 0.21/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.39 # Begin printing tableau
% 0.21/0.39 # Found 6 steps
% 0.21/0.39 cnf(i_0_28, plain, (add(X5,additive_identity)=X5), inference(start_rule)).
% 0.21/0.39 cnf(i_0_39, plain, (add(X5,additive_identity)=X5), inference(extension_rule, [i_0_37])).
% 0.21/0.39 cnf(i_0_64, plain, (add(X3,additive_identity)!=X3), inference(closure_rule, [i_0_28])).
% 0.21/0.39 cnf(i_0_63, plain, (multiply(add(X3,additive_identity),add(X5,additive_identity))=multiply(X3,X5)), inference(extension_rule, [i_0_35])).
% 0.21/0.39 cnf(i_0_74, plain, (multiply(X3,X5)!=add(multiply(X3,X5),additive_identity)), inference(closure_rule, [i_0_28])).
% 0.21/0.39 cnf(i_0_72, plain, (multiply(add(X3,additive_identity),add(X5,additive_identity))=add(multiply(X3,X5),additive_identity)), inference(etableau_closure_rule, [i_0_72, ...])).
% 0.21/0.39 # End printing tableau
% 0.21/0.39 # SZS output end
% 0.21/0.39 # Branches closed with saturation will be marked with an "s"
% 0.21/0.39 # There were 1 total branch saturation attempts.
% 0.21/0.39 # There were 0 of these attempts blocked.
% 0.21/0.39 # There were 0 deferred branch saturation attempts.
% 0.21/0.39 # There were 0 free duplicated saturations.
% 0.21/0.39 # There were 1 total successful branch saturations.
% 0.21/0.39 # There were 0 successful branch saturations in interreduction.
% 0.21/0.39 # There were 0 successful branch saturations on the branch.
% 0.21/0.39 # There were 1 successful branch saturations after the branch.
% 0.21/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.39 # Begin clausification derivation
% 0.21/0.39
% 0.21/0.39 # End clausification derivation
% 0.21/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.39 cnf(i_0_28, plain, (add(X1,additive_identity)=X1)).
% 0.21/0.39 cnf(i_0_26, plain, (multiply(X1,multiplicative_identity)=X1)).
% 0.21/0.39 cnf(i_0_29, plain, (add(additive_identity,X1)=X1)).
% 0.21/0.39 cnf(i_0_27, plain, (multiply(multiplicative_identity,X1)=X1)).
% 0.21/0.39 cnf(i_0_22, plain, (add(X1,inverse(X1))=multiplicative_identity)).
% 0.21/0.39 cnf(i_0_24, plain, (multiply(X1,inverse(X1))=additive_identity)).
% 0.21/0.39 cnf(i_0_19, plain, (multiply(add(X1,X2),add(X1,X3))=add(X1,multiply(X2,X3)))).
% 0.21/0.39 cnf(i_0_21, plain, (add(multiply(X1,X2),multiply(X1,X3))=multiply(X1,add(X2,X3)))).
% 0.21/0.39 cnf(i_0_18, plain, (multiply(add(X1,X2),add(X3,X2))=add(multiply(X1,X3),X2))).
% 0.21/0.39 cnf(i_0_20, plain, (add(multiply(X1,X2),multiply(X3,X2))=multiply(add(X1,X3),X2))).
% 0.21/0.39 cnf(i_0_16, plain, (add(X1,X2)=add(X2,X1))).
% 0.21/0.39 cnf(i_0_17, plain, (multiply(X1,X2)=multiply(X2,X1))).
% 0.21/0.39 cnf(i_0_30, negated_conjecture, (multiply(a,add(a,b))!=a)).
% 0.21/0.39 cnf(i_0_32, plain, (X4=X4)).
% 0.21/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.39 # Begin printing tableau
% 0.21/0.39 # Found 5 steps
% 0.21/0.39 cnf(i_0_28, plain, (add(X3,additive_identity)=X3), inference(start_rule)).
% 0.21/0.39 cnf(i_0_39, plain, (add(X3,additive_identity)=X3), inference(extension_rule, [i_0_38])).
% 0.21/0.39 cnf(i_0_66, plain, (inverse(add(X3,additive_identity))=inverse(X3)), inference(extension_rule, [i_0_35])).
% 0.21/0.39 cnf(i_0_74, plain, (inverse(X3)!=add(inverse(X3),additive_identity)), inference(closure_rule, [i_0_28])).
% 0.21/0.39 cnf(i_0_72, plain, (inverse(add(X3,additive_identity))=add(inverse(X3),additive_identity)), inference(etableau_closure_rule, [i_0_72, ...])).
% 0.21/0.39 # End printing tableau
% 0.21/0.39 # SZS output end
% 0.21/0.39 # Branches closed with saturation will be marked with an "s"
% 0.21/0.39 # There were 1 total branch saturation attempts.
% 0.21/0.39 # There were 0 of these attempts blocked.
% 0.21/0.39 # There were 0 deferred branch saturation attempts.
% 0.21/0.39 # There were 0 free duplicated saturations.
% 0.21/0.39 # There were 1 total successful branch saturations.
% 0.21/0.39 # There were 0 successful branch saturations in interreduction.
% 0.21/0.39 # There were 0 successful branch saturations on the branch.
% 0.21/0.39 # There were 1 successful branch saturations after the branch.
% 0.21/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.39 # Begin clausification derivation
% 0.21/0.39
% 0.21/0.39 # End clausification derivation
% 0.21/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.39 cnf(i_0_28, plain, (add(X1,additive_identity)=X1)).
% 0.21/0.39 cnf(i_0_26, plain, (multiply(X1,multiplicative_identity)=X1)).
% 0.21/0.39 cnf(i_0_29, plain, (add(additive_identity,X1)=X1)).
% 0.21/0.39 cnf(i_0_27, plain, (multiply(multiplicative_identity,X1)=X1)).
% 0.21/0.39 cnf(i_0_22, plain, (add(X1,inverse(X1))=multiplicative_identity)).
% 0.21/0.39 cnf(i_0_24, plain, (multiply(X1,inverse(X1))=additive_identity)).
% 0.21/0.39 cnf(i_0_19, plain, (multiply(add(X1,X2),add(X1,X3))=add(X1,multiply(X2,X3)))).
% 0.21/0.39 cnf(i_0_21, plain, (add(multiply(X1,X2),multiply(X1,X3))=multiply(X1,add(X2,X3)))).
% 0.21/0.39 cnf(i_0_18, plain, (multiply(add(X1,X2),add(X3,X2))=add(multiply(X1,X3),X2))).
% 0.21/0.39 cnf(i_0_20, plain, (add(multiply(X1,X2),multiply(X3,X2))=multiply(add(X1,X3),X2))).
% 0.21/0.39 cnf(i_0_16, plain, (add(X1,X2)=add(X2,X1))).
% 0.21/0.39 cnf(i_0_17, plain, (multiply(X1,X2)=multiply(X2,X1))).
% 0.21/0.39 cnf(i_0_30, negated_conjecture, (multiply(a,add(a,b))!=a)).
% 0.21/0.39 cnf(i_0_32, plain, (X4=X4)).
% 0.21/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.39 # Begin printing tableau
% 0.21/0.39 # Found 6 steps
% 0.21/0.39 cnf(i_0_28, plain, (add(X3,additive_identity)=X3), inference(start_rule)).
% 0.21/0.39 cnf(i_0_39, plain, (add(X3,additive_identity)=X3), inference(extension_rule, [i_0_37])).
% 0.21/0.39 cnf(i_0_65, plain, (add(X5,additive_identity)!=X5), inference(closure_rule, [i_0_28])).
% 0.21/0.39 cnf(i_0_63, plain, (multiply(add(X3,additive_identity),add(X5,additive_identity))=multiply(X3,X5)), inference(extension_rule, [i_0_35])).
% 0.21/0.39 cnf(i_0_74, plain, (multiply(X3,X5)!=add(multiply(X3,X5),additive_identity)), inference(closure_rule, [i_0_28])).
% 0.21/0.39 cnf(i_0_72, plain, (multiply(add(X3,additive_identity),add(X5,additive_identity))=add(multiply(X3,X5),additive_identity)), inference(etableau_closure_rule, [i_0_72, ...])).
% 0.21/0.39 # End printing tableau
% 0.21/0.39 # SZS output end
% 0.21/0.39 # Branches closed with saturation will be marked with an "s"
% 0.21/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.39 # Begin clausification derivation
% 0.21/0.39
% 0.21/0.39 # End clausification derivation
% 0.21/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.39 cnf(i_0_28, plain, (add(X1,additive_identity)=X1)).
% 0.21/0.39 cnf(i_0_26, plain, (multiply(X1,multiplicative_identity)=X1)).
% 0.21/0.39 cnf(i_0_29, plain, (add(additive_identity,X1)=X1)).
% 0.21/0.39 cnf(i_0_27, plain, (multiply(multiplicative_identity,X1)=X1)).
% 0.21/0.39 cnf(i_0_22, plain, (add(X1,inverse(X1))=multiplicative_identity)).
% 0.21/0.39 cnf(i_0_24, plain, (multiply(X1,inverse(X1))=additive_identity)).
% 0.21/0.39 cnf(i_0_19, plain, (multiply(add(X1,X2),add(X1,X3))=add(X1,multiply(X2,X3)))).
% 0.21/0.39 cnf(i_0_21, plain, (add(multiply(X1,X2),multiply(X1,X3))=multiply(X1,add(X2,X3)))).
% 0.21/0.39 cnf(i_0_18, plain, (multiply(add(X1,X2),add(X3,X2))=add(multiply(X1,X3),X2))).
% 0.21/0.39 cnf(i_0_20, plain, (add(multiply(X1,X2),multiply(X3,X2))=multiply(add(X1,X3),X2))).
% 0.21/0.39 cnf(i_0_16, plain, (add(X1,X2)=add(X2,X1))).
% 0.21/0.39 cnf(i_0_17, plain, (multiply(X1,X2)=multiply(X2,X1))).
% 0.21/0.39 cnf(i_0_30, negated_conjecture, (multiply(a,add(a,b))!=a)).
% 0.21/0.39 cnf(i_0_32, plain, (X4=X4)).
% 0.21/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.39 # Begin printing tableau
% 0.21/0.39 # Found 6 steps
% 0.21/0.39 cnf(i_0_28, plain, (add(additive_identity,additive_identity)=additive_identity), inference(start_rule)).
% 0.21/0.39 cnf(i_0_39, plain, (add(additive_identity,additive_identity)=additive_identity), inference(extension_rule, [i_0_36])).
% 0.21/0.39 cnf(i_0_61, plain, (add(X7,additive_identity)!=X7), inference(closure_rule, [i_0_28])).
% 0.21/0.39 cnf(i_0_60, plain, (add(add(X7,additive_identity),add(additive_identity,additive_identity))=add(X7,additive_identity)), inference(extension_rule, [i_0_35])).
% 0.21/0.39 cnf(i_0_74, plain, (add(X7,additive_identity)!=X7), inference(closure_rule, [i_0_28])).
% 0.21/0.39 cnf(i_0_72, plain, (add(add(X7,additive_identity),add(additive_identity,additive_identity))=X7), inference(etableau_closure_rule, [i_0_72, ...])).
% 0.21/0.39 # End printing tableau
% 0.21/0.39 # SZS output end
% 0.21/0.39 # Branches closed with saturation will be marked with an "s"
% 0.21/0.39 # There were 1 total branch saturation attempts.
% 0.21/0.39 # There were 0 of these attempts blocked.
% 0.21/0.39 # There were 0 deferred branch saturation attempts.
% 0.21/0.39 # There were 0 free duplicated saturations.
% 0.21/0.39 # There were 1 total successful branch saturations.
% 0.21/0.39 # There were 0 successful branch saturations in interreduction.
% 0.21/0.39 # There were 0 successful branch saturations on the branch.
% 0.21/0.39 # There were 1 successful branch saturations after the branch.
% 0.21/0.39 # There were 1 total branch saturation attempts.
% 0.21/0.39 # There were 0 of these attempts blocked.
% 0.21/0.39 # There were 0 deferred branch saturation attempts.
% 0.21/0.39 # There were 0 free duplicated saturations.
% 0.21/0.39 # There were 1 total successful branch saturations.
% 0.21/0.39 # There were 0 successful branch saturations in interreduction.
% 0.21/0.39 # There were 0 successful branch saturations on the branch.
% 0.21/0.39 # There were 1 successful branch saturations after the branch.
% 0.21/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.39 # Begin clausification derivation
% 0.21/0.39
% 0.21/0.39 # End clausification derivation
% 0.21/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.39 cnf(i_0_28, plain, (add(X1,additive_identity)=X1)).
% 0.21/0.39 cnf(i_0_26, plain, (multiply(X1,multiplicative_identity)=X1)).
% 0.21/0.39 cnf(i_0_29, plain, (add(additive_identity,X1)=X1)).
% 0.21/0.39 cnf(i_0_27, plain, (multiply(multiplicative_identity,X1)=X1)).
% 0.21/0.39 cnf(i_0_22, plain, (add(X1,inverse(X1))=multiplicative_identity)).
% 0.21/0.39 cnf(i_0_24, plain, (multiply(X1,inverse(X1))=additive_identity)).
% 0.21/0.39 cnf(i_0_19, plain, (multiply(add(X1,X2),add(X1,X3))=add(X1,multiply(X2,X3)))).
% 0.21/0.39 cnf(i_0_21, plain, (add(multiply(X1,X2),multiply(X1,X3))=multiply(X1,add(X2,X3)))).
% 0.21/0.39 cnf(i_0_18, plain, (multiply(add(X1,X2),add(X3,X2))=add(multiply(X1,X3),X2))).
% 0.21/0.39 cnf(i_0_20, plain, (add(multiply(X1,X2),multiply(X3,X2))=multiply(add(X1,X3),X2))).
% 0.21/0.39 cnf(i_0_16, plain, (add(X1,X2)=add(X2,X1))).
% 0.21/0.39 cnf(i_0_17, plain, (multiply(X1,X2)=multiply(X2,X1))).
% 0.21/0.39 cnf(i_0_30, negated_conjecture, (multiply(a,add(a,b))!=a)).
% 0.21/0.39 cnf(i_0_32, plain, (X4=X4)).
% 0.21/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.39 # Begin printing tableau
% 0.21/0.39 # Found 6 steps
% 0.21/0.39 cnf(i_0_28, plain, (add(X7,additive_identity)=X7), inference(start_rule)).
% 0.21/0.39 cnf(i_0_39, plain, (add(X7,additive_identity)=X7), inference(extension_rule, [i_0_36])).
% 0.21/0.39 cnf(i_0_62, plain, (add(additive_identity,additive_identity)!=additive_identity), inference(closure_rule, [i_0_28])).
% 0.21/0.39 cnf(i_0_60, plain, (add(add(X7,additive_identity),add(additive_identity,additive_identity))=add(X7,additive_identity)), inference(extension_rule, [i_0_35])).
% 0.21/0.39 cnf(i_0_74, plain, (add(X7,additive_identity)!=X7), inference(closure_rule, [i_0_28])).
% 0.21/0.39 cnf(i_0_72, plain, (add(add(X7,additive_identity),add(additive_identity,additive_identity))=X7), inference(etableau_closure_rule, [i_0_72, ...])).
% 0.21/0.39 # End printing tableau
% 0.21/0.39 # SZS output end
% 0.21/0.39 # Branches closed with saturation will be marked with an "s"
% 0.21/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.39 # Begin clausification derivation
% 0.21/0.39
% 0.21/0.39 # End clausification derivation
% 0.21/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.39 cnf(i_0_28, plain, (add(X1,additive_identity)=X1)).
% 0.21/0.39 cnf(i_0_26, plain, (multiply(X1,multiplicative_identity)=X1)).
% 0.21/0.39 cnf(i_0_29, plain, (add(additive_identity,X1)=X1)).
% 0.21/0.39 cnf(i_0_27, plain, (multiply(multiplicative_identity,X1)=X1)).
% 0.21/0.39 cnf(i_0_22, plain, (add(X1,inverse(X1))=multiplicative_identity)).
% 0.21/0.39 cnf(i_0_24, plain, (multiply(X1,inverse(X1))=additive_identity)).
% 0.21/0.39 cnf(i_0_19, plain, (multiply(add(X1,X2),add(X1,X3))=add(X1,multiply(X2,X3)))).
% 0.21/0.39 cnf(i_0_21, plain, (add(multiply(X1,X2),multiply(X1,X3))=multiply(X1,add(X2,X3)))).
% 0.21/0.39 cnf(i_0_18, plain, (multiply(add(X1,X2),add(X3,X2))=add(multiply(X1,X3),X2))).
% 0.21/0.39 cnf(i_0_20, plain, (add(multiply(X1,X2),multiply(X3,X2))=multiply(add(X1,X3),X2))).
% 0.21/0.39 cnf(i_0_16, plain, (add(X1,X2)=add(X2,X1))).
% 0.21/0.39 cnf(i_0_17, plain, (multiply(X1,X2)=multiply(X2,X1))).
% 0.21/0.39 cnf(i_0_30, negated_conjecture, (multiply(a,add(a,b))!=a)).
% 0.21/0.39 cnf(i_0_32, plain, (X4=X4)).
% 0.21/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.39 # Begin printing tableau
% 0.21/0.39 # Found 6 steps
% 0.21/0.39 cnf(i_0_28, plain, (add(a,additive_identity)=a), inference(start_rule)).
% 0.21/0.39 cnf(i_0_39, plain, (add(a,additive_identity)=a), inference(extension_rule, [i_0_35])).
% 0.21/0.39 cnf(i_0_57, plain, (multiply(a,add(a,b))=a), inference(closure_rule, [i_0_30])).
% 0.21/0.39 cnf(i_0_58, plain, (multiply(a,add(a,b))!=add(a,additive_identity)), inference(extension_rule, [i_0_35])).
% 0.21/0.39 cnf(i_0_73, plain, (multiply(a,add(a,b))!=add(multiply(a,add(a,b)),additive_identity)), inference(closure_rule, [i_0_28])).
% 0.21/0.39 cnf(i_0_74, plain, (add(multiply(a,add(a,b)),additive_identity)!=add(a,additive_identity)), inference(etableau_closure_rule, [i_0_74, ...])).
% 0.21/0.39 # End printing tableau
% 0.21/0.39 # SZS output end
% 0.21/0.39 # Branches closed with saturation will be marked with an "s"
% 0.21/0.39 # Child (25929) has found a proof.
% 0.21/0.39
% 0.21/0.39 # Proof search is over...
% 0.21/0.39 # Freeing feature tree
%------------------------------------------------------------------------------