TSTP Solution File: SWV558-1.004 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SWV558-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 : n008.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:35 EDT 2022
% Result : Unsatisfiable 0.11s 0.36s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWV558-1.004 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.11/0.33 % Computer : n008.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Tue Jun 14 22:56:07 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.11/0.36 # No SInE strategy applied
% 0.11/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.11/0.36 #
% 0.11/0.36 # Presaturation interreduction done
% 0.11/0.36 # Number of axioms: 23 Number of unprocessed: 23
% 0.11/0.36 # Tableaux proof search.
% 0.11/0.36 # APR header successfully linked.
% 0.11/0.36 # Hello from C++
% 0.11/0.36 # The folding up rule is enabled...
% 0.11/0.36 # Local unification is enabled...
% 0.11/0.36 # Any saturation attempts will use folding labels...
% 0.11/0.36 # 23 beginning clauses after preprocessing and clausification
% 0.11/0.36 # Creating start rules for all 1 conjectures.
% 0.11/0.36 # There are 1 start rule candidates:
% 0.11/0.36 # Found 21 unit axioms.
% 0.11/0.36 # 1 start rule tableaux created.
% 0.11/0.36 # 2 extension rule candidate clauses
% 0.11/0.36 # 21 unit axiom clauses
% 0.11/0.36
% 0.11/0.36 # Requested 8, 32 cores available to the main process.
% 0.11/0.36 # There are not enough tableaux to fork, creating more from the initial 1
% 0.11/0.36 # Creating equality axioms
% 0.11/0.36 # Ran out of tableaux, making start rules for all clauses
% 0.11/0.36 # Returning from population with 30 new_tableaux and 0 remaining starting tableaux.
% 0.11/0.36 # We now have 30 tableaux to operate on
% 0.11/0.36 # There were 1 total branch saturation attempts.
% 0.11/0.36 # There were 0 of these attempts blocked.
% 0.11/0.36 # There were 0 deferred branch saturation attempts.
% 0.11/0.36 # There were 0 free duplicated saturations.
% 0.11/0.36 # There were 1 total successful branch saturations.
% 0.11/0.36 # There were 0 successful branch saturations in interreduction.
% 0.11/0.36 # There were 0 successful branch saturations on the branch.
% 0.11/0.36 # There were 1 successful branch saturations after the branch.
% 0.11/0.36 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.36 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.36 # Begin clausification derivation
% 0.11/0.36
% 0.11/0.36 # End clausification derivation
% 0.11/0.36 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.11/0.36 cnf(i_0_45, hypothesis, (a_31=a_29)).
% 0.11/0.36 cnf(i_0_37, hypothesis, (select(a2,i1)=e_16)).
% 0.11/0.36 cnf(i_0_38, hypothesis, (select(a1,i1)=e_18)).
% 0.11/0.36 cnf(i_0_39, hypothesis, (select(a_19,i2)=e_20)).
% 0.11/0.36 cnf(i_0_40, hypothesis, (select(a_17,i2)=e_22)).
% 0.11/0.36 cnf(i_0_41, hypothesis, (select(a_23,i3)=e_24)).
% 0.11/0.36 cnf(i_0_42, hypothesis, (select(a_21,i3)=e_26)).
% 0.11/0.36 cnf(i_0_43, hypothesis, (select(a_27,i4)=e_28)).
% 0.11/0.36 cnf(i_0_44, hypothesis, (select(a_25,i4)=e_30)).
% 0.11/0.36 cnf(i_0_29, hypothesis, (store(a1,i1,e_16)=a_17)).
% 0.11/0.36 cnf(i_0_30, hypothesis, (store(a2,i1,e_18)=a_19)).
% 0.11/0.36 cnf(i_0_31, hypothesis, (store(a_17,i2,e_20)=a_21)).
% 0.11/0.36 cnf(i_0_32, hypothesis, (store(a_19,i2,e_22)=a_23)).
% 0.11/0.36 cnf(i_0_33, hypothesis, (store(a_21,i3,e_24)=a_25)).
% 0.11/0.36 cnf(i_0_34, hypothesis, (store(a_23,i3,e_26)=a_27)).
% 0.11/0.36 cnf(i_0_35, hypothesis, (store(a_25,i4,e_28)=a_29)).
% 0.11/0.36 cnf(i_0_36, hypothesis, (store(a_27,i4,e_30)=a_29)).
% 0.11/0.36 cnf(i_0_26, plain, (store(X1,X2,select(X1,X2))=X1)).
% 0.11/0.36 cnf(i_0_24, plain, (select(store(X1,X2,X3),X2)=X3)).
% 0.11/0.36 cnf(i_0_27, plain, (store(store(X1,X2,X3),X2,X4)=store(X1,X2,X4))).
% 0.11/0.36 cnf(i_0_46, negated_conjecture, (a1!=a2)).
% 0.11/0.36 cnf(i_0_25, plain, (select(store(X1,X2,X3),X4)=select(X1,X4)|X2=X4)).
% 0.11/0.36 cnf(i_0_28, plain, (store(store(X1,X2,X3),X4,X5)=store(store(X1,X4,X5),X2,X3)|X2=X4)).
% 0.11/0.36 cnf(i_0_60, plain, (X6=X6)).
% 0.11/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.11/0.36 # Begin printing tableau
% 0.11/0.36 # Found 6 steps
% 0.11/0.36 cnf(i_0_45, hypothesis, (a_31=a_29), inference(start_rule)).
% 0.11/0.36 cnf(i_0_66, plain, (a_31=a_29), inference(extension_rule, [i_0_65])).
% 0.11/0.36 cnf(i_0_108, plain, (a_31!=a_29), inference(closure_rule, [i_0_45])).
% 0.11/0.36 cnf(i_0_107, plain, (select(a_31,a_31)=select(a_29,a_29)), inference(extension_rule, [i_0_63])).
% 0.11/0.36 cnf(i_0_120, plain, (select(a_29,a_29)!=store(select(a_29,a_29),X2,select(select(a_29,a_29),X2))), inference(closure_rule, [i_0_26])).
% 0.11/0.36 cnf(i_0_118, plain, (select(a_31,a_31)=store(select(a_29,a_29),X2,select(select(a_29,a_29),X2))), inference(etableau_closure_rule, [i_0_118, ...])).
% 0.11/0.36 # End printing tableau
% 0.11/0.36 # SZS output end
% 0.11/0.36 # Branches closed with saturation will be marked with an "s"
% 0.11/0.36 # There were 1 total branch saturation attempts.
% 0.11/0.36 # There were 0 of these attempts blocked.
% 0.11/0.36 # There were 0 deferred branch saturation attempts.
% 0.11/0.36 # There were 0 free duplicated saturations.
% 0.11/0.36 # There were 1 total successful branch saturations.
% 0.11/0.36 # There were 0 successful branch saturations in interreduction.
% 0.11/0.36 # There were 0 successful branch saturations on the branch.
% 0.11/0.36 # There were 1 successful branch saturations after the branch.
% 0.11/0.36 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.36 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.36 # Begin clausification derivation
% 0.11/0.36
% 0.11/0.36 # End clausification derivation
% 0.11/0.36 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.11/0.36 cnf(i_0_45, hypothesis, (a_31=a_29)).
% 0.11/0.36 cnf(i_0_37, hypothesis, (select(a2,i1)=e_16)).
% 0.11/0.36 cnf(i_0_38, hypothesis, (select(a1,i1)=e_18)).
% 0.11/0.36 cnf(i_0_39, hypothesis, (select(a_19,i2)=e_20)).
% 0.11/0.36 cnf(i_0_40, hypothesis, (select(a_17,i2)=e_22)).
% 0.11/0.36 cnf(i_0_41, hypothesis, (select(a_23,i3)=e_24)).
% 0.11/0.36 cnf(i_0_42, hypothesis, (select(a_21,i3)=e_26)).
% 0.11/0.36 cnf(i_0_43, hypothesis, (select(a_27,i4)=e_28)).
% 0.11/0.36 cnf(i_0_44, hypothesis, (select(a_25,i4)=e_30)).
% 0.11/0.36 cnf(i_0_29, hypothesis, (store(a1,i1,e_16)=a_17)).
% 0.11/0.36 cnf(i_0_30, hypothesis, (store(a2,i1,e_18)=a_19)).
% 0.11/0.36 cnf(i_0_31, hypothesis, (store(a_17,i2,e_20)=a_21)).
% 0.11/0.36 cnf(i_0_32, hypothesis, (store(a_19,i2,e_22)=a_23)).
% 0.11/0.36 cnf(i_0_33, hypothesis, (store(a_21,i3,e_24)=a_25)).
% 0.11/0.36 cnf(i_0_34, hypothesis, (store(a_23,i3,e_26)=a_27)).
% 0.11/0.36 cnf(i_0_35, hypothesis, (store(a_25,i4,e_28)=a_29)).
% 0.11/0.36 cnf(i_0_36, hypothesis, (store(a_27,i4,e_30)=a_29)).
% 0.11/0.36 cnf(i_0_26, plain, (store(X1,X2,select(X1,X2))=X1)).
% 0.11/0.36 cnf(i_0_24, plain, (select(store(X1,X2,X3),X2)=X3)).
% 0.11/0.36 cnf(i_0_27, plain, (store(store(X1,X2,X3),X2,X4)=store(X1,X2,X4))).
% 0.11/0.36 cnf(i_0_46, negated_conjecture, (a1!=a2)).
% 0.11/0.36 cnf(i_0_25, plain, (select(store(X1,X2,X3),X4)=select(X1,X4)|X2=X4)).
% 0.11/0.36 cnf(i_0_28, plain, (store(store(X1,X2,X3),X4,X5)=store(store(X1,X4,X5),X2,X3)|X2=X4)).
% 0.11/0.36 cnf(i_0_60, plain, (X6=X6)).
% 0.11/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.11/0.36 # Begin printing tableau
% 0.11/0.36 # Found 6 steps
% 0.11/0.36 cnf(i_0_45, hypothesis, (a_31=a_29), inference(start_rule)).
% 0.11/0.36 cnf(i_0_66, plain, (a_31=a_29), inference(extension_rule, [i_0_65])).
% 0.11/0.36 cnf(i_0_109, plain, (a_31!=a_29), inference(closure_rule, [i_0_45])).
% 0.11/0.36 cnf(i_0_107, plain, (select(a_31,a_31)=select(a_29,a_29)), inference(extension_rule, [i_0_63])).
% 0.11/0.36 cnf(i_0_120, plain, (select(a_29,a_29)!=store(select(a_29,a_29),X2,select(select(a_29,a_29),X2))), inference(closure_rule, [i_0_26])).
% 0.11/0.36 cnf(i_0_118, plain, (select(a_31,a_31)=store(select(a_29,a_29),X2,select(select(a_29,a_29),X2))), inference(etableau_closure_rule, [i_0_118, ...])).
% 0.11/0.36 # End printing tableau
% 0.11/0.36 # SZS output end
% 0.11/0.36 # Branches closed with saturation will be marked with an "s"
% 0.11/0.36 # There were 1 total branch saturation attempts.
% 0.11/0.36 # There were 0 of these attempts blocked.
% 0.11/0.36 # There were 0 deferred branch saturation attempts.
% 0.11/0.36 # There were 0 free duplicated saturations.
% 0.11/0.36 # There were 1 total successful branch saturations.
% 0.11/0.36 # There were 0 successful branch saturations in interreduction.
% 0.11/0.36 # There were 0 successful branch saturations on the branch.
% 0.11/0.36 # There were 1 successful branch saturations after the branch.
% 0.11/0.36 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.36 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.36 # Begin clausification derivation
% 0.11/0.36
% 0.11/0.36 # End clausification derivation
% 0.11/0.36 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.11/0.36 cnf(i_0_45, hypothesis, (a_31=a_29)).
% 0.11/0.36 cnf(i_0_37, hypothesis, (select(a2,i1)=e_16)).
% 0.11/0.36 cnf(i_0_38, hypothesis, (select(a1,i1)=e_18)).
% 0.11/0.36 cnf(i_0_39, hypothesis, (select(a_19,i2)=e_20)).
% 0.11/0.36 cnf(i_0_40, hypothesis, (select(a_17,i2)=e_22)).
% 0.11/0.36 cnf(i_0_41, hypothesis, (select(a_23,i3)=e_24)).
% 0.11/0.36 cnf(i_0_42, hypothesis, (select(a_21,i3)=e_26)).
% 0.11/0.36 cnf(i_0_43, hypothesis, (select(a_27,i4)=e_28)).
% 0.11/0.36 cnf(i_0_44, hypothesis, (select(a_25,i4)=e_30)).
% 0.11/0.36 cnf(i_0_29, hypothesis, (store(a1,i1,e_16)=a_17)).
% 0.11/0.36 cnf(i_0_30, hypothesis, (store(a2,i1,e_18)=a_19)).
% 0.11/0.36 cnf(i_0_31, hypothesis, (store(a_17,i2,e_20)=a_21)).
% 0.11/0.36 cnf(i_0_32, hypothesis, (store(a_19,i2,e_22)=a_23)).
% 0.11/0.36 cnf(i_0_33, hypothesis, (store(a_21,i3,e_24)=a_25)).
% 0.11/0.36 cnf(i_0_34, hypothesis, (store(a_23,i3,e_26)=a_27)).
% 0.11/0.36 cnf(i_0_35, hypothesis, (store(a_25,i4,e_28)=a_29)).
% 0.11/0.36 cnf(i_0_36, hypothesis, (store(a_27,i4,e_30)=a_29)).
% 0.11/0.36 cnf(i_0_26, plain, (store(X1,X2,select(X1,X2))=X1)).
% 0.11/0.36 cnf(i_0_24, plain, (select(store(X1,X2,X3),X2)=X3)).
% 0.11/0.36 cnf(i_0_27, plain, (store(store(X1,X2,X3),X2,X4)=store(X1,X2,X4))).
% 0.11/0.36 cnf(i_0_46, negated_conjecture, (a1!=a2)).
% 0.11/0.36 cnf(i_0_25, plain, (select(store(X1,X2,X3),X4)=select(X1,X4)|X2=X4)).
% 0.11/0.36 cnf(i_0_28, plain, (store(store(X1,X2,X3),X4,X5)=store(store(X1,X4,X5),X2,X3)|X2=X4)).
% 0.11/0.36 cnf(i_0_60, plain, (X6=X6)).
% 0.11/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.11/0.36 # Begin printing tableau
% 0.11/0.36 # Found 7 steps
% 0.11/0.36 cnf(i_0_45, hypothesis, (a_31=a_29), inference(start_rule)).
% 0.11/0.36 cnf(i_0_66, plain, (a_31=a_29), inference(extension_rule, [i_0_63])).
% 0.11/0.36 cnf(i_0_101, plain, (a_31!=a_29), inference(closure_rule, [i_0_45])).
% 0.11/0.36 cnf(i_0_100, plain, (a_29=a_29), inference(extension_rule, [i_0_64])).
% 0.11/0.36 cnf(i_0_183, plain, (a_31!=a_29), inference(closure_rule, [i_0_45])).
% 0.11/0.36 cnf(i_0_184, plain, (a_31!=a_29), inference(closure_rule, [i_0_45])).
% 0.11/0.36 cnf(i_0_181, plain, (store(a_29,a_31,a_31)=store(a_29,a_29,a_29)), inference(etableau_closure_rule, [i_0_181, ...])).
% 0.11/0.36 # End printing tableau
% 0.11/0.36 # SZS output end
% 0.11/0.36 # Branches closed with saturation will be marked with an "s"
% 0.11/0.36 # There were 1 total branch saturation attempts.
% 0.11/0.36 # There were 0 of these attempts blocked.
% 0.11/0.36 # There were 0 deferred branch saturation attempts.
% 0.11/0.36 # There were 0 free duplicated saturations.
% 0.11/0.36 # There were 1 total successful branch saturations.
% 0.11/0.36 # There were 0 successful branch saturations in interreduction.
% 0.11/0.36 # There were 0 successful branch saturations on the branch.
% 0.11/0.36 # There were 1 successful branch saturations after the branch.
% 0.11/0.36 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.36 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.36 # Begin clausification derivation
% 0.11/0.36
% 0.11/0.36 # End clausification derivation
% 0.11/0.36 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.11/0.36 cnf(i_0_45, hypothesis, (a_31=a_29)).
% 0.11/0.36 cnf(i_0_37, hypothesis, (select(a2,i1)=e_16)).
% 0.11/0.36 cnf(i_0_38, hypothesis, (select(a1,i1)=e_18)).
% 0.11/0.36 cnf(i_0_39, hypothesis, (select(a_19,i2)=e_20)).
% 0.11/0.36 cnf(i_0_40, hypothesis, (select(a_17,i2)=e_22)).
% 0.11/0.36 cnf(i_0_41, hypothesis, (select(a_23,i3)=e_24)).
% 0.11/0.36 cnf(i_0_42, hypothesis, (select(a_21,i3)=e_26)).
% 0.11/0.36 cnf(i_0_43, hypothesis, (select(a_27,i4)=e_28)).
% 0.11/0.36 cnf(i_0_44, hypothesis, (select(a_25,i4)=e_30)).
% 0.11/0.36 cnf(i_0_29, hypothesis, (store(a1,i1,e_16)=a_17)).
% 0.11/0.36 cnf(i_0_30, hypothesis, (store(a2,i1,e_18)=a_19)).
% 0.11/0.36 cnf(i_0_31, hypothesis, (store(a_17,i2,e_20)=a_21)).
% 0.11/0.36 cnf(i_0_32, hypothesis, (store(a_19,i2,e_22)=a_23)).
% 0.11/0.36 cnf(i_0_33, hypothesis, (store(a_21,i3,e_24)=a_25)).
% 0.11/0.36 cnf(i_0_34, hypothesis, (store(a_23,i3,e_26)=a_27)).
% 0.11/0.36 cnf(i_0_35, hypothesis, (store(a_25,i4,e_28)=a_29)).
% 0.11/0.36 cnf(i_0_36, hypothesis, (store(a_27,i4,e_30)=a_29)).
% 0.11/0.36 cnf(i_0_26, plain, (store(X1,X2,select(X1,X2))=X1)).
% 0.11/0.36 cnf(i_0_24, plain, (select(store(X1,X2,X3),X2)=X3)).
% 0.11/0.36 cnf(i_0_27, plain, (store(store(X1,X2,X3),X2,X4)=store(X1,X2,X4))).
% 0.11/0.36 cnf(i_0_46, negated_conjecture, (a1!=a2)).
% 0.11/0.36 cnf(i_0_25, plain, (select(store(X1,X2,X3),X4)=select(X1,X4)|X2=X4)).
% 0.11/0.36 cnf(i_0_28, plain, (store(store(X1,X2,X3),X4,X5)=store(store(X1,X4,X5),X2,X3)|X2=X4)).
% 0.11/0.36 cnf(i_0_60, plain, (X6=X6)).
% 0.11/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.11/0.36 # Begin printing tableau
% 0.11/0.36 # Found 7 steps
% 0.11/0.36 cnf(i_0_45, hypothesis, (a_31=a_29), inference(start_rule)).
% 0.11/0.36 cnf(i_0_66, plain, (a_31=a_29), inference(extension_rule, [i_0_64])).
% 0.11/0.36 cnf(i_0_104, plain, (a_31!=a_29), inference(closure_rule, [i_0_45])).
% 0.11/0.36 cnf(i_0_106, plain, (a_31!=a_29), inference(closure_rule, [i_0_45])).
% 0.11/0.36 cnf(i_0_103, plain, (store(a_31,a_31,a_31)=store(a_29,a_29,a_29)), inference(extension_rule, [i_0_63])).
% 0.11/0.36 cnf(i_0_120, plain, (store(a_29,a_29,a_29)!=store(store(a_29,a_29,a_29),X2,select(store(a_29,a_29,a_29),X2))), inference(closure_rule, [i_0_26])).
% 0.11/0.36 cnf(i_0_118, plain, (store(a_31,a_31,a_31)=store(store(a_29,a_29,a_29),X2,select(store(a_29,a_29,a_29),X2))), inference(etableau_closure_rule, [i_0_118, ...])).
% 0.11/0.36 # End printing tableau
% 0.11/0.36 # SZS output end
% 0.11/0.36 # Branches closed with saturation will be marked with an "s"
% 0.11/0.36 # There were 1 total branch saturation attempts.
% 0.11/0.36 # There were 0 of these attempts blocked.
% 0.11/0.36 # There were 0 deferred branch saturation attempts.
% 0.11/0.36 # There were 0 free duplicated saturations.
% 0.11/0.36 # There were 1 total successful branch saturations.
% 0.11/0.37 # There were 0 successful branch saturations in interreduction.
% 0.11/0.37 # There were 0 successful branch saturations on the branch.
% 0.11/0.37 # There were 1 successful branch saturations after the branch.
% 0.11/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.37 # Begin clausification derivation
% 0.11/0.37
% 0.11/0.37 # End clausification derivation
% 0.11/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.11/0.37 cnf(i_0_45, hypothesis, (a_31=a_29)).
% 0.11/0.37 cnf(i_0_37, hypothesis, (select(a2,i1)=e_16)).
% 0.11/0.37 cnf(i_0_38, hypothesis, (select(a1,i1)=e_18)).
% 0.11/0.37 cnf(i_0_39, hypothesis, (select(a_19,i2)=e_20)).
% 0.11/0.37 cnf(i_0_40, hypothesis, (select(a_17,i2)=e_22)).
% 0.11/0.37 cnf(i_0_41, hypothesis, (select(a_23,i3)=e_24)).
% 0.11/0.37 cnf(i_0_42, hypothesis, (select(a_21,i3)=e_26)).
% 0.11/0.37 cnf(i_0_43, hypothesis, (select(a_27,i4)=e_28)).
% 0.11/0.37 cnf(i_0_44, hypothesis, (select(a_25,i4)=e_30)).
% 0.11/0.37 cnf(i_0_29, hypothesis, (store(a1,i1,e_16)=a_17)).
% 0.11/0.37 cnf(i_0_30, hypothesis, (store(a2,i1,e_18)=a_19)).
% 0.11/0.37 cnf(i_0_31, hypothesis, (store(a_17,i2,e_20)=a_21)).
% 0.11/0.37 cnf(i_0_32, hypothesis, (store(a_19,i2,e_22)=a_23)).
% 0.11/0.37 cnf(i_0_33, hypothesis, (store(a_21,i3,e_24)=a_25)).
% 0.11/0.37 cnf(i_0_34, hypothesis, (store(a_23,i3,e_26)=a_27)).
% 0.11/0.37 cnf(i_0_35, hypothesis, (store(a_25,i4,e_28)=a_29)).
% 0.11/0.37 cnf(i_0_36, hypothesis, (store(a_27,i4,e_30)=a_29)).
% 0.11/0.37 cnf(i_0_26, plain, (store(X1,X2,select(X1,X2))=X1)).
% 0.11/0.37 cnf(i_0_24, plain, (select(store(X1,X2,X3),X2)=X3)).
% 0.11/0.37 cnf(i_0_27, plain, (store(store(X1,X2,X3),X2,X4)=store(X1,X2,X4))).
% 0.11/0.37 cnf(i_0_46, negated_conjecture, (a1!=a2)).
% 0.11/0.37 cnf(i_0_25, plain, (select(store(X1,X2,X3),X4)=select(X1,X4)|X2=X4)).
% 0.11/0.37 cnf(i_0_28, plain, (store(store(X1,X2,X3),X4,X5)=store(store(X1,X4,X5),X2,X3)|X2=X4)).
% 0.11/0.37 cnf(i_0_60, plain, (X6=X6)).
% 0.11/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.11/0.37 # Begin printing tableau
% 0.11/0.37 # Found 7 steps
% 0.11/0.37 cnf(i_0_45, hypothesis, (a_31=a_29), inference(start_rule)).
% 0.11/0.37 cnf(i_0_66, plain, (a_31=a_29), inference(extension_rule, [i_0_64])).
% 0.11/0.37 cnf(i_0_105, plain, (a_31!=a_29), inference(closure_rule, [i_0_45])).
% 0.11/0.37 cnf(i_0_106, plain, (a_31!=a_29), inference(closure_rule, [i_0_45])).
% 0.11/0.37 cnf(i_0_103, plain, (store(a_31,a_31,a_31)=store(a_29,a_29,a_29)), inference(extension_rule, [i_0_63])).
% 0.11/0.37 cnf(i_0_120, plain, (store(a_29,a_29,a_29)!=store(store(a_29,a_29,a_29),X2,select(store(a_29,a_29,a_29),X2))), inference(closure_rule, [i_0_26])).
% 0.11/0.37 cnf(i_0_118, plain, (store(a_31,a_31,a_31)=store(store(a_29,a_29,a_29),X2,select(store(a_29,a_29,a_29),X2))), inference(etableau_closure_rule, [i_0_118, ...])).
% 0.11/0.37 # End printing tableau
% 0.11/0.37 # SZS output end
% 0.11/0.37 # Branches closed with saturation will be marked with an "s"
% 0.11/0.37 # Child (11842) has found a proof.
% 0.11/0.37
% 0.11/0.37 # Proof search is over...
% 0.11/0.37 # Freeing feature tree
%------------------------------------------------------------------------------