%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : SWV556-1.007 : 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 : n010.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.20s 0.38s % Output : CNFRefutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SWV556-1.007 : TPTP v8.1.0. Released v4.0.0. % 0.03/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 : n010.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 06:29:39 EDT 2022 % 0.13/0.34 % CPUTime : % 0.20/0.37 # No SInE strategy applied % 0.20/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.20/0.37 # and selection function SelectComplexExceptUniqMaxHorn. % 0.20/0.37 # % 0.20/0.37 # Presaturation interreduction done % 0.20/0.37 # Number of axioms: 35 Number of unprocessed: 35 % 0.20/0.37 # Tableaux proof search. % 0.20/0.37 # APR header successfully linked. % 0.20/0.37 # Hello from C++ % 0.20/0.37 # The folding up rule is enabled... % 0.20/0.37 # Local unification is enabled... % 0.20/0.37 # Any saturation attempts will use folding labels... % 0.20/0.37 # 35 beginning clauses after preprocessing and clausification % 0.20/0.37 # Creating start rules for all 1 conjectures. % 0.20/0.37 # There are 1 start rule candidates: % 0.20/0.37 # Found 34 unit axioms. % 0.20/0.37 # 1 start rule tableaux created. % 0.20/0.37 # 1 extension rule candidate clauses % 0.20/0.37 # 34 unit axiom clauses % 0.20/0.37 % 0.20/0.37 # Requested 8, 32 cores available to the main process. % 0.20/0.37 # There are not enough tableaux to fork, creating more from the initial 1 % 0.20/0.37 # Creating equality axioms % 0.20/0.37 # Ran out of tableaux, making start rules for all clauses % 0.20/0.37 # Returning from population with 44 new_tableaux and 0 remaining starting tableaux. % 0.20/0.37 # We now have 44 tableaux to operate on % 0.20/0.38 # 11399 Satisfiable branch % 0.20/0.38 # 11392 Satisfiable branch % 0.20/0.38 # 11394 Satisfiable branch % 0.20/0.38 # 11395 Satisfiable branch % 0.20/0.38 # 11393 Satisfiable branch % 0.20/0.38 # Satisfiable branch found. % 0.20/0.38 # There were 1 total branch saturation attempts. % 0.20/0.38 # There were 0 of these attempts blocked. % 0.20/0.38 # There were 0 deferred branch saturation attempts. % 0.20/0.38 # There were 0 free duplicated saturations. % 0.20/0.38 # There were 0 total successful branch saturations. % 0.20/0.38 # There were 0 successful branch saturations in interreduction. % 0.20/0.38 # There were 0 successful branch saturations on the branch. % 0.20/0.38 # There were 0 successful branch saturations after the branch. % 0.20/0.38 # 11396 Satisfiable branch % 0.20/0.38 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # Begin clausification derivation % 0.20/0.38 % 0.20/0.38 # End clausification derivation % 0.20/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.38 cnf(i_0_69, hypothesis, (a_58=a_56)). % 0.20/0.38 cnf(i_0_66, hypothesis, (select(a1,i_59)=e_60)). % 0.20/0.38 cnf(i_0_67, hypothesis, (select(a2,i_59)=e_61)). % 0.20/0.38 cnf(i_0_52, hypothesis, (select(a2,i1)=e_31)). % 0.20/0.38 cnf(i_0_53, hypothesis, (select(a1,i1)=e_33)). % 0.20/0.38 cnf(i_0_54, hypothesis, (select(a_34,i2)=e_35)). % 0.20/0.38 cnf(i_0_55, hypothesis, (select(a_32,i2)=e_37)). % 0.20/0.38 cnf(i_0_56, hypothesis, (select(a_38,i3)=e_39)). % 0.20/0.38 cnf(i_0_57, hypothesis, (select(a_36,i3)=e_41)). % 0.20/0.38 cnf(i_0_58, hypothesis, (select(a_42,i4)=e_43)). % 0.20/0.38 cnf(i_0_59, hypothesis, (select(a_40,i4)=e_45)). % 0.20/0.38 cnf(i_0_60, hypothesis, (select(a_46,i5)=e_47)). % 0.20/0.38 cnf(i_0_61, hypothesis, (select(a_44,i5)=e_49)). % 0.20/0.38 cnf(i_0_62, hypothesis, (select(a_50,i6)=e_51)). % 0.20/0.38 cnf(i_0_63, hypothesis, (select(a_48,i6)=e_53)). % 0.20/0.38 cnf(i_0_64, hypothesis, (select(a_54,i7)=e_55)). % 0.20/0.38 cnf(i_0_65, hypothesis, (select(a_52,i7)=e_57)). % 0.20/0.38 cnf(i_0_68, hypothesis, (sk(a1,a2)=i_59)). % 0.20/0.38 cnf(i_0_38, hypothesis, (store(a1,i1,e_31)=a_32)). % 0.20/0.38 cnf(i_0_39, hypothesis, (store(a2,i1,e_33)=a_34)). % 0.20/0.38 cnf(i_0_40, hypothesis, (store(a_32,i2,e_35)=a_36)). % 0.20/0.38 cnf(i_0_41, hypothesis, (store(a_34,i2,e_37)=a_38)). % 0.20/0.38 cnf(i_0_42, hypothesis, (store(a_36,i3,e_39)=a_40)). % 0.20/0.38 cnf(i_0_43, hypothesis, (store(a_38,i3,e_41)=a_42)). % 0.20/0.38 cnf(i_0_44, hypothesis, (store(a_40,i4,e_43)=a_44)). % 0.20/0.38 cnf(i_0_45, hypothesis, (store(a_42,i4,e_45)=a_46)). % 0.20/0.38 cnf(i_0_46, hypothesis, (store(a_44,i5,e_47)=a_48)). % 0.20/0.38 cnf(i_0_47, hypothesis, (store(a_46,i5,e_49)=a_50)). % 0.20/0.38 cnf(i_0_48, hypothesis, (store(a_48,i6,e_51)=a_52)). % 0.20/0.38 cnf(i_0_49, hypothesis, (store(a_50,i6,e_53)=a_54)). % 0.20/0.38 cnf(i_0_50, hypothesis, (store(a_52,i1,e_55)=a_56)). % 0.20/0.38 cnf(i_0_51, hypothesis, (store(a_54,i7,e_57)=a_56)). % 0.20/0.38 cnf(i_0_36, plain, (select(store(X1,X2,X3),X2)=X3)). % 0.20/0.38 cnf(i_0_70, negated_conjecture, (e_61!=e_60)). % 0.20/0.38 cnf(i_0_37, plain, (select(store(X1,X2,X3),X4)=select(X1,X4)|X2=X4)). % 0.20/0.38 cnf(i_0_76, plain, (X5=X5)). % 0.20/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.38 # Begin printing tableau % 0.20/0.38 # Found 6 steps % 0.20/0.38 cnf(i_0_69, hypothesis, (a_58=a_56), inference(start_rule)). % 0.20/0.38 cnf(i_0_83, plain, (a_58=a_56), inference(extension_rule, [i_0_79])). % 0.20/0.38 cnf(i_0_127, plain, (a_58!=a_56), inference(closure_rule, [i_0_69])). % 0.20/0.38 cnf(i_0_126, plain, (a_56=a_56), inference(extension_rule, [i_0_80])). % 0.20/0.38 cnf(i_0_211, plain, (a_58!=a_56), inference(closure_rule, [i_0_69])). % 0.20/0.38 cnf(i_0_212, plain, (a_58!=a_56), inference(closure_rule, [i_0_69])). % 0.20/0.38 # End printing tableau % 0.20/0.38 # SZS output end % 0.20/0.38 # Branches closed with saturation will be marked with an "s" % 0.20/0.38 # 11397 Satisfiable branch % 0.20/0.38 # Satisfiable branch found. % 0.20/0.38 # There were 1 total branch saturation attempts. % 0.20/0.38 # There were 0 of these attempts blocked. % 0.20/0.38 # There were 0 deferred branch saturation attempts. % 0.20/0.38 # There were 0 free duplicated saturations. % 0.20/0.38 # There were 0 total successful branch saturations. % 0.20/0.38 # There were 0 successful branch saturations in interreduction. % 0.20/0.38 # There were 0 successful branch saturations on the branch. % 0.20/0.38 # There were 0 successful branch saturations after the branch. % 0.20/0.38 # Satisfiable branch found. % 0.20/0.38 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # Begin clausification derivation % 0.20/0.38 % 0.20/0.38 # End clausification derivation % 0.20/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.38 cnf(i_0_69, hypothesis, (a_58=a_56)). % 0.20/0.38 cnf(i_0_66, hypothesis, (select(a1,i_59)=e_60)). % 0.20/0.38 cnf(i_0_67, hypothesis, (select(a2,i_59)=e_61)). % 0.20/0.38 cnf(i_0_52, hypothesis, (select(a2,i1)=e_31)). % 0.20/0.38 cnf(i_0_53, hypothesis, (select(a1,i1)=e_33)). % 0.20/0.38 cnf(i_0_54, hypothesis, (select(a_34,i2)=e_35)). % 0.20/0.38 cnf(i_0_55, hypothesis, (select(a_32,i2)=e_37)). % 0.20/0.38 cnf(i_0_56, hypothesis, (select(a_38,i3)=e_39)). % 0.20/0.38 cnf(i_0_57, hypothesis, (select(a_36,i3)=e_41)). % 0.20/0.38 cnf(i_0_58, hypothesis, (select(a_42,i4)=e_43)). % 0.20/0.38 cnf(i_0_59, hypothesis, (select(a_40,i4)=e_45)). % 0.20/0.38 cnf(i_0_60, hypothesis, (select(a_46,i5)=e_47)). % 0.20/0.38 cnf(i_0_61, hypothesis, (select(a_44,i5)=e_49)). % 0.20/0.38 cnf(i_0_62, hypothesis, (select(a_50,i6)=e_51)). % 0.20/0.38 cnf(i_0_63, hypothesis, (select(a_48,i6)=e_53)). % 0.20/0.38 cnf(i_0_64, hypothesis, (select(a_54,i7)=e_55)). % 0.20/0.38 cnf(i_0_65, hypothesis, (select(a_52,i7)=e_57)). % 0.20/0.38 cnf(i_0_68, hypothesis, (sk(a1,a2)=i_59)). % 0.20/0.38 cnf(i_0_38, hypothesis, (store(a1,i1,e_31)=a_32)). % 0.20/0.38 cnf(i_0_39, hypothesis, (store(a2,i1,e_33)=a_34)). % 0.20/0.38 cnf(i_0_40, hypothesis, (store(a_32,i2,e_35)=a_36)). % 0.20/0.38 cnf(i_0_41, hypothesis, (store(a_34,i2,e_37)=a_38)). % 0.20/0.38 cnf(i_0_42, hypothesis, (store(a_36,i3,e_39)=a_40)). % 0.20/0.38 cnf(i_0_43, hypothesis, (store(a_38,i3,e_41)=a_42)). % 0.20/0.38 cnf(i_0_44, hypothesis, (store(a_40,i4,e_43)=a_44)). % 0.20/0.38 cnf(i_0_45, hypothesis, (store(a_42,i4,e_45)=a_46)). % 0.20/0.38 cnf(i_0_46, hypothesis, (store(a_44,i5,e_47)=a_48)). % 0.20/0.38 cnf(i_0_47, hypothesis, (store(a_46,i5,e_49)=a_50)). % 0.20/0.38 cnf(i_0_48, hypothesis, (store(a_48,i6,e_51)=a_52)). % 0.20/0.38 cnf(i_0_49, hypothesis, (store(a_50,i6,e_53)=a_54)). % 0.20/0.38 cnf(i_0_50, hypothesis, (store(a_52,i1,e_55)=a_56)). % 0.20/0.38 cnf(i_0_51, hypothesis, (store(a_54,i7,e_57)=a_56)). % 0.20/0.38 cnf(i_0_36, plain, (select(store(X1,X2,X3),X2)=X3)). % 0.20/0.38 cnf(i_0_70, negated_conjecture, (e_61!=e_60)). % 0.20/0.38 cnf(i_0_37, plain, (select(store(X1,X2,X3),X4)=select(X1,X4)|X2=X4)). % 0.20/0.38 cnf(i_0_76, plain, (X5=X5)). % 0.20/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.38 # Begin printing tableau % 0.20/0.38 # Found 6 steps % 0.20/0.38 cnf(i_0_69, hypothesis, (a_58=a_56), inference(start_rule)). % 0.20/0.38 cnf(i_0_83, plain, (a_58=a_56), inference(extension_rule, [i_0_82])). % 0.20/0.38 cnf(i_0_137, plain, (a_58!=a_56), inference(closure_rule, [i_0_69])). % 0.20/0.38 cnf(i_0_136, plain, (sk(a_58,a_58)=sk(a_56,a_56)), inference(extension_rule, [i_0_80])). % 0.20/0.38 cnf(i_0_218, plain, (a_58!=a_56), inference(closure_rule, [i_0_69])). % 0.20/0.38 cnf(i_0_219, plain, (a_58!=a_56), inference(closure_rule, [i_0_69])). % 0.20/0.38 # End printing tableau % 0.20/0.38 # SZS output end % 0.20/0.38 # Branches closed with saturation will be marked with an "s" % 0.20/0.38 # There were 1 total branch saturation attempts. % 0.20/0.38 # There were 0 of these attempts blocked. % 0.20/0.38 # There were 0 deferred branch saturation attempts. % 0.20/0.38 # There were 0 free duplicated saturations. % 0.20/0.38 # There were 0 total successful branch saturations. % 0.20/0.38 # There were 0 successful branch saturations in interreduction. % 0.20/0.38 # There were 0 successful branch saturations on the branch. % 0.20/0.38 # There were 0 successful branch saturations after the branch. % 0.20/0.38 # Satisfiable branch found. % 0.20/0.38 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # Begin clausification derivation % 0.20/0.38 % 0.20/0.38 # End clausification derivation % 0.20/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.38 cnf(i_0_69, hypothesis, (a_58=a_56)). % 0.20/0.38 cnf(i_0_66, hypothesis, (select(a1,i_59)=e_60)). % 0.20/0.38 cnf(i_0_67, hypothesis, (select(a2,i_59)=e_61)). % 0.20/0.38 cnf(i_0_52, hypothesis, (select(a2,i1)=e_31)). % 0.20/0.38 cnf(i_0_53, hypothesis, (select(a1,i1)=e_33)). % 0.20/0.38 cnf(i_0_54, hypothesis, (select(a_34,i2)=e_35)). % 0.20/0.38 cnf(i_0_55, hypothesis, (select(a_32,i2)=e_37)). % 0.20/0.38 cnf(i_0_56, hypothesis, (select(a_38,i3)=e_39)). % 0.20/0.38 cnf(i_0_57, hypothesis, (select(a_36,i3)=e_41)). % 0.20/0.38 cnf(i_0_58, hypothesis, (select(a_42,i4)=e_43)). % 0.20/0.38 cnf(i_0_59, hypothesis, (select(a_40,i4)=e_45)). % 0.20/0.38 cnf(i_0_60, hypothesis, (select(a_46,i5)=e_47)). % 0.20/0.38 cnf(i_0_61, hypothesis, (select(a_44,i5)=e_49)). % 0.20/0.38 cnf(i_0_62, hypothesis, (select(a_50,i6)=e_51)). % 0.20/0.38 cnf(i_0_63, hypothesis, (select(a_48,i6)=e_53)). % 0.20/0.38 cnf(i_0_64, hypothesis, (select(a_54,i7)=e_55)). % 0.20/0.38 cnf(i_0_65, hypothesis, (select(a_52,i7)=e_57)). % 0.20/0.38 cnf(i_0_68, hypothesis, (sk(a1,a2)=i_59)). % 0.20/0.38 cnf(i_0_38, hypothesis, (store(a1,i1,e_31)=a_32)). % 0.20/0.38 cnf(i_0_39, hypothesis, (store(a2,i1,e_33)=a_34)). % 0.20/0.38 cnf(i_0_40, hypothesis, (store(a_32,i2,e_35)=a_36)). % 0.20/0.38 cnf(i_0_41, hypothesis, (store(a_34,i2,e_37)=a_38)). % 0.20/0.38 cnf(i_0_42, hypothesis, (store(a_36,i3,e_39)=a_40)). % 0.20/0.38 cnf(i_0_43, hypothesis, (store(a_38,i3,e_41)=a_42)). % 0.20/0.38 cnf(i_0_44, hypothesis, (store(a_40,i4,e_43)=a_44)). % 0.20/0.38 cnf(i_0_45, hypothesis, (store(a_42,i4,e_45)=a_46)). % 0.20/0.38 cnf(i_0_46, hypothesis, (store(a_44,i5,e_47)=a_48)). % 0.20/0.38 cnf(i_0_47, hypothesis, (store(a_46,i5,e_49)=a_50)). % 0.20/0.38 cnf(i_0_48, hypothesis, (store(a_48,i6,e_51)=a_52)). % 0.20/0.38 cnf(i_0_49, hypothesis, (store(a_50,i6,e_53)=a_54)). % 0.20/0.38 cnf(i_0_50, hypothesis, (store(a_52,i1,e_55)=a_56)). % 0.20/0.38 cnf(i_0_51, hypothesis, (store(a_54,i7,e_57)=a_56)). % 0.20/0.38 cnf(i_0_36, plain, (select(store(X1,X2,X3),X2)=X3)). % 0.20/0.38 cnf(i_0_70, negated_conjecture, (e_61!=e_60)). % 0.20/0.38 cnf(i_0_37, plain, (select(store(X1,X2,X3),X4)=select(X1,X4)|X2=X4)). % 0.20/0.38 cnf(i_0_76, plain, (X5=X5)). % 0.20/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.38 # Begin printing tableau % 0.20/0.38 # Found 6 steps % 0.20/0.38 cnf(i_0_69, hypothesis, (a_58=a_56), inference(start_rule)). % 0.20/0.38 cnf(i_0_83, plain, (a_58=a_56), inference(extension_rule, [i_0_81])). % 0.20/0.38 cnf(i_0_134, plain, (a_58!=a_56), inference(closure_rule, [i_0_69])). % 0.20/0.38 cnf(i_0_133, plain, (select(a_58,a_58)=select(a_56,a_56)), inference(extension_rule, [i_0_80])). % 0.20/0.38 cnf(i_0_196, plain, (a_58!=a_56), inference(closure_rule, [i_0_69])). % 0.20/0.38 cnf(i_0_197, plain, (a_58!=a_56), inference(closure_rule, [i_0_69])). % 0.20/0.38 # End printing tableau % 0.20/0.38 # SZS output end % 0.20/0.38 # Branches closed with saturation will be marked with an "s" % 0.20/0.38 # There were 1 total branch saturation attempts. % 0.20/0.38 # There were 0 of these attempts blocked. % 0.20/0.38 # There were 0 deferred branch saturation attempts. % 0.20/0.38 # There were 0 free duplicated saturations. % 0.20/0.38 # There were 0 total successful branch saturations. % 0.20/0.38 # There were 0 successful branch saturations in interreduction. % 0.20/0.38 # There were 0 successful branch saturations on the branch. % 0.20/0.38 # There were 0 successful branch saturations after the branch. % 0.20/0.38 # 11398 Satisfiable branch % 0.20/0.38 # Satisfiable branch found. % 0.20/0.38 # There were 1 total branch saturation attempts. % 0.20/0.38 # There were 0 of these attempts blocked. % 0.20/0.38 # There were 0 deferred branch saturation attempts. % 0.20/0.38 # There were 0 free duplicated saturations. % 0.20/0.38 # There were 0 total successful branch saturations. % 0.20/0.38 # There were 0 successful branch saturations in interreduction. % 0.20/0.38 # There were 0 successful branch saturations on the branch. % 0.20/0.38 # There were 0 successful branch saturations after the branch. % 0.20/0.38 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # Begin clausification derivation % 0.20/0.38 % 0.20/0.38 # End clausification derivation % 0.20/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.38 cnf(i_0_69, hypothesis, (a_58=a_56)). % 0.20/0.38 cnf(i_0_66, hypothesis, (select(a1,i_59)=e_60)). % 0.20/0.38 cnf(i_0_67, hypothesis, (select(a2,i_59)=e_61)). % 0.20/0.38 cnf(i_0_52, hypothesis, (select(a2,i1)=e_31)). % 0.20/0.38 cnf(i_0_53, hypothesis, (select(a1,i1)=e_33)). % 0.20/0.38 cnf(i_0_54, hypothesis, (select(a_34,i2)=e_35)). % 0.20/0.38 cnf(i_0_55, hypothesis, (select(a_32,i2)=e_37)). % 0.20/0.38 cnf(i_0_56, hypothesis, (select(a_38,i3)=e_39)). % 0.20/0.38 cnf(i_0_57, hypothesis, (select(a_36,i3)=e_41)). % 0.20/0.38 cnf(i_0_58, hypothesis, (select(a_42,i4)=e_43)). % 0.20/0.38 cnf(i_0_59, hypothesis, (select(a_40,i4)=e_45)). % 0.20/0.38 cnf(i_0_60, hypothesis, (select(a_46,i5)=e_47)). % 0.20/0.38 cnf(i_0_61, hypothesis, (select(a_44,i5)=e_49)). % 0.20/0.38 cnf(i_0_62, hypothesis, (select(a_50,i6)=e_51)). % 0.20/0.38 cnf(i_0_63, hypothesis, (select(a_48,i6)=e_53)). % 0.20/0.38 cnf(i_0_64, hypothesis, (select(a_54,i7)=e_55)). % 0.20/0.38 cnf(i_0_65, hypothesis, (select(a_52,i7)=e_57)). % 0.20/0.38 cnf(i_0_68, hypothesis, (sk(a1,a2)=i_59)). % 0.20/0.38 cnf(i_0_38, hypothesis, (store(a1,i1,e_31)=a_32)). % 0.20/0.38 cnf(i_0_39, hypothesis, (store(a2,i1,e_33)=a_34)). % 0.20/0.38 cnf(i_0_40, hypothesis, (store(a_32,i2,e_35)=a_36)). % 0.20/0.38 cnf(i_0_41, hypothesis, (store(a_34,i2,e_37)=a_38)). % 0.20/0.38 cnf(i_0_42, hypothesis, (store(a_36,i3,e_39)=a_40)). % 0.20/0.38 cnf(i_0_43, hypothesis, (store(a_38,i3,e_41)=a_42)). % 0.20/0.38 cnf(i_0_44, hypothesis, (store(a_40,i4,e_43)=a_44)). % 0.20/0.38 cnf(i_0_45, hypothesis, (store(a_42,i4,e_45)=a_46)). % 0.20/0.38 cnf(i_0_46, hypothesis, (store(a_44,i5,e_47)=a_48)). % 0.20/0.38 cnf(i_0_47, hypothesis, (store(a_46,i5,e_49)=a_50)). % 0.20/0.38 cnf(i_0_48, hypothesis, (store(a_48,i6,e_51)=a_52)). % 0.20/0.38 cnf(i_0_49, hypothesis, (store(a_50,i6,e_53)=a_54)). % 0.20/0.38 cnf(i_0_50, hypothesis, (store(a_52,i1,e_55)=a_56)). % 0.20/0.38 cnf(i_0_51, hypothesis, (store(a_54,i7,e_57)=a_56)). % 0.20/0.38 cnf(i_0_36, plain, (select(store(X1,X2,X3),X2)=X3)). % 0.20/0.38 cnf(i_0_70, negated_conjecture, (e_61!=e_60)). % 0.20/0.38 cnf(i_0_37, plain, (select(store(X1,X2,X3),X4)=select(X1,X4)|X2=X4)). % 0.20/0.38 cnf(i_0_76, plain, (X5=X5)). % 0.20/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.38 # Begin printing tableau % 0.20/0.38 # Found 6 steps % 0.20/0.38 cnf(i_0_69, hypothesis, (a_58=a_56), inference(start_rule)). % 0.20/0.38 cnf(i_0_83, plain, (a_58=a_56), inference(extension_rule, [i_0_81])). % 0.20/0.38 cnf(i_0_135, plain, (a_58!=a_56), inference(closure_rule, [i_0_69])). % 0.20/0.38 cnf(i_0_133, plain, (select(a_58,a_58)=select(a_56,a_56)), inference(extension_rule, [i_0_80])). % 0.20/0.38 cnf(i_0_196, plain, (a_58!=a_56), inference(closure_rule, [i_0_69])). % 0.20/0.38 cnf(i_0_197, plain, (a_58!=a_56), inference(closure_rule, [i_0_69])). % 0.20/0.38 # End printing tableau % 0.20/0.38 # SZS output end % 0.20/0.38 # Branches closed with saturation will be marked with an "s" % 0.20/0.38 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.38 # Begin clausification derivation % 0.20/0.38 % 0.20/0.38 # End clausification derivation % 0.20/0.38 # Begin listing active clauses obtained from FOF to CNF conversion % 0.20/0.38 cnf(i_0_69, hypothesis, (a_58=a_56)). % 0.20/0.38 cnf(i_0_66, hypothesis, (select(a1,i_59)=e_60)). % 0.20/0.38 cnf(i_0_67, hypothesis, (select(a2,i_59)=e_61)). % 0.20/0.38 cnf(i_0_52, hypothesis, (select(a2,i1)=e_31)). % 0.20/0.38 cnf(i_0_53, hypothesis, (select(a1,i1)=e_33)). % 0.20/0.38 cnf(i_0_54, hypothesis, (select(a_34,i2)=e_35)). % 0.20/0.38 cnf(i_0_55, hypothesis, (select(a_32,i2)=e_37)). % 0.20/0.38 cnf(i_0_56, hypothesis, (select(a_38,i3)=e_39)). % 0.20/0.38 cnf(i_0_57, hypothesis, (select(a_36,i3)=e_41)). % 0.20/0.38 cnf(i_0_58, hypothesis, (select(a_42,i4)=e_43)). % 0.20/0.38 cnf(i_0_59, hypothesis, (select(a_40,i4)=e_45)). % 0.20/0.38 cnf(i_0_60, hypothesis, (select(a_46,i5)=e_47)). % 0.20/0.38 cnf(i_0_61, hypothesis, (select(a_44,i5)=e_49)). % 0.20/0.38 cnf(i_0_62, hypothesis, (select(a_50,i6)=e_51)). % 0.20/0.38 cnf(i_0_63, hypothesis, (select(a_48,i6)=e_53)). % 0.20/0.38 cnf(i_0_64, hypothesis, (select(a_54,i7)=e_55)). % 0.20/0.38 cnf(i_0_65, hypothesis, (select(a_52,i7)=e_57)). % 0.20/0.38 cnf(i_0_68, hypothesis, (sk(a1,a2)=i_59)). % 0.20/0.38 cnf(i_0_38, hypothesis, (store(a1,i1,e_31)=a_32)). % 0.20/0.38 cnf(i_0_39, hypothesis, (store(a2,i1,e_33)=a_34)). % 0.20/0.38 cnf(i_0_40, hypothesis, (store(a_32,i2,e_35)=a_36)). % 0.20/0.38 cnf(i_0_41, hypothesis, (store(a_34,i2,e_37)=a_38)). % 0.20/0.38 cnf(i_0_42, hypothesis, (store(a_36,i3,e_39)=a_40)). % 0.20/0.38 cnf(i_0_43, hypothesis, (store(a_38,i3,e_41)=a_42)). % 0.20/0.38 cnf(i_0_44, hypothesis, (store(a_40,i4,e_43)=a_44)). % 0.20/0.38 cnf(i_0_45, hypothesis, (store(a_42,i4,e_45)=a_46)). % 0.20/0.38 cnf(i_0_46, hypothesis, (store(a_44,i5,e_47)=a_48)). % 0.20/0.38 cnf(i_0_47, hypothesis, (store(a_46,i5,e_49)=a_50)). % 0.20/0.38 cnf(i_0_48, hypothesis, (store(a_48,i6,e_51)=a_52)). % 0.20/0.38 cnf(i_0_49, hypothesis, (store(a_50,i6,e_53)=a_54)). % 0.20/0.38 cnf(i_0_50, hypothesis, (store(a_52,i1,e_55)=a_56)). % 0.20/0.38 cnf(i_0_51, hypothesis, (store(a_54,i7,e_57)=a_56)). % 0.20/0.38 cnf(i_0_36, plain, (select(store(X1,X2,X3),X2)=X3)). % 0.20/0.38 cnf(i_0_70, negated_conjecture, (e_61!=e_60)). % 0.20/0.38 cnf(i_0_37, plain, (select(store(X1,X2,X3),X4)=select(X1,X4)|X2=X4)). % 0.20/0.38 cnf(i_0_76, plain, (X5=X5)). % 0.20/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.20/0.38 # Begin printing tableau % 0.20/0.38 # Found 6 steps % 0.20/0.38 cnf(i_0_69, hypothesis, (a_58=a_56), inference(start_rule)). % 0.20/0.38 cnf(i_0_83, plain, (a_58=a_56), inference(extension_rule, [i_0_82])). % 0.20/0.38 cnf(i_0_138, plain, (a_58!=a_56), inference(closure_rule, [i_0_69])). % 0.20/0.38 cnf(i_0_136, plain, (sk(a_58,a_58)=sk(a_56,a_56)), inference(extension_rule, [i_0_80])). % 0.20/0.38 cnf(i_0_218, plain, (a_58!=a_56), inference(closure_rule, [i_0_69])). % 0.20/0.38 cnf(i_0_219, plain, (a_58!=a_56), inference(closure_rule, [i_0_69])). % 0.20/0.38 # End printing tableau % 0.20/0.38 # SZS output end % 0.20/0.38 # Branches closed with saturation will be marked with an "s" % 0.20/0.38 # Child (11399) has found a proof. % 0.20/0.38 % 0.20/0.38 # Proof search is over... % 0.20/0.38 # Freeing feature tree %------------------------------------------------------------------------------