%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWV565-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 : n009.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:38 EDT 2022 % Result : Unsatisfiable 0.13s 0.40s % Output : CNFRefutation 0.13s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.12 % Problem : SWV565-1.004 : TPTP v8.1.0. Released v4.0.0. % 0.10/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 : n009.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 15 01:08:08 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.37 # No SInE strategy applied % 0.13/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.13/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.13/0.37 # % 0.13/0.37 # Presaturation interreduction done % 0.13/0.37 # Number of axioms: 24 Number of unprocessed: 24 % 0.13/0.37 # Tableaux proof search. % 0.13/0.37 # APR header successfully linked. % 0.13/0.37 # Hello from C++ % 0.13/0.37 # The folding up rule is enabled... % 0.13/0.37 # Local unification is enabled... % 0.13/0.37 # Any saturation attempts will use folding labels... % 0.13/0.37 # 24 beginning clauses after preprocessing and clausification % 0.13/0.37 # Creating start rules for all 1 conjectures. % 0.13/0.37 # There are 1 start rule candidates: % 0.13/0.37 # Found 23 unit axioms. % 0.13/0.37 # 1 start rule tableaux created. % 0.13/0.37 # 1 extension rule candidate clauses % 0.13/0.37 # 23 unit axiom clauses % 0.13/0.37 % 0.13/0.37 # Requested 8, 32 cores available to the main process. % 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.13/0.37 # Creating equality axioms % 0.13/0.37 # Ran out of tableaux, making start rules for all clauses % 0.13/0.37 # Returning from population with 33 new_tableaux and 0 remaining starting tableaux. % 0.13/0.37 # We now have 33 tableaux to operate on % 0.13/0.40 # There were 1 total branch saturation attempts. % 0.13/0.40 # There were 0 of these attempts blocked. % 0.13/0.40 # There were 0 deferred branch saturation attempts. % 0.13/0.40 # There were 0 free duplicated saturations. % 0.13/0.40 # There were 1 total successful branch saturations. % 0.13/0.40 # There were 0 successful branch saturations in interreduction. % 0.13/0.40 # There were 0 successful branch saturations on the branch. % 0.13/0.40 # There were 1 successful branch saturations after the branch. % 0.13/0.40 # There were 1 total branch saturation attempts. % 0.13/0.40 # There were 0 of these attempts blocked. % 0.13/0.40 # There were 0 deferred branch saturation attempts. % 0.13/0.40 # There were 0 free duplicated saturations. % 0.13/0.40 # There were 1 total successful branch saturations. % 0.13/0.40 # There were 0 successful branch saturations in interreduction. % 0.13/0.40 # There were 0 successful branch saturations on the branch. % 0.13/0.40 # There were 1 successful branch saturations after the branch. % 0.13/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.40 # Begin clausification derivation % 0.13/0.40 % 0.13/0.40 # End clausification derivation % 0.13/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.40 cnf(i_0_47, hypothesis, (a_34=a_32)). % 0.13/0.40 cnf(i_0_44, hypothesis, (select(a1,i_35)=e_36)). % 0.13/0.40 cnf(i_0_45, hypothesis, (select(a2,i_35)=e_37)). % 0.13/0.40 cnf(i_0_36, hypothesis, (select(a2,i1)=e_19)). % 0.13/0.40 cnf(i_0_37, hypothesis, (select(a1,i1)=e_21)). % 0.13/0.40 cnf(i_0_38, hypothesis, (select(a_22,i2)=e_23)). % 0.13/0.40 cnf(i_0_39, hypothesis, (select(a_20,i2)=e_25)). % 0.13/0.40 cnf(i_0_40, hypothesis, (select(a_26,i3)=e_27)). % 0.13/0.40 cnf(i_0_41, hypothesis, (select(a_24,i3)=e_29)). % 0.13/0.40 cnf(i_0_42, hypothesis, (select(a_30,i4)=e_31)). % 0.13/0.40 cnf(i_0_43, hypothesis, (select(a_28,i4)=e_33)). % 0.13/0.40 cnf(i_0_46, hypothesis, (sk(a1,a2)=i_35)). % 0.13/0.40 cnf(i_0_28, hypothesis, (store(a1,i1,e_19)=a_20)). % 0.13/0.40 cnf(i_0_29, hypothesis, (store(a2,i1,e_21)=a_22)). % 0.13/0.40 cnf(i_0_30, hypothesis, (store(a_20,i2,e_23)=a_24)). % 0.13/0.40 cnf(i_0_31, hypothesis, (store(a_22,i2,e_25)=a_26)). % 0.13/0.40 cnf(i_0_32, hypothesis, (store(a_24,i3,e_27)=a_28)). % 0.13/0.40 cnf(i_0_33, hypothesis, (store(a_26,i3,e_29)=a_30)). % 0.13/0.40 cnf(i_0_34, hypothesis, (store(a_28,i4,e_31)=a_32)). % 0.13/0.40 cnf(i_0_35, hypothesis, (store(a_30,i4,e_33)=a_32)). % 0.13/0.40 cnf(i_0_25, plain, (select(store(X1,X2,X3),X2)=X3)). % 0.13/0.40 cnf(i_0_27, plain, (store(store(X1,X2,select(X1,X3)),X3,select(X1,X2))=store(store(X1,X3,select(X1,X2)),X2,select(X1,X3)))). % 0.13/0.40 cnf(i_0_48, negated_conjecture, (e_37!=e_36)). % 0.13/0.40 cnf(i_0_26, plain, (select(store(X1,X2,X3),X4)=select(X1,X4)|X2=X4)). % 0.13/0.40 cnf(i_0_54, plain, (X5=X5)). % 0.13/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.40 # Begin printing tableau % 0.13/0.40 # Found 7 steps % 0.13/0.40 cnf(i_0_47, hypothesis, (a_34=a_32), inference(start_rule)). % 0.13/0.40 cnf(i_0_61, plain, (a_34=a_32), inference(extension_rule, [i_0_59])). % 0.13/0.40 cnf(i_0_101, plain, (a_34!=a_32), inference(closure_rule, [i_0_47])). % 0.13/0.40 cnf(i_0_100, plain, (select(a_34,a_34)=select(a_32,a_32)), inference(extension_rule, [i_0_58])). % 0.13/0.40 cnf(i_0_163, plain, (a_34!=a_32), inference(closure_rule, [i_0_47])). % 0.13/0.40 cnf(i_0_164, plain, (a_34!=a_32), inference(closure_rule, [i_0_47])). % 0.13/0.40 cnf(i_0_161, plain, (store(select(a_34,a_34),a_34,a_34)=store(select(a_32,a_32),a_32,a_32)), inference(etableau_closure_rule, [i_0_161, ...])). % 0.13/0.40 # End printing tableau % 0.13/0.40 # SZS output end % 0.13/0.40 # Branches closed with saturation will be marked with an "s" % 0.13/0.40 # There were 1 total branch saturation attempts. % 0.13/0.40 # There were 0 of these attempts blocked. % 0.13/0.40 # There were 0 deferred branch saturation attempts. % 0.13/0.40 # There were 0 free duplicated saturations. % 0.13/0.40 # There were 1 total successful branch saturations. % 0.13/0.40 # There were 0 successful branch saturations in interreduction. % 0.13/0.40 # There were 0 successful branch saturations on the branch. % 0.13/0.40 # There were 1 successful branch saturations after the branch. % 0.13/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.40 # Begin clausification derivation % 0.13/0.40 % 0.13/0.40 # End clausification derivation % 0.13/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.40 cnf(i_0_47, hypothesis, (a_34=a_32)). % 0.13/0.40 cnf(i_0_44, hypothesis, (select(a1,i_35)=e_36)). % 0.13/0.40 cnf(i_0_45, hypothesis, (select(a2,i_35)=e_37)). % 0.13/0.40 cnf(i_0_36, hypothesis, (select(a2,i1)=e_19)). % 0.13/0.40 cnf(i_0_37, hypothesis, (select(a1,i1)=e_21)). % 0.13/0.40 cnf(i_0_38, hypothesis, (select(a_22,i2)=e_23)). % 0.13/0.40 cnf(i_0_39, hypothesis, (select(a_20,i2)=e_25)). % 0.13/0.40 cnf(i_0_40, hypothesis, (select(a_26,i3)=e_27)). % 0.13/0.40 cnf(i_0_41, hypothesis, (select(a_24,i3)=e_29)). % 0.13/0.40 cnf(i_0_42, hypothesis, (select(a_30,i4)=e_31)). % 0.13/0.40 cnf(i_0_43, hypothesis, (select(a_28,i4)=e_33)). % 0.13/0.40 cnf(i_0_46, hypothesis, (sk(a1,a2)=i_35)). % 0.13/0.40 cnf(i_0_28, hypothesis, (store(a1,i1,e_19)=a_20)). % 0.13/0.40 cnf(i_0_29, hypothesis, (store(a2,i1,e_21)=a_22)). % 0.13/0.40 cnf(i_0_30, hypothesis, (store(a_20,i2,e_23)=a_24)). % 0.13/0.40 cnf(i_0_31, hypothesis, (store(a_22,i2,e_25)=a_26)). % 0.13/0.40 cnf(i_0_32, hypothesis, (store(a_24,i3,e_27)=a_28)). % 0.13/0.40 cnf(i_0_33, hypothesis, (store(a_26,i3,e_29)=a_30)). % 0.13/0.40 cnf(i_0_34, hypothesis, (store(a_28,i4,e_31)=a_32)). % 0.13/0.40 cnf(i_0_35, hypothesis, (store(a_30,i4,e_33)=a_32)). % 0.13/0.40 cnf(i_0_25, plain, (select(store(X1,X2,X3),X2)=X3)). % 0.13/0.40 cnf(i_0_27, plain, (store(store(X1,X2,select(X1,X3)),X3,select(X1,X2))=store(store(X1,X3,select(X1,X2)),X2,select(X1,X3)))). % 0.13/0.40 cnf(i_0_48, negated_conjecture, (e_37!=e_36)). % 0.13/0.40 cnf(i_0_26, plain, (select(store(X1,X2,X3),X4)=select(X1,X4)|X2=X4)). % 0.13/0.40 cnf(i_0_54, plain, (X5=X5)). % 0.13/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.40 # Begin printing tableau % 0.13/0.40 # Found 7 steps % 0.13/0.40 cnf(i_0_47, hypothesis, (a_34=a_32), inference(start_rule)). % 0.13/0.40 cnf(i_0_61, plain, (a_34=a_32), inference(extension_rule, [i_0_60])). % 0.13/0.40 cnf(i_0_105, plain, (a_34!=a_32), inference(closure_rule, [i_0_47])). % 0.13/0.40 cnf(i_0_103, plain, (sk(a_34,a_34)=sk(a_32,a_32)), inference(extension_rule, [i_0_58])). % 0.13/0.40 cnf(i_0_185, plain, (a_34!=a_32), inference(closure_rule, [i_0_47])). % 0.13/0.40 cnf(i_0_186, plain, (a_34!=a_32), inference(closure_rule, [i_0_47])). % 0.13/0.40 cnf(i_0_183, plain, (store(sk(a_34,a_34),a_34,a_34)=store(sk(a_32,a_32),a_32,a_32)), inference(etableau_closure_rule, [i_0_183, ...])). % 0.13/0.40 # End printing tableau % 0.13/0.40 # SZS output end % 0.13/0.40 # Branches closed with saturation will be marked with an "s" % 0.13/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.40 # Begin clausification derivation % 0.13/0.40 % 0.13/0.40 # End clausification derivation % 0.13/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.40 cnf(i_0_47, hypothesis, (a_34=a_32)). % 0.13/0.40 cnf(i_0_44, hypothesis, (select(a1,i_35)=e_36)). % 0.13/0.40 cnf(i_0_45, hypothesis, (select(a2,i_35)=e_37)). % 0.13/0.40 cnf(i_0_36, hypothesis, (select(a2,i1)=e_19)). % 0.13/0.40 cnf(i_0_37, hypothesis, (select(a1,i1)=e_21)). % 0.13/0.40 cnf(i_0_38, hypothesis, (select(a_22,i2)=e_23)). % 0.13/0.40 cnf(i_0_39, hypothesis, (select(a_20,i2)=e_25)). % 0.13/0.40 cnf(i_0_40, hypothesis, (select(a_26,i3)=e_27)). % 0.13/0.40 cnf(i_0_41, hypothesis, (select(a_24,i3)=e_29)). % 0.13/0.40 cnf(i_0_42, hypothesis, (select(a_30,i4)=e_31)). % 0.13/0.40 cnf(i_0_43, hypothesis, (select(a_28,i4)=e_33)). % 0.13/0.40 cnf(i_0_46, hypothesis, (sk(a1,a2)=i_35)). % 0.13/0.40 cnf(i_0_28, hypothesis, (store(a1,i1,e_19)=a_20)). % 0.13/0.40 cnf(i_0_29, hypothesis, (store(a2,i1,e_21)=a_22)). % 0.13/0.40 cnf(i_0_30, hypothesis, (store(a_20,i2,e_23)=a_24)). % 0.13/0.40 cnf(i_0_31, hypothesis, (store(a_22,i2,e_25)=a_26)). % 0.13/0.40 cnf(i_0_32, hypothesis, (store(a_24,i3,e_27)=a_28)). % 0.13/0.40 cnf(i_0_33, hypothesis, (store(a_26,i3,e_29)=a_30)). % 0.13/0.40 cnf(i_0_34, hypothesis, (store(a_28,i4,e_31)=a_32)). % 0.13/0.40 cnf(i_0_35, hypothesis, (store(a_30,i4,e_33)=a_32)). % 0.13/0.40 cnf(i_0_25, plain, (select(store(X1,X2,X3),X2)=X3)). % 0.13/0.40 cnf(i_0_27, plain, (store(store(X1,X2,select(X1,X3)),X3,select(X1,X2))=store(store(X1,X3,select(X1,X2)),X2,select(X1,X3)))). % 0.13/0.40 cnf(i_0_48, negated_conjecture, (e_37!=e_36)). % 0.13/0.40 cnf(i_0_26, plain, (select(store(X1,X2,X3),X4)=select(X1,X4)|X2=X4)). % 0.13/0.40 cnf(i_0_54, plain, (X5=X5)). % 0.13/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.40 # Begin printing tableau % 0.13/0.40 # Found 7 steps % 0.13/0.40 cnf(i_0_47, hypothesis, (a_34=a_32), inference(start_rule)). % 0.13/0.40 cnf(i_0_61, plain, (a_34=a_32), inference(extension_rule, [i_0_59])). % 0.13/0.40 cnf(i_0_102, plain, (a_34!=a_32), inference(closure_rule, [i_0_47])). % 0.13/0.40 cnf(i_0_100, plain, (select(a_34,a_34)=select(a_32,a_32)), inference(extension_rule, [i_0_58])). % 0.13/0.40 cnf(i_0_163, plain, (a_34!=a_32), inference(closure_rule, [i_0_47])). % 0.13/0.40 cnf(i_0_164, plain, (a_34!=a_32), inference(closure_rule, [i_0_47])). % 0.13/0.40 cnf(i_0_161, plain, (store(select(a_34,a_34),a_34,a_34)=store(select(a_32,a_32),a_32,a_32)), inference(etableau_closure_rule, [i_0_161, ...])). % 0.13/0.40 # End printing tableau % 0.13/0.40 # SZS output end % 0.13/0.40 # Branches closed with saturation will be marked with an "s" % 0.13/0.40 # There were 1 total branch saturation attempts. % 0.13/0.40 # There were 0 of these attempts blocked. % 0.13/0.40 # There were 0 deferred branch saturation attempts. % 0.13/0.40 # There were 0 free duplicated saturations. % 0.13/0.40 # There were 1 total successful branch saturations. % 0.13/0.40 # There were 0 successful branch saturations in interreduction. % 0.13/0.40 # There were 0 successful branch saturations on the branch. % 0.13/0.40 # There were 1 successful branch saturations after the branch. % 0.13/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.40 # Begin clausification derivation % 0.13/0.40 % 0.13/0.40 # End clausification derivation % 0.13/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.40 cnf(i_0_47, hypothesis, (a_34=a_32)). % 0.13/0.40 cnf(i_0_44, hypothesis, (select(a1,i_35)=e_36)). % 0.13/0.40 cnf(i_0_45, hypothesis, (select(a2,i_35)=e_37)). % 0.13/0.40 cnf(i_0_36, hypothesis, (select(a2,i1)=e_19)). % 0.13/0.40 cnf(i_0_37, hypothesis, (select(a1,i1)=e_21)). % 0.13/0.40 cnf(i_0_38, hypothesis, (select(a_22,i2)=e_23)). % 0.13/0.40 cnf(i_0_39, hypothesis, (select(a_20,i2)=e_25)). % 0.13/0.40 cnf(i_0_40, hypothesis, (select(a_26,i3)=e_27)). % 0.13/0.40 cnf(i_0_41, hypothesis, (select(a_24,i3)=e_29)). % 0.13/0.40 cnf(i_0_42, hypothesis, (select(a_30,i4)=e_31)). % 0.13/0.40 cnf(i_0_43, hypothesis, (select(a_28,i4)=e_33)). % 0.13/0.40 cnf(i_0_46, hypothesis, (sk(a1,a2)=i_35)). % 0.13/0.40 cnf(i_0_28, hypothesis, (store(a1,i1,e_19)=a_20)). % 0.13/0.40 cnf(i_0_29, hypothesis, (store(a2,i1,e_21)=a_22)). % 0.13/0.40 cnf(i_0_30, hypothesis, (store(a_20,i2,e_23)=a_24)). % 0.13/0.40 cnf(i_0_31, hypothesis, (store(a_22,i2,e_25)=a_26)). % 0.13/0.40 cnf(i_0_32, hypothesis, (store(a_24,i3,e_27)=a_28)). % 0.13/0.40 cnf(i_0_33, hypothesis, (store(a_26,i3,e_29)=a_30)). % 0.13/0.40 cnf(i_0_34, hypothesis, (store(a_28,i4,e_31)=a_32)). % 0.13/0.40 cnf(i_0_35, hypothesis, (store(a_30,i4,e_33)=a_32)). % 0.13/0.40 cnf(i_0_25, plain, (select(store(X1,X2,X3),X2)=X3)). % 0.13/0.40 cnf(i_0_27, plain, (store(store(X1,X2,select(X1,X3)),X3,select(X1,X2))=store(store(X1,X3,select(X1,X2)),X2,select(X1,X3)))). % 0.13/0.40 cnf(i_0_48, negated_conjecture, (e_37!=e_36)). % 0.13/0.40 cnf(i_0_26, plain, (select(store(X1,X2,X3),X4)=select(X1,X4)|X2=X4)). % 0.13/0.40 cnf(i_0_54, plain, (X5=X5)). % 0.13/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.40 # Begin printing tableau % 0.13/0.40 # Found 7 steps % 0.13/0.40 cnf(i_0_47, hypothesis, (a_34=a_32), inference(start_rule)). % 0.13/0.40 cnf(i_0_61, plain, (a_34=a_32), inference(extension_rule, [i_0_58])). % 0.13/0.40 cnf(i_0_97, plain, (a_34!=a_32), inference(closure_rule, [i_0_47])). % 0.13/0.40 cnf(i_0_98, plain, (a_34!=a_32), inference(closure_rule, [i_0_47])). % 0.13/0.40 cnf(i_0_96, plain, (store(a_34,a_34,a_34)=store(a_32,a_32,a_32)), inference(extension_rule, [i_0_59])). % 0.13/0.40 cnf(i_0_178, plain, (a_34!=a_32), inference(closure_rule, [i_0_47])). % 0.13/0.40 cnf(i_0_176, plain, (select(store(a_34,a_34,a_34),a_34)=select(store(a_32,a_32,a_32),a_32)), inference(etableau_closure_rule, [i_0_176, ...])). % 0.13/0.40 # End printing tableau % 0.13/0.40 # SZS output end % 0.13/0.40 # Branches closed with saturation will be marked with an "s" % 0.13/0.40 # There were 1 total branch saturation attempts. % 0.13/0.40 # There were 0 of these attempts blocked. % 0.13/0.40 # There were 0 deferred branch saturation attempts. % 0.13/0.40 # There were 0 free duplicated saturations. % 0.13/0.40 # There were 1 total successful branch saturations. % 0.13/0.40 # There were 0 successful branch saturations in interreduction. % 0.13/0.40 # There were 0 successful branch saturations on the branch. % 0.13/0.40 # There were 1 successful branch saturations after the branch. % 0.13/0.40 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.40 # Begin clausification derivation % 0.13/0.40 % 0.13/0.40 # End clausification derivation % 0.13/0.40 # Begin listing active clauses obtained from FOF to CNF conversion % 0.13/0.40 cnf(i_0_47, hypothesis, (a_34=a_32)). % 0.13/0.40 cnf(i_0_44, hypothesis, (select(a1,i_35)=e_36)). % 0.13/0.40 cnf(i_0_45, hypothesis, (select(a2,i_35)=e_37)). % 0.13/0.40 cnf(i_0_36, hypothesis, (select(a2,i1)=e_19)). % 0.13/0.40 cnf(i_0_37, hypothesis, (select(a1,i1)=e_21)). % 0.13/0.40 cnf(i_0_38, hypothesis, (select(a_22,i2)=e_23)). % 0.13/0.40 cnf(i_0_39, hypothesis, (select(a_20,i2)=e_25)). % 0.13/0.40 cnf(i_0_40, hypothesis, (select(a_26,i3)=e_27)). % 0.13/0.40 cnf(i_0_41, hypothesis, (select(a_24,i3)=e_29)). % 0.13/0.40 cnf(i_0_42, hypothesis, (select(a_30,i4)=e_31)). % 0.13/0.40 cnf(i_0_43, hypothesis, (select(a_28,i4)=e_33)). % 0.13/0.40 cnf(i_0_46, hypothesis, (sk(a1,a2)=i_35)). % 0.13/0.40 cnf(i_0_28, hypothesis, (store(a1,i1,e_19)=a_20)). % 0.13/0.40 cnf(i_0_29, hypothesis, (store(a2,i1,e_21)=a_22)). % 0.13/0.40 cnf(i_0_30, hypothesis, (store(a_20,i2,e_23)=a_24)). % 0.13/0.40 cnf(i_0_31, hypothesis, (store(a_22,i2,e_25)=a_26)). % 0.13/0.40 cnf(i_0_32, hypothesis, (store(a_24,i3,e_27)=a_28)). % 0.13/0.40 cnf(i_0_33, hypothesis, (store(a_26,i3,e_29)=a_30)). % 0.13/0.40 cnf(i_0_34, hypothesis, (store(a_28,i4,e_31)=a_32)). % 0.13/0.40 cnf(i_0_35, hypothesis, (store(a_30,i4,e_33)=a_32)). % 0.13/0.40 cnf(i_0_25, plain, (select(store(X1,X2,X3),X2)=X3)). % 0.13/0.40 cnf(i_0_27, plain, (store(store(X1,X2,select(X1,X3)),X3,select(X1,X2))=store(store(X1,X3,select(X1,X2)),X2,select(X1,X3)))). % 0.13/0.40 cnf(i_0_48, negated_conjecture, (e_37!=e_36)). % 0.13/0.40 cnf(i_0_26, plain, (select(store(X1,X2,X3),X4)=select(X1,X4)|X2=X4)). % 0.13/0.40 cnf(i_0_54, plain, (X5=X5)). % 0.13/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.13/0.40 # Begin printing tableau % 0.13/0.40 # Found 7 steps % 0.13/0.40 cnf(i_0_47, hypothesis, (a_34=a_32), inference(start_rule)). % 0.13/0.40 cnf(i_0_61, plain, (a_34=a_32), inference(extension_rule, [i_0_58])). % 0.13/0.40 cnf(i_0_97, plain, (a_34!=a_32), inference(closure_rule, [i_0_47])). % 0.13/0.40 cnf(i_0_99, plain, (a_34!=a_32), inference(closure_rule, [i_0_47])). % 0.13/0.40 cnf(i_0_96, plain, (store(a_34,a_34,a_34)=store(a_32,a_32,a_32)), inference(extension_rule, [i_0_59])). % 0.13/0.40 cnf(i_0_178, plain, (a_34!=a_32), inference(closure_rule, [i_0_47])). % 0.13/0.40 cnf(i_0_176, plain, (select(store(a_34,a_34,a_34),a_34)=select(store(a_32,a_32,a_32),a_32)), inference(etableau_closure_rule, [i_0_176, ...])). % 0.13/0.40 # End printing tableau % 0.13/0.40 # SZS output end % 0.13/0.40 # Branches closed with saturation will be marked with an "s" % 0.13/0.40 # Child (15798) has found a proof. % 0.13/0.40 % 0.13/0.40 # Proof search is over... % 0.13/0.40 # Freeing feature tree %------------------------------------------------------------------------------