TSTP Solution File: SWV556-1.004 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SWV556-1.004 : TPTP v8.1.0. Released 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 : n020.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 : Wed Jul 20 18:22:34 EDT 2022
% Result : Satisfiable 0.21s 0.39s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV556-1.004 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.35 % Computer : n020.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jun 14 17:38:34 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.38 # No SInE strategy applied
% 0.14/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.14/0.38 #
% 0.14/0.38 # Presaturation interreduction done
% 0.14/0.38 # Number of axioms: 23 Number of unprocessed: 23
% 0.14/0.38 # Tableaux proof search.
% 0.14/0.38 # APR header successfully linked.
% 0.14/0.38 # Hello from C++
% 0.14/0.38 # The folding up rule is enabled...
% 0.14/0.38 # Local unification is enabled...
% 0.14/0.38 # Any saturation attempts will use folding labels...
% 0.14/0.38 # 23 beginning clauses after preprocessing and clausification
% 0.14/0.38 # Creating start rules for all 1 conjectures.
% 0.14/0.38 # There are 1 start rule candidates:
% 0.14/0.38 # Found 22 unit axioms.
% 0.14/0.38 # 1 start rule tableaux created.
% 0.14/0.38 # 1 extension rule candidate clauses
% 0.14/0.38 # 22 unit axiom clauses
% 0.14/0.38
% 0.14/0.38 # Requested 8, 32 cores available to the main process.
% 0.14/0.38 # There are not enough tableaux to fork, creating more from the initial 1
% 0.14/0.38 # Creating equality axioms
% 0.14/0.38 # Ran out of tableaux, making start rules for all clauses
% 0.14/0.38 # Returning from population with 32 new_tableaux and 0 remaining starting tableaux.
% 0.14/0.38 # We now have 32 tableaux to operate on
% 0.21/0.39 # 23774 Satisfiable branch
% 0.21/0.39 # 23777 Satisfiable branch
% 0.21/0.39 # 23776 Satisfiable branch
% 0.21/0.39 # 23775 Satisfiable branch
% 0.21/0.39 # 23778 Satisfiable branch
% 0.21/0.39 # Satisfiable branch found.
% 0.21/0.39 # Satisfiable branch found.
% 0.21/0.39 # 23779 Satisfiable 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 0 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 0 successful branch saturations after the branch.
% 0.21/0.39 # Satisfiable branch found.
% 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 0 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 0 successful branch saturations after the branch.
% 0.21/0.39 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.39 # SZS output start for /export/starexec/sandbox2/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_45, hypothesis, (a_34=a_32)).
% 0.21/0.39 cnf(i_0_42, hypothesis, (select(a1,i_35)=e_36)).
% 0.21/0.39 cnf(i_0_43, hypothesis, (select(a2,i_35)=e_37)).
% 0.21/0.39 cnf(i_0_34, hypothesis, (select(a2,i1)=e_19)).
% 0.21/0.39 cnf(i_0_35, hypothesis, (select(a1,i1)=e_21)).
% 0.21/0.39 cnf(i_0_36, hypothesis, (select(a_22,i2)=e_23)).
% 0.21/0.39 cnf(i_0_37, hypothesis, (select(a_20,i2)=e_25)).
% 0.21/0.39 cnf(i_0_38, hypothesis, (select(a_26,i3)=e_27)).
% 0.21/0.39 cnf(i_0_39, hypothesis, (select(a_24,i3)=e_29)).
% 0.21/0.39 cnf(i_0_40, hypothesis, (select(a_30,i4)=e_31)).
% 0.21/0.39 cnf(i_0_41, hypothesis, (select(a_28,i4)=e_33)).
% 0.21/0.39 cnf(i_0_44, hypothesis, (sk(a1,a2)=i_35)).
% 0.21/0.39 cnf(i_0_26, hypothesis, (store(a1,i1,e_19)=a_20)).
% 0.21/0.39 cnf(i_0_27, hypothesis, (store(a2,i1,e_21)=a_22)).
% 0.21/0.39 cnf(i_0_28, hypothesis, (store(a_20,i2,e_23)=a_24)).
% 0.21/0.39 cnf(i_0_29, hypothesis, (store(a_22,i2,e_25)=a_26)).
% 0.21/0.39 cnf(i_0_30, hypothesis, (store(a_24,i3,e_27)=a_28)).
% 0.21/0.39 cnf(i_0_31, hypothesis, (store(a_26,i3,e_29)=a_30)).
% 0.21/0.39 cnf(i_0_32, hypothesis, (store(a_28,i1,e_31)=a_32)).
% 0.21/0.39 cnf(i_0_33, hypothesis, (store(a_30,i4,e_33)=a_32)).
% 0.21/0.39 cnf(i_0_24, plain, (select(store(X1,X2,X3),X2)=X3)).
% 0.21/0.39 cnf(i_0_46, negated_conjecture, (e_37!=e_36)).
% 0.21/0.39 cnf(i_0_25, plain, (select(store(X1,X2,X3),X4)=select(X1,X4)|X2=X4)).
% 0.21/0.39 cnf(i_0_52, plain, (X5=X5)).
% 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_45, hypothesis, (a_34=a_32), inference(start_rule)).
% 0.21/0.39 cnf(i_0_59, plain, (a_34=a_32), inference(extension_rule, [i_0_58])).
% 0.21/0.39 cnf(i_0_101, plain, (a_34!=a_32), inference(closure_rule, [i_0_45])).
% 0.21/0.39 cnf(i_0_100, plain, (sk(a_34,a_34)=sk(a_32,a_32)), inference(extension_rule, [i_0_56])).
% 0.21/0.39 cnf(i_0_182, plain, (a_34!=a_32), inference(closure_rule, [i_0_45])).
% 0.21/0.39 cnf(i_0_183, plain, (a_34!=a_32), inference(closure_rule, [i_0_45])).
% 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 Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.39 # SZS output start for /export/starexec/sandbox2/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_45, hypothesis, (a_34=a_32)).
% 0.21/0.39 cnf(i_0_42, hypothesis, (select(a1,i_35)=e_36)).
% 0.21/0.39 cnf(i_0_43, hypothesis, (select(a2,i_35)=e_37)).
% 0.21/0.39 cnf(i_0_34, hypothesis, (select(a2,i1)=e_19)).
% 0.21/0.39 cnf(i_0_35, hypothesis, (select(a1,i1)=e_21)).
% 0.21/0.39 cnf(i_0_36, hypothesis, (select(a_22,i2)=e_23)).
% 0.21/0.39 cnf(i_0_37, hypothesis, (select(a_20,i2)=e_25)).
% 0.21/0.39 cnf(i_0_38, hypothesis, (select(a_26,i3)=e_27)).
% 0.21/0.39 cnf(i_0_39, hypothesis, (select(a_24,i3)=e_29)).
% 0.21/0.39 cnf(i_0_40, hypothesis, (select(a_30,i4)=e_31)).
% 0.21/0.39 cnf(i_0_41, hypothesis, (select(a_28,i4)=e_33)).
% 0.21/0.39 cnf(i_0_44, hypothesis, (sk(a1,a2)=i_35)).
% 0.21/0.39 cnf(i_0_26, hypothesis, (store(a1,i1,e_19)=a_20)).
% 0.21/0.39 cnf(i_0_27, hypothesis, (store(a2,i1,e_21)=a_22)).
% 0.21/0.39 cnf(i_0_28, hypothesis, (store(a_20,i2,e_23)=a_24)).
% 0.21/0.39 cnf(i_0_29, hypothesis, (store(a_22,i2,e_25)=a_26)).
% 0.21/0.39 cnf(i_0_30, hypothesis, (store(a_24,i3,e_27)=a_28)).
% 0.21/0.39 cnf(i_0_31, hypothesis, (store(a_26,i3,e_29)=a_30)).
% 0.21/0.39 cnf(i_0_32, hypothesis, (store(a_28,i1,e_31)=a_32)).
% 0.21/0.39 cnf(i_0_33, hypothesis, (store(a_30,i4,e_33)=a_32)).
% 0.21/0.39 cnf(i_0_24, plain, (select(store(X1,X2,X3),X2)=X3)).
% 0.21/0.39 cnf(i_0_46, negated_conjecture, (e_37!=e_36)).
% 0.21/0.39 cnf(i_0_25, plain, (select(store(X1,X2,X3),X4)=select(X1,X4)|X2=X4)).
% 0.21/0.39 cnf(i_0_52, plain, (X5=X5)).
% 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_45, hypothesis, (a_34=a_32), inference(start_rule)).
% 0.21/0.39 cnf(i_0_59, plain, (a_34=a_32), inference(extension_rule, [i_0_57])).
% 0.21/0.39 cnf(i_0_99, plain, (a_34!=a_32), inference(closure_rule, [i_0_45])).
% 0.21/0.39 cnf(i_0_97, plain, (select(a_34,a_34)=select(a_32,a_32)), inference(extension_rule, [i_0_56])).
% 0.21/0.39 cnf(i_0_160, plain, (a_34!=a_32), inference(closure_rule, [i_0_45])).
% 0.21/0.39 cnf(i_0_161, plain, (a_34!=a_32), inference(closure_rule, [i_0_45])).
% 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 # 23780 Satisfiable branch
% 0.21/0.39 # Satisfiable branch found.
% 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 0 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 0 successful branch saturations after the branch.
% 0.21/0.39 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.39 # SZS output start for /export/starexec/sandbox2/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_45, hypothesis, (a_34=a_32)).
% 0.21/0.39 cnf(i_0_42, hypothesis, (select(a1,i_35)=e_36)).
% 0.21/0.39 cnf(i_0_43, hypothesis, (select(a2,i_35)=e_37)).
% 0.21/0.39 cnf(i_0_34, hypothesis, (select(a2,i1)=e_19)).
% 0.21/0.39 cnf(i_0_35, hypothesis, (select(a1,i1)=e_21)).
% 0.21/0.39 cnf(i_0_36, hypothesis, (select(a_22,i2)=e_23)).
% 0.21/0.39 cnf(i_0_37, hypothesis, (select(a_20,i2)=e_25)).
% 0.21/0.39 cnf(i_0_38, hypothesis, (select(a_26,i3)=e_27)).
% 0.21/0.39 cnf(i_0_39, hypothesis, (select(a_24,i3)=e_29)).
% 0.21/0.39 cnf(i_0_40, hypothesis, (select(a_30,i4)=e_31)).
% 0.21/0.39 cnf(i_0_41, hypothesis, (select(a_28,i4)=e_33)).
% 0.21/0.39 cnf(i_0_44, hypothesis, (sk(a1,a2)=i_35)).
% 0.21/0.39 cnf(i_0_26, hypothesis, (store(a1,i1,e_19)=a_20)).
% 0.21/0.39 cnf(i_0_27, hypothesis, (store(a2,i1,e_21)=a_22)).
% 0.21/0.39 cnf(i_0_28, hypothesis, (store(a_20,i2,e_23)=a_24)).
% 0.21/0.39 cnf(i_0_29, hypothesis, (store(a_22,i2,e_25)=a_26)).
% 0.21/0.39 cnf(i_0_30, hypothesis, (store(a_24,i3,e_27)=a_28)).
% 0.21/0.39 cnf(i_0_31, hypothesis, (store(a_26,i3,e_29)=a_30)).
% 0.21/0.39 cnf(i_0_32, hypothesis, (store(a_28,i1,e_31)=a_32)).
% 0.21/0.39 cnf(i_0_33, hypothesis, (store(a_30,i4,e_33)=a_32)).
% 0.21/0.39 cnf(i_0_24, plain, (select(store(X1,X2,X3),X2)=X3)).
% 0.21/0.39 cnf(i_0_46, negated_conjecture, (e_37!=e_36)).
% 0.21/0.39 cnf(i_0_25, plain, (select(store(X1,X2,X3),X4)=select(X1,X4)|X2=X4)).
% 0.21/0.39 cnf(i_0_52, plain, (X5=X5)).
% 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_45, hypothesis, (a_34=a_32), inference(start_rule)).
% 0.21/0.39 cnf(i_0_59, plain, (a_34=a_32), inference(extension_rule, [i_0_58])).
% 0.21/0.39 cnf(i_0_102, plain, (a_34!=a_32), inference(closure_rule, [i_0_45])).
% 0.21/0.39 cnf(i_0_100, plain, (sk(a_34,a_34)=sk(a_32,a_32)), inference(extension_rule, [i_0_56])).
% 0.21/0.39 cnf(i_0_182, plain, (a_34!=a_32), inference(closure_rule, [i_0_45])).
% 0.21/0.39 cnf(i_0_183, plain, (a_34!=a_32), inference(closure_rule, [i_0_45])).
% 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 # Satisfiable branch found.
% 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 0 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 0 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 0 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 0 successful branch saturations after the branch.
% 0.21/0.39 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.39 # SZS output start for /export/starexec/sandbox2/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_45, hypothesis, (a_34=a_32)).
% 0.21/0.39 cnf(i_0_42, hypothesis, (select(a1,i_35)=e_36)).
% 0.21/0.39 cnf(i_0_43, hypothesis, (select(a2,i_35)=e_37)).
% 0.21/0.39 cnf(i_0_34, hypothesis, (select(a2,i1)=e_19)).
% 0.21/0.39 cnf(i_0_35, hypothesis, (select(a1,i1)=e_21)).
% 0.21/0.39 cnf(i_0_36, hypothesis, (select(a_22,i2)=e_23)).
% 0.21/0.39 cnf(i_0_37, hypothesis, (select(a_20,i2)=e_25)).
% 0.21/0.39 cnf(i_0_38, hypothesis, (select(a_26,i3)=e_27)).
% 0.21/0.39 cnf(i_0_39, hypothesis, (select(a_24,i3)=e_29)).
% 0.21/0.39 cnf(i_0_40, hypothesis, (select(a_30,i4)=e_31)).
% 0.21/0.39 cnf(i_0_41, hypothesis, (select(a_28,i4)=e_33)).
% 0.21/0.39 cnf(i_0_44, hypothesis, (sk(a1,a2)=i_35)).
% 0.21/0.39 cnf(i_0_26, hypothesis, (store(a1,i1,e_19)=a_20)).
% 0.21/0.39 cnf(i_0_27, hypothesis, (store(a2,i1,e_21)=a_22)).
% 0.21/0.39 cnf(i_0_28, hypothesis, (store(a_20,i2,e_23)=a_24)).
% 0.21/0.39 cnf(i_0_29, hypothesis, (store(a_22,i2,e_25)=a_26)).
% 0.21/0.39 cnf(i_0_30, hypothesis, (store(a_24,i3,e_27)=a_28)).
% 0.21/0.39 cnf(i_0_31, hypothesis, (store(a_26,i3,e_29)=a_30)).
% 0.21/0.39 cnf(i_0_32, hypothesis, (store(a_28,i1,e_31)=a_32)).
% 0.21/0.39 cnf(i_0_33, hypothesis, (store(a_30,i4,e_33)=a_32)).
% 0.21/0.39 cnf(i_0_24, plain, (select(store(X1,X2,X3),X2)=X3)).
% 0.21/0.39 cnf(i_0_46, negated_conjecture, (e_37!=e_36)).
% 0.21/0.39 cnf(i_0_25, plain, (select(store(X1,X2,X3),X4)=select(X1,X4)|X2=X4)).
% 0.21/0.39 cnf(i_0_52, plain, (X5=X5)).
% 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_45, hypothesis, (a_34=a_32), inference(start_rule)).
% 0.21/0.39 cnf(i_0_59, plain, (a_34=a_32), inference(extension_rule, [i_0_56])).
% 0.21/0.39 cnf(i_0_94, plain, (a_34!=a_32), inference(closure_rule, [i_0_45])).
% 0.21/0.39 cnf(i_0_95, plain, (a_34!=a_32), inference(closure_rule, [i_0_45])).
% 0.21/0.39 cnf(i_0_93, plain, (store(a_34,a_34,a_34)=store(a_32,a_32,a_32)), inference(extension_rule, [i_0_57])).
% 0.21/0.39 cnf(i_0_175, plain, (a_34!=a_32), inference(closure_rule, [i_0_45])).
% 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 # Satisfiable branch found.
% 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 0 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 0 successful branch saturations after the branch.
% 0.21/0.39 # SZS status Satisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.39 # SZS output start for /export/starexec/sandbox2/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_45, hypothesis, (a_34=a_32)).
% 0.21/0.39 cnf(i_0_42, hypothesis, (select(a1,i_35)=e_36)).
% 0.21/0.39 cnf(i_0_43, hypothesis, (select(a2,i_35)=e_37)).
% 0.21/0.39 cnf(i_0_34, hypothesis, (select(a2,i1)=e_19)).
% 0.21/0.39 cnf(i_0_35, hypothesis, (select(a1,i1)=e_21)).
% 0.21/0.39 cnf(i_0_36, hypothesis, (select(a_22,i2)=e_23)).
% 0.21/0.39 cnf(i_0_37, hypothesis, (select(a_20,i2)=e_25)).
% 0.21/0.39 cnf(i_0_38, hypothesis, (select(a_26,i3)=e_27)).
% 0.21/0.39 cnf(i_0_39, hypothesis, (select(a_24,i3)=e_29)).
% 0.21/0.39 cnf(i_0_40, hypothesis, (select(a_30,i4)=e_31)).
% 0.21/0.39 cnf(i_0_41, hypothesis, (select(a_28,i4)=e_33)).
% 0.21/0.39 cnf(i_0_44, hypothesis, (sk(a1,a2)=i_35)).
% 0.21/0.39 cnf(i_0_26, hypothesis, (store(a1,i1,e_19)=a_20)).
% 0.21/0.39 cnf(i_0_27, hypothesis, (store(a2,i1,e_21)=a_22)).
% 0.21/0.39 cnf(i_0_28, hypothesis, (store(a_20,i2,e_23)=a_24)).
% 0.21/0.39 cnf(i_0_29, hypothesis, (store(a_22,i2,e_25)=a_26)).
% 0.21/0.39 cnf(i_0_30, hypothesis, (store(a_24,i3,e_27)=a_28)).
% 0.21/0.39 cnf(i_0_31, hypothesis, (store(a_26,i3,e_29)=a_30)).
% 0.21/0.39 cnf(i_0_32, hypothesis, (store(a_28,i1,e_31)=a_32)).
% 0.21/0.39 cnf(i_0_33, hypothesis, (store(a_30,i4,e_33)=a_32)).
% 0.21/0.39 cnf(i_0_24, plain, (select(store(X1,X2,X3),X2)=X3)).
% 0.21/0.39 cnf(i_0_46, negated_conjecture, (e_37!=e_36)).
% 0.21/0.39 cnf(i_0_25, plain, (select(store(X1,X2,X3),X4)=select(X1,X4)|X2=X4)).
% 0.21/0.39 cnf(i_0_52, plain, (X5=X5)).
% 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_45, hypothesis, (a_34=a_32), inference(start_rule)).
% 0.21/0.39 cnf(i_0_59, plain, (a_34=a_32), inference(extension_rule, [i_0_56])).
% 0.21/0.39 cnf(i_0_94, plain, (a_34!=a_32), inference(closure_rule, [i_0_45])).
% 0.21/0.39 cnf(i_0_96, plain, (a_34!=a_32), inference(closure_rule, [i_0_45])).
% 0.21/0.39 cnf(i_0_93, plain, (store(a_34,a_34,a_34)=store(a_32,a_32,a_32)), inference(extension_rule, [i_0_57])).
% 0.21/0.39 cnf(i_0_175, plain, (a_34!=a_32), inference(closure_rule, [i_0_45])).
% 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 (23777) has found a proof.
% 0.21/0.39
% 0.21/0.39 # Proof search is over...
% 0.21/0.39 # Freeing feature tree
%------------------------------------------------------------------------------