TSTP Solution File: BOO004-10 by Etableau---0.67

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : BOO004-10 : TPTP v8.1.0. Released v7.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 : n018.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:21 EDT 2022

% Result   : Unsatisfiable 0.19s 0.46s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : BOO004-10 : TPTP v8.1.0. Released v7.5.0.
% 0.13/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 : n018.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 : Wed Jun  1 23:21:59 EDT 2022
% 0.19/0.35  % CPUTime  : 
% 0.19/0.37  # No SInE strategy applied
% 0.19/0.37  # Auto-Mode selected heuristic G_E___300_C18_F1_SE_CS_SP_PS_S0Y
% 0.19/0.37  # and selection function SelectMaxLComplexAvoidPosPred.
% 0.19/0.37  #
% 0.19/0.37  # Presaturation interreduction done
% 0.19/0.37  # Number of axioms: 25 Number of unprocessed: 25
% 0.19/0.37  # Tableaux proof search.
% 0.19/0.37  # APR header successfully linked.
% 0.19/0.37  # Hello from C++
% 0.19/0.38  # The folding up rule is enabled...
% 0.19/0.38  # Local unification is enabled...
% 0.19/0.38  # Any saturation attempts will use folding labels...
% 0.19/0.38  # 25 beginning clauses after preprocessing and clausification
% 0.19/0.38  # Creating start rules for all 1 conjectures.
% 0.19/0.38  # There are 1 start rule candidates:
% 0.19/0.38  # Found 25 unit axioms.
% 0.19/0.38  # 1 start rule tableaux created.
% 0.19/0.38  # 0 extension rule candidate clauses
% 0.19/0.38  # 25 unit axiom clauses
% 0.19/0.38  
% 0.19/0.38  # Requested 8, 32 cores available to the main process.
% 0.19/0.38  # There are not enough tableaux to fork, creating more from the initial 1
% 0.19/0.38  # Creating equality axioms
% 0.19/0.38  # Ran out of tableaux, making start rules for all clauses
% 0.19/0.38  # Returning from population with 46 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.38  # We now have 46 tableaux to operate on
% 0.19/0.46  # There were 1 total branch saturation attempts.
% 0.19/0.46  # There were 0 of these attempts blocked.
% 0.19/0.46  # There were 0 deferred branch saturation attempts.
% 0.19/0.46  # There were 0 free duplicated saturations.
% 0.19/0.46  # There were 1 total successful branch saturations.
% 0.19/0.46  # There were 0 successful branch saturations in interreduction.
% 0.19/0.46  # There were 0 successful branch saturations on the branch.
% 0.19/0.46  # There were 1 successful branch saturations after the branch.
% 0.19/0.46  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46  # Begin clausification derivation
% 0.19/0.46  
% 0.19/0.46  # End clausification derivation
% 0.19/0.46  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.46  cnf(i_0_33, plain, (sum(X1,additive_identity,X1)=true)).
% 0.19/0.46  cnf(i_0_35, plain, (product(X1,multiplicative_identity,X1)=true)).
% 0.19/0.46  cnf(i_0_32, plain, (sum(additive_identity,X1,X1)=true)).
% 0.19/0.46  cnf(i_0_34, plain, (product(multiplicative_identity,X1,X1)=true)).
% 0.19/0.46  cnf(i_0_45, plain, (sum(X1,inverse(X1),multiplicative_identity)=true)).
% 0.19/0.46  cnf(i_0_47, plain, (product(X1,inverse(X1),additive_identity)=true)).
% 0.19/0.46  cnf(i_0_44, plain, (sum(inverse(X1),X1,multiplicative_identity)=true)).
% 0.19/0.46  cnf(i_0_46, plain, (product(inverse(X1),X1,additive_identity)=true)).
% 0.19/0.46  cnf(i_0_26, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 0.19/0.46  cnf(i_0_27, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.19/0.46  cnf(i_0_28, plain, (sum(X1,X2,add(X1,X2))=true)).
% 0.19/0.46  cnf(i_0_29, plain, (product(X1,X2,multiply(X1,X2))=true)).
% 0.19/0.46  cnf(i_0_30, plain, (ifeq(sum(X1,X2,X3),true,sum(X2,X1,X3),true)=true)).
% 0.19/0.46  cnf(i_0_31, plain, (ifeq(product(X1,X2,X3),true,product(X2,X1,X3),true)=true)).
% 0.19/0.46  cnf(i_0_48, plain, (ifeq2(sum(X1,X2,X3),true,ifeq2(sum(X1,X2,X4),true,X4,X3),X3)=X3)).
% 0.19/0.46  cnf(i_0_49, plain, (ifeq2(product(X1,X2,X3),true,ifeq2(product(X1,X2,X4),true,X4,X3),X3)=X3)).
% 0.19/0.46  cnf(i_0_40, plain, (ifeq(product(X1,X2,X3),true,ifeq(sum(X4,X3,X5),true,ifeq(sum(X4,X2,X6),true,ifeq(sum(X4,X1,X7),true,product(X7,X6,X5),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_42, plain, (ifeq(product(X1,X2,X3),true,ifeq(sum(X3,X4,X5),true,ifeq(sum(X2,X4,X6),true,ifeq(sum(X1,X4,X7),true,product(X7,X6,X5),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_41, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X5,X6),true,ifeq(sum(X7,X5,X2),true,ifeq(sum(X7,X4,X1),true,sum(X7,X6,X3),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_43, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X5,X6),true,ifeq(sum(X5,X7,X2),true,ifeq(sum(X4,X7,X1),true,sum(X6,X7,X3),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_39, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X2,X5),true,ifeq(sum(X5,X3,X6),true,ifeq(sum(X4,X1,X7),true,product(X7,X2,X6),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_38, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X2,X5),true,ifeq(product(X6,X2,X7),true,ifeq(sum(X6,X4,X1),true,sum(X7,X5,X3),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_37, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X1,X4,X5),true,ifeq(sum(X5,X3,X6),true,ifeq(sum(X4,X2,X7),true,product(X1,X7,X6),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_36, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X1,X4,X5),true,ifeq(product(X1,X6,X7),true,ifeq(sum(X6,X4,X2),true,sum(X7,X5,X3),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_50, negated_conjecture, (sum(x,x,x)!=true)).
% 0.19/0.46  cnf(i_0_52, plain, (X8=X8)).
% 0.19/0.46  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.19/0.46  # Begin printing tableau
% 0.19/0.46  # Found 7 steps
% 0.19/0.46  cnf(i_0_33, plain, (sum(X9,additive_identity,X9)=true), inference(start_rule)).
% 0.19/0.46  cnf(i_0_63, plain, (sum(X9,additive_identity,X9)=true), inference(extension_rule, [i_0_59])).
% 0.19/0.46  cnf(i_0_110, plain, (sum(X1,additive_identity,X1)!=true), inference(closure_rule, [i_0_33])).
% 0.19/0.46  cnf(i_0_112, plain, (sum(X1,additive_identity,X1)!=true), inference(closure_rule, [i_0_33])).
% 0.19/0.46  cnf(i_0_109, plain, (sum(sum(X1,additive_identity,X1),sum(X9,additive_identity,X9),sum(X1,additive_identity,X1))=sum(true,true,true)), inference(extension_rule, [i_0_55])).
% 0.19/0.46  cnf(i_0_128, plain, (sum(true,true,true)!=ifeq2(X1,X1,sum(true,true,true),X3)), inference(closure_rule, [i_0_26])).
% 0.19/0.46  cnf(i_0_126, plain, (sum(sum(X1,additive_identity,X1),sum(X9,additive_identity,X9),sum(X1,additive_identity,X1))=ifeq2(X1,X1,sum(true,true,true),X3)), inference(etableau_closure_rule, [i_0_126, ...])).
% 0.19/0.46  # End printing tableau
% 0.19/0.46  # SZS output end
% 0.19/0.46  # Branches closed with saturation will be marked with an "s"
% 0.19/0.46  # There were 1 total branch saturation attempts.
% 0.19/0.46  # There were 0 of these attempts blocked.
% 0.19/0.46  # There were 0 deferred branch saturation attempts.
% 0.19/0.46  # There were 0 free duplicated saturations.
% 0.19/0.46  # There were 1 total successful branch saturations.
% 0.19/0.46  # There were 0 successful branch saturations in interreduction.
% 0.19/0.46  # There were 0 successful branch saturations on the branch.
% 0.19/0.46  # There were 1 successful branch saturations after the branch.
% 0.19/0.46  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46  # Begin clausification derivation
% 0.19/0.46  
% 0.19/0.46  # End clausification derivation
% 0.19/0.46  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.46  cnf(i_0_33, plain, (sum(X1,additive_identity,X1)=true)).
% 0.19/0.46  cnf(i_0_35, plain, (product(X1,multiplicative_identity,X1)=true)).
% 0.19/0.46  cnf(i_0_32, plain, (sum(additive_identity,X1,X1)=true)).
% 0.19/0.46  cnf(i_0_34, plain, (product(multiplicative_identity,X1,X1)=true)).
% 0.19/0.46  cnf(i_0_45, plain, (sum(X1,inverse(X1),multiplicative_identity)=true)).
% 0.19/0.46  cnf(i_0_47, plain, (product(X1,inverse(X1),additive_identity)=true)).
% 0.19/0.46  cnf(i_0_44, plain, (sum(inverse(X1),X1,multiplicative_identity)=true)).
% 0.19/0.46  cnf(i_0_46, plain, (product(inverse(X1),X1,additive_identity)=true)).
% 0.19/0.46  cnf(i_0_26, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 0.19/0.46  cnf(i_0_27, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.19/0.46  cnf(i_0_28, plain, (sum(X1,X2,add(X1,X2))=true)).
% 0.19/0.46  cnf(i_0_29, plain, (product(X1,X2,multiply(X1,X2))=true)).
% 0.19/0.46  cnf(i_0_30, plain, (ifeq(sum(X1,X2,X3),true,sum(X2,X1,X3),true)=true)).
% 0.19/0.46  cnf(i_0_31, plain, (ifeq(product(X1,X2,X3),true,product(X2,X1,X3),true)=true)).
% 0.19/0.46  cnf(i_0_48, plain, (ifeq2(sum(X1,X2,X3),true,ifeq2(sum(X1,X2,X4),true,X4,X3),X3)=X3)).
% 0.19/0.46  cnf(i_0_49, plain, (ifeq2(product(X1,X2,X3),true,ifeq2(product(X1,X2,X4),true,X4,X3),X3)=X3)).
% 0.19/0.46  cnf(i_0_40, plain, (ifeq(product(X1,X2,X3),true,ifeq(sum(X4,X3,X5),true,ifeq(sum(X4,X2,X6),true,ifeq(sum(X4,X1,X7),true,product(X7,X6,X5),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_42, plain, (ifeq(product(X1,X2,X3),true,ifeq(sum(X3,X4,X5),true,ifeq(sum(X2,X4,X6),true,ifeq(sum(X1,X4,X7),true,product(X7,X6,X5),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_41, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X5,X6),true,ifeq(sum(X7,X5,X2),true,ifeq(sum(X7,X4,X1),true,sum(X7,X6,X3),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_43, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X5,X6),true,ifeq(sum(X5,X7,X2),true,ifeq(sum(X4,X7,X1),true,sum(X6,X7,X3),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_39, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X2,X5),true,ifeq(sum(X5,X3,X6),true,ifeq(sum(X4,X1,X7),true,product(X7,X2,X6),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_38, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X2,X5),true,ifeq(product(X6,X2,X7),true,ifeq(sum(X6,X4,X1),true,sum(X7,X5,X3),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_37, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X1,X4,X5),true,ifeq(sum(X5,X3,X6),true,ifeq(sum(X4,X2,X7),true,product(X1,X7,X6),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_36, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X1,X4,X5),true,ifeq(product(X1,X6,X7),true,ifeq(sum(X6,X4,X2),true,sum(X7,X5,X3),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_50, negated_conjecture, (sum(x,x,x)!=true)).
% 0.19/0.46  cnf(i_0_52, plain, (X8=X8)).
% 0.19/0.46  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.19/0.46  # Begin printing tableau
% 0.19/0.46  # Found 7 steps
% 0.19/0.46  cnf(i_0_33, plain, (sum(X10,additive_identity,X10)=true), inference(start_rule)).
% 0.19/0.46  cnf(i_0_63, plain, (sum(X10,additive_identity,X10)=true), inference(extension_rule, [i_0_62])).
% 0.19/0.46  cnf(i_0_120, plain, (inverse(sum(X10,additive_identity,X10))=inverse(true)), inference(extension_rule, [i_0_56])).
% 0.19/0.46  cnf(i_0_256, plain, (sum(X1,additive_identity,X1)!=true), inference(closure_rule, [i_0_33])).
% 0.19/0.46  cnf(i_0_257, plain, (sum(X1,additive_identity,X1)!=true), inference(closure_rule, [i_0_33])).
% 0.19/0.46  cnf(i_0_258, plain, (sum(X1,additive_identity,X1)!=true), inference(closure_rule, [i_0_33])).
% 0.19/0.46  cnf(i_0_254, plain, (ifeq2(inverse(sum(X10,additive_identity,X10)),sum(X1,additive_identity,X1),sum(X1,additive_identity,X1),sum(X1,additive_identity,X1))=ifeq2(inverse(true),true,true,true)), inference(etableau_closure_rule, [i_0_254, ...])).
% 0.19/0.46  # End printing tableau
% 0.19/0.46  # SZS output end
% 0.19/0.46  # Branches closed with saturation will be marked with an "s"
% 0.19/0.46  # There were 1 total branch saturation attempts.
% 0.19/0.46  # There were 0 of these attempts blocked.
% 0.19/0.46  # There were 0 deferred branch saturation attempts.
% 0.19/0.46  # There were 0 free duplicated saturations.
% 0.19/0.46  # There were 1 total successful branch saturations.
% 0.19/0.46  # There were 0 successful branch saturations in interreduction.
% 0.19/0.46  # There were 0 successful branch saturations on the branch.
% 0.19/0.46  # There were 1 successful branch saturations after the branch.
% 0.19/0.46  # There were 1 total branch saturation attempts.
% 0.19/0.46  # There were 0 of these attempts blocked.
% 0.19/0.46  # There were 0 deferred branch saturation attempts.
% 0.19/0.46  # There were 0 free duplicated saturations.
% 0.19/0.46  # There were 1 total successful branch saturations.
% 0.19/0.46  # There were 0 successful branch saturations in interreduction.
% 0.19/0.46  # There were 0 successful branch saturations on the branch.
% 0.19/0.46  # There were 1 successful branch saturations after the branch.
% 0.19/0.46  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46  # Begin clausification derivation
% 0.19/0.46  
% 0.19/0.46  # End clausification derivation
% 0.19/0.46  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.46  cnf(i_0_33, plain, (sum(X1,additive_identity,X1)=true)).
% 0.19/0.46  cnf(i_0_35, plain, (product(X1,multiplicative_identity,X1)=true)).
% 0.19/0.46  cnf(i_0_32, plain, (sum(additive_identity,X1,X1)=true)).
% 0.19/0.46  cnf(i_0_34, plain, (product(multiplicative_identity,X1,X1)=true)).
% 0.19/0.46  cnf(i_0_45, plain, (sum(X1,inverse(X1),multiplicative_identity)=true)).
% 0.19/0.46  cnf(i_0_47, plain, (product(X1,inverse(X1),additive_identity)=true)).
% 0.19/0.46  cnf(i_0_44, plain, (sum(inverse(X1),X1,multiplicative_identity)=true)).
% 0.19/0.46  cnf(i_0_46, plain, (product(inverse(X1),X1,additive_identity)=true)).
% 0.19/0.46  cnf(i_0_26, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 0.19/0.46  cnf(i_0_27, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.19/0.46  cnf(i_0_28, plain, (sum(X1,X2,add(X1,X2))=true)).
% 0.19/0.46  cnf(i_0_29, plain, (product(X1,X2,multiply(X1,X2))=true)).
% 0.19/0.46  cnf(i_0_30, plain, (ifeq(sum(X1,X2,X3),true,sum(X2,X1,X3),true)=true)).
% 0.19/0.46  cnf(i_0_31, plain, (ifeq(product(X1,X2,X3),true,product(X2,X1,X3),true)=true)).
% 0.19/0.46  cnf(i_0_48, plain, (ifeq2(sum(X1,X2,X3),true,ifeq2(sum(X1,X2,X4),true,X4,X3),X3)=X3)).
% 0.19/0.46  cnf(i_0_49, plain, (ifeq2(product(X1,X2,X3),true,ifeq2(product(X1,X2,X4),true,X4,X3),X3)=X3)).
% 0.19/0.46  cnf(i_0_40, plain, (ifeq(product(X1,X2,X3),true,ifeq(sum(X4,X3,X5),true,ifeq(sum(X4,X2,X6),true,ifeq(sum(X4,X1,X7),true,product(X7,X6,X5),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_42, plain, (ifeq(product(X1,X2,X3),true,ifeq(sum(X3,X4,X5),true,ifeq(sum(X2,X4,X6),true,ifeq(sum(X1,X4,X7),true,product(X7,X6,X5),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_41, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X5,X6),true,ifeq(sum(X7,X5,X2),true,ifeq(sum(X7,X4,X1),true,sum(X7,X6,X3),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_43, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X5,X6),true,ifeq(sum(X5,X7,X2),true,ifeq(sum(X4,X7,X1),true,sum(X6,X7,X3),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_39, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X2,X5),true,ifeq(sum(X5,X3,X6),true,ifeq(sum(X4,X1,X7),true,product(X7,X2,X6),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_38, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X2,X5),true,ifeq(product(X6,X2,X7),true,ifeq(sum(X6,X4,X1),true,sum(X7,X5,X3),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_37, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X1,X4,X5),true,ifeq(sum(X5,X3,X6),true,ifeq(sum(X4,X2,X7),true,product(X1,X7,X6),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_36, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X1,X4,X5),true,ifeq(product(X1,X6,X7),true,ifeq(sum(X6,X4,X2),true,sum(X7,X5,X3),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_50, negated_conjecture, (sum(x,x,x)!=true)).
% 0.19/0.46  cnf(i_0_52, plain, (X8=X8)).
% 0.19/0.46  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.19/0.46  # Begin printing tableau
% 0.19/0.46  # Found 7 steps
% 0.19/0.46  cnf(i_0_33, plain, (sum(X10,additive_identity,X10)=true), inference(start_rule)).
% 0.19/0.46  cnf(i_0_63, plain, (sum(X10,additive_identity,X10)=true), inference(extension_rule, [i_0_61])).
% 0.19/0.46  cnf(i_0_117, plain, (sum(X1,additive_identity,X1)!=true), inference(closure_rule, [i_0_33])).
% 0.19/0.46  cnf(i_0_118, plain, (sum(X1,additive_identity,X1)!=true), inference(closure_rule, [i_0_33])).
% 0.19/0.46  cnf(i_0_116, plain, (product(sum(X1,additive_identity,X1),sum(X1,additive_identity,X1),sum(X10,additive_identity,X10))=product(true,true,true)), inference(extension_rule, [i_0_55])).
% 0.19/0.46  cnf(i_0_128, plain, (product(true,true,true)!=ifeq2(X1,X1,product(true,true,true),X3)), inference(closure_rule, [i_0_26])).
% 0.19/0.46  cnf(i_0_126, plain, (product(sum(X1,additive_identity,X1),sum(X1,additive_identity,X1),sum(X10,additive_identity,X10))=ifeq2(X1,X1,product(true,true,true),X3)), inference(etableau_closure_rule, [i_0_126, ...])).
% 0.19/0.46  # End printing tableau
% 0.19/0.46  # SZS output end
% 0.19/0.46  # Branches closed with saturation will be marked with an "s"
% 0.19/0.46  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46  # Begin clausification derivation
% 0.19/0.46  
% 0.19/0.46  # End clausification derivation
% 0.19/0.46  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.46  cnf(i_0_33, plain, (sum(X1,additive_identity,X1)=true)).
% 0.19/0.46  cnf(i_0_35, plain, (product(X1,multiplicative_identity,X1)=true)).
% 0.19/0.46  cnf(i_0_32, plain, (sum(additive_identity,X1,X1)=true)).
% 0.19/0.46  cnf(i_0_34, plain, (product(multiplicative_identity,X1,X1)=true)).
% 0.19/0.46  cnf(i_0_45, plain, (sum(X1,inverse(X1),multiplicative_identity)=true)).
% 0.19/0.46  cnf(i_0_47, plain, (product(X1,inverse(X1),additive_identity)=true)).
% 0.19/0.46  cnf(i_0_44, plain, (sum(inverse(X1),X1,multiplicative_identity)=true)).
% 0.19/0.46  cnf(i_0_46, plain, (product(inverse(X1),X1,additive_identity)=true)).
% 0.19/0.46  cnf(i_0_26, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 0.19/0.46  cnf(i_0_27, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.19/0.46  cnf(i_0_28, plain, (sum(X1,X2,add(X1,X2))=true)).
% 0.19/0.46  cnf(i_0_29, plain, (product(X1,X2,multiply(X1,X2))=true)).
% 0.19/0.46  cnf(i_0_30, plain, (ifeq(sum(X1,X2,X3),true,sum(X2,X1,X3),true)=true)).
% 0.19/0.46  cnf(i_0_31, plain, (ifeq(product(X1,X2,X3),true,product(X2,X1,X3),true)=true)).
% 0.19/0.46  cnf(i_0_48, plain, (ifeq2(sum(X1,X2,X3),true,ifeq2(sum(X1,X2,X4),true,X4,X3),X3)=X3)).
% 0.19/0.46  cnf(i_0_49, plain, (ifeq2(product(X1,X2,X3),true,ifeq2(product(X1,X2,X4),true,X4,X3),X3)=X3)).
% 0.19/0.46  cnf(i_0_40, plain, (ifeq(product(X1,X2,X3),true,ifeq(sum(X4,X3,X5),true,ifeq(sum(X4,X2,X6),true,ifeq(sum(X4,X1,X7),true,product(X7,X6,X5),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_42, plain, (ifeq(product(X1,X2,X3),true,ifeq(sum(X3,X4,X5),true,ifeq(sum(X2,X4,X6),true,ifeq(sum(X1,X4,X7),true,product(X7,X6,X5),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_41, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X5,X6),true,ifeq(sum(X7,X5,X2),true,ifeq(sum(X7,X4,X1),true,sum(X7,X6,X3),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_43, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X5,X6),true,ifeq(sum(X5,X7,X2),true,ifeq(sum(X4,X7,X1),true,sum(X6,X7,X3),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_39, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X2,X5),true,ifeq(sum(X5,X3,X6),true,ifeq(sum(X4,X1,X7),true,product(X7,X2,X6),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_38, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X2,X5),true,ifeq(product(X6,X2,X7),true,ifeq(sum(X6,X4,X1),true,sum(X7,X5,X3),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_37, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X1,X4,X5),true,ifeq(sum(X5,X3,X6),true,ifeq(sum(X4,X2,X7),true,product(X1,X7,X6),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_36, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X1,X4,X5),true,ifeq(product(X1,X6,X7),true,ifeq(sum(X6,X4,X2),true,sum(X7,X5,X3),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_50, negated_conjecture, (sum(x,x,x)!=true)).
% 0.19/0.46  cnf(i_0_52, plain, (X8=X8)).
% 0.19/0.46  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.19/0.46  # Begin printing tableau
% 0.19/0.46  # Found 6 steps
% 0.19/0.46  cnf(i_0_33, plain, (sum(X7,additive_identity,X7)=true), inference(start_rule)).
% 0.19/0.46  cnf(i_0_63, plain, (sum(X7,additive_identity,X7)=true), inference(extension_rule, [i_0_60])).
% 0.19/0.46  cnf(i_0_114, plain, (sum(X1,additive_identity,X1)!=true), inference(closure_rule, [i_0_33])).
% 0.19/0.46  cnf(i_0_113, plain, (multiply(sum(X1,additive_identity,X1),sum(X7,additive_identity,X7))=multiply(true,true)), inference(extension_rule, [i_0_55])).
% 0.19/0.46  cnf(i_0_128, plain, (multiply(true,true)!=ifeq2(X1,X1,multiply(true,true),X3)), inference(closure_rule, [i_0_26])).
% 0.19/0.46  cnf(i_0_126, plain, (multiply(sum(X1,additive_identity,X1),sum(X7,additive_identity,X7))=ifeq2(X1,X1,multiply(true,true),X3)), inference(etableau_closure_rule, [i_0_126, ...])).
% 0.19/0.46  # End printing tableau
% 0.19/0.46  # SZS output end
% 0.19/0.46  # Branches closed with saturation will be marked with an "s"
% 0.19/0.46  # There were 1 total branch saturation attempts.
% 0.19/0.46  # There were 0 of these attempts blocked.
% 0.19/0.46  # There were 0 deferred branch saturation attempts.
% 0.19/0.46  # There were 0 free duplicated saturations.
% 0.19/0.46  # There were 1 total successful branch saturations.
% 0.19/0.46  # There were 0 successful branch saturations in interreduction.
% 0.19/0.46  # There were 0 successful branch saturations on the branch.
% 0.19/0.46  # There were 1 successful branch saturations after the branch.
% 0.19/0.46  # There were 1 total branch saturation attempts.
% 0.19/0.46  # There were 0 of these attempts blocked.
% 0.19/0.46  # There were 0 deferred branch saturation attempts.
% 0.19/0.46  # There were 0 free duplicated saturations.
% 0.19/0.46  # There were 1 total successful branch saturations.
% 0.19/0.46  # There were 0 successful branch saturations in interreduction.
% 0.19/0.46  # There were 0 successful branch saturations on the branch.
% 0.19/0.46  # There were 1 successful branch saturations after the branch.
% 0.19/0.46  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46  # Begin clausification derivation
% 0.19/0.46  
% 0.19/0.46  # End clausification derivation
% 0.19/0.46  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.46  cnf(i_0_33, plain, (sum(X1,additive_identity,X1)=true)).
% 0.19/0.46  cnf(i_0_35, plain, (product(X1,multiplicative_identity,X1)=true)).
% 0.19/0.46  cnf(i_0_32, plain, (sum(additive_identity,X1,X1)=true)).
% 0.19/0.46  cnf(i_0_34, plain, (product(multiplicative_identity,X1,X1)=true)).
% 0.19/0.46  cnf(i_0_45, plain, (sum(X1,inverse(X1),multiplicative_identity)=true)).
% 0.19/0.46  cnf(i_0_47, plain, (product(X1,inverse(X1),additive_identity)=true)).
% 0.19/0.46  cnf(i_0_44, plain, (sum(inverse(X1),X1,multiplicative_identity)=true)).
% 0.19/0.46  cnf(i_0_46, plain, (product(inverse(X1),X1,additive_identity)=true)).
% 0.19/0.46  cnf(i_0_26, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 0.19/0.46  cnf(i_0_27, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.19/0.46  cnf(i_0_28, plain, (sum(X1,X2,add(X1,X2))=true)).
% 0.19/0.46  cnf(i_0_29, plain, (product(X1,X2,multiply(X1,X2))=true)).
% 0.19/0.46  cnf(i_0_30, plain, (ifeq(sum(X1,X2,X3),true,sum(X2,X1,X3),true)=true)).
% 0.19/0.46  cnf(i_0_31, plain, (ifeq(product(X1,X2,X3),true,product(X2,X1,X3),true)=true)).
% 0.19/0.46  cnf(i_0_48, plain, (ifeq2(sum(X1,X2,X3),true,ifeq2(sum(X1,X2,X4),true,X4,X3),X3)=X3)).
% 0.19/0.46  cnf(i_0_49, plain, (ifeq2(product(X1,X2,X3),true,ifeq2(product(X1,X2,X4),true,X4,X3),X3)=X3)).
% 0.19/0.46  cnf(i_0_40, plain, (ifeq(product(X1,X2,X3),true,ifeq(sum(X4,X3,X5),true,ifeq(sum(X4,X2,X6),true,ifeq(sum(X4,X1,X7),true,product(X7,X6,X5),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_42, plain, (ifeq(product(X1,X2,X3),true,ifeq(sum(X3,X4,X5),true,ifeq(sum(X2,X4,X6),true,ifeq(sum(X1,X4,X7),true,product(X7,X6,X5),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_41, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X5,X6),true,ifeq(sum(X7,X5,X2),true,ifeq(sum(X7,X4,X1),true,sum(X7,X6,X3),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_43, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X5,X6),true,ifeq(sum(X5,X7,X2),true,ifeq(sum(X4,X7,X1),true,sum(X6,X7,X3),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_39, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X2,X5),true,ifeq(sum(X5,X3,X6),true,ifeq(sum(X4,X1,X7),true,product(X7,X2,X6),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_38, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X2,X5),true,ifeq(product(X6,X2,X7),true,ifeq(sum(X6,X4,X1),true,sum(X7,X5,X3),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_37, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X1,X4,X5),true,ifeq(sum(X5,X3,X6),true,ifeq(sum(X4,X2,X7),true,product(X1,X7,X6),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_36, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X1,X4,X5),true,ifeq(product(X1,X6,X7),true,ifeq(sum(X6,X4,X2),true,sum(X7,X5,X3),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_50, negated_conjecture, (sum(x,x,x)!=true)).
% 0.19/0.46  cnf(i_0_52, plain, (X8=X8)).
% 0.19/0.46  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.19/0.46  # Begin printing tableau
% 0.19/0.46  # Found 7 steps
% 0.19/0.46  cnf(i_0_33, plain, (sum(X9,additive_identity,X9)=true), inference(start_rule)).
% 0.19/0.46  cnf(i_0_63, plain, (sum(X9,additive_identity,X9)=true), inference(extension_rule, [i_0_61])).
% 0.19/0.46  cnf(i_0_117, plain, (sum(X1,additive_identity,X1)!=true), inference(closure_rule, [i_0_33])).
% 0.19/0.46  cnf(i_0_119, plain, (sum(X1,additive_identity,X1)!=true), inference(closure_rule, [i_0_33])).
% 0.19/0.46  cnf(i_0_116, plain, (product(sum(X1,additive_identity,X1),sum(X9,additive_identity,X9),sum(X1,additive_identity,X1))=product(true,true,true)), inference(extension_rule, [i_0_55])).
% 0.19/0.46  cnf(i_0_128, plain, (product(true,true,true)!=ifeq2(X1,X1,product(true,true,true),X3)), inference(closure_rule, [i_0_26])).
% 0.19/0.46  cnf(i_0_126, plain, (product(sum(X1,additive_identity,X1),sum(X9,additive_identity,X9),sum(X1,additive_identity,X1))=ifeq2(X1,X1,product(true,true,true),X3)), inference(etableau_closure_rule, [i_0_126, ...])).
% 0.19/0.46  # End printing tableau
% 0.19/0.46  # SZS output end
% 0.19/0.46  # Branches closed with saturation will be marked with an "s"
% 0.19/0.46  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46  # Begin clausification derivation
% 0.19/0.46  
% 0.19/0.46  # End clausification derivation
% 0.19/0.46  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.46  cnf(i_0_33, plain, (sum(X1,additive_identity,X1)=true)).
% 0.19/0.46  cnf(i_0_35, plain, (product(X1,multiplicative_identity,X1)=true)).
% 0.19/0.46  cnf(i_0_32, plain, (sum(additive_identity,X1,X1)=true)).
% 0.19/0.46  cnf(i_0_34, plain, (product(multiplicative_identity,X1,X1)=true)).
% 0.19/0.46  cnf(i_0_45, plain, (sum(X1,inverse(X1),multiplicative_identity)=true)).
% 0.19/0.46  cnf(i_0_47, plain, (product(X1,inverse(X1),additive_identity)=true)).
% 0.19/0.46  cnf(i_0_44, plain, (sum(inverse(X1),X1,multiplicative_identity)=true)).
% 0.19/0.46  cnf(i_0_46, plain, (product(inverse(X1),X1,additive_identity)=true)).
% 0.19/0.46  cnf(i_0_26, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 0.19/0.46  cnf(i_0_27, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.19/0.46  cnf(i_0_28, plain, (sum(X1,X2,add(X1,X2))=true)).
% 0.19/0.46  cnf(i_0_29, plain, (product(X1,X2,multiply(X1,X2))=true)).
% 0.19/0.46  cnf(i_0_30, plain, (ifeq(sum(X1,X2,X3),true,sum(X2,X1,X3),true)=true)).
% 0.19/0.46  cnf(i_0_31, plain, (ifeq(product(X1,X2,X3),true,product(X2,X1,X3),true)=true)).
% 0.19/0.46  cnf(i_0_48, plain, (ifeq2(sum(X1,X2,X3),true,ifeq2(sum(X1,X2,X4),true,X4,X3),X3)=X3)).
% 0.19/0.46  cnf(i_0_49, plain, (ifeq2(product(X1,X2,X3),true,ifeq2(product(X1,X2,X4),true,X4,X3),X3)=X3)).
% 0.19/0.46  cnf(i_0_40, plain, (ifeq(product(X1,X2,X3),true,ifeq(sum(X4,X3,X5),true,ifeq(sum(X4,X2,X6),true,ifeq(sum(X4,X1,X7),true,product(X7,X6,X5),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_42, plain, (ifeq(product(X1,X2,X3),true,ifeq(sum(X3,X4,X5),true,ifeq(sum(X2,X4,X6),true,ifeq(sum(X1,X4,X7),true,product(X7,X6,X5),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_41, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X5,X6),true,ifeq(sum(X7,X5,X2),true,ifeq(sum(X7,X4,X1),true,sum(X7,X6,X3),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_43, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X5,X6),true,ifeq(sum(X5,X7,X2),true,ifeq(sum(X4,X7,X1),true,sum(X6,X7,X3),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_39, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X2,X5),true,ifeq(sum(X5,X3,X6),true,ifeq(sum(X4,X1,X7),true,product(X7,X2,X6),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_38, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X2,X5),true,ifeq(product(X6,X2,X7),true,ifeq(sum(X6,X4,X1),true,sum(X7,X5,X3),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_37, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X1,X4,X5),true,ifeq(sum(X5,X3,X6),true,ifeq(sum(X4,X2,X7),true,product(X1,X7,X6),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_36, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X1,X4,X5),true,ifeq(product(X1,X6,X7),true,ifeq(sum(X6,X4,X2),true,sum(X7,X5,X3),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_50, negated_conjecture, (sum(x,x,x)!=true)).
% 0.19/0.46  cnf(i_0_52, plain, (X8=X8)).
% 0.19/0.46  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.19/0.46  # Begin printing tableau
% 0.19/0.46  # Found 7 steps
% 0.19/0.46  cnf(i_0_33, plain, (sum(X8,additive_identity,X8)=true), inference(start_rule)).
% 0.19/0.46  cnf(i_0_63, plain, (sum(X8,additive_identity,X8)=true), inference(extension_rule, [i_0_61])).
% 0.19/0.46  cnf(i_0_118, plain, (sum(X1,additive_identity,X1)!=true), inference(closure_rule, [i_0_33])).
% 0.19/0.46  cnf(i_0_119, plain, (sum(X1,additive_identity,X1)!=true), inference(closure_rule, [i_0_33])).
% 0.19/0.46  cnf(i_0_116, plain, (product(sum(X8,additive_identity,X8),sum(X1,additive_identity,X1),sum(X1,additive_identity,X1))=product(true,true,true)), inference(extension_rule, [i_0_55])).
% 0.19/0.46  cnf(i_0_128, plain, (product(true,true,true)!=ifeq2(X1,X1,product(true,true,true),X3)), inference(closure_rule, [i_0_26])).
% 0.19/0.46  cnf(i_0_126, plain, (product(sum(X8,additive_identity,X8),sum(X1,additive_identity,X1),sum(X1,additive_identity,X1))=ifeq2(X1,X1,product(true,true,true),X3)), inference(etableau_closure_rule, [i_0_126, ...])).
% 0.19/0.46  # End printing tableau
% 0.19/0.46  # SZS output end
% 0.19/0.46  # Branches closed with saturation will be marked with an "s"
% 0.19/0.46  # There were 1 total branch saturation attempts.
% 0.19/0.46  # There were 0 of these attempts blocked.
% 0.19/0.46  # There were 0 deferred branch saturation attempts.
% 0.19/0.46  # There were 0 free duplicated saturations.
% 0.19/0.46  # There were 1 total successful branch saturations.
% 0.19/0.46  # There were 0 successful branch saturations in interreduction.
% 0.19/0.46  # There were 0 successful branch saturations on the branch.
% 0.19/0.46  # There were 1 successful branch saturations after the branch.
% 0.19/0.46  # There were 1 total branch saturation attempts.
% 0.19/0.46  # There were 0 of these attempts blocked.
% 0.19/0.46  # There were 0 deferred branch saturation attempts.
% 0.19/0.46  # There were 0 free duplicated saturations.
% 0.19/0.46  # There were 1 total successful branch saturations.
% 0.19/0.46  # There were 0 successful branch saturations in interreduction.
% 0.19/0.46  # There were 0 successful branch saturations on the branch.
% 0.19/0.46  # There were 1 successful branch saturations after the branch.
% 0.19/0.46  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46  # Begin clausification derivation
% 0.19/0.46  
% 0.19/0.46  # End clausification derivation
% 0.19/0.46  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.46  cnf(i_0_33, plain, (sum(X1,additive_identity,X1)=true)).
% 0.19/0.46  cnf(i_0_35, plain, (product(X1,multiplicative_identity,X1)=true)).
% 0.19/0.46  cnf(i_0_32, plain, (sum(additive_identity,X1,X1)=true)).
% 0.19/0.46  cnf(i_0_34, plain, (product(multiplicative_identity,X1,X1)=true)).
% 0.19/0.46  cnf(i_0_45, plain, (sum(X1,inverse(X1),multiplicative_identity)=true)).
% 0.19/0.46  cnf(i_0_47, plain, (product(X1,inverse(X1),additive_identity)=true)).
% 0.19/0.46  cnf(i_0_44, plain, (sum(inverse(X1),X1,multiplicative_identity)=true)).
% 0.19/0.46  cnf(i_0_46, plain, (product(inverse(X1),X1,additive_identity)=true)).
% 0.19/0.46  cnf(i_0_26, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 0.19/0.46  cnf(i_0_27, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.19/0.46  cnf(i_0_28, plain, (sum(X1,X2,add(X1,X2))=true)).
% 0.19/0.46  cnf(i_0_29, plain, (product(X1,X2,multiply(X1,X2))=true)).
% 0.19/0.46  cnf(i_0_30, plain, (ifeq(sum(X1,X2,X3),true,sum(X2,X1,X3),true)=true)).
% 0.19/0.46  cnf(i_0_31, plain, (ifeq(product(X1,X2,X3),true,product(X2,X1,X3),true)=true)).
% 0.19/0.46  cnf(i_0_48, plain, (ifeq2(sum(X1,X2,X3),true,ifeq2(sum(X1,X2,X4),true,X4,X3),X3)=X3)).
% 0.19/0.46  cnf(i_0_49, plain, (ifeq2(product(X1,X2,X3),true,ifeq2(product(X1,X2,X4),true,X4,X3),X3)=X3)).
% 0.19/0.46  cnf(i_0_40, plain, (ifeq(product(X1,X2,X3),true,ifeq(sum(X4,X3,X5),true,ifeq(sum(X4,X2,X6),true,ifeq(sum(X4,X1,X7),true,product(X7,X6,X5),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_42, plain, (ifeq(product(X1,X2,X3),true,ifeq(sum(X3,X4,X5),true,ifeq(sum(X2,X4,X6),true,ifeq(sum(X1,X4,X7),true,product(X7,X6,X5),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_41, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X5,X6),true,ifeq(sum(X7,X5,X2),true,ifeq(sum(X7,X4,X1),true,sum(X7,X6,X3),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_43, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X5,X6),true,ifeq(sum(X5,X7,X2),true,ifeq(sum(X4,X7,X1),true,sum(X6,X7,X3),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_39, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X2,X5),true,ifeq(sum(X5,X3,X6),true,ifeq(sum(X4,X1,X7),true,product(X7,X2,X6),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_38, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X2,X5),true,ifeq(product(X6,X2,X7),true,ifeq(sum(X6,X4,X1),true,sum(X7,X5,X3),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_37, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X1,X4,X5),true,ifeq(sum(X5,X3,X6),true,ifeq(sum(X4,X2,X7),true,product(X1,X7,X6),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_36, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X1,X4,X5),true,ifeq(product(X1,X6,X7),true,ifeq(sum(X6,X4,X2),true,sum(X7,X5,X3),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_50, negated_conjecture, (sum(x,x,x)!=true)).
% 0.19/0.46  cnf(i_0_52, plain, (X8=X8)).
% 0.19/0.46  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.19/0.46  # Begin printing tableau
% 0.19/0.46  # Found 7 steps
% 0.19/0.46  cnf(i_0_33, plain, (sum(X10,additive_identity,X10)=true), inference(start_rule)).
% 0.19/0.46  cnf(i_0_63, plain, (sum(X10,additive_identity,X10)=true), inference(extension_rule, [i_0_59])).
% 0.19/0.46  cnf(i_0_110, plain, (sum(X1,additive_identity,X1)!=true), inference(closure_rule, [i_0_33])).
% 0.19/0.46  cnf(i_0_111, plain, (sum(X1,additive_identity,X1)!=true), inference(closure_rule, [i_0_33])).
% 0.19/0.46  cnf(i_0_109, plain, (sum(sum(X1,additive_identity,X1),sum(X1,additive_identity,X1),sum(X10,additive_identity,X10))=sum(true,true,true)), inference(extension_rule, [i_0_55])).
% 0.19/0.46  cnf(i_0_128, plain, (sum(true,true,true)!=ifeq2(X1,X1,sum(true,true,true),X3)), inference(closure_rule, [i_0_26])).
% 0.19/0.46  cnf(i_0_126, plain, (sum(sum(X1,additive_identity,X1),sum(X1,additive_identity,X1),sum(X10,additive_identity,X10))=ifeq2(X1,X1,sum(true,true,true),X3)), inference(etableau_closure_rule, [i_0_126, ...])).
% 0.19/0.46  # End printing tableau
% 0.19/0.46  # SZS output end
% 0.19/0.46  # Branches closed with saturation will be marked with an "s"
% 0.19/0.46  # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46  # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46  # Begin clausification derivation
% 0.19/0.46  
% 0.19/0.46  # End clausification derivation
% 0.19/0.46  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.46  cnf(i_0_33, plain, (sum(X1,additive_identity,X1)=true)).
% 0.19/0.46  cnf(i_0_35, plain, (product(X1,multiplicative_identity,X1)=true)).
% 0.19/0.46  cnf(i_0_32, plain, (sum(additive_identity,X1,X1)=true)).
% 0.19/0.46  cnf(i_0_34, plain, (product(multiplicative_identity,X1,X1)=true)).
% 0.19/0.46  cnf(i_0_45, plain, (sum(X1,inverse(X1),multiplicative_identity)=true)).
% 0.19/0.46  cnf(i_0_47, plain, (product(X1,inverse(X1),additive_identity)=true)).
% 0.19/0.46  cnf(i_0_44, plain, (sum(inverse(X1),X1,multiplicative_identity)=true)).
% 0.19/0.46  cnf(i_0_46, plain, (product(inverse(X1),X1,additive_identity)=true)).
% 0.19/0.46  cnf(i_0_26, plain, (ifeq2(X1,X1,X2,X3)=X2)).
% 0.19/0.46  cnf(i_0_27, plain, (ifeq(X1,X1,X2,X3)=X2)).
% 0.19/0.46  cnf(i_0_28, plain, (sum(X1,X2,add(X1,X2))=true)).
% 0.19/0.46  cnf(i_0_29, plain, (product(X1,X2,multiply(X1,X2))=true)).
% 0.19/0.46  cnf(i_0_30, plain, (ifeq(sum(X1,X2,X3),true,sum(X2,X1,X3),true)=true)).
% 0.19/0.46  cnf(i_0_31, plain, (ifeq(product(X1,X2,X3),true,product(X2,X1,X3),true)=true)).
% 0.19/0.46  cnf(i_0_48, plain, (ifeq2(sum(X1,X2,X3),true,ifeq2(sum(X1,X2,X4),true,X4,X3),X3)=X3)).
% 0.19/0.46  cnf(i_0_49, plain, (ifeq2(product(X1,X2,X3),true,ifeq2(product(X1,X2,X4),true,X4,X3),X3)=X3)).
% 0.19/0.46  cnf(i_0_40, plain, (ifeq(product(X1,X2,X3),true,ifeq(sum(X4,X3,X5),true,ifeq(sum(X4,X2,X6),true,ifeq(sum(X4,X1,X7),true,product(X7,X6,X5),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_42, plain, (ifeq(product(X1,X2,X3),true,ifeq(sum(X3,X4,X5),true,ifeq(sum(X2,X4,X6),true,ifeq(sum(X1,X4,X7),true,product(X7,X6,X5),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_41, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X5,X6),true,ifeq(sum(X7,X5,X2),true,ifeq(sum(X7,X4,X1),true,sum(X7,X6,X3),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_43, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X5,X6),true,ifeq(sum(X5,X7,X2),true,ifeq(sum(X4,X7,X1),true,sum(X6,X7,X3),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_39, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X2,X5),true,ifeq(sum(X5,X3,X6),true,ifeq(sum(X4,X1,X7),true,product(X7,X2,X6),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_38, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X4,X2,X5),true,ifeq(product(X6,X2,X7),true,ifeq(sum(X6,X4,X1),true,sum(X7,X5,X3),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_37, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X1,X4,X5),true,ifeq(sum(X5,X3,X6),true,ifeq(sum(X4,X2,X7),true,product(X1,X7,X6),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_36, plain, (ifeq(product(X1,X2,X3),true,ifeq(product(X1,X4,X5),true,ifeq(product(X1,X6,X7),true,ifeq(sum(X6,X4,X2),true,sum(X7,X5,X3),true),true),true),true)=true)).
% 0.19/0.46  cnf(i_0_50, negated_conjecture, (sum(x,x,x)!=true)).
% 0.19/0.46  cnf(i_0_52, plain, (X8=X8)).
% 0.19/0.46  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.19/0.46  # Begin printing tableau
% 0.19/0.46  # Found 6 steps
% 0.19/0.46  cnf(i_0_33, plain, (sum(X6,additive_identity,X6)=true), inference(start_rule)).
% 0.19/0.46  cnf(i_0_63, plain, (sum(X6,additive_identity,X6)=true), inference(extension_rule, [i_0_60])).
% 0.19/0.46  cnf(i_0_115, plain, (sum(X1,additive_identity,X1)!=true), inference(closure_rule, [i_0_33])).
% 0.19/0.46  cnf(i_0_113, plain, (multiply(sum(X6,additive_identity,X6),sum(X1,additive_identity,X1))=multiply(true,true)), inference(extension_rule, [i_0_55])).
% 0.19/0.46  cnf(i_0_128, plain, (multiply(true,true)!=ifeq2(X1,X1,multiply(true,true),X3)), inference(closure_rule, [i_0_26])).
% 0.19/0.46  cnf(i_0_126, plain, (multiply(sum(X6,additive_identity,X6),sum(X1,additive_identity,X1))=ifeq2(X1,X1,multiply(true,true),X3)), inference(etableau_closure_rule, [i_0_126, ...])).
% 0.19/0.46  # End printing tableau
% 0.19/0.46  # SZS output end
% 0.19/0.46  # Branches closed with saturation will be marked with an "s"
% 0.19/0.46  # Child (4345) has found a proof.
% 0.19/0.46  
% 0.19/0.46  # Proof search is over...
% 0.19/0.46  # Freeing feature tree
%------------------------------------------------------------------------------